./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--yurex.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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--yurex.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 838cbce098703eae9745d1ba54cc8860e1e4bdea5f00e637be7216785f1ba452 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 08:26:30,182 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 08:26:30,253 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-06 08:26:30,260 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 08:26:30,263 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 08:26:30,285 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 08:26:30,286 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 08:26:30,287 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 08:26:30,287 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 08:26:30,287 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 08:26:30,288 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 08:26:30,288 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 08:26:30,289 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 08:26:30,289 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 08:26:30,289 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 08:26:30,289 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 08:26:30,289 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 08:26:30,289 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 08:26:30,289 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 08:26:30,289 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 08:26:30,289 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 08:26:30,289 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 08:26:30,289 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 08:26:30,289 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 08:26:30,289 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 08:26:30,290 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 08:26:30,290 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 08:26:30,290 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 08:26:30,290 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 08:26:30,290 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 08:26:30,290 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 08:26:30,290 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 08:26:30,291 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 08:26:30,291 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 08:26:30,291 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 08:26:30,291 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 08:26:30,291 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 08:26:30,291 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 08:26:30,291 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 08:26:30,291 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 08:26:30,292 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 -> 838cbce098703eae9745d1ba54cc8860e1e4bdea5f00e637be7216785f1ba452 [2025-02-06 08:26:30,566 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 08:26:30,573 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 08:26:30,576 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 08:26:30,577 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 08:26:30,577 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 08:26:30,579 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--yurex.ko.cil.i [2025-02-06 08:26:31,746 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0b607593a/09f1cd41d8b5469f9b5b9f51790830a5/FLAGe1efa9d4a [2025-02-06 08:26:32,289 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 08:26:32,290 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--yurex.ko.cil.i [2025-02-06 08:26:32,341 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0b607593a/09f1cd41d8b5469f9b5b9f51790830a5/FLAGe1efa9d4a [2025-02-06 08:26:32,365 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0b607593a/09f1cd41d8b5469f9b5b9f51790830a5 [2025-02-06 08:26:32,367 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 08:26:32,369 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 08:26:32,370 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 08:26:32,370 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 08:26:32,375 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 08:26:32,377 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 08:26:32" (1/1) ... [2025-02-06 08:26:32,378 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6aa72034 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:26:32, skipping insertion in model container [2025-02-06 08:26:32,378 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 08:26:32" (1/1) ... [2025-02-06 08:26:32,472 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 08:26:34,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--yurex.ko.cil.i[259112,259125] [2025-02-06 08:26:34,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--yurex.ko.cil.i[259257,259270] [2025-02-06 08:26:34,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--yurex.ko.cil.i[259403,259416] [2025-02-06 08:26:34,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--yurex.ko.cil.i[259568,259581] [2025-02-06 08:26:34,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--yurex.ko.cil.i[259726,259739] [2025-02-06 08:26:34,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--yurex.ko.cil.i[259884,259897] [2025-02-06 08:26:34,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--yurex.ko.cil.i[260042,260055] [2025-02-06 08:26:34,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--yurex.ko.cil.i[260202,260215] [2025-02-06 08:26:34,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--yurex.ko.cil.i[260361,260374] [2025-02-06 08:26:34,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--yurex.ko.cil.i[260500,260513] [2025-02-06 08:26:34,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--yurex.ko.cil.i[260642,260655] [2025-02-06 08:26:34,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--yurex.ko.cil.i[260791,260804] [2025-02-06 08:26:34,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--yurex.ko.cil.i[260930,260943] [2025-02-06 08:26:34,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--yurex.ko.cil.i[261085,261098] [2025-02-06 08:26:34,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--yurex.ko.cil.i[261245,261258] [2025-02-06 08:26:34,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--yurex.ko.cil.i[261396,261409] [2025-02-06 08:26:34,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--yurex.ko.cil.i[261547,261560] [2025-02-06 08:26:34,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--yurex.ko.cil.i[261699,261712] [2025-02-06 08:26:34,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--yurex.ko.cil.i[261848,261861] [2025-02-06 08:26:34,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--yurex.ko.cil.i[261996,262009] [2025-02-06 08:26:34,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--yurex.ko.cil.i[262153,262166] [2025-02-06 08:26:34,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--yurex.ko.cil.i[262302,262315] [2025-02-06 08:26:34,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--yurex.ko.cil.i[262458,262471] [2025-02-06 08:26:34,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--yurex.ko.cil.i[262611,262624] [2025-02-06 08:26:34,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--yurex.ko.cil.i[262757,262770] [2025-02-06 08:26:34,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--yurex.ko.cil.i[262900,262913] [2025-02-06 08:26:34,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--yurex.ko.cil.i[263052,263065] [2025-02-06 08:26:34,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--yurex.ko.cil.i[263198,263211] [2025-02-06 08:26:34,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--yurex.ko.cil.i[263343,263356] [2025-02-06 08:26:34,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--yurex.ko.cil.i[263497,263510] [2025-02-06 08:26:34,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--yurex.ko.cil.i[263648,263661] [2025-02-06 08:26:34,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--yurex.ko.cil.i[263803,263816] [2025-02-06 08:26:34,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--yurex.ko.cil.i[263955,263968] [2025-02-06 08:26:34,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--yurex.ko.cil.i[264110,264123] [2025-02-06 08:26:34,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--yurex.ko.cil.i[264274,264287] [2025-02-06 08:26:34,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--yurex.ko.cil.i[264430,264443] [2025-02-06 08:26:34,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--yurex.ko.cil.i[264594,264607] [2025-02-06 08:26:34,727 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--yurex.ko.cil.i[264736,264749] [2025-02-06 08:26:34,728 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--yurex.ko.cil.i[264894,264907] [2025-02-06 08:26:34,728 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--yurex.ko.cil.i[265061,265074] [2025-02-06 08:26:34,728 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--yurex.ko.cil.i[265220,265233] [2025-02-06 08:26:34,728 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--yurex.ko.cil.i[265379,265392] [2025-02-06 08:26:34,728 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--yurex.ko.cil.i[265528,265541] [2025-02-06 08:26:34,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--yurex.ko.cil.i[265675,265688] [2025-02-06 08:26:34,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--yurex.ko.cil.i[265814,265827] [2025-02-06 08:26:34,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--yurex.ko.cil.i[265977,265990] [2025-02-06 08:26:34,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--yurex.ko.cil.i[266143,266156] [2025-02-06 08:26:34,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--yurex.ko.cil.i[266307,266320] [2025-02-06 08:26:34,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--yurex.ko.cil.i[266472,266485] [2025-02-06 08:26:34,733 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--yurex.ko.cil.i[266637,266650] [2025-02-06 08:26:34,733 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--yurex.ko.cil.i[266803,266816] [2025-02-06 08:26:34,733 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--yurex.ko.cil.i[266968,266981] [2025-02-06 08:26:34,734 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--yurex.ko.cil.i[267135,267148] [2025-02-06 08:26:34,734 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--yurex.ko.cil.i[267295,267308] [2025-02-06 08:26:34,734 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--yurex.ko.cil.i[267457,267470] [2025-02-06 08:26:34,734 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--yurex.ko.cil.i[267616,267629] [2025-02-06 08:26:34,735 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--yurex.ko.cil.i[267762,267775] [2025-02-06 08:26:34,735 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--yurex.ko.cil.i[267905,267918] [2025-02-06 08:26:34,735 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--yurex.ko.cil.i[268049,268062] [2025-02-06 08:26:34,735 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--yurex.ko.cil.i[268192,268205] [2025-02-06 08:26:34,737 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--yurex.ko.cil.i[268336,268349] [2025-02-06 08:26:34,737 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--yurex.ko.cil.i[268477,268490] [2025-02-06 08:26:34,737 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--yurex.ko.cil.i[268615,268628] [2025-02-06 08:26:34,737 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--yurex.ko.cil.i[268773,268786] [2025-02-06 08:26:34,738 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--yurex.ko.cil.i[268932,268945] [2025-02-06 08:26:34,739 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--yurex.ko.cil.i[269088,269101] [2025-02-06 08:26:34,740 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--yurex.ko.cil.i[269237,269250] [2025-02-06 08:26:34,740 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--yurex.ko.cil.i[269389,269402] [2025-02-06 08:26:34,740 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--yurex.ko.cil.i[269540,269553] [2025-02-06 08:26:34,740 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--yurex.ko.cil.i[269689,269702] [2025-02-06 08:26:34,740 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--yurex.ko.cil.i[269841,269854] [2025-02-06 08:26:34,741 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--yurex.ko.cil.i[269989,270002] [2025-02-06 08:26:34,741 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--yurex.ko.cil.i[270142,270155] [2025-02-06 08:26:34,742 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--yurex.ko.cil.i[270293,270306] [2025-02-06 08:26:34,742 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--yurex.ko.cil.i[270443,270456] [2025-02-06 08:26:34,742 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--yurex.ko.cil.i[270590,270603] [2025-02-06 08:26:34,743 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--yurex.ko.cil.i[270741,270754] [2025-02-06 08:26:34,743 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--yurex.ko.cil.i[270892,270905] [2025-02-06 08:26:34,744 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--yurex.ko.cil.i[271040,271053] [2025-02-06 08:26:34,744 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--yurex.ko.cil.i[271206,271219] [2025-02-06 08:26:34,744 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--yurex.ko.cil.i[271375,271388] [2025-02-06 08:26:34,744 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--yurex.ko.cil.i[271542,271555] [2025-02-06 08:26:34,745 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--yurex.ko.cil.i[271710,271723] [2025-02-06 08:26:34,745 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--yurex.ko.cil.i[271860,271873] [2025-02-06 08:26:34,745 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--yurex.ko.cil.i[272007,272020] [2025-02-06 08:26:34,745 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--yurex.ko.cil.i[272168,272181] [2025-02-06 08:26:34,745 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--yurex.ko.cil.i[272338,272351] [2025-02-06 08:26:34,747 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--yurex.ko.cil.i[272500,272513] [2025-02-06 08:26:34,755 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 08:26:34,773 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 08:26:34,827 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movb %%gs:%P1,%0": "=q" (pfo_ret__): "p" (& current_task)); [4155] [2025-02-06 08:26:34,829 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movw %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [4158] [2025-02-06 08:26:34,829 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movl %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [4161] [2025-02-06 08:26:34,829 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movq %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [4164] [2025-02-06 08:26:34,937 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--yurex.ko.cil.i[259112,259125] [2025-02-06 08:26:34,938 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--yurex.ko.cil.i[259257,259270] [2025-02-06 08:26:34,938 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--yurex.ko.cil.i[259403,259416] [2025-02-06 08:26:34,938 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--yurex.ko.cil.i[259568,259581] [2025-02-06 08:26:34,938 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--yurex.ko.cil.i[259726,259739] [2025-02-06 08:26:34,939 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--yurex.ko.cil.i[259884,259897] [2025-02-06 08:26:34,939 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--yurex.ko.cil.i[260042,260055] [2025-02-06 08:26:34,939 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--yurex.ko.cil.i[260202,260215] [2025-02-06 08:26:34,939 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--yurex.ko.cil.i[260361,260374] [2025-02-06 08:26:34,939 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--yurex.ko.cil.i[260500,260513] [2025-02-06 08:26:34,940 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--yurex.ko.cil.i[260642,260655] [2025-02-06 08:26:34,940 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--yurex.ko.cil.i[260791,260804] [2025-02-06 08:26:34,940 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--yurex.ko.cil.i[260930,260943] [2025-02-06 08:26:34,940 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--yurex.ko.cil.i[261085,261098] [2025-02-06 08:26:34,940 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--yurex.ko.cil.i[261245,261258] [2025-02-06 08:26:34,941 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--yurex.ko.cil.i[261396,261409] [2025-02-06 08:26:34,941 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--yurex.ko.cil.i[261547,261560] [2025-02-06 08:26:34,941 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--yurex.ko.cil.i[261699,261712] [2025-02-06 08:26:34,941 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--yurex.ko.cil.i[261848,261861] [2025-02-06 08:26:34,941 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--yurex.ko.cil.i[261996,262009] [2025-02-06 08:26:34,942 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--yurex.ko.cil.i[262153,262166] [2025-02-06 08:26:34,942 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--yurex.ko.cil.i[262302,262315] [2025-02-06 08:26:34,942 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--yurex.ko.cil.i[262458,262471] [2025-02-06 08:26:34,943 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--yurex.ko.cil.i[262611,262624] [2025-02-06 08:26:34,943 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--yurex.ko.cil.i[262757,262770] [2025-02-06 08:26:34,943 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--yurex.ko.cil.i[262900,262913] [2025-02-06 08:26:34,943 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--yurex.ko.cil.i[263052,263065] [2025-02-06 08:26:34,943 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--yurex.ko.cil.i[263198,263211] [2025-02-06 08:26:34,943 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--yurex.ko.cil.i[263343,263356] [2025-02-06 08:26:34,944 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--yurex.ko.cil.i[263497,263510] [2025-02-06 08:26:34,944 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--yurex.ko.cil.i[263648,263661] [2025-02-06 08:26:34,945 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--yurex.ko.cil.i[263803,263816] [2025-02-06 08:26:34,945 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--yurex.ko.cil.i[263955,263968] [2025-02-06 08:26:34,945 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--yurex.ko.cil.i[264110,264123] [2025-02-06 08:26:34,947 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--yurex.ko.cil.i[264274,264287] [2025-02-06 08:26:34,947 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--yurex.ko.cil.i[264430,264443] [2025-02-06 08:26:34,947 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--yurex.ko.cil.i[264594,264607] [2025-02-06 08:26:34,948 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--yurex.ko.cil.i[264736,264749] [2025-02-06 08:26:34,948 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--yurex.ko.cil.i[264894,264907] [2025-02-06 08:26:34,948 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--yurex.ko.cil.i[265061,265074] [2025-02-06 08:26:34,949 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--yurex.ko.cil.i[265220,265233] [2025-02-06 08:26:34,949 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--yurex.ko.cil.i[265379,265392] [2025-02-06 08:26:34,949 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--yurex.ko.cil.i[265528,265541] [2025-02-06 08:26:34,949 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--yurex.ko.cil.i[265675,265688] [2025-02-06 08:26:34,949 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--yurex.ko.cil.i[265814,265827] [2025-02-06 08:26:34,949 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--yurex.ko.cil.i[265977,265990] [2025-02-06 08:26:34,949 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--yurex.ko.cil.i[266143,266156] [2025-02-06 08:26:34,949 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--yurex.ko.cil.i[266307,266320] [2025-02-06 08:26:34,950 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--yurex.ko.cil.i[266472,266485] [2025-02-06 08:26:34,950 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--yurex.ko.cil.i[266637,266650] [2025-02-06 08:26:34,950 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--yurex.ko.cil.i[266803,266816] [2025-02-06 08:26:34,950 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--yurex.ko.cil.i[266968,266981] [2025-02-06 08:26:34,950 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--yurex.ko.cil.i[267135,267148] [2025-02-06 08:26:34,950 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--yurex.ko.cil.i[267295,267308] [2025-02-06 08:26:34,950 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--yurex.ko.cil.i[267457,267470] [2025-02-06 08:26:34,950 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--yurex.ko.cil.i[267616,267629] [2025-02-06 08:26:34,951 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--yurex.ko.cil.i[267762,267775] [2025-02-06 08:26:34,951 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--yurex.ko.cil.i[267905,267918] [2025-02-06 08:26:34,951 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--yurex.ko.cil.i[268049,268062] [2025-02-06 08:26:34,951 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--yurex.ko.cil.i[268192,268205] [2025-02-06 08:26:34,951 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--yurex.ko.cil.i[268336,268349] [2025-02-06 08:26:34,951 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--yurex.ko.cil.i[268477,268490] [2025-02-06 08:26:34,953 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--yurex.ko.cil.i[268615,268628] [2025-02-06 08:26:34,953 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--yurex.ko.cil.i[268773,268786] [2025-02-06 08:26:34,953 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--yurex.ko.cil.i[268932,268945] [2025-02-06 08:26:34,953 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--yurex.ko.cil.i[269088,269101] [2025-02-06 08:26:34,954 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--yurex.ko.cil.i[269237,269250] [2025-02-06 08:26:34,954 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--yurex.ko.cil.i[269389,269402] [2025-02-06 08:26:34,954 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--yurex.ko.cil.i[269540,269553] [2025-02-06 08:26:34,954 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--yurex.ko.cil.i[269689,269702] [2025-02-06 08:26:34,955 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--yurex.ko.cil.i[269841,269854] [2025-02-06 08:26:34,955 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--yurex.ko.cil.i[269989,270002] [2025-02-06 08:26:34,955 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--yurex.ko.cil.i[270142,270155] [2025-02-06 08:26:34,955 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--yurex.ko.cil.i[270293,270306] [2025-02-06 08:26:34,956 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--yurex.ko.cil.i[270443,270456] [2025-02-06 08:26:34,956 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--yurex.ko.cil.i[270590,270603] [2025-02-06 08:26:34,956 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--yurex.ko.cil.i[270741,270754] [2025-02-06 08:26:34,956 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--yurex.ko.cil.i[270892,270905] [2025-02-06 08:26:34,957 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--yurex.ko.cil.i[271040,271053] [2025-02-06 08:26:34,957 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--yurex.ko.cil.i[271206,271219] [2025-02-06 08:26:34,958 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--yurex.ko.cil.i[271375,271388] [2025-02-06 08:26:34,958 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--yurex.ko.cil.i[271542,271555] [2025-02-06 08:26:34,959 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--yurex.ko.cil.i[271710,271723] [2025-02-06 08:26:34,959 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--yurex.ko.cil.i[271860,271873] [2025-02-06 08:26:34,959 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--yurex.ko.cil.i[272007,272020] [2025-02-06 08:26:34,959 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--yurex.ko.cil.i[272168,272181] [2025-02-06 08:26:34,959 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--yurex.ko.cil.i[272338,272351] [2025-02-06 08:26:34,960 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--yurex.ko.cil.i[272500,272513] [2025-02-06 08:26:34,962 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 08:26:35,058 INFO L204 MainTranslator]: Completed translation [2025-02-06 08:26:35,058 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:26:35 WrapperNode [2025-02-06 08:26:35,059 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 08:26:35,059 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 08:26:35,059 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 08:26:35,060 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 08:26:35,064 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:26:35" (1/1) ... [2025-02-06 08:26:35,097 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:26:35" (1/1) ... [2025-02-06 08:26:35,185 INFO L138 Inliner]: procedures = 509, calls = 1274, calls flagged for inlining = 230, calls inlined = 156, statements flattened = 2802 [2025-02-06 08:26:35,186 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 08:26:35,186 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 08:26:35,186 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 08:26:35,186 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 08:26:35,195 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:26:35" (1/1) ... [2025-02-06 08:26:35,195 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:26:35" (1/1) ... [2025-02-06 08:26:35,208 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:26:35" (1/1) ... [2025-02-06 08:26:35,594 INFO L175 MemorySlicer]: Split 421 memory accesses to 12 slices as follows [4, 1, 3, 34, 273, 35, 4, 19, 6, 39, 1, 2]. 65 percent of accesses are in the largest equivalence class. The 91 initializations are split as follows [4, 0, 0, 34, 32, 0, 4, 0, 6, 8, 1, 2]. The 174 writes are split as follows [0, 1, 0, 0, 111, 30, 0, 1, 0, 31, 0, 0]. [2025-02-06 08:26:35,595 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:26:35" (1/1) ... [2025-02-06 08:26:35,595 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:26:35" (1/1) ... [2025-02-06 08:26:35,681 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:26:35" (1/1) ... [2025-02-06 08:26:35,689 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:26:35" (1/1) ... [2025-02-06 08:26:35,701 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:26:35" (1/1) ... [2025-02-06 08:26:35,714 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:26:35" (1/1) ... [2025-02-06 08:26:35,738 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 08:26:35,740 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 08:26:35,740 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 08:26:35,740 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 08:26:35,741 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:26:35" (1/1) ... [2025-02-06 08:26:35,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 08:26:35,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:26:35,771 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-02-06 08:26:35,774 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-02-06 08:26:35,795 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2025-02-06 08:26:35,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2025-02-06 08:26:35,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-02-06 08:26:35,796 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-02-06 08:26:35,796 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-02-06 08:26:35,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-02-06 08:26:35,796 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2025-02-06 08:26:35,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2025-02-06 08:26:35,796 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_usb_alloc_coherent [2025-02-06 08:26:35,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_usb_alloc_coherent [2025-02-06 08:26:35,796 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_usb_yurex [2025-02-06 08:26:35,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_usb_yurex [2025-02-06 08:26:35,797 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2025-02-06 08:26:35,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2025-02-06 08:26:35,797 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2025-02-06 08:26:35,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2025-02-06 08:26:35,797 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2025-02-06 08:26:35,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2025-02-06 08:26:35,797 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2025-02-06 08:26:35,798 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2025-02-06 08:26:35,798 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2025-02-06 08:26:35,798 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2025-02-06 08:26:35,798 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2025-02-06 08:26:35,798 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2025-02-06 08:26:35,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 08:26:35,798 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2025-02-06 08:26:35,798 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2025-02-06 08:26:35,798 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2025-02-06 08:26:35,798 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2025-02-06 08:26:35,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-02-06 08:26:35,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-02-06 08:26:35,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-02-06 08:26:35,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-02-06 08:26:35,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-02-06 08:26:35,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-02-06 08:26:35,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-02-06 08:26:35,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-02-06 08:26:35,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-02-06 08:26:35,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-02-06 08:26:35,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-02-06 08:26:35,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-02-06 08:26:35,798 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2025-02-06 08:26:35,798 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2025-02-06 08:26:35,798 INFO L130 BoogieDeclarations]: Found specification of procedure _dev_info [2025-02-06 08:26:35,798 INFO L138 BoogieDeclarations]: Found implementation of procedure _dev_info [2025-02-06 08:26:35,798 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2025-02-06 08:26:35,798 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2025-02-06 08:26:35,798 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2025-02-06 08:26:35,798 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2025-02-06 08:26:35,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 08:26:35,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 08:26:35,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 08:26:35,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 08:26:35,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 08:26:35,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-06 08:26:35,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-06 08:26:35,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-06 08:26:35,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-06 08:26:35,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-06 08:26:35,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-06 08:26:35,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-06 08:26:35,799 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2025-02-06 08:26:35,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2025-02-06 08:26:35,799 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2025-02-06 08:26:35,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2025-02-06 08:26:35,799 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2025-02-06 08:26:35,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2025-02-06 08:26:35,799 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2025-02-06 08:26:35,799 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2025-02-06 08:26:35,799 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2025-02-06 08:26:35,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2025-02-06 08:26:35,799 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2025-02-06 08:26:35,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2025-02-06 08:26:35,799 INFO L130 BoogieDeclarations]: Found specification of procedure __dynamic_dev_dbg [2025-02-06 08:26:35,799 INFO L138 BoogieDeclarations]: Found implementation of procedure __dynamic_dev_dbg [2025-02-06 08:26:35,799 INFO L130 BoogieDeclarations]: Found specification of procedure kref_put [2025-02-06 08:26:35,799 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_put [2025-02-06 08:26:35,799 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2025-02-06 08:26:35,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2025-02-06 08:26:35,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 08:26:35,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 08:26:35,799 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2025-02-06 08:26:35,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2025-02-06 08:26:35,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 08:26:35,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 08:26:35,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 08:26:35,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-06 08:26:35,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-06 08:26:35,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-06 08:26:35,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-06 08:26:35,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-02-06 08:26:35,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-02-06 08:26:35,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-02-06 08:26:35,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-02-06 08:26:35,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-02-06 08:26:35,802 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2025-02-06 08:26:35,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2025-02-06 08:26:35,802 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2025-02-06 08:26:35,802 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2025-02-06 08:26:35,802 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2025-02-06 08:26:35,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2025-02-06 08:26:35,802 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_irq_check_alloc_flags [2025-02-06 08:26:35,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_irq_check_alloc_flags [2025-02-06 08:26:35,802 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_io_mutex_of_usb_yurex [2025-02-06 08:26:35,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_io_mutex_of_usb_yurex [2025-02-06 08:26:35,802 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2025-02-06 08:26:35,802 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2025-02-06 08:26:35,803 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2025-02-06 08:26:35,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2025-02-06 08:26:35,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 08:26:35,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 08:26:35,803 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_intfdata [2025-02-06 08:26:35,805 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_intfdata [2025-02-06 08:26:35,805 INFO L130 BoogieDeclarations]: Found specification of procedure kref_sub [2025-02-06 08:26:35,805 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_sub [2025-02-06 08:26:35,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-02-06 08:26:35,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-02-06 08:26:35,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-02-06 08:26:35,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-02-06 08:26:35,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-02-06 08:26:35,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-02-06 08:26:35,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-02-06 08:26:35,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-02-06 08:26:35,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-02-06 08:26:35,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-02-06 08:26:35,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-02-06 08:26:35,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-02-06 08:26:35,805 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-02-06 08:26:35,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-02-06 08:26:35,805 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2025-02-06 08:26:35,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2025-02-06 08:26:35,805 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2025-02-06 08:26:35,806 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2025-02-06 08:26:35,806 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2025-02-06 08:26:35,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2025-02-06 08:26:35,806 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_free_urb [2025-02-06 08:26:35,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_free_urb [2025-02-06 08:26:35,806 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2025-02-06 08:26:35,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2025-02-06 08:26:35,806 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 08:26:35,806 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2025-02-06 08:26:35,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2025-02-06 08:26:35,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 08:26:35,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 08:26:35,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 08:26:35,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-06 08:26:35,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-06 08:26:35,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-06 08:26:35,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-06 08:26:35,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-02-06 08:26:35,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-02-06 08:26:35,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-02-06 08:26:35,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-02-06 08:26:35,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-02-06 08:26:35,806 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_usb_free_coherent [2025-02-06 08:26:35,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_usb_free_coherent [2025-02-06 08:26:35,806 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_101 [2025-02-06 08:26:35,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_101 [2025-02-06 08:26:35,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-06 08:26:35,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-06 08:26:35,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-06 08:26:35,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-06 08:26:35,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-02-06 08:26:35,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-02-06 08:26:35,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-02-06 08:26:35,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-02-06 08:26:35,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-02-06 08:26:35,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-02-06 08:26:35,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-02-06 08:26:35,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-02-06 08:26:35,806 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2025-02-06 08:26:35,806 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2025-02-06 08:26:35,806 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2025-02-06 08:26:35,806 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2025-02-06 08:26:35,806 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2025-02-06 08:26:35,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2025-02-06 08:26:35,806 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2025-02-06 08:26:35,806 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2025-02-06 08:26:35,806 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2025-02-06 08:26:35,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2025-02-06 08:26:35,806 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2025-02-06 08:26:35,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2025-02-06 08:26:35,806 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2025-02-06 08:26:35,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2025-02-06 08:26:35,809 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_alloc_urb [2025-02-06 08:26:35,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_alloc_urb [2025-02-06 08:26:35,809 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2025-02-06 08:26:35,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2025-02-06 08:26:35,809 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2025-02-06 08:26:35,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2025-02-06 08:26:35,810 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2025-02-06 08:26:35,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2025-02-06 08:26:35,810 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2025-02-06 08:26:35,810 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2025-02-06 08:26:35,810 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2025-02-06 08:26:35,810 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2025-02-06 08:26:35,810 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2025-02-06 08:26:35,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2025-02-06 08:26:35,810 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_io_mutex_of_usb_yurex [2025-02-06 08:26:35,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_io_mutex_of_usb_yurex [2025-02-06 08:26:35,810 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-02-06 08:26:35,810 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-02-06 08:26:35,810 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2025-02-06 08:26:35,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2025-02-06 08:26:35,810 INFO L130 BoogieDeclarations]: Found specification of procedure kill_fasync [2025-02-06 08:26:35,810 INFO L138 BoogieDeclarations]: Found implementation of procedure kill_fasync [2025-02-06 08:26:35,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 08:26:35,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 08:26:35,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 08:26:35,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 08:26:35,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 08:26:35,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 08:26:35,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-06 08:26:35,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-06 08:26:35,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-06 08:26:35,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-06 08:26:35,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-06 08:26:35,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-06 08:26:35,811 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2025-02-06 08:26:35,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2025-02-06 08:26:35,811 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-02-06 08:26:35,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-02-06 08:26:35,811 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2025-02-06 08:26:35,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2025-02-06 08:26:35,811 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2025-02-06 08:26:35,811 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2025-02-06 08:26:35,811 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2025-02-06 08:26:35,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2025-02-06 08:26:35,811 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2025-02-06 08:26:35,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2025-02-06 08:26:35,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 08:26:35,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 08:26:35,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 08:26:35,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 08:26:35,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 08:26:35,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 08:26:35,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-06 08:26:35,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-06 08:26:35,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-06 08:26:35,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-06 08:26:35,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-06 08:26:35,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-06 08:26:35,812 INFO L130 BoogieDeclarations]: Found specification of procedure yurex_disconnect [2025-02-06 08:26:35,812 INFO L138 BoogieDeclarations]: Found implementation of procedure yurex_disconnect [2025-02-06 08:26:36,257 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 08:26:36,260 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 08:26:36,299 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4422: havoc dev_get_drvdata_#t~mem73#1.base, dev_get_drvdata_#t~mem73#1.offset; [2025-02-06 08:26:36,392 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-02-06 08:26:36,468 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4546: havoc #t~mem107;havoc #t~bitwise108; [2025-02-06 08:26:36,817 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6113: havoc ldv_usb_submit_urb_102_#t~nondet354#1; [2025-02-06 08:26:36,817 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4581: call ULTIMATE.dealloc(yurex_delete_~#descriptor~0#1.base, yurex_delete_~#descriptor~0#1.offset);havoc yurex_delete_~#descriptor~0#1.base, yurex_delete_~#descriptor~0#1.offset; [2025-02-06 08:26:36,817 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4651: call ULTIMATE.dealloc(yurex_interrupt_~#descriptor~1#1.base, yurex_interrupt_~#descriptor~1#1.offset);havoc yurex_interrupt_~#descriptor~1#1.base, yurex_interrupt_~#descriptor~1#1.offset;call ULTIMATE.dealloc(yurex_interrupt_~#descriptor___0~0#1.base, yurex_interrupt_~#descriptor___0~0#1.offset);havoc yurex_interrupt_~#descriptor___0~0#1.base, yurex_interrupt_~#descriptor___0~0#1.offset;call ULTIMATE.dealloc(yurex_interrupt_~#descriptor___1~0#1.base, yurex_interrupt_~#descriptor___1~0#1.offset);havoc yurex_interrupt_~#descriptor___1~0#1.base, yurex_interrupt_~#descriptor___1~0#1.offset; [2025-02-06 08:26:36,821 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10800: havoc #t~nondet531; [2025-02-06 08:26:36,911 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10796: havoc #t~nondet530; [2025-02-06 08:26:41,922 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10870: havoc usb_register_driver_#t~nondet539#1; [2025-02-06 08:26:41,923 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4827: call ULTIMATE.dealloc(yurex_probe_~#wait~0#1.base, yurex_probe_~#wait~0#1.offset);havoc yurex_probe_~#wait~0#1.base, yurex_probe_~#wait~0#1.offset;call ULTIMATE.dealloc(yurex_probe_~#__key~0#1.base, yurex_probe_~#__key~0#1.offset);havoc yurex_probe_~#__key~0#1.base, yurex_probe_~#__key~0#1.offset;call ULTIMATE.dealloc(yurex_probe_~#__key___0~0#1.base, yurex_probe_~#__key___0~0#1.offset);havoc yurex_probe_~#__key___0~0#1.base, yurex_probe_~#__key___0~0#1.offset;call ULTIMATE.dealloc(yurex_probe_~#__key___1~0#1.base, yurex_probe_~#__key___1~0#1.offset);havoc yurex_probe_~#__key___1~0#1.base, yurex_probe_~#__key___1~0#1.offset; [2025-02-06 08:26:41,923 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10842: havoc printk_#t~nondet534#1; [2025-02-06 08:26:41,923 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10810: havoc default_llseek_#t~nondet532#1; [2025-02-06 08:26:41,923 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4437: havoc iminor_#t~mem78#1; [2025-02-06 08:26:41,923 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10846: havoc schedule_timeout_#t~nondet535#1; [2025-02-06 08:26:41,923 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10850: havoc simple_strtoull_#t~nondet536#1; [2025-02-06 08:26:41,923 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10817: havoc fasync_helper_#t~nondet533#1; [2025-02-06 08:26:41,923 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6656: havoc ldv_linux_usb_dev_atomic_add_return_#t~mem387#1; [2025-02-06 08:26:41,923 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5108: call ULTIMATE.dealloc(yurex_read_~#in_buffer~0#1.base, yurex_read_~#in_buffer~0#1.offset);havoc yurex_read_~#in_buffer~0#1.base, yurex_read_~#in_buffer~0#1.offset; [2025-02-06 08:26:41,923 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4318: havoc usb_endpoint_dir_in_#t~mem55#1; [2025-02-06 08:26:41,923 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10859: havoc usb_find_interface_#t~ret537#1.base, usb_find_interface_#t~ret537#1.offset; [2025-02-06 08:26:41,923 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6202: havoc ldv_usb_submit_urb_108_#t~nondet364#1; [2025-02-06 08:26:41,923 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6336-1: ldv_usb_register_driver_123_#res#1 := ldv_usb_register_driver_123_~ldv_func_res~0#1; [2025-02-06 08:26:41,923 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4324: havoc usb_endpoint_xfer_int_#t~mem56#1; [2025-02-06 08:26:41,923 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10866: havoc usb_register_dev_#t~nondet538#1; [2025-02-06 08:26:41,923 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5881-1: ldv_usb_register_driver_#res#1 := ldv_usb_register_driver_~arg0#1; [2025-02-06 08:26:41,923 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6311: havoc ldv_usb_submit_urb_121_#t~nondet365#1; [2025-02-06 08:26:41,923 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5155: call ULTIMATE.dealloc(yurex_write_~#buffer~0#1.base, yurex_write_~#buffer~0#1.offset);havoc yurex_write_~#buffer~0#1.base, yurex_write_~#buffer~0#1.offset;call ULTIMATE.dealloc(yurex_write_~#wait~1#1.base, yurex_write_~#wait~1#1.offset);havoc yurex_write_~#wait~1#1.base, yurex_write_~#wait~1#1.offset;call ULTIMATE.dealloc(yurex_write_~#descriptor~2#1.base, yurex_write_~#descriptor~2#1.offset);havoc yurex_write_~#descriptor~2#1.base, yurex_write_~#descriptor~2#1.offset; [2025-02-06 08:26:42,224 INFO L? ?]: Removed 1377 outVars from TransFormulas that were not future-live. [2025-02-06 08:26:42,225 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 08:26:42,272 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 08:26:42,272 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 08:26:42,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 08:26:42 BoogieIcfgContainer [2025-02-06 08:26:42,273 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 08:26:42,275 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 08:26:42,275 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 08:26:42,279 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 08:26:42,280 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 08:26:32" (1/3) ... [2025-02-06 08:26:42,280 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66b52d70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 08:26:42, skipping insertion in model container [2025-02-06 08:26:42,280 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:26:35" (2/3) ... [2025-02-06 08:26:42,281 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66b52d70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 08:26:42, skipping insertion in model container [2025-02-06 08:26:42,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 08:26:42" (3/3) ... [2025-02-06 08:26:42,282 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i [2025-02-06 08:26:42,295 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 08:26:42,298 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i that has 72 procedures, 1031 locations, 1 initial locations, 2 loop locations, and 33 error locations. [2025-02-06 08:26:42,374 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 08:26:42,383 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;@d22fe85, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 08:26:42,384 INFO L334 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2025-02-06 08:26:42,394 INFO L276 IsEmpty]: Start isEmpty. Operand has 1030 states, 681 states have (on average 1.28928046989721) internal successors, (878), 739 states have internal predecessors, (878), 245 states have call successors, (245), 71 states have call predecessors, (245), 70 states have return successors, (240), 229 states have call predecessors, (240), 240 states have call successors, (240) [2025-02-06 08:26:42,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-06 08:26:42,402 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:26:42,402 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-02-06 08:26:42,403 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 31 more)] === [2025-02-06 08:26:42,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:26:42,407 INFO L85 PathProgramCache]: Analyzing trace with hash -644186177, now seen corresponding path program 1 times [2025-02-06 08:26:42,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:26:42,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015611869] [2025-02-06 08:26:42,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:26:42,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:26:43,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-06 08:26:43,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-06 08:26:43,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:26:43,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:26:43,823 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-06 08:26:43,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:26:43,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015611869] [2025-02-06 08:26:43,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015611869] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:26:43,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:26:43,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:26:43,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406226319] [2025-02-06 08:26:43,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:26:43,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:26:43,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:26:43,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:26:43,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:26:43,845 INFO L87 Difference]: Start difference. First operand has 1030 states, 681 states have (on average 1.28928046989721) internal successors, (878), 739 states have internal predecessors, (878), 245 states have call successors, (245), 71 states have call predecessors, (245), 70 states have return successors, (240), 229 states have call predecessors, (240), 240 states have call successors, (240) 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-02-06 08:26:44,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:26:44,071 INFO L93 Difference]: Finished difference Result 2010 states and 2746 transitions. [2025-02-06 08:26:44,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:26:44,073 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-02-06 08:26:44,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:26:44,095 INFO L225 Difference]: With dead ends: 2010 [2025-02-06 08:26:44,096 INFO L226 Difference]: Without dead ends: 1010 [2025-02-06 08:26:44,107 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-02-06 08:26:44,109 INFO L435 NwaCegarLoop]: 1309 mSDtfsCounter, 1284 mSDsluCounter, 1308 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1284 SdHoareTripleChecker+Valid, 2617 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:26:44,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1284 Valid, 2617 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 08:26:44,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2025-02-06 08:26:44,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 1010. [2025-02-06 08:26:44,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1010 states, 669 states have (on average 1.2257100149476832) internal successors, (820), 722 states have internal predecessors, (820), 240 states have call successors, (240), 70 states have call predecessors, (240), 69 states have return successors, (238), 227 states have call predecessors, (238), 238 states have call successors, (238) [2025-02-06 08:26:44,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 1298 transitions. [2025-02-06 08:26:44,231 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 1298 transitions. Word has length 71 [2025-02-06 08:26:44,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:26:44,234 INFO L471 AbstractCegarLoop]: Abstraction has 1010 states and 1298 transitions. [2025-02-06 08:26:44,234 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-02-06 08:26:44,234 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 1298 transitions. [2025-02-06 08:26:44,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-06 08:26:44,237 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:26:44,237 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-02-06 08:26:44,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 08:26:44,237 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 31 more)] === [2025-02-06 08:26:44,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:26:44,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1372657177, now seen corresponding path program 1 times [2025-02-06 08:26:44,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:26:44,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772678084] [2025-02-06 08:26:44,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:26:44,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:26:44,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-06 08:26:44,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-06 08:26:44,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:26:44,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:26:45,197 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-06 08:26:45,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:26:45,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772678084] [2025-02-06 08:26:45,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772678084] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:26:45,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:26:45,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:26:45,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111796499] [2025-02-06 08:26:45,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:26:45,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:26:45,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:26:45,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:26:45,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:26:45,200 INFO L87 Difference]: Start difference. First operand 1010 states and 1298 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-02-06 08:26:45,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:26:45,282 INFO L93 Difference]: Finished difference Result 1010 states and 1298 transitions. [2025-02-06 08:26:45,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:26:45,283 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-02-06 08:26:45,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:26:45,291 INFO L225 Difference]: With dead ends: 1010 [2025-02-06 08:26:45,292 INFO L226 Difference]: Without dead ends: 1008 [2025-02-06 08:26:45,293 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-02-06 08:26:45,293 INFO L435 NwaCegarLoop]: 1289 mSDtfsCounter, 1263 mSDsluCounter, 1288 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1263 SdHoareTripleChecker+Valid, 2577 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:26:45,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1263 Valid, 2577 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 08:26:45,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2025-02-06 08:26:45,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 1008. [2025-02-06 08:26:45,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1008 states, 668 states have (on average 1.2245508982035929) internal successors, (818), 720 states have internal predecessors, (818), 240 states have call successors, (240), 70 states have call predecessors, (240), 69 states have return successors, (238), 227 states have call predecessors, (238), 238 states have call successors, (238) [2025-02-06 08:26:45,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1296 transitions. [2025-02-06 08:26:45,362 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1296 transitions. Word has length 77 [2025-02-06 08:26:45,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:26:45,363 INFO L471 AbstractCegarLoop]: Abstraction has 1008 states and 1296 transitions. [2025-02-06 08:26:45,363 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-02-06 08:26:45,363 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1296 transitions. [2025-02-06 08:26:45,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-06 08:26:45,367 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:26:45,367 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-02-06 08:26:45,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 08:26:45,368 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 31 more)] === [2025-02-06 08:26:45,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:26:45,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1292678762, now seen corresponding path program 1 times [2025-02-06 08:26:45,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:26:45,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881935673] [2025-02-06 08:26:45,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:26:45,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:26:45,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-06 08:26:45,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-06 08:26:45,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:26:45,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:26:46,230 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-06 08:26:46,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:26:46,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881935673] [2025-02-06 08:26:46,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881935673] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:26:46,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:26:46,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:26:46,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173104357] [2025-02-06 08:26:46,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:26:46,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:26:46,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:26:46,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:26:46,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:26:46,232 INFO L87 Difference]: Start difference. First operand 1008 states and 1296 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-02-06 08:26:46,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:26:46,307 INFO L93 Difference]: Finished difference Result 1008 states and 1296 transitions. [2025-02-06 08:26:46,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:26:46,308 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-02-06 08:26:46,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:26:46,313 INFO L225 Difference]: With dead ends: 1008 [2025-02-06 08:26:46,313 INFO L226 Difference]: Without dead ends: 1006 [2025-02-06 08:26:46,314 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-02-06 08:26:46,314 INFO L435 NwaCegarLoop]: 1287 mSDtfsCounter, 1260 mSDsluCounter, 1286 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1260 SdHoareTripleChecker+Valid, 2573 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:26:46,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1260 Valid, 2573 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 08:26:46,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2025-02-06 08:26:46,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 1006. [2025-02-06 08:26:46,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1006 states, 667 states have (on average 1.2233883058470765) internal successors, (816), 718 states have internal predecessors, (816), 240 states have call successors, (240), 70 states have call predecessors, (240), 69 states have return successors, (238), 227 states have call predecessors, (238), 238 states have call successors, (238) [2025-02-06 08:26:46,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 1294 transitions. [2025-02-06 08:26:46,385 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 1294 transitions. Word has length 83 [2025-02-06 08:26:46,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:26:46,387 INFO L471 AbstractCegarLoop]: Abstraction has 1006 states and 1294 transitions. [2025-02-06 08:26:46,387 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-02-06 08:26:46,387 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1294 transitions. [2025-02-06 08:26:46,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-06 08:26:46,389 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:26:46,389 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-02-06 08:26:46,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 08:26:46,390 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 31 more)] === [2025-02-06 08:26:46,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:26:46,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1433261734, now seen corresponding path program 1 times [2025-02-06 08:26:46,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:26:46,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571508994] [2025-02-06 08:26:46,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:26:46,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:26:46,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 08:26:46,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 08:26:46,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:26:46,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:26:47,121 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-06 08:26:47,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:26:47,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571508994] [2025-02-06 08:26:47,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571508994] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:26:47,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:26:47,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:26:47,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220169365] [2025-02-06 08:26:47,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:26:47,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:26:47,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:26:47,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:26:47,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:26:47,124 INFO L87 Difference]: Start difference. First operand 1006 states and 1294 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-02-06 08:26:47,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:26:47,202 INFO L93 Difference]: Finished difference Result 1006 states and 1294 transitions. [2025-02-06 08:26:47,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:26:47,203 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-02-06 08:26:47,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:26:47,210 INFO L225 Difference]: With dead ends: 1006 [2025-02-06 08:26:47,210 INFO L226 Difference]: Without dead ends: 1004 [2025-02-06 08:26:47,211 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-02-06 08:26:47,212 INFO L435 NwaCegarLoop]: 1285 mSDtfsCounter, 1257 mSDsluCounter, 1284 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1257 SdHoareTripleChecker+Valid, 2569 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:26:47,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1257 Valid, 2569 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 08:26:47,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2025-02-06 08:26:47,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 1004. [2025-02-06 08:26:47,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1004 states, 666 states have (on average 1.2222222222222223) internal successors, (814), 716 states have internal predecessors, (814), 240 states have call successors, (240), 70 states have call predecessors, (240), 69 states have return successors, (238), 227 states have call predecessors, (238), 238 states have call successors, (238) [2025-02-06 08:26:47,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 1292 transitions. [2025-02-06 08:26:47,264 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 1292 transitions. Word has length 89 [2025-02-06 08:26:47,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:26:47,264 INFO L471 AbstractCegarLoop]: Abstraction has 1004 states and 1292 transitions. [2025-02-06 08:26:47,264 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-02-06 08:26:47,264 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1292 transitions. [2025-02-06 08:26:47,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-06 08:26:47,266 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:26:47,266 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-02-06 08:26:47,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 08:26:47,266 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 31 more)] === [2025-02-06 08:26:47,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:26:47,266 INFO L85 PathProgramCache]: Analyzing trace with hash 2056878019, now seen corresponding path program 1 times [2025-02-06 08:26:47,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:26:47,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877868408] [2025-02-06 08:26:47,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:26:47,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:26:47,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-06 08:26:47,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-06 08:26:47,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:26:47,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:26:47,922 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-06 08:26:47,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:26:47,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877868408] [2025-02-06 08:26:47,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877868408] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:26:47,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:26:47,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:26:47,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962491589] [2025-02-06 08:26:47,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:26:47,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:26:47,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:26:47,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:26:47,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:26:47,924 INFO L87 Difference]: Start difference. First operand 1004 states and 1292 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-02-06 08:26:48,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:26:48,003 INFO L93 Difference]: Finished difference Result 1004 states and 1292 transitions. [2025-02-06 08:26:48,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:26:48,004 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-02-06 08:26:48,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:26:48,010 INFO L225 Difference]: With dead ends: 1004 [2025-02-06 08:26:48,011 INFO L226 Difference]: Without dead ends: 1002 [2025-02-06 08:26:48,012 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-02-06 08:26:48,012 INFO L435 NwaCegarLoop]: 1283 mSDtfsCounter, 1254 mSDsluCounter, 1282 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1254 SdHoareTripleChecker+Valid, 2565 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:26:48,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1254 Valid, 2565 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 08:26:48,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2025-02-06 08:26:48,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 1002. [2025-02-06 08:26:48,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1002 states, 665 states have (on average 1.2210526315789474) internal successors, (812), 714 states have internal predecessors, (812), 240 states have call successors, (240), 70 states have call predecessors, (240), 69 states have return successors, (238), 227 states have call predecessors, (238), 238 states have call successors, (238) [2025-02-06 08:26:48,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1290 transitions. [2025-02-06 08:26:48,085 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1290 transitions. Word has length 95 [2025-02-06 08:26:48,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:26:48,086 INFO L471 AbstractCegarLoop]: Abstraction has 1002 states and 1290 transitions. [2025-02-06 08:26:48,086 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-02-06 08:26:48,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1290 transitions. [2025-02-06 08:26:48,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-06 08:26:48,087 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:26:48,088 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-02-06 08:26:48,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 08:26:48,088 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 31 more)] === [2025-02-06 08:26:48,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:26:48,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1272297222, now seen corresponding path program 1 times [2025-02-06 08:26:48,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:26:48,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875005094] [2025-02-06 08:26:48,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:26:48,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:26:48,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-06 08:26:48,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-06 08:26:48,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:26:48,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:26:48,760 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-06 08:26:48,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:26:48,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875005094] [2025-02-06 08:26:48,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875005094] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:26:48,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:26:48,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:26:48,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548370720] [2025-02-06 08:26:48,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:26:48,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:26:48,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:26:48,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:26:48,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:26:48,762 INFO L87 Difference]: Start difference. First operand 1002 states and 1290 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-02-06 08:26:48,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:26:48,845 INFO L93 Difference]: Finished difference Result 1002 states and 1290 transitions. [2025-02-06 08:26:48,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:26:48,846 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-02-06 08:26:48,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:26:48,853 INFO L225 Difference]: With dead ends: 1002 [2025-02-06 08:26:48,853 INFO L226 Difference]: Without dead ends: 1000 [2025-02-06 08:26:48,854 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-02-06 08:26:48,854 INFO L435 NwaCegarLoop]: 1281 mSDtfsCounter, 1251 mSDsluCounter, 1280 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1251 SdHoareTripleChecker+Valid, 2561 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:26:48,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1251 Valid, 2561 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 08:26:48,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2025-02-06 08:26:48,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 1000. [2025-02-06 08:26:48,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1000 states, 664 states have (on average 1.2198795180722892) internal successors, (810), 712 states have internal predecessors, (810), 240 states have call successors, (240), 70 states have call predecessors, (240), 69 states have return successors, (238), 227 states have call predecessors, (238), 238 states have call successors, (238) [2025-02-06 08:26:48,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1288 transitions. [2025-02-06 08:26:48,903 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1288 transitions. Word has length 101 [2025-02-06 08:26:48,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:26:48,903 INFO L471 AbstractCegarLoop]: Abstraction has 1000 states and 1288 transitions. [2025-02-06 08:26:48,904 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-02-06 08:26:48,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1288 transitions. [2025-02-06 08:26:48,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-06 08:26:48,906 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:26:48,906 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-02-06 08:26:48,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 08:26:48,906 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 31 more)] === [2025-02-06 08:26:48,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:26:48,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1801653087, now seen corresponding path program 1 times [2025-02-06 08:26:48,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:26:48,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751870080] [2025-02-06 08:26:48,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:26:48,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:26:49,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-06 08:26:49,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-06 08:26:49,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:26:49,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:26:49,543 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-06 08:26:49,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:26:49,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751870080] [2025-02-06 08:26:49,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751870080] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:26:49,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:26:49,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:26:49,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103749805] [2025-02-06 08:26:49,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:26:49,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:26:49,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:26:49,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:26:49,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:26:49,545 INFO L87 Difference]: Start difference. First operand 1000 states and 1288 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-02-06 08:26:49,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:26:49,619 INFO L93 Difference]: Finished difference Result 1000 states and 1288 transitions. [2025-02-06 08:26:49,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:26:49,620 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-02-06 08:26:49,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:26:49,625 INFO L225 Difference]: With dead ends: 1000 [2025-02-06 08:26:49,625 INFO L226 Difference]: Without dead ends: 998 [2025-02-06 08:26:49,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:26:49,626 INFO L435 NwaCegarLoop]: 1279 mSDtfsCounter, 1248 mSDsluCounter, 1278 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1248 SdHoareTripleChecker+Valid, 2557 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:26:49,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1248 Valid, 2557 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 08:26:49,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2025-02-06 08:26:49,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 998. [2025-02-06 08:26:49,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 998 states, 663 states have (on average 1.2187028657616892) internal successors, (808), 710 states have internal predecessors, (808), 240 states have call successors, (240), 70 states have call predecessors, (240), 69 states have return successors, (238), 227 states have call predecessors, (238), 238 states have call successors, (238) [2025-02-06 08:26:49,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1286 transitions. [2025-02-06 08:26:49,694 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1286 transitions. Word has length 107 [2025-02-06 08:26:49,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:26:49,695 INFO L471 AbstractCegarLoop]: Abstraction has 998 states and 1286 transitions. [2025-02-06 08:26:49,695 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-02-06 08:26:49,695 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1286 transitions. [2025-02-06 08:26:49,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-06 08:26:49,696 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:26:49,696 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-02-06 08:26:49,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 08:26:49,696 INFO L396 AbstractCegarLoop]: === Iteration 8 === 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 31 more)] === [2025-02-06 08:26:49,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:26:49,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1585738438, now seen corresponding path program 1 times [2025-02-06 08:26:49,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:26:49,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120572171] [2025-02-06 08:26:49,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:26:49,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:26:50,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-06 08:26:50,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-06 08:26:50,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:26:50,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:26:50,315 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-06 08:26:50,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:26:50,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120572171] [2025-02-06 08:26:50,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120572171] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:26:50,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:26:50,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:26:50,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713110333] [2025-02-06 08:26:50,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:26:50,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:26:50,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:26:50,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:26:50,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:26:50,317 INFO L87 Difference]: Start difference. First operand 998 states and 1286 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-02-06 08:26:50,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:26:50,397 INFO L93 Difference]: Finished difference Result 998 states and 1286 transitions. [2025-02-06 08:26:50,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:26:50,398 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-02-06 08:26:50,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:26:50,403 INFO L225 Difference]: With dead ends: 998 [2025-02-06 08:26:50,404 INFO L226 Difference]: Without dead ends: 996 [2025-02-06 08:26:50,404 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-02-06 08:26:50,404 INFO L435 NwaCegarLoop]: 1277 mSDtfsCounter, 1245 mSDsluCounter, 1276 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1245 SdHoareTripleChecker+Valid, 2553 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:26:50,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1245 Valid, 2553 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 08:26:50,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2025-02-06 08:26:50,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 996. [2025-02-06 08:26:50,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 996 states, 662 states have (on average 1.2175226586102719) internal successors, (806), 708 states have internal predecessors, (806), 240 states have call successors, (240), 70 states have call predecessors, (240), 69 states have return successors, (238), 227 states have call predecessors, (238), 238 states have call successors, (238) [2025-02-06 08:26:50,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 1284 transitions. [2025-02-06 08:26:50,452 INFO L78 Accepts]: Start accepts. Automaton has 996 states and 1284 transitions. Word has length 113 [2025-02-06 08:26:50,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:26:50,452 INFO L471 AbstractCegarLoop]: Abstraction has 996 states and 1284 transitions. [2025-02-06 08:26:50,452 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-02-06 08:26:50,452 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 1284 transitions. [2025-02-06 08:26:50,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-06 08:26:50,454 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:26:50,454 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-02-06 08:26:50,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 08:26:50,455 INFO L396 AbstractCegarLoop]: === Iteration 9 === 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 31 more)] === [2025-02-06 08:26:50,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:26:50,455 INFO L85 PathProgramCache]: Analyzing trace with hash 818783605, now seen corresponding path program 1 times [2025-02-06 08:26:50,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:26:50,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720929604] [2025-02-06 08:26:50,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:26:50,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:26:50,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-06 08:26:50,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-06 08:26:50,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:26:50,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:26:51,112 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-06 08:26:51,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:26:51,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720929604] [2025-02-06 08:26:51,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720929604] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:26:51,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:26:51,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:26:51,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245499997] [2025-02-06 08:26:51,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:26:51,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:26:51,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:26:51,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:26:51,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:26:51,115 INFO L87 Difference]: Start difference. First operand 996 states and 1284 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-02-06 08:26:51,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:26:51,204 INFO L93 Difference]: Finished difference Result 996 states and 1284 transitions. [2025-02-06 08:26:51,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:26:51,205 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-02-06 08:26:51,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:26:51,210 INFO L225 Difference]: With dead ends: 996 [2025-02-06 08:26:51,211 INFO L226 Difference]: Without dead ends: 994 [2025-02-06 08:26:51,212 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-02-06 08:26:51,212 INFO L435 NwaCegarLoop]: 1275 mSDtfsCounter, 1241 mSDsluCounter, 1274 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1241 SdHoareTripleChecker+Valid, 2549 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:26:51,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1241 Valid, 2549 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 08:26:51,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2025-02-06 08:26:51,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 994. [2025-02-06 08:26:51,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 661 states have (on average 1.2163388804841149) internal successors, (804), 706 states have internal predecessors, (804), 240 states have call successors, (240), 70 states have call predecessors, (240), 69 states have return successors, (238), 227 states have call predecessors, (238), 238 states have call successors, (238) [2025-02-06 08:26:51,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1282 transitions. [2025-02-06 08:26:51,270 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1282 transitions. Word has length 115 [2025-02-06 08:26:51,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:26:51,270 INFO L471 AbstractCegarLoop]: Abstraction has 994 states and 1282 transitions. [2025-02-06 08:26:51,271 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-02-06 08:26:51,271 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1282 transitions. [2025-02-06 08:26:51,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-06 08:26:51,272 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:26:51,272 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-02-06 08:26:51,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 08:26:51,272 INFO L396 AbstractCegarLoop]: === Iteration 10 === 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 31 more)] === [2025-02-06 08:26:51,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:26:51,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1883907414, now seen corresponding path program 1 times [2025-02-06 08:26:51,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:26:51,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289190544] [2025-02-06 08:26:51,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:26:51,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:26:51,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-06 08:26:51,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-06 08:26:51,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:26:51,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:26:51,905 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-06 08:26:51,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:26:51,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289190544] [2025-02-06 08:26:51,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289190544] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:26:51,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:26:51,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:26:51,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868074146] [2025-02-06 08:26:51,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:26:51,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:26:51,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:26:51,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:26:51,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:26:51,907 INFO L87 Difference]: Start difference. First operand 994 states and 1282 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-02-06 08:26:52,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:26:52,002 INFO L93 Difference]: Finished difference Result 994 states and 1282 transitions. [2025-02-06 08:26:52,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:26:52,003 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-02-06 08:26:52,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:26:52,010 INFO L225 Difference]: With dead ends: 994 [2025-02-06 08:26:52,011 INFO L226 Difference]: Without dead ends: 992 [2025-02-06 08:26:52,011 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-02-06 08:26:52,012 INFO L435 NwaCegarLoop]: 1273 mSDtfsCounter, 1240 mSDsluCounter, 1272 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1240 SdHoareTripleChecker+Valid, 2545 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:26:52,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1240 Valid, 2545 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 08:26:52,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2025-02-06 08:26:52,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 992. [2025-02-06 08:26:52,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 992 states, 660 states have (on average 1.215151515151515) internal successors, (802), 704 states have internal predecessors, (802), 240 states have call successors, (240), 70 states have call predecessors, (240), 69 states have return successors, (238), 227 states have call predecessors, (238), 238 states have call successors, (238) [2025-02-06 08:26:52,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1280 transitions. [2025-02-06 08:26:52,103 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1280 transitions. Word has length 121 [2025-02-06 08:26:52,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:26:52,104 INFO L471 AbstractCegarLoop]: Abstraction has 992 states and 1280 transitions. [2025-02-06 08:26:52,104 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-02-06 08:26:52,104 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1280 transitions. [2025-02-06 08:26:52,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-06 08:26:52,106 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:26:52,106 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-02-06 08:26:52,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 08:26:52,107 INFO L396 AbstractCegarLoop]: === Iteration 11 === 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 31 more)] === [2025-02-06 08:26:52,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:26:52,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1419189676, now seen corresponding path program 1 times [2025-02-06 08:26:52,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:26:52,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772476992] [2025-02-06 08:26:52,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:26:52,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:26:52,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-06 08:26:52,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-06 08:26:52,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:26:52,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:26:52,657 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-06 08:26:52,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:26:52,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772476992] [2025-02-06 08:26:52,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772476992] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:26:52,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:26:52,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:26:52,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269214154] [2025-02-06 08:26:52,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:26:52,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:26:52,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:26:52,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:26:52,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:26:52,659 INFO L87 Difference]: Start difference. First operand 992 states and 1280 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-02-06 08:26:52,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:26:52,763 INFO L93 Difference]: Finished difference Result 992 states and 1280 transitions. [2025-02-06 08:26:52,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:26:52,764 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-02-06 08:26:52,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:26:52,771 INFO L225 Difference]: With dead ends: 992 [2025-02-06 08:26:52,772 INFO L226 Difference]: Without dead ends: 990 [2025-02-06 08:26:52,772 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-02-06 08:26:52,773 INFO L435 NwaCegarLoop]: 1271 mSDtfsCounter, 1237 mSDsluCounter, 1270 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1237 SdHoareTripleChecker+Valid, 2541 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:26:52,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1237 Valid, 2541 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 08:26:52,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2025-02-06 08:26:52,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 990. [2025-02-06 08:26:52,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 990 states, 659 states have (on average 1.2139605462822458) internal successors, (800), 702 states have internal predecessors, (800), 240 states have call successors, (240), 70 states have call predecessors, (240), 69 states have return successors, (238), 227 states have call predecessors, (238), 238 states have call successors, (238) [2025-02-06 08:26:52,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1278 transitions. [2025-02-06 08:26:52,862 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1278 transitions. Word has length 127 [2025-02-06 08:26:52,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:26:52,864 INFO L471 AbstractCegarLoop]: Abstraction has 990 states and 1278 transitions. [2025-02-06 08:26:52,865 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-02-06 08:26:52,865 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1278 transitions. [2025-02-06 08:26:52,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-02-06 08:26:52,868 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:26:52,868 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-02-06 08:26:52,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 08:26:52,868 INFO L396 AbstractCegarLoop]: === Iteration 12 === 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 31 more)] === [2025-02-06 08:26:52,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:26:52,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1199244474, now seen corresponding path program 1 times [2025-02-06 08:26:52,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:26:52,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967265261] [2025-02-06 08:26:52,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:26:52,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:26:53,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-02-06 08:26:53,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-02-06 08:26:53,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:26:53,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:26:54,262 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-02-06 08:26:54,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:26:54,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967265261] [2025-02-06 08:26:54,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967265261] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:26:54,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:26:54,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 08:26:54,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493095192] [2025-02-06 08:26:54,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:26:54,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 08:26:54,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:26:54,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 08:26:54,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:26:54,263 INFO L87 Difference]: Start difference. First operand 990 states and 1278 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 08:26:58,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 08:26:59,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:26:59,669 INFO L93 Difference]: Finished difference Result 1940 states and 2513 transitions. [2025-02-06 08:26:59,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 08:26:59,669 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 171 [2025-02-06 08:26:59,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:26:59,675 INFO L225 Difference]: With dead ends: 1940 [2025-02-06 08:26:59,675 INFO L226 Difference]: Without dead ends: 990 [2025-02-06 08:26:59,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 08:26:59,678 INFO L435 NwaCegarLoop]: 1269 mSDtfsCounter, 1237 mSDsluCounter, 3325 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1238 SdHoareTripleChecker+Valid, 4594 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2025-02-06 08:26:59,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1238 Valid, 4594 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 509 Invalid, 1 Unknown, 0 Unchecked, 5.2s Time] [2025-02-06 08:26:59,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2025-02-06 08:26:59,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 990. [2025-02-06 08:26:59,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 990 states, 659 states have (on average 1.212443095599393) internal successors, (799), 702 states have internal predecessors, (799), 240 states have call successors, (240), 70 states have call predecessors, (240), 69 states have return successors, (238), 227 states have call predecessors, (238), 238 states have call successors, (238) [2025-02-06 08:26:59,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1277 transitions. [2025-02-06 08:26:59,735 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1277 transitions. Word has length 171 [2025-02-06 08:26:59,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:26:59,735 INFO L471 AbstractCegarLoop]: Abstraction has 990 states and 1277 transitions. [2025-02-06 08:26:59,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 08:26:59,736 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1277 transitions. [2025-02-06 08:26:59,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-02-06 08:26:59,737 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:26:59,737 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-02-06 08:26:59,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 08:26:59,738 INFO L396 AbstractCegarLoop]: === Iteration 13 === 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 31 more)] === [2025-02-06 08:26:59,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:26:59,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1199214683, now seen corresponding path program 1 times [2025-02-06 08:26:59,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:26:59,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665049364] [2025-02-06 08:26:59,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:26:59,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:00,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-02-06 08:27:00,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-02-06 08:27:00,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:00,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:00,425 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-02-06 08:27:00,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:00,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665049364] [2025-02-06 08:27:00,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665049364] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:00,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:27:00,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:27:00,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798498640] [2025-02-06 08:27:00,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:00,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:27:00,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:00,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:27:00,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:27:00,428 INFO L87 Difference]: Start difference. First operand 990 states and 1277 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 08:27:00,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:00,537 INFO L93 Difference]: Finished difference Result 990 states and 1277 transitions. [2025-02-06 08:27:00,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:27:00,537 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 171 [2025-02-06 08:27:00,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:00,542 INFO L225 Difference]: With dead ends: 990 [2025-02-06 08:27:00,542 INFO L226 Difference]: Without dead ends: 988 [2025-02-06 08:27:00,542 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-02-06 08:27:00,543 INFO L435 NwaCegarLoop]: 1268 mSDtfsCounter, 0 mSDsluCounter, 2533 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3801 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:27:00,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3801 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 08:27:00,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2025-02-06 08:27:00,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 988. [2025-02-06 08:27:00,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 988 states, 658 states have (on average 1.2112462006079028) internal successors, (797), 700 states have internal predecessors, (797), 240 states have call successors, (240), 70 states have call predecessors, (240), 69 states have return successors, (238), 227 states have call predecessors, (238), 238 states have call successors, (238) [2025-02-06 08:27:00,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1275 transitions. [2025-02-06 08:27:00,594 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1275 transitions. Word has length 171 [2025-02-06 08:27:00,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:00,594 INFO L471 AbstractCegarLoop]: Abstraction has 988 states and 1275 transitions. [2025-02-06 08:27:00,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 08:27:00,594 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1275 transitions. [2025-02-06 08:27:00,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-06 08:27:00,595 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:00,596 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-02-06 08:27:00,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 08:27:00,596 INFO L396 AbstractCegarLoop]: === Iteration 14 === 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 31 more)] === [2025-02-06 08:27:00,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:00,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1730770647, now seen corresponding path program 1 times [2025-02-06 08:27:00,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:00,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579655538] [2025-02-06 08:27:00,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:00,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:00,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-06 08:27:00,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-06 08:27:00,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:00,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:01,153 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-06 08:27:01,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:01,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579655538] [2025-02-06 08:27:01,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579655538] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:01,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:27:01,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:27:01,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492403325] [2025-02-06 08:27:01,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:01,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:27:01,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:01,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:27:01,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:27:01,155 INFO L87 Difference]: Start difference. First operand 988 states and 1275 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-02-06 08:27:01,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:01,267 INFO L93 Difference]: Finished difference Result 988 states and 1275 transitions. [2025-02-06 08:27:01,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:27:01,268 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-02-06 08:27:01,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:01,272 INFO L225 Difference]: With dead ends: 988 [2025-02-06 08:27:01,273 INFO L226 Difference]: Without dead ends: 986 [2025-02-06 08:27:01,273 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-02-06 08:27:01,274 INFO L435 NwaCegarLoop]: 1266 mSDtfsCounter, 1231 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1231 SdHoareTripleChecker+Valid, 2531 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:27:01,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1231 Valid, 2531 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 08:27:01,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2025-02-06 08:27:01,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 986. [2025-02-06 08:27:01,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 986 states, 657 states have (on average 1.2100456621004567) internal successors, (795), 698 states have internal predecessors, (795), 240 states have call successors, (240), 70 states have call predecessors, (240), 69 states have return successors, (238), 227 states have call predecessors, (238), 238 states have call successors, (238) [2025-02-06 08:27:01,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 1273 transitions. [2025-02-06 08:27:01,327 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 1273 transitions. Word has length 133 [2025-02-06 08:27:01,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:01,328 INFO L471 AbstractCegarLoop]: Abstraction has 986 states and 1273 transitions. [2025-02-06 08:27:01,328 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-02-06 08:27:01,328 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1273 transitions. [2025-02-06 08:27:01,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-02-06 08:27:01,330 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:01,330 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:27:01,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 08:27:01,330 INFO L396 AbstractCegarLoop]: === Iteration 15 === 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 31 more)] === [2025-02-06 08:27:01,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:01,331 INFO L85 PathProgramCache]: Analyzing trace with hash -428729687, now seen corresponding path program 1 times [2025-02-06 08:27:01,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:01,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564119212] [2025-02-06 08:27:01,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:01,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:01,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-02-06 08:27:01,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-02-06 08:27:01,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:01,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:01,822 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-02-06 08:27:01,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:01,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564119212] [2025-02-06 08:27:01,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564119212] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:01,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:27:01,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 08:27:01,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696830319] [2025-02-06 08:27:01,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:01,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:27:01,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:01,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:27:01,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:27:01,824 INFO L87 Difference]: Start difference. First operand 986 states and 1273 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 08:27:01,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:01,893 INFO L93 Difference]: Finished difference Result 1928 states and 2499 transitions. [2025-02-06 08:27:01,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:27:01,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 178 [2025-02-06 08:27:01,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:01,899 INFO L225 Difference]: With dead ends: 1928 [2025-02-06 08:27:01,899 INFO L226 Difference]: Without dead ends: 982 [2025-02-06 08:27:01,901 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-02-06 08:27:01,902 INFO L435 NwaCegarLoop]: 1262 mSDtfsCounter, 1228 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1228 SdHoareTripleChecker+Valid, 1262 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:27:01,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1228 Valid, 1262 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 08:27:01,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2025-02-06 08:27:01,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 982. [2025-02-06 08:27:01,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 654 states have (on average 1.2079510703363914) internal successors, (790), 694 states have internal predecessors, (790), 240 states have call successors, (240), 70 states have call predecessors, (240), 69 states have return successors, (238), 227 states have call predecessors, (238), 238 states have call successors, (238) [2025-02-06 08:27:01,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1268 transitions. [2025-02-06 08:27:01,955 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1268 transitions. Word has length 178 [2025-02-06 08:27:01,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:01,955 INFO L471 AbstractCegarLoop]: Abstraction has 982 states and 1268 transitions. [2025-02-06 08:27:01,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 08:27:01,955 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1268 transitions. [2025-02-06 08:27:01,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-06 08:27:01,956 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:01,957 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-02-06 08:27:01,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 08:27:01,957 INFO L396 AbstractCegarLoop]: === Iteration 16 === 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 31 more)] === [2025-02-06 08:27:01,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:01,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1275703202, now seen corresponding path program 1 times [2025-02-06 08:27:01,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:01,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637756025] [2025-02-06 08:27:01,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:01,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:02,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-06 08:27:02,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-06 08:27:02,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:02,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:02,478 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-06 08:27:02,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:02,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637756025] [2025-02-06 08:27:02,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637756025] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:02,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:27:02,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:27:02,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401855583] [2025-02-06 08:27:02,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:02,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:27:02,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:02,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:27:02,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:27:02,481 INFO L87 Difference]: Start difference. First operand 982 states and 1268 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-02-06 08:27:02,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:02,566 INFO L93 Difference]: Finished difference Result 982 states and 1268 transitions. [2025-02-06 08:27:02,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:27:02,567 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-02-06 08:27:02,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:02,572 INFO L225 Difference]: With dead ends: 982 [2025-02-06 08:27:02,572 INFO L226 Difference]: Without dead ends: 980 [2025-02-06 08:27:02,573 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-02-06 08:27:02,573 INFO L435 NwaCegarLoop]: 1259 mSDtfsCounter, 1223 mSDsluCounter, 1258 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1223 SdHoareTripleChecker+Valid, 2517 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:27:02,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1223 Valid, 2517 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 08:27:02,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states. [2025-02-06 08:27:02,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 980. [2025-02-06 08:27:02,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 653 states have (on average 1.206738131699847) internal successors, (788), 692 states have internal predecessors, (788), 240 states have call successors, (240), 70 states have call predecessors, (240), 69 states have return successors, (238), 227 states have call predecessors, (238), 238 states have call successors, (238) [2025-02-06 08:27:02,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 1266 transitions. [2025-02-06 08:27:02,628 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 1266 transitions. Word has length 139 [2025-02-06 08:27:02,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:02,628 INFO L471 AbstractCegarLoop]: Abstraction has 980 states and 1266 transitions. [2025-02-06 08:27:02,628 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-02-06 08:27:02,629 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1266 transitions. [2025-02-06 08:27:02,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-06 08:27:02,630 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:02,630 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-02-06 08:27:02,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 08:27:02,630 INFO L396 AbstractCegarLoop]: === Iteration 17 === 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 31 more)] === [2025-02-06 08:27:02,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:02,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1723321166, now seen corresponding path program 1 times [2025-02-06 08:27:02,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:02,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544134761] [2025-02-06 08:27:02,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:02,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:02,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-06 08:27:02,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-06 08:27:02,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:02,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:03,131 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-06 08:27:03,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:03,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544134761] [2025-02-06 08:27:03,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544134761] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:03,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:27:03,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:27:03,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161072919] [2025-02-06 08:27:03,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:03,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:27:03,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:03,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:27:03,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:27:03,134 INFO L87 Difference]: Start difference. First operand 980 states and 1266 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-02-06 08:27:03,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:03,237 INFO L93 Difference]: Finished difference Result 980 states and 1266 transitions. [2025-02-06 08:27:03,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:27:03,237 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-02-06 08:27:03,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:03,242 INFO L225 Difference]: With dead ends: 980 [2025-02-06 08:27:03,242 INFO L226 Difference]: Without dead ends: 978 [2025-02-06 08:27:03,243 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-02-06 08:27:03,244 INFO L435 NwaCegarLoop]: 1257 mSDtfsCounter, 1220 mSDsluCounter, 1256 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1220 SdHoareTripleChecker+Valid, 2513 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:27:03,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1220 Valid, 2513 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 08:27:03,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2025-02-06 08:27:03,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 978. [2025-02-06 08:27:03,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 978 states, 652 states have (on average 1.205521472392638) internal successors, (786), 690 states have internal predecessors, (786), 240 states have call successors, (240), 70 states have call predecessors, (240), 69 states have return successors, (238), 227 states have call predecessors, (238), 238 states have call successors, (238) [2025-02-06 08:27:03,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 1264 transitions. [2025-02-06 08:27:03,352 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 1264 transitions. Word has length 145 [2025-02-06 08:27:03,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:03,352 INFO L471 AbstractCegarLoop]: Abstraction has 978 states and 1264 transitions. [2025-02-06 08:27:03,353 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-02-06 08:27:03,353 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1264 transitions. [2025-02-06 08:27:03,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-06 08:27:03,355 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:03,356 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-02-06 08:27:03,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 08:27:03,356 INFO L396 AbstractCegarLoop]: === Iteration 18 === 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 31 more)] === [2025-02-06 08:27:03,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:03,356 INFO L85 PathProgramCache]: Analyzing trace with hash -970769075, now seen corresponding path program 1 times [2025-02-06 08:27:03,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:03,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921081932] [2025-02-06 08:27:03,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:03,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:03,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-06 08:27:03,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-06 08:27:03,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:03,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:03,920 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-06 08:27:03,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:03,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921081932] [2025-02-06 08:27:03,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921081932] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:03,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:27:03,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:27:03,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075971156] [2025-02-06 08:27:03,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:03,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:27:03,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:03,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:27:03,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:27:03,922 INFO L87 Difference]: Start difference. First operand 978 states and 1264 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-02-06 08:27:04,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:04,030 INFO L93 Difference]: Finished difference Result 978 states and 1264 transitions. [2025-02-06 08:27:04,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:27:04,031 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-02-06 08:27:04,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:04,035 INFO L225 Difference]: With dead ends: 978 [2025-02-06 08:27:04,035 INFO L226 Difference]: Without dead ends: 976 [2025-02-06 08:27:04,036 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-02-06 08:27:04,036 INFO L435 NwaCegarLoop]: 1255 mSDtfsCounter, 1217 mSDsluCounter, 1254 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1217 SdHoareTripleChecker+Valid, 2509 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:27:04,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1217 Valid, 2509 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 08:27:04,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2025-02-06 08:27:04,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 976. [2025-02-06 08:27:04,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 651 states have (on average 1.2043010752688172) internal successors, (784), 688 states have internal predecessors, (784), 240 states have call successors, (240), 70 states have call predecessors, (240), 69 states have return successors, (238), 227 states have call predecessors, (238), 238 states have call successors, (238) [2025-02-06 08:27:04,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1262 transitions. [2025-02-06 08:27:04,096 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1262 transitions. Word has length 151 [2025-02-06 08:27:04,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:04,096 INFO L471 AbstractCegarLoop]: Abstraction has 976 states and 1262 transitions. [2025-02-06 08:27:04,096 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-02-06 08:27:04,096 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1262 transitions. [2025-02-06 08:27:04,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-02-06 08:27:04,098 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:04,098 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 7, 7, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 08:27:04,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 08:27:04,098 INFO L396 AbstractCegarLoop]: === Iteration 19 === 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 31 more)] === [2025-02-06 08:27:04,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:04,099 INFO L85 PathProgramCache]: Analyzing trace with hash 762656652, now seen corresponding path program 1 times [2025-02-06 08:27:04,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:04,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827255496] [2025-02-06 08:27:04,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:04,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:04,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-02-06 08:27:04,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-02-06 08:27:04,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:04,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:04,893 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2025-02-06 08:27:04,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:04,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827255496] [2025-02-06 08:27:04,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827255496] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:04,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:27:04,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 08:27:04,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444519462] [2025-02-06 08:27:04,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:04,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 08:27:04,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:04,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 08:27:04,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:27:04,897 INFO L87 Difference]: Start difference. First operand 976 states and 1262 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-06 08:27:05,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:05,033 INFO L93 Difference]: Finished difference Result 1639 states and 2075 transitions. [2025-02-06 08:27:05,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 08:27:05,034 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) Word has length 187 [2025-02-06 08:27:05,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:05,040 INFO L225 Difference]: With dead ends: 1639 [2025-02-06 08:27:05,040 INFO L226 Difference]: Without dead ends: 981 [2025-02-06 08:27:05,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:27:05,042 INFO L435 NwaCegarLoop]: 1254 mSDtfsCounter, 0 mSDsluCounter, 5009 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6263 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:27:05,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6263 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:27:05,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2025-02-06 08:27:05,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 981. [2025-02-06 08:27:05,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 655 states have (on average 1.203053435114504) internal successors, (788), 692 states have internal predecessors, (788), 240 states have call successors, (240), 70 states have call predecessors, (240), 70 states have return successors, (242), 228 states have call predecessors, (242), 238 states have call successors, (242) [2025-02-06 08:27:05,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1270 transitions. [2025-02-06 08:27:05,109 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1270 transitions. Word has length 187 [2025-02-06 08:27:05,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:05,111 INFO L471 AbstractCegarLoop]: Abstraction has 981 states and 1270 transitions. [2025-02-06 08:27:05,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-06 08:27:05,111 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1270 transitions. [2025-02-06 08:27:05,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-06 08:27:05,112 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:05,112 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-02-06 08:27:05,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 08:27:05,113 INFO L396 AbstractCegarLoop]: === Iteration 20 === 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 31 more)] === [2025-02-06 08:27:05,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:05,113 INFO L85 PathProgramCache]: Analyzing trace with hash -948171506, now seen corresponding path program 1 times [2025-02-06 08:27:05,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:05,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990831905] [2025-02-06 08:27:05,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:05,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:05,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-06 08:27:05,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-06 08:27:05,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:05,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:05,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-02-06 08:27:05,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:05,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990831905] [2025-02-06 08:27:05,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990831905] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:05,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:27:05,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:27:05,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189650850] [2025-02-06 08:27:05,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:05,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:27:05,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:05,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:27:05,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:27:05,761 INFO L87 Difference]: Start difference. First operand 981 states and 1270 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-02-06 08:27:05,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:05,861 INFO L93 Difference]: Finished difference Result 981 states and 1270 transitions. [2025-02-06 08:27:05,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:27:05,861 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-02-06 08:27:05,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:05,866 INFO L225 Difference]: With dead ends: 981 [2025-02-06 08:27:05,867 INFO L226 Difference]: Without dead ends: 979 [2025-02-06 08:27:05,867 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-02-06 08:27:05,869 INFO L435 NwaCegarLoop]: 1253 mSDtfsCounter, 1214 mSDsluCounter, 1252 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1214 SdHoareTripleChecker+Valid, 2505 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:27:05,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1214 Valid, 2505 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 08:27:05,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2025-02-06 08:27:05,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 979. [2025-02-06 08:27:05,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 979 states, 654 states have (on average 1.201834862385321) internal successors, (786), 690 states have internal predecessors, (786), 240 states have call successors, (240), 70 states have call predecessors, (240), 70 states have return successors, (242), 228 states have call predecessors, (242), 238 states have call successors, (242) [2025-02-06 08:27:05,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 979 states and 1268 transitions. [2025-02-06 08:27:05,936 INFO L78 Accepts]: Start accepts. Automaton has 979 states and 1268 transitions. Word has length 157 [2025-02-06 08:27:05,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:05,939 INFO L471 AbstractCegarLoop]: Abstraction has 979 states and 1268 transitions. [2025-02-06 08:27:05,939 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-02-06 08:27:05,939 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 1268 transitions. [2025-02-06 08:27:05,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-06 08:27:05,941 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:05,941 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-02-06 08:27:05,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 08:27:05,941 INFO L396 AbstractCegarLoop]: === Iteration 21 === 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 31 more)] === [2025-02-06 08:27:05,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:05,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1114720425, now seen corresponding path program 1 times [2025-02-06 08:27:05,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:05,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918705874] [2025-02-06 08:27:05,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:05,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:06,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-06 08:27:06,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-06 08:27:06,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:06,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:06,572 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-06 08:27:06,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:06,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918705874] [2025-02-06 08:27:06,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918705874] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:06,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:27:06,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:27:06,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791150422] [2025-02-06 08:27:06,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:06,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:27:06,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:06,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:27:06,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:27:06,574 INFO L87 Difference]: Start difference. First operand 979 states and 1268 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-02-06 08:27:06,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:06,665 INFO L93 Difference]: Finished difference Result 979 states and 1268 transitions. [2025-02-06 08:27:06,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:27:06,665 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-02-06 08:27:06,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:06,670 INFO L225 Difference]: With dead ends: 979 [2025-02-06 08:27:06,670 INFO L226 Difference]: Without dead ends: 977 [2025-02-06 08:27:06,670 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-02-06 08:27:06,671 INFO L435 NwaCegarLoop]: 1251 mSDtfsCounter, 1211 mSDsluCounter, 1250 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1211 SdHoareTripleChecker+Valid, 2501 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:27:06,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1211 Valid, 2501 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 08:27:06,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2025-02-06 08:27:06,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 977. [2025-02-06 08:27:06,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 653 states have (on average 1.2006125574272588) internal successors, (784), 688 states have internal predecessors, (784), 240 states have call successors, (240), 70 states have call predecessors, (240), 70 states have return successors, (242), 228 states have call predecessors, (242), 238 states have call successors, (242) [2025-02-06 08:27:06,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1266 transitions. [2025-02-06 08:27:06,735 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1266 transitions. Word has length 163 [2025-02-06 08:27:06,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:06,735 INFO L471 AbstractCegarLoop]: Abstraction has 977 states and 1266 transitions. [2025-02-06 08:27:06,736 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-02-06 08:27:06,736 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1266 transitions. [2025-02-06 08:27:06,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-02-06 08:27:06,738 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:06,738 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-02-06 08:27:06,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 08:27:06,738 INFO L396 AbstractCegarLoop]: === Iteration 22 === 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 31 more)] === [2025-02-06 08:27:06,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:06,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1804739358, now seen corresponding path program 1 times [2025-02-06 08:27:06,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:06,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93062023] [2025-02-06 08:27:06,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:06,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:07,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-02-06 08:27:07,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-02-06 08:27:07,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:07,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:07,236 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-06 08:27:07,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:07,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93062023] [2025-02-06 08:27:07,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93062023] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:07,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:27:07,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:27:07,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587532007] [2025-02-06 08:27:07,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:07,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:27:07,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:07,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:27:07,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:27:07,237 INFO L87 Difference]: Start difference. First operand 977 states and 1266 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-02-06 08:27:07,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:07,330 INFO L93 Difference]: Finished difference Result 977 states and 1266 transitions. [2025-02-06 08:27:07,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:27:07,330 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-02-06 08:27:07,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:07,335 INFO L225 Difference]: With dead ends: 977 [2025-02-06 08:27:07,335 INFO L226 Difference]: Without dead ends: 975 [2025-02-06 08:27:07,336 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-02-06 08:27:07,337 INFO L435 NwaCegarLoop]: 1249 mSDtfsCounter, 1208 mSDsluCounter, 1248 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1208 SdHoareTripleChecker+Valid, 2497 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:27:07,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1208 Valid, 2497 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 08:27:07,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2025-02-06 08:27:07,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 975. [2025-02-06 08:27:07,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 975 states, 652 states have (on average 1.1993865030674846) internal successors, (782), 686 states have internal predecessors, (782), 240 states have call successors, (240), 70 states have call predecessors, (240), 70 states have return successors, (242), 228 states have call predecessors, (242), 238 states have call successors, (242) [2025-02-06 08:27:07,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 1264 transitions. [2025-02-06 08:27:07,403 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 1264 transitions. Word has length 169 [2025-02-06 08:27:07,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:07,404 INFO L471 AbstractCegarLoop]: Abstraction has 975 states and 1264 transitions. [2025-02-06 08:27:07,404 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-02-06 08:27:07,404 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1264 transitions. [2025-02-06 08:27:07,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-02-06 08:27:07,406 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:07,406 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:27:07,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 08:27:07,406 INFO L396 AbstractCegarLoop]: === Iteration 23 === 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 31 more)] === [2025-02-06 08:27:07,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:07,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1834178765, now seen corresponding path program 1 times [2025-02-06 08:27:07,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:07,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442363500] [2025-02-06 08:27:07,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:07,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:07,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-02-06 08:27:07,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-02-06 08:27:07,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:07,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:07,916 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 383 trivial. 0 not checked. [2025-02-06 08:27:07,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:07,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442363500] [2025-02-06 08:27:07,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442363500] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:07,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:27:07,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 08:27:07,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127249897] [2025-02-06 08:27:07,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:07,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:27:07,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:07,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:27:07,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:27:07,918 INFO L87 Difference]: Start difference. First operand 975 states and 1264 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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-02-06 08:27:08,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:08,015 INFO L93 Difference]: Finished difference Result 1739 states and 2225 transitions. [2025-02-06 08:27:08,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:27:08,016 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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 211 [2025-02-06 08:27:08,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:08,021 INFO L225 Difference]: With dead ends: 1739 [2025-02-06 08:27:08,021 INFO L226 Difference]: Without dead ends: 971 [2025-02-06 08:27:08,023 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-02-06 08:27:08,024 INFO L435 NwaCegarLoop]: 1245 mSDtfsCounter, 1228 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1228 SdHoareTripleChecker+Valid, 1245 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:27:08,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1228 Valid, 1245 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 08:27:08,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2025-02-06 08:27:08,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 971. [2025-02-06 08:27:08,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 649 states have (on average 1.197226502311248) internal successors, (777), 682 states have internal predecessors, (777), 240 states have call successors, (240), 70 states have call predecessors, (240), 70 states have return successors, (242), 228 states have call predecessors, (242), 238 states have call successors, (242) [2025-02-06 08:27:08,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1259 transitions. [2025-02-06 08:27:08,088 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1259 transitions. Word has length 211 [2025-02-06 08:27:08,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:08,089 INFO L471 AbstractCegarLoop]: Abstraction has 971 states and 1259 transitions. [2025-02-06 08:27:08,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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-02-06 08:27:08,090 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1259 transitions. [2025-02-06 08:27:08,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-02-06 08:27:08,091 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:08,092 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 7, 7, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 08:27:08,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 08:27:08,092 INFO L396 AbstractCegarLoop]: === Iteration 24 === 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 31 more)] === [2025-02-06 08:27:08,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:08,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1558667491, now seen corresponding path program 1 times [2025-02-06 08:27:08,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:08,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237388297] [2025-02-06 08:27:08,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:08,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:08,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-02-06 08:27:08,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-02-06 08:27:08,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:08,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:08,845 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2025-02-06 08:27:08,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:08,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237388297] [2025-02-06 08:27:08,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237388297] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:08,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:27:08,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 08:27:08,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300245373] [2025-02-06 08:27:08,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:08,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 08:27:08,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:08,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 08:27:08,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:27:08,846 INFO L87 Difference]: Start difference. First operand 971 states and 1259 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), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-02-06 08:27:08,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:08,969 INFO L93 Difference]: Finished difference Result 1031 states and 1314 transitions. [2025-02-06 08:27:08,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 08:27:08,970 INFO L78 Accepts]: Start accepts. Automaton has 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), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 203 [2025-02-06 08:27:08,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:08,975 INFO L225 Difference]: With dead ends: 1031 [2025-02-06 08:27:08,975 INFO L226 Difference]: Without dead ends: 1029 [2025-02-06 08:27:08,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:27:08,976 INFO L435 NwaCegarLoop]: 1241 mSDtfsCounter, 1025 mSDsluCounter, 2695 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1026 SdHoareTripleChecker+Valid, 3936 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:27:08,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1026 Valid, 3936 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 08:27:08,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2025-02-06 08:27:09,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 1025. [2025-02-06 08:27:09,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 685 states have (on average 1.1883211678832117) internal successors, (814), 717 states have internal predecessors, (814), 247 states have call successors, (247), 82 states have call predecessors, (247), 82 states have return successors, (249), 235 states have call predecessors, (249), 245 states have call successors, (249) [2025-02-06 08:27:09,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1310 transitions. [2025-02-06 08:27:09,050 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1310 transitions. Word has length 203 [2025-02-06 08:27:09,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:09,050 INFO L471 AbstractCegarLoop]: Abstraction has 1025 states and 1310 transitions. [2025-02-06 08:27:09,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has 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), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-02-06 08:27:09,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1310 transitions. [2025-02-06 08:27:09,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-06 08:27:09,054 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:09,054 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, 1, 1, 1, 1, 1, 1] [2025-02-06 08:27:09,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-06 08:27:09,055 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_linux_usb_coherent_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 31 more)] === [2025-02-06 08:27:09,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:09,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1753676057, now seen corresponding path program 1 times [2025-02-06 08:27:09,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:09,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268686063] [2025-02-06 08:27:09,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:09,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:09,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-06 08:27:09,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-06 08:27:09,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:09,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:09,668 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-06 08:27:09,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:09,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268686063] [2025-02-06 08:27:09,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268686063] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:09,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:27:09,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:27:09,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900270861] [2025-02-06 08:27:09,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:09,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:27:09,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:09,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:27:09,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:27:09,670 INFO L87 Difference]: Start difference. First operand 1025 states and 1310 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-02-06 08:27:09,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:09,891 INFO L93 Difference]: Finished difference Result 1938 states and 2471 transitions. [2025-02-06 08:27:09,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:27:09,892 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 175 [2025-02-06 08:27:09,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:09,902 INFO L225 Difference]: With dead ends: 1938 [2025-02-06 08:27:09,902 INFO L226 Difference]: Without dead ends: 1936 [2025-02-06 08:27:09,904 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-02-06 08:27:09,904 INFO L435 NwaCegarLoop]: 1429 mSDtfsCounter, 1196 mSDsluCounter, 2510 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1196 SdHoareTripleChecker+Valid, 3939 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:27:09,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1196 Valid, 3939 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:27:09,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1936 states. [2025-02-06 08:27:10,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1936 to 1903. [2025-02-06 08:27:10,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1903 states, 1278 states have (on average 1.1885758998435054) internal successors, (1519), 1326 states have internal predecessors, (1519), 454 states have call successors, (454), 159 states have call predecessors, (454), 160 states have return successors, (470), 435 states have call predecessors, (470), 452 states have call successors, (470) [2025-02-06 08:27:10,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1903 states to 1903 states and 2443 transitions. [2025-02-06 08:27:10,058 INFO L78 Accepts]: Start accepts. Automaton has 1903 states and 2443 transitions. Word has length 175 [2025-02-06 08:27:10,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:10,059 INFO L471 AbstractCegarLoop]: Abstraction has 1903 states and 2443 transitions. [2025-02-06 08:27:10,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-02-06 08:27:10,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1903 states and 2443 transitions. [2025-02-06 08:27:10,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-02-06 08:27:10,061 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:10,061 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:27:10,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-06 08:27:10,061 INFO L396 AbstractCegarLoop]: === Iteration 26 === 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 31 more)] === [2025-02-06 08:27:10,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:10,062 INFO L85 PathProgramCache]: Analyzing trace with hash -761173966, now seen corresponding path program 1 times [2025-02-06 08:27:10,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:10,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514579879] [2025-02-06 08:27:10,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:10,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:10,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-02-06 08:27:10,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-02-06 08:27:10,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:10,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:10,587 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2025-02-06 08:27:10,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:10,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514579879] [2025-02-06 08:27:10,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514579879] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:27:10,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064348867] [2025-02-06 08:27:10,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:10,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:27:10,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:27:10,590 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-02-06 08:27:10,591 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-02-06 08:27:11,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-02-06 08:27:11,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-02-06 08:27:11,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:11,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:11,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 2283 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 08:27:11,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:27:12,020 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-02-06 08:27:12,021 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 08:27:12,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064348867] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:12,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 08:27:12,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-02-06 08:27:12,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918761926] [2025-02-06 08:27:12,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:12,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:27:12,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:12,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:27:12,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:27:12,022 INFO L87 Difference]: Start difference. First operand 1903 states and 2443 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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-02-06 08:27:12,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:12,234 INFO L93 Difference]: Finished difference Result 3548 states and 4500 transitions. [2025-02-06 08:27:12,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:27:12,235 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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 217 [2025-02-06 08:27:12,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:12,250 INFO L225 Difference]: With dead ends: 3548 [2025-02-06 08:27:12,250 INFO L226 Difference]: Without dead ends: 1953 [2025-02-06 08:27:12,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:27:12,257 INFO L435 NwaCegarLoop]: 1303 mSDtfsCounter, 1170 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1170 SdHoareTripleChecker+Valid, 1370 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:27:12,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1170 Valid, 1370 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 08:27:12,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1953 states. [2025-02-06 08:27:12,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1953 to 1950. [2025-02-06 08:27:12,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1950 states, 1305 states have (on average 1.1839080459770115) internal successors, (1545), 1356 states have internal predecessors, (1545), 469 states have call successors, (469), 165 states have call predecessors, (469), 166 states have return successors, (485), 448 states have call predecessors, (485), 467 states have call successors, (485) [2025-02-06 08:27:12,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1950 states to 1950 states and 2499 transitions. [2025-02-06 08:27:12,415 INFO L78 Accepts]: Start accepts. Automaton has 1950 states and 2499 transitions. Word has length 217 [2025-02-06 08:27:12,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:12,416 INFO L471 AbstractCegarLoop]: Abstraction has 1950 states and 2499 transitions. [2025-02-06 08:27:12,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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-02-06 08:27:12,416 INFO L276 IsEmpty]: Start isEmpty. Operand 1950 states and 2499 transitions. [2025-02-06 08:27:12,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-02-06 08:27:12,419 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:12,419 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:27:12,435 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-02-06 08:27:12,624 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,SelfDestructingSolverStorable25 [2025-02-06 08:27:12,624 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_linux_usb_gadget_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 31 more)] === [2025-02-06 08:27:12,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:12,624 INFO L85 PathProgramCache]: Analyzing trace with hash 155048814, now seen corresponding path program 1 times [2025-02-06 08:27:12,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:12,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210795948] [2025-02-06 08:27:12,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:12,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:12,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-02-06 08:27:12,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-02-06 08:27:12,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:12,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:13,134 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-06 08:27:13,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:13,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210795948] [2025-02-06 08:27:13,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210795948] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:13,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:27:13,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:27:13,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440106731] [2025-02-06 08:27:13,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:13,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:27:13,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:13,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:27:13,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:27:13,135 INFO L87 Difference]: Start difference. First operand 1950 states and 2499 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-02-06 08:27:13,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:13,373 INFO L93 Difference]: Finished difference Result 1950 states and 2499 transitions. [2025-02-06 08:27:13,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:27:13,374 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 181 [2025-02-06 08:27:13,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:13,381 INFO L225 Difference]: With dead ends: 1950 [2025-02-06 08:27:13,381 INFO L226 Difference]: Without dead ends: 1948 [2025-02-06 08:27:13,382 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-02-06 08:27:13,382 INFO L435 NwaCegarLoop]: 1235 mSDtfsCounter, 1192 mSDsluCounter, 1234 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1192 SdHoareTripleChecker+Valid, 2469 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:27:13,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1192 Valid, 2469 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 08:27:13,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1948 states. [2025-02-06 08:27:13,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1948 to 1948. [2025-02-06 08:27:13,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1948 states, 1304 states have (on average 1.1832822085889572) internal successors, (1543), 1354 states have internal predecessors, (1543), 469 states have call successors, (469), 165 states have call predecessors, (469), 166 states have return successors, (485), 448 states have call predecessors, (485), 467 states have call successors, (485) [2025-02-06 08:27:13,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1948 states to 1948 states and 2497 transitions. [2025-02-06 08:27:13,537 INFO L78 Accepts]: Start accepts. Automaton has 1948 states and 2497 transitions. Word has length 181 [2025-02-06 08:27:13,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:13,537 INFO L471 AbstractCegarLoop]: Abstraction has 1948 states and 2497 transitions. [2025-02-06 08:27:13,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-02-06 08:27:13,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1948 states and 2497 transitions. [2025-02-06 08:27:13,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-02-06 08:27:13,539 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:13,539 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 7, 7, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 08:27:13,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-06 08:27:13,539 INFO L396 AbstractCegarLoop]: === Iteration 28 === 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 31 more)] === [2025-02-06 08:27:13,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:13,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1528321866, now seen corresponding path program 1 times [2025-02-06 08:27:13,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:13,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377868810] [2025-02-06 08:27:13,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:13,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:13,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-02-06 08:27:13,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-02-06 08:27:13,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:13,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:14,281 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2025-02-06 08:27:14,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:14,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377868810] [2025-02-06 08:27:14,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377868810] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:14,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:27:14,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 08:27:14,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470652226] [2025-02-06 08:27:14,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:14,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 08:27:14,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:14,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 08:27:14,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:27:14,282 INFO L87 Difference]: Start difference. First operand 1948 states and 2497 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (29), 2 states have call predecessors, (29), 1 states have call successors, (29) [2025-02-06 08:27:18,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 08:27:18,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:18,515 INFO L93 Difference]: Finished difference Result 1952 states and 2499 transitions. [2025-02-06 08:27:18,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 08:27:18,515 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (29), 2 states have call predecessors, (29), 1 states have call successors, (29) Word has length 214 [2025-02-06 08:27:18,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:18,523 INFO L225 Difference]: With dead ends: 1952 [2025-02-06 08:27:18,523 INFO L226 Difference]: Without dead ends: 1950 [2025-02-06 08:27:18,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:27:18,524 INFO L435 NwaCegarLoop]: 1287 mSDtfsCounter, 212 mSDsluCounter, 3642 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 4929 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:27:18,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 4929 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-06 08:27:18,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1950 states. [2025-02-06 08:27:18,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1950 to 1946. [2025-02-06 08:27:18,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1946 states, 1303 states have (on average 1.1818879508825786) internal successors, (1540), 1352 states have internal predecessors, (1540), 469 states have call successors, (469), 165 states have call predecessors, (469), 166 states have return successors, (485), 448 states have call predecessors, (485), 467 states have call successors, (485) [2025-02-06 08:27:18,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1946 states and 2494 transitions. [2025-02-06 08:27:18,677 INFO L78 Accepts]: Start accepts. Automaton has 1946 states and 2494 transitions. Word has length 214 [2025-02-06 08:27:18,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:18,678 INFO L471 AbstractCegarLoop]: Abstraction has 1946 states and 2494 transitions. [2025-02-06 08:27:18,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (29), 2 states have call predecessors, (29), 1 states have call successors, (29) [2025-02-06 08:27:18,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 2494 transitions. [2025-02-06 08:27:18,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-02-06 08:27:18,680 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:18,681 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:27:18,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-06 08:27:18,681 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ldv_linux_usb_urb_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 31 more)] === [2025-02-06 08:27:18,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:18,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1095151654, now seen corresponding path program 1 times [2025-02-06 08:27:18,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:18,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270400732] [2025-02-06 08:27:18,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:18,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:19,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-02-06 08:27:19,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-02-06 08:27:19,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:19,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:19,329 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-06 08:27:19,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:19,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270400732] [2025-02-06 08:27:19,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270400732] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:19,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:27:19,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:27:19,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939548631] [2025-02-06 08:27:19,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:19,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:27:19,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:19,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:27:19,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:27:19,332 INFO L87 Difference]: Start difference. First operand 1946 states and 2494 transitions. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-02-06 08:27:19,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:19,772 INFO L93 Difference]: Finished difference Result 3749 states and 4825 transitions. [2025-02-06 08:27:19,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:27:19,773 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 187 [2025-02-06 08:27:19,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:19,789 INFO L225 Difference]: With dead ends: 3749 [2025-02-06 08:27:19,789 INFO L226 Difference]: Without dead ends: 3591 [2025-02-06 08:27:19,794 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-02-06 08:27:19,795 INFO L435 NwaCegarLoop]: 1377 mSDtfsCounter, 1185 mSDsluCounter, 2484 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1185 SdHoareTripleChecker+Valid, 3861 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:27:19,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1185 Valid, 3861 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:27:19,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3591 states. [2025-02-06 08:27:20,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3591 to 3573. [2025-02-06 08:27:20,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3573 states, 2407 states have (on average 1.1882010801828002) internal successors, (2860), 2487 states have internal predecessors, (2860), 854 states have call successors, (854), 302 states have call predecessors, (854), 304 states have return successors, (914), 819 states have call predecessors, (914), 850 states have call successors, (914) [2025-02-06 08:27:20,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3573 states to 3573 states and 4628 transitions. [2025-02-06 08:27:20,147 INFO L78 Accepts]: Start accepts. Automaton has 3573 states and 4628 transitions. Word has length 187 [2025-02-06 08:27:20,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:20,148 INFO L471 AbstractCegarLoop]: Abstraction has 3573 states and 4628 transitions. [2025-02-06 08:27:20,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-02-06 08:27:20,148 INFO L276 IsEmpty]: Start isEmpty. Operand 3573 states and 4628 transitions. [2025-02-06 08:27:20,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-02-06 08:27:20,150 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:20,150 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 08:27:20,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-06 08:27:20,150 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ldv_assert_linux_kernel_locking_spinlock__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 31 more)] === [2025-02-06 08:27:20,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:20,151 INFO L85 PathProgramCache]: Analyzing trace with hash 490436756, now seen corresponding path program 1 times [2025-02-06 08:27:20,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:20,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278961803] [2025-02-06 08:27:20,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:20,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:20,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-02-06 08:27:20,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-02-06 08:27:20,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:20,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:20,673 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 413 trivial. 0 not checked. [2025-02-06 08:27:20,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:20,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278961803] [2025-02-06 08:27:20,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278961803] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:20,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:27:20,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 08:27:20,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583474032] [2025-02-06 08:27:20,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:20,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 08:27:20,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:20,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 08:27:20,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:27:20,675 INFO L87 Difference]: Start difference. First operand 3573 states and 4628 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-02-06 08:27:20,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:20,988 INFO L93 Difference]: Finished difference Result 6611 states and 8532 transitions. [2025-02-06 08:27:20,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 08:27:20,988 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 230 [2025-02-06 08:27:20,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:21,004 INFO L225 Difference]: With dead ends: 6611 [2025-02-06 08:27:21,005 INFO L226 Difference]: Without dead ends: 3585 [2025-02-06 08:27:21,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:27:21,016 INFO L435 NwaCegarLoop]: 1232 mSDtfsCounter, 0 mSDsluCounter, 3690 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4922 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:27:21,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4922 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 08:27:21,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3585 states. [2025-02-06 08:27:21,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3585 to 3585. [2025-02-06 08:27:21,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3585 states, 2419 states have (on average 1.187267465894998) internal successors, (2872), 2499 states have internal predecessors, (2872), 854 states have call successors, (854), 302 states have call predecessors, (854), 304 states have return successors, (914), 819 states have call predecessors, (914), 850 states have call successors, (914) [2025-02-06 08:27:21,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3585 states to 3585 states and 4640 transitions. [2025-02-06 08:27:21,360 INFO L78 Accepts]: Start accepts. Automaton has 3585 states and 4640 transitions. Word has length 230 [2025-02-06 08:27:21,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:21,361 INFO L471 AbstractCegarLoop]: Abstraction has 3585 states and 4640 transitions. [2025-02-06 08:27:21,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-02-06 08:27:21,361 INFO L276 IsEmpty]: Start isEmpty. Operand 3585 states and 4640 transitions. [2025-02-06 08:27:21,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-02-06 08:27:21,363 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:21,364 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 08:27:21,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-06 08:27:21,364 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ldv_assert_linux_kernel_locking_spinlock__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 31 more)] === [2025-02-06 08:27:21,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:21,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1198506986, now seen corresponding path program 1 times [2025-02-06 08:27:21,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:21,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366163972] [2025-02-06 08:27:21,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:21,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:21,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-02-06 08:27:21,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-02-06 08:27:21,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:21,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:22,134 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 413 trivial. 0 not checked. [2025-02-06 08:27:22,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:22,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366163972] [2025-02-06 08:27:22,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366163972] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:22,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:27:22,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 08:27:22,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608211597] [2025-02-06 08:27:22,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:22,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 08:27:22,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:22,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 08:27:22,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:27:22,135 INFO L87 Difference]: Start difference. First operand 3585 states and 4640 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (32), 3 states have call predecessors, (32), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-02-06 08:27:22,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:22,484 INFO L93 Difference]: Finished difference Result 3641 states and 4680 transitions. [2025-02-06 08:27:22,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 08:27:22,484 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (32), 3 states have call predecessors, (32), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 230 [2025-02-06 08:27:22,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:22,502 INFO L225 Difference]: With dead ends: 3641 [2025-02-06 08:27:22,502 INFO L226 Difference]: Without dead ends: 3639 [2025-02-06 08:27:22,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:27:22,505 INFO L435 NwaCegarLoop]: 1229 mSDtfsCounter, 1109 mSDsluCounter, 2497 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1110 SdHoareTripleChecker+Valid, 3726 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:27:22,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1110 Valid, 3726 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 08:27:22,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3639 states. [2025-02-06 08:27:22,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3639 to 3639. [2025-02-06 08:27:22,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3639 states, 2458 states have (on average 1.1810414971521561) internal successors, (2903), 2537 states have internal predecessors, (2903), 854 states have call successors, (854), 318 states have call predecessors, (854), 320 states have return successors, (914), 819 states have call predecessors, (914), 850 states have call successors, (914) [2025-02-06 08:27:22,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3639 states to 3639 states and 4671 transitions. [2025-02-06 08:27:22,822 INFO L78 Accepts]: Start accepts. Automaton has 3639 states and 4671 transitions. Word has length 230 [2025-02-06 08:27:22,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:22,826 INFO L471 AbstractCegarLoop]: Abstraction has 3639 states and 4671 transitions. [2025-02-06 08:27:22,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (32), 3 states have call predecessors, (32), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-02-06 08:27:22,826 INFO L276 IsEmpty]: Start isEmpty. Operand 3639 states and 4671 transitions. [2025-02-06 08:27:22,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-02-06 08:27:22,829 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:22,829 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 08:27:22,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-06 08:27:22,829 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2025-02-06 08:27:22,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:22,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1830217577, now seen corresponding path program 1 times [2025-02-06 08:27:22,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:22,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887130533] [2025-02-06 08:27:22,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:22,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:23,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-02-06 08:27:23,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-02-06 08:27:23,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:23,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:24,399 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 9 proven. 28 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2025-02-06 08:27:24,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:24,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887130533] [2025-02-06 08:27:24,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887130533] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:27:24,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997519932] [2025-02-06 08:27:24,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:24,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:27:24,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:27:24,402 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:27:24,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 08:27:25,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-02-06 08:27:25,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-02-06 08:27:25,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:25,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:25,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 2462 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-06 08:27:25,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:27:26,229 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 358 trivial. 0 not checked. [2025-02-06 08:27:26,229 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 08:27:26,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997519932] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:26,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 08:27:26,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [18] total 27 [2025-02-06 08:27:26,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436927564] [2025-02-06 08:27:26,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:26,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 08:27:26,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:26,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 08:27:26,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=649, Unknown=0, NotChecked=0, Total=702 [2025-02-06 08:27:26,232 INFO L87 Difference]: Start difference. First operand 3639 states and 4671 transitions. Second operand has 13 states, 12 states have (on average 8.0) internal successors, (96), 12 states have internal predecessors, (96), 5 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (29), 5 states have call predecessors, (29), 5 states have call successors, (29) [2025-02-06 08:27:27,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:27,575 INFO L93 Difference]: Finished difference Result 6570 states and 8299 transitions. [2025-02-06 08:27:27,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-06 08:27:27,575 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.0) internal successors, (96), 12 states have internal predecessors, (96), 5 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (29), 5 states have call predecessors, (29), 5 states have call successors, (29) Word has length 229 [2025-02-06 08:27:27,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:27,593 INFO L225 Difference]: With dead ends: 6570 [2025-02-06 08:27:27,593 INFO L226 Difference]: Without dead ends: 3880 [2025-02-06 08:27:27,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=95, Invalid=1165, Unknown=0, NotChecked=0, Total=1260 [2025-02-06 08:27:27,601 INFO L435 NwaCegarLoop]: 1253 mSDtfsCounter, 38 mSDsluCounter, 13674 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 14927 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 08:27:27,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 14927 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 08:27:27,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3880 states. [2025-02-06 08:27:27,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3880 to 3675. [2025-02-06 08:27:27,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3675 states, 2486 states have (on average 1.1790024135156878) internal successors, (2931), 2565 states have internal predecessors, (2931), 862 states have call successors, (862), 318 states have call predecessors, (862), 320 states have return successors, (922), 827 states have call predecessors, (922), 858 states have call successors, (922) [2025-02-06 08:27:27,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3675 states to 3675 states and 4715 transitions. [2025-02-06 08:27:27,938 INFO L78 Accepts]: Start accepts. Automaton has 3675 states and 4715 transitions. Word has length 229 [2025-02-06 08:27:27,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:27,939 INFO L471 AbstractCegarLoop]: Abstraction has 3675 states and 4715 transitions. [2025-02-06 08:27:27,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.0) internal successors, (96), 12 states have internal predecessors, (96), 5 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (29), 5 states have call predecessors, (29), 5 states have call successors, (29) [2025-02-06 08:27:27,939 INFO L276 IsEmpty]: Start isEmpty. Operand 3675 states and 4715 transitions. [2025-02-06 08:27:27,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2025-02-06 08:27:27,941 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:27,941 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:27:27,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 08:27:28,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:27:28,142 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2025-02-06 08:27:28,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:28,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1341096415, now seen corresponding path program 1 times [2025-02-06 08:27:28,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:28,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516647818] [2025-02-06 08:27:28,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:28,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:28,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-02-06 08:27:28,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-02-06 08:27:28,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:28,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:28,656 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-02-06 08:27:28,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:28,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516647818] [2025-02-06 08:27:28,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516647818] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:28,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:27:28,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 08:27:28,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128524126] [2025-02-06 08:27:28,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:28,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:27:28,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:28,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:27:28,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:27:28,658 INFO L87 Difference]: Start difference. First operand 3675 states and 4715 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2025-02-06 08:27:29,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:29,215 INFO L93 Difference]: Finished difference Result 6805 states and 8634 transitions. [2025-02-06 08:27:29,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:27:29,216 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 238 [2025-02-06 08:27:29,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:29,232 INFO L225 Difference]: With dead ends: 6805 [2025-02-06 08:27:29,232 INFO L226 Difference]: Without dead ends: 3676 [2025-02-06 08:27:29,240 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-02-06 08:27:29,241 INFO L435 NwaCegarLoop]: 1232 mSDtfsCounter, 0 mSDsluCounter, 1202 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2434 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 08:27:29,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2434 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 08:27:29,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3676 states. [2025-02-06 08:27:29,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3676 to 3676. [2025-02-06 08:27:29,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3676 states, 2487 states have (on average 1.178930438279051) internal successors, (2932), 2565 states have internal predecessors, (2932), 862 states have call successors, (862), 318 states have call predecessors, (862), 320 states have return successors, (922), 828 states have call predecessors, (922), 858 states have call successors, (922) [2025-02-06 08:27:29,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3676 states to 3676 states and 4716 transitions. [2025-02-06 08:27:29,584 INFO L78 Accepts]: Start accepts. Automaton has 3676 states and 4716 transitions. Word has length 238 [2025-02-06 08:27:29,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:29,585 INFO L471 AbstractCegarLoop]: Abstraction has 3676 states and 4716 transitions. [2025-02-06 08:27:29,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2025-02-06 08:27:29,585 INFO L276 IsEmpty]: Start isEmpty. Operand 3676 states and 4716 transitions. [2025-02-06 08:27:29,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2025-02-06 08:27:29,587 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:29,587 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 08:27:29,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-06 08:27:29,588 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2025-02-06 08:27:29,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:29,588 INFO L85 PathProgramCache]: Analyzing trace with hash 286640636, now seen corresponding path program 1 times [2025-02-06 08:27:29,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:29,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451850382] [2025-02-06 08:27:29,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:29,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:29,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-02-06 08:27:29,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-02-06 08:27:29,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:29,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:30,558 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-02-06 08:27:30,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:30,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451850382] [2025-02-06 08:27:30,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451850382] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:30,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:27:30,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 08:27:30,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476481563] [2025-02-06 08:27:30,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:30,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 08:27:30,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:30,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 08:27:30,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-06 08:27:30,562 INFO L87 Difference]: Start difference. First operand 3676 states and 4716 transitions. Second operand has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 4 states have call successors, (29), 3 states have call predecessors, (29), 1 states have return successors, (26), 4 states have call predecessors, (26), 4 states have call successors, (26) [2025-02-06 08:27:34,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 08:27:38,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 08:27:42,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []