./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--misc--legousbtower.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 5574142529d95f295134c1dccd4c5dbe0383ae5c309e7dc50fd933e5702659ed --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 20:32:12,756 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 20:32:12,834 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-01-09 20:32:12,844 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 20:32:12,844 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 20:32:12,867 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 20:32:12,868 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 20:32:12,868 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 20:32:12,869 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 20:32:12,869 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 20:32:12,869 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 20:32:12,869 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 20:32:12,869 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 20:32:12,869 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 20:32:12,870 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 20:32:12,870 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 20:32:12,870 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 20:32:12,870 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 20:32:12,870 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 20:32:12,870 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 20:32:12,870 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 20:32:12,871 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 20:32:12,871 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 20:32:12,871 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 20:32:12,871 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 20:32:12,871 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 20:32:12,871 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 20:32:12,871 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 20:32:12,872 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 20:32:12,872 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:32:12,872 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 20:32:12,872 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 20:32:12,872 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 20:32:12,872 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 20:32:12,872 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:32:12,873 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 20:32:12,873 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 20:32:12,873 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 20:32:12,873 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 20:32:12,873 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 20:32:12,873 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 20:32:12,873 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 20:32:12,873 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 20:32:12,873 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 20:32:12,874 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 20:32:12,874 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-jdk21/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 -> 5574142529d95f295134c1dccd4c5dbe0383ae5c309e7dc50fd933e5702659ed [2025-01-09 20:32:13,195 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 20:32:13,206 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 20:32:13,209 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 20:32:13,210 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 20:32:13,211 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 20:32:13,212 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i [2025-01-09 20:32:14,599 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/76156ccfb/8ca4bc68288d487cb8016a00885f9eab/FLAG6a0063d35 [2025-01-09 20:32:15,209 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 20:32:15,210 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i [2025-01-09 20:32:15,262 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/76156ccfb/8ca4bc68288d487cb8016a00885f9eab/FLAG6a0063d35 [2025-01-09 20:32:15,281 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/76156ccfb/8ca4bc68288d487cb8016a00885f9eab [2025-01-09 20:32:15,284 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 20:32:15,286 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 20:32:15,287 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 20:32:15,287 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 20:32:15,291 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 20:32:15,292 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:32:15" (1/1) ... [2025-01-09 20:32:15,293 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12b61bc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:32:15, skipping insertion in model container [2025-01-09 20:32:15,293 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:32:15" (1/1) ... [2025-01-09 20:32:15,381 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 20:32:18,367 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273031,273044] [2025-01-09 20:32:18,370 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273176,273189] [2025-01-09 20:32:18,371 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273322,273335] [2025-01-09 20:32:18,371 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273487,273500] [2025-01-09 20:32:18,371 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273645,273658] [2025-01-09 20:32:18,372 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273803,273816] [2025-01-09 20:32:18,372 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273961,273974] [2025-01-09 20:32:18,372 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274121,274134] [2025-01-09 20:32:18,372 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274280,274293] [2025-01-09 20:32:18,373 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274419,274432] [2025-01-09 20:32:18,373 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274561,274574] [2025-01-09 20:32:18,373 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274710,274723] [2025-01-09 20:32:18,374 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274849,274862] [2025-01-09 20:32:18,374 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275004,275017] [2025-01-09 20:32:18,374 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275164,275177] [2025-01-09 20:32:18,374 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275315,275328] [2025-01-09 20:32:18,375 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275466,275479] [2025-01-09 20:32:18,375 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275618,275631] [2025-01-09 20:32:18,375 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275767,275780] [2025-01-09 20:32:18,375 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275915,275928] [2025-01-09 20:32:18,375 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276072,276085] [2025-01-09 20:32:18,376 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276221,276234] [2025-01-09 20:32:18,376 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276377,276390] [2025-01-09 20:32:18,376 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276530,276543] [2025-01-09 20:32:18,376 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276676,276689] [2025-01-09 20:32:18,377 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276819,276832] [2025-01-09 20:32:18,377 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276971,276984] [2025-01-09 20:32:18,378 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277117,277130] [2025-01-09 20:32:18,378 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277262,277275] [2025-01-09 20:32:18,378 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277416,277429] [2025-01-09 20:32:18,378 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277567,277580] [2025-01-09 20:32:18,379 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277722,277735] [2025-01-09 20:32:18,379 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277874,277887] [2025-01-09 20:32:18,379 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278029,278042] [2025-01-09 20:32:18,379 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278193,278206] [2025-01-09 20:32:18,380 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278349,278362] [2025-01-09 20:32:18,380 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278513,278526] [2025-01-09 20:32:18,380 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278655,278668] [2025-01-09 20:32:18,381 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278813,278826] [2025-01-09 20:32:18,381 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278980,278993] [2025-01-09 20:32:18,381 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279139,279152] [2025-01-09 20:32:18,381 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279298,279311] [2025-01-09 20:32:18,382 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279447,279460] [2025-01-09 20:32:18,382 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279594,279607] [2025-01-09 20:32:18,382 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279733,279746] [2025-01-09 20:32:18,383 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279896,279909] [2025-01-09 20:32:18,383 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280062,280075] [2025-01-09 20:32:18,383 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280226,280239] [2025-01-09 20:32:18,383 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280391,280404] [2025-01-09 20:32:18,384 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280556,280569] [2025-01-09 20:32:18,384 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280722,280735] [2025-01-09 20:32:18,384 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280887,280900] [2025-01-09 20:32:18,385 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281054,281067] [2025-01-09 20:32:18,385 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281214,281227] [2025-01-09 20:32:18,385 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281376,281389] [2025-01-09 20:32:18,385 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281535,281548] [2025-01-09 20:32:18,386 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281681,281694] [2025-01-09 20:32:18,386 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281824,281837] [2025-01-09 20:32:18,386 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281968,281981] [2025-01-09 20:32:18,387 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282111,282124] [2025-01-09 20:32:18,387 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282255,282268] [2025-01-09 20:32:18,387 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282396,282409] [2025-01-09 20:32:18,388 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282534,282547] [2025-01-09 20:32:18,388 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282692,282705] [2025-01-09 20:32:18,388 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282851,282864] [2025-01-09 20:32:18,388 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283007,283020] [2025-01-09 20:32:18,389 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283156,283169] [2025-01-09 20:32:18,389 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283308,283321] [2025-01-09 20:32:18,389 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283459,283472] [2025-01-09 20:32:18,390 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283608,283621] [2025-01-09 20:32:18,390 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283760,283773] [2025-01-09 20:32:18,390 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283908,283921] [2025-01-09 20:32:18,391 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284061,284074] [2025-01-09 20:32:18,391 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284212,284225] [2025-01-09 20:32:18,391 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284362,284375] [2025-01-09 20:32:18,391 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284509,284522] [2025-01-09 20:32:18,392 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284660,284673] [2025-01-09 20:32:18,392 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284811,284824] [2025-01-09 20:32:18,392 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284959,284972] [2025-01-09 20:32:18,392 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285125,285138] [2025-01-09 20:32:18,393 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285294,285307] [2025-01-09 20:32:18,393 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285461,285474] [2025-01-09 20:32:18,393 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285629,285642] [2025-01-09 20:32:18,394 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285779,285792] [2025-01-09 20:32:18,394 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285926,285939] [2025-01-09 20:32:18,394 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[286087,286100] [2025-01-09 20:32:18,394 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[286257,286270] [2025-01-09 20:32:18,394 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[286419,286432] [2025-01-09 20:32:18,402 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 20:32:18,430 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 20:32:18,566 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("mfence": : : "memory"); [4644] [2025-01-09 20:32:18,577 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("mfence": : : "memory"); [4799] [2025-01-09 20:32:18,597 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("sfence": : : "memory"); [5192] [2025-01-09 20:32:18,695 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273031,273044] [2025-01-09 20:32:18,696 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273176,273189] [2025-01-09 20:32:18,697 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273322,273335] [2025-01-09 20:32:18,697 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273487,273500] [2025-01-09 20:32:18,697 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273645,273658] [2025-01-09 20:32:18,697 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273803,273816] [2025-01-09 20:32:18,698 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273961,273974] [2025-01-09 20:32:18,698 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274121,274134] [2025-01-09 20:32:18,698 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274280,274293] [2025-01-09 20:32:18,698 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274419,274432] [2025-01-09 20:32:18,700 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274561,274574] [2025-01-09 20:32:18,701 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274710,274723] [2025-01-09 20:32:18,701 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274849,274862] [2025-01-09 20:32:18,702 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275004,275017] [2025-01-09 20:32:18,702 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275164,275177] [2025-01-09 20:32:18,703 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275315,275328] [2025-01-09 20:32:18,703 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275466,275479] [2025-01-09 20:32:18,704 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275618,275631] [2025-01-09 20:32:18,704 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275767,275780] [2025-01-09 20:32:18,706 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275915,275928] [2025-01-09 20:32:18,706 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276072,276085] [2025-01-09 20:32:18,706 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276221,276234] [2025-01-09 20:32:18,707 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276377,276390] [2025-01-09 20:32:18,707 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276530,276543] [2025-01-09 20:32:18,707 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276676,276689] [2025-01-09 20:32:18,707 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276819,276832] [2025-01-09 20:32:18,707 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276971,276984] [2025-01-09 20:32:18,708 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277117,277130] [2025-01-09 20:32:18,708 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277262,277275] [2025-01-09 20:32:18,708 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277416,277429] [2025-01-09 20:32:18,708 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277567,277580] [2025-01-09 20:32:18,708 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277722,277735] [2025-01-09 20:32:18,712 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277874,277887] [2025-01-09 20:32:18,712 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278029,278042] [2025-01-09 20:32:18,713 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278193,278206] [2025-01-09 20:32:18,713 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278349,278362] [2025-01-09 20:32:18,713 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278513,278526] [2025-01-09 20:32:18,714 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278655,278668] [2025-01-09 20:32:18,714 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278813,278826] [2025-01-09 20:32:18,714 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278980,278993] [2025-01-09 20:32:18,715 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279139,279152] [2025-01-09 20:32:18,716 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279298,279311] [2025-01-09 20:32:18,716 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279447,279460] [2025-01-09 20:32:18,716 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279594,279607] [2025-01-09 20:32:18,717 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279733,279746] [2025-01-09 20:32:18,717 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279896,279909] [2025-01-09 20:32:18,717 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280062,280075] [2025-01-09 20:32:18,717 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280226,280239] [2025-01-09 20:32:18,718 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280391,280404] [2025-01-09 20:32:18,719 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280556,280569] [2025-01-09 20:32:18,719 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280722,280735] [2025-01-09 20:32:18,719 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280887,280900] [2025-01-09 20:32:18,720 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281054,281067] [2025-01-09 20:32:18,720 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281214,281227] [2025-01-09 20:32:18,720 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281376,281389] [2025-01-09 20:32:18,720 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281535,281548] [2025-01-09 20:32:18,721 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281681,281694] [2025-01-09 20:32:18,721 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281824,281837] [2025-01-09 20:32:18,721 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281968,281981] [2025-01-09 20:32:18,721 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282111,282124] [2025-01-09 20:32:18,722 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282255,282268] [2025-01-09 20:32:18,722 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282396,282409] [2025-01-09 20:32:18,722 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282534,282547] [2025-01-09 20:32:18,722 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282692,282705] [2025-01-09 20:32:18,723 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282851,282864] [2025-01-09 20:32:18,723 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283007,283020] [2025-01-09 20:32:18,723 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283156,283169] [2025-01-09 20:32:18,723 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283308,283321] [2025-01-09 20:32:18,724 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283459,283472] [2025-01-09 20:32:18,724 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283608,283621] [2025-01-09 20:32:18,724 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283760,283773] [2025-01-09 20:32:18,724 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283908,283921] [2025-01-09 20:32:18,725 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284061,284074] [2025-01-09 20:32:18,725 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284212,284225] [2025-01-09 20:32:18,725 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284362,284375] [2025-01-09 20:32:18,726 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284509,284522] [2025-01-09 20:32:18,729 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284660,284673] [2025-01-09 20:32:18,730 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284811,284824] [2025-01-09 20:32:18,730 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284959,284972] [2025-01-09 20:32:18,730 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285125,285138] [2025-01-09 20:32:18,731 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285294,285307] [2025-01-09 20:32:18,731 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285461,285474] [2025-01-09 20:32:18,731 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285629,285642] [2025-01-09 20:32:18,731 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285779,285792] [2025-01-09 20:32:18,732 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285926,285939] [2025-01-09 20:32:18,732 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[286087,286100] [2025-01-09 20:32:18,732 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[286257,286270] [2025-01-09 20:32:18,732 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[286419,286432] [2025-01-09 20:32:18,736 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 20:32:18,899 INFO L204 MainTranslator]: Completed translation [2025-01-09 20:32:18,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:32:18 WrapperNode [2025-01-09 20:32:18,900 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 20:32:18,902 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 20:32:18,902 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 20:32:18,903 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 20:32:18,908 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:32:18" (1/1) ... [2025-01-09 20:32:18,975 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:32:18" (1/1) ... [2025-01-09 20:32:19,081 INFO L138 Inliner]: procedures = 526, calls = 1370, calls flagged for inlining = 224, calls inlined = 135, statements flattened = 2492 [2025-01-09 20:32:19,083 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 20:32:19,083 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 20:32:19,083 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 20:32:19,083 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 20:32:19,094 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:32:18" (1/1) ... [2025-01-09 20:32:19,094 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:32:18" (1/1) ... [2025-01-09 20:32:19,108 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:32:18" (1/1) ... [2025-01-09 20:32:19,500 INFO L175 MemorySlicer]: Split 355 memory accesses to 11 slices as follows [7, 3, 1, 2, 23, 5, 2, 4, 3, 277, 28]. 78 percent of accesses are in the largest equivalence class. The 40 initializations are split as follows [7, 0, 1, 2, 0, 0, 0, 4, 0, 26, 0]. The 184 writes are split as follows [0, 0, 0, 0, 23, 5, 0, 0, 0, 132, 24]. [2025-01-09 20:32:19,500 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:32:18" (1/1) ... [2025-01-09 20:32:19,500 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:32:18" (1/1) ... [2025-01-09 20:32:19,610 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:32:18" (1/1) ... [2025-01-09 20:32:19,624 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:32:18" (1/1) ... [2025-01-09 20:32:19,649 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:32:18" (1/1) ... [2025-01-09 20:32:19,683 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:32:18" (1/1) ... [2025-01-09 20:32:19,699 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:32:18" (1/1) ... [2025-01-09 20:32:19,757 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 20:32:19,760 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 20:32:19,760 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 20:32:19,760 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 20:32:19,762 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:32:18" (1/1) ... [2025-01-09 20:32:19,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:32:19,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:32:19,803 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 20:32:19,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 20:32:19,830 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2025-01-09 20:32:19,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2025-01-09 20:32:19,830 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-01-09 20:32:19,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-01-09 20:32:19,830 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2025-01-09 20:32:19,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2025-01-09 20:32:19,830 INFO L130 BoogieDeclarations]: Found specification of procedure __might_sleep [2025-01-09 20:32:19,832 INFO L138 BoogieDeclarations]: Found implementation of procedure __might_sleep [2025-01-09 20:32:19,832 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2025-01-09 20:32:19,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2025-01-09 20:32:19,832 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2025-01-09 20:32:19,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2025-01-09 20:32:19,833 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2025-01-09 20:32:19,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2025-01-09 20:32:19,833 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_read_buffer_lock_of_lego_usb_tower [2025-01-09 20:32:19,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_read_buffer_lock_of_lego_usb_tower [2025-01-09 20:32:19,833 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2025-01-09 20:32:19,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2025-01-09 20:32:19,833 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2025-01-09 20:32:19,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2025-01-09 20:32:19,833 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2025-01-09 20:32:19,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2025-01-09 20:32:19,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 20:32:19,833 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2025-01-09 20:32:19,834 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2025-01-09 20:32:19,834 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2025-01-09 20:32:19,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2025-01-09 20:32:19,834 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2025-01-09 20:32:19,834 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2025-01-09 20:32:19,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-01-09 20:32:19,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-01-09 20:32:19,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-01-09 20:32:19,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-01-09 20:32:19,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-01-09 20:32:19,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-01-09 20:32:19,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-01-09 20:32:19,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-01-09 20:32:19,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-01-09 20:32:19,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-01-09 20:32:19,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-01-09 20:32:19,836 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2025-01-09 20:32:19,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2025-01-09 20:32:19,837 INFO L130 BoogieDeclarations]: Found specification of procedure _dev_info [2025-01-09 20:32:19,837 INFO L138 BoogieDeclarations]: Found implementation of procedure _dev_info [2025-01-09 20:32:19,837 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2025-01-09 20:32:19,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2025-01-09 20:32:19,837 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irq_112 [2025-01-09 20:32:19,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irq_112 [2025-01-09 20:32:19,837 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2025-01-09 20:32:19,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2025-01-09 20:32:19,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 20:32:19,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 20:32:19,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 20:32:19,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 20:32:19,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 20:32:19,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 20:32:19,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 20:32:19,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-09 20:32:19,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-01-09 20:32:19,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-01-09 20:32:19,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-01-09 20:32:19,840 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2025-01-09 20:32:19,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2025-01-09 20:32:19,840 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2025-01-09 20:32:19,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2025-01-09 20:32:19,840 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2025-01-09 20:32:19,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2025-01-09 20:32:19,840 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2025-01-09 20:32:19,840 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2025-01-09 20:32:19,840 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2025-01-09 20:32:19,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2025-01-09 20:32:19,840 INFO L130 BoogieDeclarations]: Found specification of procedure prepare_to_wait_event [2025-01-09 20:32:19,840 INFO L138 BoogieDeclarations]: Found implementation of procedure prepare_to_wait_event [2025-01-09 20:32:19,840 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2025-01-09 20:32:19,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2025-01-09 20:32:19,840 INFO L130 BoogieDeclarations]: Found specification of procedure __dynamic_dev_dbg [2025-01-09 20:32:19,840 INFO L138 BoogieDeclarations]: Found implementation of procedure __dynamic_dev_dbg [2025-01-09 20:32:19,840 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_open_disc_mutex [2025-01-09 20:32:19,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_open_disc_mutex [2025-01-09 20:32:19,840 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_lock_of_lego_usb_tower [2025-01-09 20:32:19,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_lock_of_lego_usb_tower [2025-01-09 20:32:19,841 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2025-01-09 20:32:19,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2025-01-09 20:32:19,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 20:32:19,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 20:32:19,841 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2025-01-09 20:32:19,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2025-01-09 20:32:19,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 20:32:19,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 20:32:19,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 20:32:19,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-09 20:32:19,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-01-09 20:32:19,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-01-09 20:32:19,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-01-09 20:32:19,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-01-09 20:32:19,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-01-09 20:32:19,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-01-09 20:32:19,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-01-09 20:32:19,841 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2025-01-09 20:32:19,841 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2025-01-09 20:32:19,841 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2025-01-09 20:32:19,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2025-01-09 20:32:19,841 INFO L130 BoogieDeclarations]: Found specification of procedure usb_control_msg [2025-01-09 20:32:19,841 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_control_msg [2025-01-09 20:32:19,841 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_irq_check_alloc_flags [2025-01-09 20:32:19,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_irq_check_alloc_flags [2025-01-09 20:32:19,844 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2025-01-09 20:32:19,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2025-01-09 20:32:19,844 INFO L130 BoogieDeclarations]: Found specification of procedure __init_waitqueue_head [2025-01-09 20:32:19,844 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_waitqueue_head [2025-01-09 20:32:19,844 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_open_disc_mutex [2025-01-09 20:32:19,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_open_disc_mutex [2025-01-09 20:32:19,845 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_timeout [2025-01-09 20:32:19,845 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_timeout [2025-01-09 20:32:19,845 INFO L130 BoogieDeclarations]: Found specification of procedure finish_wait [2025-01-09 20:32:19,845 INFO L138 BoogieDeclarations]: Found implementation of procedure finish_wait [2025-01-09 20:32:19,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 20:32:19,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 20:32:19,845 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_intfdata [2025-01-09 20:32:19,845 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_intfdata [2025-01-09 20:32:19,845 INFO L130 BoogieDeclarations]: Found specification of procedure tower_disconnect [2025-01-09 20:32:19,845 INFO L138 BoogieDeclarations]: Found implementation of procedure tower_disconnect [2025-01-09 20:32:19,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-01-09 20:32:19,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-01-09 20:32:19,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-01-09 20:32:19,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-01-09 20:32:19,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-01-09 20:32:19,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-01-09 20:32:19,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-01-09 20:32:19,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-01-09 20:32:19,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-01-09 20:32:19,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-01-09 20:32:19,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-01-09 20:32:19,846 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-01-09 20:32:19,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-01-09 20:32:19,846 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2025-01-09 20:32:19,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2025-01-09 20:32:19,846 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_maxp [2025-01-09 20:32:19,846 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_maxp [2025-01-09 20:32:19,846 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2025-01-09 20:32:19,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2025-01-09 20:32:19,846 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_free_urb [2025-01-09 20:32:19,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_free_urb [2025-01-09 20:32:19,847 INFO L130 BoogieDeclarations]: Found specification of procedure poll_wait [2025-01-09 20:32:19,847 INFO L138 BoogieDeclarations]: Found implementation of procedure poll_wait [2025-01-09 20:32:19,847 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2025-01-09 20:32:19,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2025-01-09 20:32:19,847 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_lock_of_lego_usb_tower [2025-01-09 20:32:19,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_lock_of_lego_usb_tower [2025-01-09 20:32:19,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 20:32:19,847 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2025-01-09 20:32:19,847 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2025-01-09 20:32:19,847 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2025-01-09 20:32:19,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2025-01-09 20:32:19,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 20:32:19,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 20:32:19,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 20:32:19,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-09 20:32:19,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-01-09 20:32:19,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-01-09 20:32:19,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-01-09 20:32:19,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-01-09 20:32:19,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-01-09 20:32:19,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-01-09 20:32:19,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-01-09 20:32:19,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 20:32:19,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 20:32:19,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 20:32:19,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-01-09 20:32:19,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-01-09 20:32:19,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-01-09 20:32:19,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-01-09 20:32:19,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-01-09 20:32:19,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-01-09 20:32:19,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-01-09 20:32:19,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-01-09 20:32:19,848 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2025-01-09 20:32:19,848 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2025-01-09 20:32:19,848 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-01-09 20:32:19,848 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-01-09 20:32:19,848 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2025-01-09 20:32:19,848 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2025-01-09 20:32:19,848 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2025-01-09 20:32:19,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2025-01-09 20:32:19,848 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2025-01-09 20:32:19,848 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2025-01-09 20:32:19,848 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2025-01-09 20:32:19,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2025-01-09 20:32:19,848 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_interruptible_or_killable_lock_of_lego_usb_tower [2025-01-09 20:32:19,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_interruptible_or_killable_lock_of_lego_usb_tower [2025-01-09 20:32:19,848 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2025-01-09 20:32:19,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2025-01-09 20:32:19,848 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_alloc_urb [2025-01-09 20:32:19,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_alloc_urb [2025-01-09 20:32:19,848 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2025-01-09 20:32:19,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2025-01-09 20:32:19,848 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2025-01-09 20:32:19,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2025-01-09 20:32:19,848 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2025-01-09 20:32:19,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2025-01-09 20:32:19,851 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2025-01-09 20:32:19,851 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2025-01-09 20:32:19,851 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2025-01-09 20:32:19,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2025-01-09 20:32:19,851 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_int_urb [2025-01-09 20:32:19,851 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_int_urb [2025-01-09 20:32:19,851 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_read_buffer_lock_of_lego_usb_tower [2025-01-09 20:32:19,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_read_buffer_lock_of_lego_usb_tower [2025-01-09 20:32:19,851 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-01-09 20:32:19,851 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-01-09 20:32:19,851 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2025-01-09 20:32:19,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2025-01-09 20:32:19,851 INFO L130 BoogieDeclarations]: Found specification of procedure tower_delete [2025-01-09 20:32:19,851 INFO L138 BoogieDeclarations]: Found implementation of procedure tower_delete [2025-01-09 20:32:19,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 20:32:19,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 20:32:19,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 20:32:19,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 20:32:19,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 20:32:19,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 20:32:19,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 20:32:19,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-09 20:32:19,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-09 20:32:19,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-01-09 20:32:19,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-01-09 20:32:19,851 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2025-01-09 20:32:19,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2025-01-09 20:32:19,851 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-01-09 20:32:19,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-01-09 20:32:19,851 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2025-01-09 20:32:19,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2025-01-09 20:32:19,852 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2025-01-09 20:32:19,852 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2025-01-09 20:32:19,852 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2025-01-09 20:32:19,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2025-01-09 20:32:19,852 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2025-01-09 20:32:19,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2025-01-09 20:32:19,852 INFO L130 BoogieDeclarations]: Found specification of procedure tower_check_for_read_packet [2025-01-09 20:32:19,852 INFO L138 BoogieDeclarations]: Found implementation of procedure tower_check_for_read_packet [2025-01-09 20:32:19,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 20:32:19,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 20:32:19,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 20:32:19,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 20:32:19,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 20:32:19,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 20:32:19,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 20:32:19,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 20:32:19,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 20:32:19,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 20:32:19,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 20:32:19,852 INFO L130 BoogieDeclarations]: Found specification of procedure tower_abort_transfers [2025-01-09 20:32:19,852 INFO L138 BoogieDeclarations]: Found implementation of procedure tower_abort_transfers [2025-01-09 20:32:19,852 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_irq_111 [2025-01-09 20:32:19,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_irq_111 [2025-01-09 20:32:20,412 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 20:32:20,415 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 20:32:20,592 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-01-09 20:32:28,046 INFO L? ?]: Removed 1159 outVars from TransFormulas that were not future-live. [2025-01-09 20:32:28,047 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 20:32:28,088 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 20:32:28,088 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 20:32:28,088 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:32:28 BoogieIcfgContainer [2025-01-09 20:32:28,088 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 20:32:28,090 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 20:32:28,090 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 20:32:28,094 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 20:32:28,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:32:15" (1/3) ... [2025-01-09 20:32:28,095 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f0ab24d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:32:28, skipping insertion in model container [2025-01-09 20:32:28,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:32:18" (2/3) ... [2025-01-09 20:32:28,095 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f0ab24d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:32:28, skipping insertion in model container [2025-01-09 20:32:28,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:32:28" (3/3) ... [2025-01-09 20:32:28,096 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i [2025-01-09 20:32:28,109 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 20:32:28,112 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i that has 81 procedures, 1067 locations, 1 initial locations, 0 loop locations, and 30 error locations. [2025-01-09 20:32:28,202 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 20:32:28,215 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;@1f29d53a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 20:32:28,216 INFO L334 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2025-01-09 20:32:28,226 INFO L276 IsEmpty]: Start isEmpty. Operand has 1066 states, 692 states have (on average 1.283236994219653) internal successors, (888), 745 states have internal predecessors, (888), 264 states have call successors, (264), 80 states have call predecessors, (264), 79 states have return successors, (259), 249 states have call predecessors, (259), 259 states have call successors, (259) [2025-01-09 20:32:28,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 20:32:28,236 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:32:28,236 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:32:28,237 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-01-09 20:32:28,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:32:28,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1954184494, now seen corresponding path program 1 times [2025-01-09 20:32:28,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:32:28,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050041293] [2025-01-09 20:32:28,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:32:28,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:32:29,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 20:32:29,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 20:32:29,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:32:29,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:32:30,749 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-09 20:32:30,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:32:30,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050041293] [2025-01-09 20:32:30,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050041293] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:32:30,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:32:30,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:32:30,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468954244] [2025-01-09 20:32:30,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:32:30,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:32:30,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:32:30,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:32:30,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:32:30,787 INFO L87 Difference]: Start difference. First operand has 1066 states, 692 states have (on average 1.283236994219653) internal successors, (888), 745 states have internal predecessors, (888), 264 states have call successors, (264), 80 states have call predecessors, (264), 79 states have return successors, (259), 249 states have call predecessors, (259), 259 states have call successors, (259) Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 20:32:31,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:32:31,106 INFO L93 Difference]: Finished difference Result 2083 states and 2852 transitions. [2025-01-09 20:32:31,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:32:31,111 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 71 [2025-01-09 20:32:31,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:32:31,145 INFO L225 Difference]: With dead ends: 2083 [2025-01-09 20:32:31,145 INFO L226 Difference]: Without dead ends: 1048 [2025-01-09 20:32:31,155 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-01-09 20:32:31,158 INFO L435 NwaCegarLoop]: 1368 mSDtfsCounter, 1338 mSDsluCounter, 1367 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1338 SdHoareTripleChecker+Valid, 2735 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:32:31,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1338 Valid, 2735 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:32:31,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2025-01-09 20:32:31,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 1048. [2025-01-09 20:32:31,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1048 states, 682 states have (on average 1.2258064516129032) internal successors, (836), 730 states have internal predecessors, (836), 259 states have call successors, (259), 79 states have call predecessors, (259), 78 states have return successors, (257), 247 states have call predecessors, (257), 257 states have call successors, (257) [2025-01-09 20:32:31,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1352 transitions. [2025-01-09 20:32:31,354 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1352 transitions. Word has length 71 [2025-01-09 20:32:31,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:32:31,358 INFO L471 AbstractCegarLoop]: Abstraction has 1048 states and 1352 transitions. [2025-01-09 20:32:31,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 20:32:31,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1352 transitions. [2025-01-09 20:32:31,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 20:32:31,365 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:32:31,365 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:32:31,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 20:32:31,366 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_linux_block_genhd_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-01-09 20:32:31,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:32:31,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1831593091, now seen corresponding path program 1 times [2025-01-09 20:32:31,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:32:31,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337357859] [2025-01-09 20:32:31,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:32:31,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:32:32,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 20:32:32,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 20:32:32,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:32:32,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:32:33,074 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-09 20:32:33,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:32:33,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337357859] [2025-01-09 20:32:33,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337357859] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:32:33,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:32:33,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:32:33,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976477548] [2025-01-09 20:32:33,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:32:33,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:32:33,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:32:33,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:32:33,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:32:33,080 INFO L87 Difference]: Start difference. First operand 1048 states and 1352 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 20:32:33,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:32:33,198 INFO L93 Difference]: Finished difference Result 1048 states and 1352 transitions. [2025-01-09 20:32:33,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:32:33,201 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 77 [2025-01-09 20:32:33,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:32:33,212 INFO L225 Difference]: With dead ends: 1048 [2025-01-09 20:32:33,212 INFO L226 Difference]: Without dead ends: 1046 [2025-01-09 20:32:33,213 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-01-09 20:32:33,216 INFO L435 NwaCegarLoop]: 1348 mSDtfsCounter, 1317 mSDsluCounter, 1347 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1317 SdHoareTripleChecker+Valid, 2695 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:32:33,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1317 Valid, 2695 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:32:33,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2025-01-09 20:32:33,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 1046. [2025-01-09 20:32:33,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1046 states, 681 states have (on average 1.224669603524229) internal successors, (834), 728 states have internal predecessors, (834), 259 states have call successors, (259), 79 states have call predecessors, (259), 78 states have return successors, (257), 247 states have call predecessors, (257), 257 states have call successors, (257) [2025-01-09 20:32:33,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1350 transitions. [2025-01-09 20:32:33,307 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1350 transitions. Word has length 77 [2025-01-09 20:32:33,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:32:33,307 INFO L471 AbstractCegarLoop]: Abstraction has 1046 states and 1350 transitions. [2025-01-09 20:32:33,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 20:32:33,308 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1350 transitions. [2025-01-09 20:32:33,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-09 20:32:33,312 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:32:33,312 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:32:33,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 20:32:33,312 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-01-09 20:32:33,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:32:33,313 INFO L85 PathProgramCache]: Analyzing trace with hash 232852419, now seen corresponding path program 1 times [2025-01-09 20:32:33,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:32:33,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568478487] [2025-01-09 20:32:33,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:32:33,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:32:34,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 20:32:34,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 20:32:34,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:32:34,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:32:34,782 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-09 20:32:34,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:32:34,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568478487] [2025-01-09 20:32:34,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568478487] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:32:34,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:32:34,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:32:34,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524365355] [2025-01-09 20:32:34,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:32:34,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:32:34,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:32:34,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:32:34,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:32:34,784 INFO L87 Difference]: Start difference. First operand 1046 states and 1350 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 20:32:34,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:32:34,912 INFO L93 Difference]: Finished difference Result 1046 states and 1350 transitions. [2025-01-09 20:32:34,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:32:34,913 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 83 [2025-01-09 20:32:34,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:32:34,921 INFO L225 Difference]: With dead ends: 1046 [2025-01-09 20:32:34,922 INFO L226 Difference]: Without dead ends: 1044 [2025-01-09 20:32:34,923 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-01-09 20:32:34,926 INFO L435 NwaCegarLoop]: 1346 mSDtfsCounter, 1314 mSDsluCounter, 1345 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1314 SdHoareTripleChecker+Valid, 2691 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:32:34,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1314 Valid, 2691 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:32:34,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1044 states. [2025-01-09 20:32:34,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1044 to 1044. [2025-01-09 20:32:34,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1044 states, 680 states have (on average 1.223529411764706) internal successors, (832), 726 states have internal predecessors, (832), 259 states have call successors, (259), 79 states have call predecessors, (259), 78 states have return successors, (257), 247 states have call predecessors, (257), 257 states have call successors, (257) [2025-01-09 20:32:34,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 1348 transitions. [2025-01-09 20:32:35,002 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 1348 transitions. Word has length 83 [2025-01-09 20:32:35,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:32:35,004 INFO L471 AbstractCegarLoop]: Abstraction has 1044 states and 1348 transitions. [2025-01-09 20:32:35,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 20:32:35,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 1348 transitions. [2025-01-09 20:32:35,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 20:32:35,008 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:32:35,009 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:32:35,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 20:32:35,009 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-01-09 20:32:35,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:32:35,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1200582179, now seen corresponding path program 1 times [2025-01-09 20:32:35,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:32:35,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410633955] [2025-01-09 20:32:35,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:32:35,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:32:35,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 20:32:35,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 20:32:35,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:32:35,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:32:36,309 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-09 20:32:36,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:32:36,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410633955] [2025-01-09 20:32:36,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410633955] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:32:36,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:32:36,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:32:36,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235456088] [2025-01-09 20:32:36,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:32:36,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:32:36,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:32:36,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:32:36,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:32:36,311 INFO L87 Difference]: Start difference. First operand 1044 states and 1348 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 20:32:36,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:32:36,430 INFO L93 Difference]: Finished difference Result 1044 states and 1348 transitions. [2025-01-09 20:32:36,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:32:36,432 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 89 [2025-01-09 20:32:36,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:32:36,441 INFO L225 Difference]: With dead ends: 1044 [2025-01-09 20:32:36,441 INFO L226 Difference]: Without dead ends: 1042 [2025-01-09 20:32:36,442 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-01-09 20:32:36,443 INFO L435 NwaCegarLoop]: 1344 mSDtfsCounter, 1311 mSDsluCounter, 1343 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1311 SdHoareTripleChecker+Valid, 2687 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:32:36,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1311 Valid, 2687 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:32:36,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2025-01-09 20:32:36,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 1042. [2025-01-09 20:32:36,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1042 states, 679 states have (on average 1.2223858615611194) internal successors, (830), 724 states have internal predecessors, (830), 259 states have call successors, (259), 79 states have call predecessors, (259), 78 states have return successors, (257), 247 states have call predecessors, (257), 257 states have call successors, (257) [2025-01-09 20:32:36,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1346 transitions. [2025-01-09 20:32:36,520 INFO L78 Accepts]: Start accepts. Automaton has 1042 states and 1346 transitions. Word has length 89 [2025-01-09 20:32:36,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:32:36,521 INFO L471 AbstractCegarLoop]: Abstraction has 1042 states and 1346 transitions. [2025-01-09 20:32:36,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 20:32:36,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 1346 transitions. [2025-01-09 20:32:36,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-09 20:32:36,523 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:32:36,523 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:32:36,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 20:32:36,524 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-01-09 20:32:36,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:32:36,524 INFO L85 PathProgramCache]: Analyzing trace with hash 2087623650, now seen corresponding path program 1 times [2025-01-09 20:32:36,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:32:36,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657180228] [2025-01-09 20:32:36,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:32:36,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:32:37,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 20:32:37,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 20:32:37,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:32:37,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:32:37,808 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-09 20:32:37,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:32:37,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657180228] [2025-01-09 20:32:37,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657180228] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:32:37,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:32:37,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:32:37,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801520857] [2025-01-09 20:32:37,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:32:37,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:32:37,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:32:37,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:32:37,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:32:37,811 INFO L87 Difference]: Start difference. First operand 1042 states and 1346 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 20:32:37,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:32:37,904 INFO L93 Difference]: Finished difference Result 1042 states and 1346 transitions. [2025-01-09 20:32:37,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:32:37,905 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 95 [2025-01-09 20:32:37,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:32:37,913 INFO L225 Difference]: With dead ends: 1042 [2025-01-09 20:32:37,913 INFO L226 Difference]: Without dead ends: 1040 [2025-01-09 20:32:37,914 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-01-09 20:32:37,915 INFO L435 NwaCegarLoop]: 1342 mSDtfsCounter, 1308 mSDsluCounter, 1341 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1308 SdHoareTripleChecker+Valid, 2683 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:32:37,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1308 Valid, 2683 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:32:37,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2025-01-09 20:32:37,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 1040. [2025-01-09 20:32:37,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1040 states, 678 states have (on average 1.2212389380530972) internal successors, (828), 722 states have internal predecessors, (828), 259 states have call successors, (259), 79 states have call predecessors, (259), 78 states have return successors, (257), 247 states have call predecessors, (257), 257 states have call successors, (257) [2025-01-09 20:32:37,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 1040 states and 1344 transitions. [2025-01-09 20:32:37,981 INFO L78 Accepts]: Start accepts. Automaton has 1040 states and 1344 transitions. Word has length 95 [2025-01-09 20:32:37,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:32:37,981 INFO L471 AbstractCegarLoop]: Abstraction has 1040 states and 1344 transitions. [2025-01-09 20:32:37,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 20:32:37,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 1344 transitions. [2025-01-09 20:32:37,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 20:32:37,983 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:32:37,983 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:32:37,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 20:32:37,983 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-01-09 20:32:37,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:32:37,984 INFO L85 PathProgramCache]: Analyzing trace with hash 73319135, now seen corresponding path program 1 times [2025-01-09 20:32:37,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:32:37,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337570099] [2025-01-09 20:32:37,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:32:37,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:32:38,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 20:32:38,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 20:32:38,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:32:38,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:32:39,099 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-09 20:32:39,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:32:39,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337570099] [2025-01-09 20:32:39,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337570099] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:32:39,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:32:39,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:32:39,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400385641] [2025-01-09 20:32:39,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:32:39,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:32:39,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:32:39,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:32:39,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:32:39,101 INFO L87 Difference]: Start difference. First operand 1040 states and 1344 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 20:32:39,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:32:39,191 INFO L93 Difference]: Finished difference Result 1040 states and 1344 transitions. [2025-01-09 20:32:39,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:32:39,192 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 101 [2025-01-09 20:32:39,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:32:39,200 INFO L225 Difference]: With dead ends: 1040 [2025-01-09 20:32:39,200 INFO L226 Difference]: Without dead ends: 1038 [2025-01-09 20:32:39,201 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-01-09 20:32:39,203 INFO L435 NwaCegarLoop]: 1340 mSDtfsCounter, 1305 mSDsluCounter, 1339 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1305 SdHoareTripleChecker+Valid, 2679 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:32:39,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1305 Valid, 2679 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:32:39,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states. [2025-01-09 20:32:39,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 1038. [2025-01-09 20:32:39,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1038 states, 677 states have (on average 1.2200886262924668) internal successors, (826), 720 states have internal predecessors, (826), 259 states have call successors, (259), 79 states have call predecessors, (259), 78 states have return successors, (257), 247 states have call predecessors, (257), 257 states have call successors, (257) [2025-01-09 20:32:39,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 1038 states and 1342 transitions. [2025-01-09 20:32:39,268 INFO L78 Accepts]: Start accepts. Automaton has 1038 states and 1342 transitions. Word has length 101 [2025-01-09 20:32:39,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:32:39,268 INFO L471 AbstractCegarLoop]: Abstraction has 1038 states and 1342 transitions. [2025-01-09 20:32:39,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 20:32:39,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 1342 transitions. [2025-01-09 20:32:39,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-09 20:32:39,270 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:32:39,270 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:32:39,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 20:32:39,270 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-01-09 20:32:39,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:32:39,271 INFO L85 PathProgramCache]: Analyzing trace with hash -372696350, now seen corresponding path program 1 times [2025-01-09 20:32:39,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:32:39,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633718301] [2025-01-09 20:32:39,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:32:39,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:32:40,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 20:32:40,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 20:32:40,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:32:40,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:32:40,585 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-09 20:32:40,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:32:40,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633718301] [2025-01-09 20:32:40,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633718301] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:32:40,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:32:40,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:32:40,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379692443] [2025-01-09 20:32:40,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:32:40,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:32:40,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:32:40,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:32:40,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:32:40,588 INFO L87 Difference]: Start difference. First operand 1038 states and 1342 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 20:32:40,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:32:40,675 INFO L93 Difference]: Finished difference Result 1038 states and 1342 transitions. [2025-01-09 20:32:40,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:32:40,675 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 107 [2025-01-09 20:32:40,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:32:40,683 INFO L225 Difference]: With dead ends: 1038 [2025-01-09 20:32:40,683 INFO L226 Difference]: Without dead ends: 1036 [2025-01-09 20:32:40,684 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-01-09 20:32:40,685 INFO L435 NwaCegarLoop]: 1338 mSDtfsCounter, 1302 mSDsluCounter, 1337 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1302 SdHoareTripleChecker+Valid, 2675 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:32:40,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1302 Valid, 2675 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:32:40,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2025-01-09 20:32:40,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 1036. [2025-01-09 20:32:40,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1036 states, 676 states have (on average 1.2189349112426036) internal successors, (824), 718 states have internal predecessors, (824), 259 states have call successors, (259), 79 states have call predecessors, (259), 78 states have return successors, (257), 247 states have call predecessors, (257), 257 states have call successors, (257) [2025-01-09 20:32:40,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1340 transitions. [2025-01-09 20:32:40,825 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 1340 transitions. Word has length 107 [2025-01-09 20:32:40,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:32:40,826 INFO L471 AbstractCegarLoop]: Abstraction has 1036 states and 1340 transitions. [2025-01-09 20:32:40,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 20:32:40,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1340 transitions. [2025-01-09 20:32:40,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-09 20:32:40,830 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:32:40,831 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:32:40,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 20:32:40,831 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-01-09 20:32:40,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:32:40,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1237568151, now seen corresponding path program 1 times [2025-01-09 20:32:40,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:32:40,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179017624] [2025-01-09 20:32:40,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:32:40,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:32:41,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 20:32:41,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 20:32:41,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:32:41,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:32:42,068 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-09 20:32:42,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:32:42,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179017624] [2025-01-09 20:32:42,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179017624] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:32:42,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:32:42,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:32:42,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789591296] [2025-01-09 20:32:42,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:32:42,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:32:42,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:32:42,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:32:42,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:32:42,071 INFO L87 Difference]: Start difference. First operand 1036 states and 1340 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 20:32:42,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:32:42,188 INFO L93 Difference]: Finished difference Result 1036 states and 1340 transitions. [2025-01-09 20:32:42,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:32:42,191 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 113 [2025-01-09 20:32:42,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:32:42,199 INFO L225 Difference]: With dead ends: 1036 [2025-01-09 20:32:42,199 INFO L226 Difference]: Without dead ends: 1034 [2025-01-09 20:32:42,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:32:42,202 INFO L435 NwaCegarLoop]: 1336 mSDtfsCounter, 1299 mSDsluCounter, 1335 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1299 SdHoareTripleChecker+Valid, 2671 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:32:42,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1299 Valid, 2671 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:32:42,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2025-01-09 20:32:42,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2025-01-09 20:32:42,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 675 states have (on average 1.2177777777777778) internal successors, (822), 716 states have internal predecessors, (822), 259 states have call successors, (259), 79 states have call predecessors, (259), 78 states have return successors, (257), 247 states have call predecessors, (257), 257 states have call successors, (257) [2025-01-09 20:32:42,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1338 transitions. [2025-01-09 20:32:42,325 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1338 transitions. Word has length 113 [2025-01-09 20:32:42,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:32:42,325 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1338 transitions. [2025-01-09 20:32:42,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 20:32:42,326 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1338 transitions. [2025-01-09 20:32:42,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 20:32:42,330 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:32:42,331 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:32:42,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 20:32:42,331 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-01-09 20:32:42,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:32:42,332 INFO L85 PathProgramCache]: Analyzing trace with hash -402815878, now seen corresponding path program 1 times [2025-01-09 20:32:42,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:32:42,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786223506] [2025-01-09 20:32:42,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:32:42,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:32:43,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 20:32:43,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 20:32:43,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:32:43,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:32:43,609 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-09 20:32:43,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:32:43,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786223506] [2025-01-09 20:32:43,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786223506] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:32:43,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:32:43,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:32:43,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726721894] [2025-01-09 20:32:43,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:32:43,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:32:43,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:32:43,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:32:43,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:32:43,612 INFO L87 Difference]: Start difference. First operand 1034 states and 1338 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 20:32:43,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:32:43,793 INFO L93 Difference]: Finished difference Result 1034 states and 1338 transitions. [2025-01-09 20:32:43,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:32:43,793 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 115 [2025-01-09 20:32:43,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:32:43,799 INFO L225 Difference]: With dead ends: 1034 [2025-01-09 20:32:43,800 INFO L226 Difference]: Without dead ends: 1032 [2025-01-09 20:32:43,800 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-01-09 20:32:43,801 INFO L435 NwaCegarLoop]: 1334 mSDtfsCounter, 1295 mSDsluCounter, 1333 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1295 SdHoareTripleChecker+Valid, 2667 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:32:43,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1295 Valid, 2667 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:32:43,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2025-01-09 20:32:43,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 1032. [2025-01-09 20:32:43,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1032 states, 674 states have (on average 1.2166172106824926) internal successors, (820), 714 states have internal predecessors, (820), 259 states have call successors, (259), 79 states have call predecessors, (259), 78 states have return successors, (257), 247 states have call predecessors, (257), 257 states have call successors, (257) [2025-01-09 20:32:43,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1336 transitions. [2025-01-09 20:32:43,883 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1336 transitions. Word has length 115 [2025-01-09 20:32:43,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:32:43,883 INFO L471 AbstractCegarLoop]: Abstraction has 1032 states and 1336 transitions. [2025-01-09 20:32:43,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 20:32:43,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1336 transitions. [2025-01-09 20:32:43,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-01-09 20:32:43,887 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:32:43,887 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:32:43,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 20:32:43,887 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_linux_alloc_irq_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-01-09 20:32:43,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:32:43,888 INFO L85 PathProgramCache]: Analyzing trace with hash -2123719673, now seen corresponding path program 1 times [2025-01-09 20:32:43,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:32:43,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461540310] [2025-01-09 20:32:43,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:32:43,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:32:44,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 20:32:45,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 20:32:45,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:32:45,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:32:46,593 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-01-09 20:32:46,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:32:46,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461540310] [2025-01-09 20:32:46,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461540310] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:32:46,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:32:46,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 20:32:46,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585839581] [2025-01-09 20:32:46,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:32:46,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 20:32:46,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:32:46,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 20:32:46,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 20:32:46,596 INFO L87 Difference]: Start difference. First operand 1032 states and 1336 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 20:32:50,642 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-01-09 20:32:53,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:32:53,471 INFO L93 Difference]: Finished difference Result 2025 states and 2624 transitions. [2025-01-09 20:32:53,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 20:32:53,472 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 164 [2025-01-09 20:32:53,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:32:53,481 INFO L225 Difference]: With dead ends: 2025 [2025-01-09 20:32:53,481 INFO L226 Difference]: Without dead ends: 1032 [2025-01-09 20:32:53,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 20:32:53,485 INFO L435 NwaCegarLoop]: 1332 mSDtfsCounter, 1294 mSDsluCounter, 3476 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1295 SdHoareTripleChecker+Valid, 4808 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2025-01-09 20:32:53,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1295 Valid, 4808 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 527 Invalid, 1 Unknown, 0 Unchecked, 6.5s Time] [2025-01-09 20:32:53,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2025-01-09 20:32:53,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 1032. [2025-01-09 20:32:53,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1032 states, 674 states have (on average 1.21513353115727) internal successors, (819), 714 states have internal predecessors, (819), 259 states have call successors, (259), 79 states have call predecessors, (259), 78 states have return successors, (257), 247 states have call predecessors, (257), 257 states have call successors, (257) [2025-01-09 20:32:53,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1335 transitions. [2025-01-09 20:32:53,556 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1335 transitions. Word has length 164 [2025-01-09 20:32:53,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:32:53,557 INFO L471 AbstractCegarLoop]: Abstraction has 1032 states and 1335 transitions. [2025-01-09 20:32:53,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 20:32:53,557 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1335 transitions. [2025-01-09 20:32:53,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-01-09 20:32:53,561 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:32:53,561 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:32:53,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 20:32:53,561 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_linux_alloc_irq_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-01-09 20:32:53,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:32:53,562 INFO L85 PathProgramCache]: Analyzing trace with hash -2123660091, now seen corresponding path program 1 times [2025-01-09 20:32:53,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:32:53,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369912796] [2025-01-09 20:32:53,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:32:53,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:32:54,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 20:32:54,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 20:32:54,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:32:54,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:32:55,132 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-01-09 20:32:55,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:32:55,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369912796] [2025-01-09 20:32:55,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369912796] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:32:55,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:32:55,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:32:55,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361204478] [2025-01-09 20:32:55,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:32:55,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:32:55,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:32:55,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:32:55,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:32:55,134 INFO L87 Difference]: Start difference. First operand 1032 states and 1335 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 20:32:55,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:32:55,257 INFO L93 Difference]: Finished difference Result 1032 states and 1335 transitions. [2025-01-09 20:32:55,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:32:55,257 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), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 164 [2025-01-09 20:32:55,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:32:55,264 INFO L225 Difference]: With dead ends: 1032 [2025-01-09 20:32:55,264 INFO L226 Difference]: Without dead ends: 1030 [2025-01-09 20:32:55,265 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-01-09 20:32:55,266 INFO L435 NwaCegarLoop]: 1331 mSDtfsCounter, 0 mSDsluCounter, 2659 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3990 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:32:55,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3990 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:32:55,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2025-01-09 20:32:55,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 1030. [2025-01-09 20:32:55,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1030 states, 673 states have (on average 1.213967310549777) internal successors, (817), 712 states have internal predecessors, (817), 259 states have call successors, (259), 79 states have call predecessors, (259), 78 states have return successors, (257), 247 states have call predecessors, (257), 257 states have call successors, (257) [2025-01-09 20:32:55,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 1333 transitions. [2025-01-09 20:32:55,335 INFO L78 Accepts]: Start accepts. Automaton has 1030 states and 1333 transitions. Word has length 164 [2025-01-09 20:32:55,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:32:55,336 INFO L471 AbstractCegarLoop]: Abstraction has 1030 states and 1333 transitions. [2025-01-09 20:32:55,336 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), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 20:32:55,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1333 transitions. [2025-01-09 20:32:55,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 20:32:55,340 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:32:55,340 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:32:55,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 20:32:55,340 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_linux_kernel_module_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-01-09 20:32:55,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:32:55,341 INFO L85 PathProgramCache]: Analyzing trace with hash 15096843, now seen corresponding path program 1 times [2025-01-09 20:32:55,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:32:55,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925830475] [2025-01-09 20:32:55,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:32:55,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:32:56,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 20:32:56,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 20:32:56,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:32:56,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:32:56,337 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-09 20:32:56,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:32:56,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925830475] [2025-01-09 20:32:56,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925830475] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:32:56,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:32:56,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:32:56,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53859043] [2025-01-09 20:32:56,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:32:56,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:32:56,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:32:56,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:32:56,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:32:56,339 INFO L87 Difference]: Start difference. First operand 1030 states and 1333 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 20:32:56,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:32:56,473 INFO L93 Difference]: Finished difference Result 1030 states and 1333 transitions. [2025-01-09 20:32:56,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:32:56,473 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 121 [2025-01-09 20:32:56,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:32:56,480 INFO L225 Difference]: With dead ends: 1030 [2025-01-09 20:32:56,480 INFO L226 Difference]: Without dead ends: 1028 [2025-01-09 20:32:56,481 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-01-09 20:32:56,483 INFO L435 NwaCegarLoop]: 1329 mSDtfsCounter, 1291 mSDsluCounter, 1328 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1291 SdHoareTripleChecker+Valid, 2657 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:32:56,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1291 Valid, 2657 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:32:56,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2025-01-09 20:32:56,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 1028. [2025-01-09 20:32:56,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1028 states, 672 states have (on average 1.212797619047619) internal successors, (815), 710 states have internal predecessors, (815), 259 states have call successors, (259), 79 states have call predecessors, (259), 78 states have return successors, (257), 247 states have call predecessors, (257), 257 states have call successors, (257) [2025-01-09 20:32:56,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1331 transitions. [2025-01-09 20:32:56,562 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1331 transitions. Word has length 121 [2025-01-09 20:32:56,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:32:56,562 INFO L471 AbstractCegarLoop]: Abstraction has 1028 states and 1331 transitions. [2025-01-09 20:32:56,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 20:32:56,563 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1331 transitions. [2025-01-09 20:32:56,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-09 20:32:56,565 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:32:56,565 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:32:56,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 20:32:56,566 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-01-09 20:32:56,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:32:56,566 INFO L85 PathProgramCache]: Analyzing trace with hash 618461630, now seen corresponding path program 1 times [2025-01-09 20:32:56,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:32:56,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376257895] [2025-01-09 20:32:56,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:32:56,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:32:57,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 20:32:57,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 20:32:57,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:32:57,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:32:57,704 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-09 20:32:57,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:32:57,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376257895] [2025-01-09 20:32:57,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376257895] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:32:57,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:32:57,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:32:57,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232670022] [2025-01-09 20:32:57,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:32:57,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:32:57,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:32:57,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:32:57,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:32:57,707 INFO L87 Difference]: Start difference. First operand 1028 states and 1331 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 20:32:57,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:32:57,814 INFO L93 Difference]: Finished difference Result 1028 states and 1331 transitions. [2025-01-09 20:32:57,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:32:57,815 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 127 [2025-01-09 20:32:57,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:32:57,821 INFO L225 Difference]: With dead ends: 1028 [2025-01-09 20:32:57,822 INFO L226 Difference]: Without dead ends: 1026 [2025-01-09 20:32:57,822 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-01-09 20:32:57,823 INFO L435 NwaCegarLoop]: 1327 mSDtfsCounter, 1288 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1288 SdHoareTripleChecker+Valid, 2653 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:32:57,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1288 Valid, 2653 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:32:57,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2025-01-09 20:32:57,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 1026. [2025-01-09 20:32:57,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1026 states, 671 states have (on average 1.2116244411326378) internal successors, (813), 708 states have internal predecessors, (813), 259 states have call successors, (259), 79 states have call predecessors, (259), 78 states have return successors, (257), 247 states have call predecessors, (257), 257 states have call successors, (257) [2025-01-09 20:32:57,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1329 transitions. [2025-01-09 20:32:57,904 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1329 transitions. Word has length 127 [2025-01-09 20:32:57,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:32:57,905 INFO L471 AbstractCegarLoop]: Abstraction has 1026 states and 1329 transitions. [2025-01-09 20:32:57,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 20:32:57,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1329 transitions. [2025-01-09 20:32:57,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 20:32:57,908 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:32:57,908 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:32:57,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 20:32:57,909 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-01-09 20:32:57,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:32:57,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1052386765, now seen corresponding path program 1 times [2025-01-09 20:32:57,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:32:57,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783669191] [2025-01-09 20:32:57,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:32:57,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:32:58,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 20:32:58,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 20:32:58,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:32:58,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:32:58,885 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-01-09 20:32:58,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:32:58,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783669191] [2025-01-09 20:32:58,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783669191] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:32:58,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:32:58,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:32:58,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370717654] [2025-01-09 20:32:58,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:32:58,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:32:58,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:32:58,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:32:58,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:32:58,888 INFO L87 Difference]: Start difference. First operand 1026 states and 1329 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 20:32:58,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:32:58,972 INFO L93 Difference]: Finished difference Result 2009 states and 2606 transitions. [2025-01-09 20:32:58,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:32:58,973 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 171 [2025-01-09 20:32:58,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:32:58,980 INFO L225 Difference]: With dead ends: 2009 [2025-01-09 20:32:58,980 INFO L226 Difference]: Without dead ends: 1022 [2025-01-09 20:32:58,984 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-01-09 20:32:58,984 INFO L435 NwaCegarLoop]: 1323 mSDtfsCounter, 1283 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1283 SdHoareTripleChecker+Valid, 1323 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:32:58,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1283 Valid, 1323 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:32:58,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2025-01-09 20:32:59,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 1022. [2025-01-09 20:32:59,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1022 states, 668 states have (on average 1.2095808383233533) internal successors, (808), 704 states have internal predecessors, (808), 259 states have call successors, (259), 79 states have call predecessors, (259), 78 states have return successors, (257), 247 states have call predecessors, (257), 257 states have call successors, (257) [2025-01-09 20:32:59,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 1022 states and 1324 transitions. [2025-01-09 20:32:59,067 INFO L78 Accepts]: Start accepts. Automaton has 1022 states and 1324 transitions. Word has length 171 [2025-01-09 20:32:59,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:32:59,068 INFO L471 AbstractCegarLoop]: Abstraction has 1022 states and 1324 transitions. [2025-01-09 20:32:59,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 20:32:59,068 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 1324 transitions. [2025-01-09 20:32:59,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-09 20:32:59,070 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:32:59,070 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:32:59,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 20:32:59,071 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-01-09 20:32:59,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:32:59,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1813819607, now seen corresponding path program 1 times [2025-01-09 20:32:59,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:32:59,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369128922] [2025-01-09 20:32:59,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:32:59,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:32:59,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 20:32:59,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 20:32:59,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:32:59,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:32:59,995 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-09 20:32:59,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:32:59,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369128922] [2025-01-09 20:32:59,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369128922] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:32:59,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:32:59,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:32:59,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834673887] [2025-01-09 20:32:59,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:32:59,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:32:59,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:32:59,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:32:59,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:32:59,997 INFO L87 Difference]: Start difference. First operand 1022 states and 1324 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 20:33:00,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:33:00,091 INFO L93 Difference]: Finished difference Result 1022 states and 1324 transitions. [2025-01-09 20:33:00,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:33:00,092 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 133 [2025-01-09 20:33:00,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:33:00,100 INFO L225 Difference]: With dead ends: 1022 [2025-01-09 20:33:00,101 INFO L226 Difference]: Without dead ends: 1020 [2025-01-09 20:33:00,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-01-09 20:33:00,102 INFO L435 NwaCegarLoop]: 1320 mSDtfsCounter, 1280 mSDsluCounter, 1319 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1280 SdHoareTripleChecker+Valid, 2639 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:33:00,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1280 Valid, 2639 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:33:00,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states. [2025-01-09 20:33:00,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 1020. [2025-01-09 20:33:00,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1020 states, 667 states have (on average 1.2083958020989505) internal successors, (806), 702 states have internal predecessors, (806), 259 states have call successors, (259), 79 states have call predecessors, (259), 78 states have return successors, (257), 247 states have call predecessors, (257), 257 states have call successors, (257) [2025-01-09 20:33:00,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 1322 transitions. [2025-01-09 20:33:00,211 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 1322 transitions. Word has length 133 [2025-01-09 20:33:00,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:33:00,211 INFO L471 AbstractCegarLoop]: Abstraction has 1020 states and 1322 transitions. [2025-01-09 20:33:00,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 20:33:00,212 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 1322 transitions. [2025-01-09 20:33:00,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-01-09 20:33:00,214 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:33:00,214 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 7, 7, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:33:00,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 20:33:00,215 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-01-09 20:33:00,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:33:00,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1295508173, now seen corresponding path program 1 times [2025-01-09 20:33:00,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:33:00,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430171248] [2025-01-09 20:33:00,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:33:00,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:33:00,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 20:33:00,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 20:33:00,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:33:00,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:33:01,714 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-01-09 20:33:01,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:33:01,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430171248] [2025-01-09 20:33:01,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430171248] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:33:01,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:33:01,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 20:33:01,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242715108] [2025-01-09 20:33:01,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:33:01,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 20:33:01,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:33:01,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 20:33:01,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 20:33:01,718 INFO L87 Difference]: Start difference. First operand 1020 states and 1322 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 20:33:01,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:33:01,905 INFO L93 Difference]: Finished difference Result 1749 states and 2228 transitions. [2025-01-09 20:33:01,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 20:33:01,906 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) Word has length 167 [2025-01-09 20:33:01,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:33:01,912 INFO L225 Difference]: With dead ends: 1749 [2025-01-09 20:33:01,912 INFO L226 Difference]: Without dead ends: 1025 [2025-01-09 20:33:01,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 20:33:01,916 INFO L435 NwaCegarLoop]: 1319 mSDtfsCounter, 0 mSDsluCounter, 5269 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6588 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:33:01,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6588 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:33:01,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2025-01-09 20:33:01,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 1025. [2025-01-09 20:33:01,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 671 states have (on average 1.2071535022354694) internal successors, (810), 706 states have internal predecessors, (810), 259 states have call successors, (259), 79 states have call predecessors, (259), 79 states have return successors, (261), 248 states have call predecessors, (261), 257 states have call successors, (261) [2025-01-09 20:33:02,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1330 transitions. [2025-01-09 20:33:02,007 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1330 transitions. Word has length 167 [2025-01-09 20:33:02,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:33:02,009 INFO L471 AbstractCegarLoop]: Abstraction has 1025 states and 1330 transitions. [2025-01-09 20:33:02,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 20:33:02,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1330 transitions. [2025-01-09 20:33:02,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 20:33:02,012 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:33:02,012 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:33:02,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 20:33:02,012 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-01-09 20:33:02,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:33:02,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1873594208, now seen corresponding path program 1 times [2025-01-09 20:33:02,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:33:02,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798920128] [2025-01-09 20:33:02,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:33:02,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:33:02,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 20:33:02,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 20:33:02,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:33:02,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:33:02,924 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-09 20:33:02,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:33:02,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798920128] [2025-01-09 20:33:02,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798920128] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:33:02,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:33:02,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:33:02,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804402685] [2025-01-09 20:33:02,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:33:02,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:33:02,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:33:02,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:33:02,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:33:02,928 INFO L87 Difference]: Start difference. First operand 1025 states and 1330 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 20:33:03,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:33:03,055 INFO L93 Difference]: Finished difference Result 1025 states and 1330 transitions. [2025-01-09 20:33:03,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:33:03,056 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 139 [2025-01-09 20:33:03,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:33:03,063 INFO L225 Difference]: With dead ends: 1025 [2025-01-09 20:33:03,064 INFO L226 Difference]: Without dead ends: 1023 [2025-01-09 20:33:03,065 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-01-09 20:33:03,065 INFO L435 NwaCegarLoop]: 1318 mSDtfsCounter, 1277 mSDsluCounter, 1317 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1277 SdHoareTripleChecker+Valid, 2635 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:33:03,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1277 Valid, 2635 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:33:03,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2025-01-09 20:33:03,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 1023. [2025-01-09 20:33:03,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 670 states have (on average 1.2059701492537314) internal successors, (808), 704 states have internal predecessors, (808), 259 states have call successors, (259), 79 states have call predecessors, (259), 79 states have return successors, (261), 248 states have call predecessors, (261), 257 states have call successors, (261) [2025-01-09 20:33:03,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1328 transitions. [2025-01-09 20:33:03,148 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1328 transitions. Word has length 139 [2025-01-09 20:33:03,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:33:03,148 INFO L471 AbstractCegarLoop]: Abstraction has 1023 states and 1328 transitions. [2025-01-09 20:33:03,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 20:33:03,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1328 transitions. [2025-01-09 20:33:03,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 20:33:03,152 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:33:03,152 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:33:03,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 20:33:03,153 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_linux_kernel_rcu_srcu_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-01-09 20:33:03,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:33:03,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1214907471, now seen corresponding path program 1 times [2025-01-09 20:33:03,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:33:03,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116529272] [2025-01-09 20:33:03,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:33:03,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:33:03,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 20:33:03,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 20:33:03,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:33:03,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:33:04,073 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-09 20:33:04,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:33:04,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116529272] [2025-01-09 20:33:04,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116529272] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:33:04,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:33:04,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:33:04,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393322126] [2025-01-09 20:33:04,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:33:04,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:33:04,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:33:04,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:33:04,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:33:04,076 INFO L87 Difference]: Start difference. First operand 1023 states and 1328 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 20:33:04,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:33:04,241 INFO L93 Difference]: Finished difference Result 1023 states and 1328 transitions. [2025-01-09 20:33:04,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:33:04,242 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 145 [2025-01-09 20:33:04,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:33:04,249 INFO L225 Difference]: With dead ends: 1023 [2025-01-09 20:33:04,249 INFO L226 Difference]: Without dead ends: 1021 [2025-01-09 20:33:04,250 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-01-09 20:33:04,251 INFO L435 NwaCegarLoop]: 1316 mSDtfsCounter, 1274 mSDsluCounter, 1315 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1274 SdHoareTripleChecker+Valid, 2631 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:33:04,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1274 Valid, 2631 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:33:04,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2025-01-09 20:33:04,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 1021. [2025-01-09 20:33:04,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1021 states, 669 states have (on average 1.2047832585949179) internal successors, (806), 702 states have internal predecessors, (806), 259 states have call successors, (259), 79 states have call predecessors, (259), 79 states have return successors, (261), 248 states have call predecessors, (261), 257 states have call successors, (261) [2025-01-09 20:33:04,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 1326 transitions. [2025-01-09 20:33:04,391 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 1326 transitions. Word has length 145 [2025-01-09 20:33:04,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:33:04,394 INFO L471 AbstractCegarLoop]: Abstraction has 1021 states and 1326 transitions. [2025-01-09 20:33:04,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 20:33:04,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 1326 transitions. [2025-01-09 20:33:04,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 20:33:04,396 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:33:04,396 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:33:04,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 20:33:04,397 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_linux_lib_idr_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-01-09 20:33:04,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:33:04,397 INFO L85 PathProgramCache]: Analyzing trace with hash 2041401368, now seen corresponding path program 1 times [2025-01-09 20:33:04,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:33:04,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14339790] [2025-01-09 20:33:04,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:33:04,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:33:04,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 20:33:04,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 20:33:04,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:33:04,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:33:05,306 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-09 20:33:05,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:33:05,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14339790] [2025-01-09 20:33:05,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14339790] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:33:05,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:33:05,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:33:05,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440307862] [2025-01-09 20:33:05,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:33:05,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:33:05,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:33:05,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:33:05,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:33:05,309 INFO L87 Difference]: Start difference. First operand 1021 states and 1326 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 20:33:05,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:33:05,445 INFO L93 Difference]: Finished difference Result 1021 states and 1326 transitions. [2025-01-09 20:33:05,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:33:05,446 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 151 [2025-01-09 20:33:05,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:33:05,452 INFO L225 Difference]: With dead ends: 1021 [2025-01-09 20:33:05,453 INFO L226 Difference]: Without dead ends: 1019 [2025-01-09 20:33:05,454 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-01-09 20:33:05,454 INFO L435 NwaCegarLoop]: 1314 mSDtfsCounter, 1271 mSDsluCounter, 1313 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1271 SdHoareTripleChecker+Valid, 2627 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:33:05,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1271 Valid, 2627 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:33:05,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2025-01-09 20:33:05,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 1019. [2025-01-09 20:33:05,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1019 states, 668 states have (on average 1.2035928143712575) internal successors, (804), 700 states have internal predecessors, (804), 259 states have call successors, (259), 79 states have call predecessors, (259), 79 states have return successors, (261), 248 states have call predecessors, (261), 257 states have call successors, (261) [2025-01-09 20:33:05,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1324 transitions. [2025-01-09 20:33:05,547 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 1324 transitions. Word has length 151 [2025-01-09 20:33:05,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:33:05,547 INFO L471 AbstractCegarLoop]: Abstraction has 1019 states and 1324 transitions. [2025-01-09 20:33:05,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 20:33:05,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1324 transitions. [2025-01-09 20:33:05,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-01-09 20:33:05,550 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:33:05,550 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 7, 7, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:33:05,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 20:33:05,550 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-01-09 20:33:05,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:33:05,551 INFO L85 PathProgramCache]: Analyzing trace with hash 825827337, now seen corresponding path program 1 times [2025-01-09 20:33:05,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:33:05,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326515482] [2025-01-09 20:33:05,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:33:05,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:33:06,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-01-09 20:33:06,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-01-09 20:33:06,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:33:06,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:33:06,567 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2025-01-09 20:33:06,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:33:06,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326515482] [2025-01-09 20:33:06,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326515482] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:33:06,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:33:06,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 20:33:06,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6728102] [2025-01-09 20:33:06,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:33:06,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 20:33:06,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:33:06,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 20:33:06,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:33:06,569 INFO L87 Difference]: Start difference. First operand 1019 states and 1324 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (26), 3 states have call predecessors, (26), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 20:33:06,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:33:06,799 INFO L93 Difference]: Finished difference Result 1124 states and 1428 transitions. [2025-01-09 20:33:06,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:33:06,800 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (26), 3 states have call predecessors, (26), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 183 [2025-01-09 20:33:06,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:33:06,807 INFO L225 Difference]: With dead ends: 1124 [2025-01-09 20:33:06,807 INFO L226 Difference]: Without dead ends: 1122 [2025-01-09 20:33:06,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:33:06,808 INFO L435 NwaCegarLoop]: 1349 mSDtfsCounter, 1167 mSDsluCounter, 2892 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1168 SdHoareTripleChecker+Valid, 4241 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:33:06,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1168 Valid, 4241 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:33:06,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2025-01-09 20:33:06,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 1116. [2025-01-09 20:33:06,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1116 states, 733 states have (on average 1.199181446111869) internal successors, (879), 765 states have internal predecessors, (879), 271 states have call successors, (271), 99 states have call predecessors, (271), 99 states have return successors, (273), 260 states have call predecessors, (273), 269 states have call successors, (273) [2025-01-09 20:33:06,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1423 transitions. [2025-01-09 20:33:06,909 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1423 transitions. Word has length 183 [2025-01-09 20:33:06,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:33:06,910 INFO L471 AbstractCegarLoop]: Abstraction has 1116 states and 1423 transitions. [2025-01-09 20:33:06,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (26), 3 states have call predecessors, (26), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 20:33:06,910 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1423 transitions. [2025-01-09 20:33:06,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-01-09 20:33:06,912 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:33:06,912 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:33:06,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 20:33:06,912 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-01-09 20:33:06,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:33:06,913 INFO L85 PathProgramCache]: Analyzing trace with hash 443444550, now seen corresponding path program 1 times [2025-01-09 20:33:06,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:33:06,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875625406] [2025-01-09 20:33:06,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:33:06,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:33:07,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 20:33:07,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 20:33:07,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:33:07,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:33:07,759 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-09 20:33:07,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:33:07,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875625406] [2025-01-09 20:33:07,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875625406] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:33:07,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:33:07,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:33:07,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645566815] [2025-01-09 20:33:07,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:33:07,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:33:07,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:33:07,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:33:07,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:33:07,760 INFO L87 Difference]: Start difference. First operand 1116 states and 1423 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 20:33:07,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:33:07,906 INFO L93 Difference]: Finished difference Result 1116 states and 1423 transitions. [2025-01-09 20:33:07,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:33:07,906 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 157 [2025-01-09 20:33:07,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:33:07,913 INFO L225 Difference]: With dead ends: 1116 [2025-01-09 20:33:07,913 INFO L226 Difference]: Without dead ends: 1114 [2025-01-09 20:33:07,914 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-01-09 20:33:07,916 INFO L435 NwaCegarLoop]: 1312 mSDtfsCounter, 1268 mSDsluCounter, 1311 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1268 SdHoareTripleChecker+Valid, 2623 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:33:07,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1268 Valid, 2623 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:33:07,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1114 states. [2025-01-09 20:33:08,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1114 to 1114. [2025-01-09 20:33:08,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1114 states, 732 states have (on average 1.1980874316939891) internal successors, (877), 763 states have internal predecessors, (877), 271 states have call successors, (271), 99 states have call predecessors, (271), 99 states have return successors, (273), 260 states have call predecessors, (273), 269 states have call successors, (273) [2025-01-09 20:33:08,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1114 states to 1114 states and 1421 transitions. [2025-01-09 20:33:08,056 INFO L78 Accepts]: Start accepts. Automaton has 1114 states and 1421 transitions. Word has length 157 [2025-01-09 20:33:08,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:33:08,058 INFO L471 AbstractCegarLoop]: Abstraction has 1114 states and 1421 transitions. [2025-01-09 20:33:08,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 20:33:08,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1114 states and 1421 transitions. [2025-01-09 20:33:08,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-01-09 20:33:08,061 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:33:08,061 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2025-01-09 20:33:08,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 20:33:08,061 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-01-09 20:33:08,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:33:08,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1776032839, now seen corresponding path program 1 times [2025-01-09 20:33:08,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:33:08,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312619467] [2025-01-09 20:33:08,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:33:08,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:33:08,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-01-09 20:33:08,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-01-09 20:33:08,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:33:08,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:33:08,962 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 383 trivial. 0 not checked. [2025-01-09 20:33:08,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:33:08,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312619467] [2025-01-09 20:33:08,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312619467] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:33:08,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:33:08,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:33:08,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791029248] [2025-01-09 20:33:08,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:33:08,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:33:08,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:33:08,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:33:08,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:33:08,963 INFO L87 Difference]: Start difference. First operand 1114 states and 1421 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 20:33:09,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:33:09,111 INFO L93 Difference]: Finished difference Result 2074 states and 2617 transitions. [2025-01-09 20:33:09,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:33:09,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 203 [2025-01-09 20:33:09,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:33:09,119 INFO L225 Difference]: With dead ends: 2074 [2025-01-09 20:33:09,119 INFO L226 Difference]: Without dead ends: 1110 [2025-01-09 20:33:09,123 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-01-09 20:33:09,125 INFO L435 NwaCegarLoop]: 1308 mSDtfsCounter, 1293 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1293 SdHoareTripleChecker+Valid, 1308 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:33:09,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1293 Valid, 1308 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:33:09,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2025-01-09 20:33:09,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 1110. [2025-01-09 20:33:09,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1110 states, 729 states have (on average 1.196159122085048) internal successors, (872), 759 states have internal predecessors, (872), 271 states have call successors, (271), 99 states have call predecessors, (271), 99 states have return successors, (273), 260 states have call predecessors, (273), 269 states have call successors, (273) [2025-01-09 20:33:09,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1416 transitions. [2025-01-09 20:33:09,245 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1416 transitions. Word has length 203 [2025-01-09 20:33:09,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:33:09,246 INFO L471 AbstractCegarLoop]: Abstraction has 1110 states and 1416 transitions. [2025-01-09 20:33:09,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 20:33:09,246 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1416 transitions. [2025-01-09 20:33:09,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-01-09 20:33:09,248 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:33:09,248 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:33:09,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 20:33:09,249 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_linux_net_rtnetlink_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-01-09 20:33:09,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:33:09,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1230025084, now seen corresponding path program 1 times [2025-01-09 20:33:09,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:33:09,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428702206] [2025-01-09 20:33:09,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:33:09,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:33:09,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-01-09 20:33:09,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-01-09 20:33:09,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:33:09,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:33:10,098 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-09 20:33:10,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:33:10,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428702206] [2025-01-09 20:33:10,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428702206] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:33:10,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:33:10,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:33:10,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651366545] [2025-01-09 20:33:10,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:33:10,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:33:10,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:33:10,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:33:10,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:33:10,099 INFO L87 Difference]: Start difference. First operand 1110 states and 1416 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-01-09 20:33:10,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:33:10,237 INFO L93 Difference]: Finished difference Result 1110 states and 1416 transitions. [2025-01-09 20:33:10,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:33:10,238 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 163 [2025-01-09 20:33:10,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:33:10,244 INFO L225 Difference]: With dead ends: 1110 [2025-01-09 20:33:10,244 INFO L226 Difference]: Without dead ends: 1108 [2025-01-09 20:33:10,244 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-01-09 20:33:10,245 INFO L435 NwaCegarLoop]: 1305 mSDtfsCounter, 1260 mSDsluCounter, 1304 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1260 SdHoareTripleChecker+Valid, 2609 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:33:10,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1260 Valid, 2609 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:33:10,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states. [2025-01-09 20:33:10,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 1108. [2025-01-09 20:33:10,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1108 states, 728 states have (on average 1.195054945054945) internal successors, (870), 757 states have internal predecessors, (870), 271 states have call successors, (271), 99 states have call predecessors, (271), 99 states have return successors, (273), 260 states have call predecessors, (273), 269 states have call successors, (273) [2025-01-09 20:33:10,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 1414 transitions. [2025-01-09 20:33:10,385 INFO L78 Accepts]: Start accepts. Automaton has 1108 states and 1414 transitions. Word has length 163 [2025-01-09 20:33:10,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:33:10,385 INFO L471 AbstractCegarLoop]: Abstraction has 1108 states and 1414 transitions. [2025-01-09 20:33:10,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-01-09 20:33:10,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1414 transitions. [2025-01-09 20:33:10,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-01-09 20:33:10,388 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:33:10,388 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:33:10,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 20:33:10,389 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-01-09 20:33:10,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:33:10,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1477779784, now seen corresponding path program 1 times [2025-01-09 20:33:10,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:33:10,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057525102] [2025-01-09 20:33:10,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:33:10,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:33:11,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-01-09 20:33:11,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-01-09 20:33:11,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:33:11,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:33:11,268 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2025-01-09 20:33:11,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:33:11,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057525102] [2025-01-09 20:33:11,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057525102] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:33:11,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577398525] [2025-01-09 20:33:11,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:33:11,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:33:11,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:33:11,271 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 20:33:11,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 20:33:12,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-01-09 20:33:12,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-01-09 20:33:12,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:33:12,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:33:12,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 2425 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 20:33:12,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:33:13,394 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-01-09 20:33:13,394 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 20:33:13,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577398525] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:33:13,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 20:33:13,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-01-09 20:33:13,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218265271] [2025-01-09 20:33:13,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:33:13,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:33:13,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:33:13,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:33:13,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:33:13,397 INFO L87 Difference]: Start difference. First operand 1108 states and 1414 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 20:33:13,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:33:13,549 INFO L93 Difference]: Finished difference Result 2115 states and 2669 transitions. [2025-01-09 20:33:13,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:33:13,549 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 209 [2025-01-09 20:33:13,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:33:13,556 INFO L225 Difference]: With dead ends: 2115 [2025-01-09 20:33:13,556 INFO L226 Difference]: Without dead ends: 1160 [2025-01-09 20:33:13,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 209 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-01-09 20:33:13,560 INFO L435 NwaCegarLoop]: 1366 mSDtfsCounter, 1236 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1236 SdHoareTripleChecker+Valid, 1433 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:33:13,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1236 Valid, 1433 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:33:13,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2025-01-09 20:33:13,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 1157. [2025-01-09 20:33:13,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 757 states have (on average 1.1889035667107002) internal successors, (900), 789 states have internal predecessors, (900), 286 states have call successors, (286), 105 states have call predecessors, (286), 105 states have return successors, (288), 273 states have call predecessors, (288), 284 states have call successors, (288) [2025-01-09 20:33:13,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1474 transitions. [2025-01-09 20:33:13,684 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1474 transitions. Word has length 209 [2025-01-09 20:33:13,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:33:13,685 INFO L471 AbstractCegarLoop]: Abstraction has 1157 states and 1474 transitions. [2025-01-09 20:33:13,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 20:33:13,686 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1474 transitions. [2025-01-09 20:33:13,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-01-09 20:33:13,689 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:33:13,689 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:33:13,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 20:33:13,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-01-09 20:33:13,890 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_linux_net_sock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-01-09 20:33:13,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:33:13,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1145443227, now seen corresponding path program 1 times [2025-01-09 20:33:13,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:33:13,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171181454] [2025-01-09 20:33:13,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:33:13,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:33:14,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-09 20:33:14,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 20:33:14,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:33:14,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:33:14,599 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-09 20:33:14,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:33:14,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171181454] [2025-01-09 20:33:14,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171181454] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:33:14,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:33:14,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:33:14,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193926272] [2025-01-09 20:33:14,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:33:14,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:33:14,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:33:14,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:33:14,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:33:14,601 INFO L87 Difference]: Start difference. First operand 1157 states and 1474 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 20:33:14,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:33:14,731 INFO L93 Difference]: Finished difference Result 1157 states and 1474 transitions. [2025-01-09 20:33:14,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:33:14,731 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 169 [2025-01-09 20:33:14,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:33:14,738 INFO L225 Difference]: With dead ends: 1157 [2025-01-09 20:33:14,738 INFO L226 Difference]: Without dead ends: 1155 [2025-01-09 20:33:14,739 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-01-09 20:33:14,739 INFO L435 NwaCegarLoop]: 1298 mSDtfsCounter, 1252 mSDsluCounter, 1297 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1252 SdHoareTripleChecker+Valid, 2595 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:33:14,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1252 Valid, 2595 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:33:14,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2025-01-09 20:33:14,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 1155. [2025-01-09 20:33:14,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1155 states, 756 states have (on average 1.187830687830688) internal successors, (898), 787 states have internal predecessors, (898), 286 states have call successors, (286), 105 states have call predecessors, (286), 105 states have return successors, (288), 273 states have call predecessors, (288), 284 states have call successors, (288) [2025-01-09 20:33:14,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 1472 transitions. [2025-01-09 20:33:14,868 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 1472 transitions. Word has length 169 [2025-01-09 20:33:14,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:33:14,869 INFO L471 AbstractCegarLoop]: Abstraction has 1155 states and 1472 transitions. [2025-01-09 20:33:14,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 20:33:14,869 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 1472 transitions. [2025-01-09 20:33:14,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-01-09 20:33:14,872 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:33:14,872 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 7, 7, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:33:14,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 20:33:14,873 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-01-09 20:33:14,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:33:14,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1195172577, now seen corresponding path program 1 times [2025-01-09 20:33:14,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:33:14,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537046117] [2025-01-09 20:33:14,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:33:14,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:33:15,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-01-09 20:33:15,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-01-09 20:33:15,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:33:15,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:33:15,882 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2025-01-09 20:33:15,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:33:15,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537046117] [2025-01-09 20:33:15,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537046117] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:33:15,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:33:15,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 20:33:15,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366034802] [2025-01-09 20:33:15,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:33:15,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 20:33:15,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:33:15,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 20:33:15,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:33:15,884 INFO L87 Difference]: Start difference. First operand 1155 states and 1472 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (29), 3 states have call predecessors, (29), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27)