./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 5574142529d95f295134c1dccd4c5dbe0383ae5c309e7dc50fd933e5702659ed --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 05:00:09,165 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 05:00:09,234 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-19 05:00:09,241 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 05:00:09,242 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 05:00:09,278 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 05:00:09,279 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 05:00:09,280 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 05:00:09,281 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 05:00:09,283 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 05:00:09,283 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 05:00:09,283 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 05:00:09,284 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 05:00:09,285 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 05:00:09,286 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 05:00:09,287 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 05:00:09,287 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 05:00:09,288 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 05:00:09,288 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 05:00:09,288 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 05:00:09,288 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 05:00:09,289 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 05:00:09,289 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 05:00:09,289 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 05:00:09,290 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 05:00:09,290 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 05:00:09,290 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 05:00:09,290 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 05:00:09,291 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 05:00:09,291 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:00:09,291 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 05:00:09,292 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 05:00:09,292 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 05:00:09,296 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 05:00:09,296 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 05:00:09,297 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 05:00:09,297 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 05:00:09,298 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 05:00:09,298 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 05:00:09,298 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5574142529d95f295134c1dccd4c5dbe0383ae5c309e7dc50fd933e5702659ed [2024-11-19 05:00:09,555 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 05:00:09,582 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 05:00:09,586 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 05:00:09,587 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 05:00:09,588 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 05:00:09,589 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i [2024-11-19 05:00:11,135 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 05:00:11,712 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 05:00:11,713 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i [2024-11-19 05:00:11,775 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29551bb95/8e8dbfbe9271454795d89ac9a86c6f99/FLAGe878aa1a9 [2024-11-19 05:00:11,789 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29551bb95/8e8dbfbe9271454795d89ac9a86c6f99 [2024-11-19 05:00:11,792 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 05:00:11,794 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 05:00:11,796 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 05:00:11,796 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 05:00:11,804 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 05:00:11,805 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:00:11" (1/1) ... [2024-11-19 05:00:11,808 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d8d77e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:00:11, skipping insertion in model container [2024-11-19 05:00:11,808 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:00:11" (1/1) ... [2024-11-19 05:00:11,989 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 05:00:15,954 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273031,273044] [2024-11-19 05:00:15,960 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273176,273189] [2024-11-19 05:00:15,963 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273322,273335] [2024-11-19 05:00:15,963 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273487,273500] [2024-11-19 05:00:15,964 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273645,273658] [2024-11-19 05:00:15,964 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273803,273816] [2024-11-19 05:00:15,965 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273961,273974] [2024-11-19 05:00:15,965 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274121,274134] [2024-11-19 05:00:15,966 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274280,274293] [2024-11-19 05:00:15,966 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274419,274432] [2024-11-19 05:00:15,966 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274561,274574] [2024-11-19 05:00:15,967 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274710,274723] [2024-11-19 05:00:15,968 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274849,274862] [2024-11-19 05:00:15,968 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275004,275017] [2024-11-19 05:00:15,969 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275164,275177] [2024-11-19 05:00:15,970 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275315,275328] [2024-11-19 05:00:15,971 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275466,275479] [2024-11-19 05:00:15,971 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275618,275631] [2024-11-19 05:00:15,976 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275767,275780] [2024-11-19 05:00:15,976 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275915,275928] [2024-11-19 05:00:15,977 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276072,276085] [2024-11-19 05:00:15,977 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276221,276234] [2024-11-19 05:00:15,977 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276377,276390] [2024-11-19 05:00:15,978 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276530,276543] [2024-11-19 05:00:15,978 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276676,276689] [2024-11-19 05:00:15,983 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276819,276832] [2024-11-19 05:00:15,983 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276971,276984] [2024-11-19 05:00:15,984 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277117,277130] [2024-11-19 05:00:15,984 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277262,277275] [2024-11-19 05:00:15,984 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277416,277429] [2024-11-19 05:00:15,984 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277567,277580] [2024-11-19 05:00:15,985 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277722,277735] [2024-11-19 05:00:15,985 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277874,277887] [2024-11-19 05:00:15,986 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278029,278042] [2024-11-19 05:00:15,989 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278193,278206] [2024-11-19 05:00:15,990 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278349,278362] [2024-11-19 05:00:15,990 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278513,278526] [2024-11-19 05:00:15,991 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278655,278668] [2024-11-19 05:00:15,991 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278813,278826] [2024-11-19 05:00:15,991 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278980,278993] [2024-11-19 05:00:15,992 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279139,279152] [2024-11-19 05:00:15,992 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279298,279311] [2024-11-19 05:00:15,993 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279447,279460] [2024-11-19 05:00:15,994 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279594,279607] [2024-11-19 05:00:15,995 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279733,279746] [2024-11-19 05:00:15,995 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279896,279909] [2024-11-19 05:00:15,996 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280062,280075] [2024-11-19 05:00:15,996 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280226,280239] [2024-11-19 05:00:15,996 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280391,280404] [2024-11-19 05:00:15,998 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280556,280569] [2024-11-19 05:00:15,998 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280722,280735] [2024-11-19 05:00:15,998 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280887,280900] [2024-11-19 05:00:15,999 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281054,281067] [2024-11-19 05:00:16,000 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281214,281227] [2024-11-19 05:00:16,000 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281376,281389] [2024-11-19 05:00:16,001 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281535,281548] [2024-11-19 05:00:16,001 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281681,281694] [2024-11-19 05:00:16,001 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281824,281837] [2024-11-19 05:00:16,002 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281968,281981] [2024-11-19 05:00:16,002 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282111,282124] [2024-11-19 05:00:16,003 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282255,282268] [2024-11-19 05:00:16,003 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282396,282409] [2024-11-19 05:00:16,004 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282534,282547] [2024-11-19 05:00:16,004 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282692,282705] [2024-11-19 05:00:16,005 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282851,282864] [2024-11-19 05:00:16,005 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283007,283020] [2024-11-19 05:00:16,006 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283156,283169] [2024-11-19 05:00:16,006 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283308,283321] [2024-11-19 05:00:16,006 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283459,283472] [2024-11-19 05:00:16,008 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283608,283621] [2024-11-19 05:00:16,009 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283760,283773] [2024-11-19 05:00:16,010 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283908,283921] [2024-11-19 05:00:16,010 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284061,284074] [2024-11-19 05:00:16,011 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284212,284225] [2024-11-19 05:00:16,011 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284362,284375] [2024-11-19 05:00:16,011 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284509,284522] [2024-11-19 05:00:16,012 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284660,284673] [2024-11-19 05:00:16,012 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284811,284824] [2024-11-19 05:00:16,012 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284959,284972] [2024-11-19 05:00:16,013 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285125,285138] [2024-11-19 05:00:16,013 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285294,285307] [2024-11-19 05:00:16,013 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285461,285474] [2024-11-19 05:00:16,014 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285629,285642] [2024-11-19 05:00:16,014 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285779,285792] [2024-11-19 05:00:16,014 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285926,285939] [2024-11-19 05:00:16,015 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[286087,286100] [2024-11-19 05:00:16,015 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[286257,286270] [2024-11-19 05:00:16,015 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[286419,286432] [2024-11-19 05:00:16,024 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:00:16,061 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 05:00:16,258 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("mfence": : : "memory"); [4644] [2024-11-19 05:00:16,274 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("mfence": : : "memory"); [4799] [2024-11-19 05:00:16,302 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("sfence": : : "memory"); [5192] [2024-11-19 05:00:16,428 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273031,273044] [2024-11-19 05:00:16,429 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273176,273189] [2024-11-19 05:00:16,430 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273322,273335] [2024-11-19 05:00:16,431 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273487,273500] [2024-11-19 05:00:16,431 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273645,273658] [2024-11-19 05:00:16,432 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273803,273816] [2024-11-19 05:00:16,432 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273961,273974] [2024-11-19 05:00:16,433 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274121,274134] [2024-11-19 05:00:16,433 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274280,274293] [2024-11-19 05:00:16,433 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274419,274432] [2024-11-19 05:00:16,434 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274561,274574] [2024-11-19 05:00:16,435 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274710,274723] [2024-11-19 05:00:16,435 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274849,274862] [2024-11-19 05:00:16,435 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275004,275017] [2024-11-19 05:00:16,436 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275164,275177] [2024-11-19 05:00:16,439 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275315,275328] [2024-11-19 05:00:16,439 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275466,275479] [2024-11-19 05:00:16,439 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275618,275631] [2024-11-19 05:00:16,440 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275767,275780] [2024-11-19 05:00:16,440 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275915,275928] [2024-11-19 05:00:16,440 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276072,276085] [2024-11-19 05:00:16,440 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276221,276234] [2024-11-19 05:00:16,441 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276377,276390] [2024-11-19 05:00:16,441 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276530,276543] [2024-11-19 05:00:16,443 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276676,276689] [2024-11-19 05:00:16,443 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276819,276832] [2024-11-19 05:00:16,444 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276971,276984] [2024-11-19 05:00:16,444 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277117,277130] [2024-11-19 05:00:16,444 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277262,277275] [2024-11-19 05:00:16,445 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277416,277429] [2024-11-19 05:00:16,445 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277567,277580] [2024-11-19 05:00:16,445 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277722,277735] [2024-11-19 05:00:16,445 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277874,277887] [2024-11-19 05:00:16,446 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278029,278042] [2024-11-19 05:00:16,446 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278193,278206] [2024-11-19 05:00:16,447 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278349,278362] [2024-11-19 05:00:16,448 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278513,278526] [2024-11-19 05:00:16,449 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278655,278668] [2024-11-19 05:00:16,449 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278813,278826] [2024-11-19 05:00:16,450 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278980,278993] [2024-11-19 05:00:16,450 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279139,279152] [2024-11-19 05:00:16,451 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279298,279311] [2024-11-19 05:00:16,451 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279447,279460] [2024-11-19 05:00:16,452 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279594,279607] [2024-11-19 05:00:16,452 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279733,279746] [2024-11-19 05:00:16,452 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279896,279909] [2024-11-19 05:00:16,453 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280062,280075] [2024-11-19 05:00:16,453 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280226,280239] [2024-11-19 05:00:16,453 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280391,280404] [2024-11-19 05:00:16,454 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280556,280569] [2024-11-19 05:00:16,454 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280722,280735] [2024-11-19 05:00:16,454 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280887,280900] [2024-11-19 05:00:16,455 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281054,281067] [2024-11-19 05:00:16,455 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281214,281227] [2024-11-19 05:00:16,455 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281376,281389] [2024-11-19 05:00:16,456 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281535,281548] [2024-11-19 05:00:16,456 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281681,281694] [2024-11-19 05:00:16,457 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281824,281837] [2024-11-19 05:00:16,457 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281968,281981] [2024-11-19 05:00:16,457 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282111,282124] [2024-11-19 05:00:16,458 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282255,282268] [2024-11-19 05:00:16,458 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282396,282409] [2024-11-19 05:00:16,458 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282534,282547] [2024-11-19 05:00:16,459 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282692,282705] [2024-11-19 05:00:16,460 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282851,282864] [2024-11-19 05:00:16,460 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283007,283020] [2024-11-19 05:00:16,460 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283156,283169] [2024-11-19 05:00:16,461 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283308,283321] [2024-11-19 05:00:16,462 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283459,283472] [2024-11-19 05:00:16,462 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283608,283621] [2024-11-19 05:00:16,462 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283760,283773] [2024-11-19 05:00:16,463 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283908,283921] [2024-11-19 05:00:16,463 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284061,284074] [2024-11-19 05:00:16,464 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284212,284225] [2024-11-19 05:00:16,465 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284362,284375] [2024-11-19 05:00:16,465 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284509,284522] [2024-11-19 05:00:16,465 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284660,284673] [2024-11-19 05:00:16,466 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284811,284824] [2024-11-19 05:00:16,466 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284959,284972] [2024-11-19 05:00:16,471 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285125,285138] [2024-11-19 05:00:16,471 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285294,285307] [2024-11-19 05:00:16,472 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285461,285474] [2024-11-19 05:00:16,472 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285629,285642] [2024-11-19 05:00:16,472 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285779,285792] [2024-11-19 05:00:16,473 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285926,285939] [2024-11-19 05:00:16,473 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[286087,286100] [2024-11-19 05:00:16,473 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[286257,286270] [2024-11-19 05:00:16,474 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[286419,286432] [2024-11-19 05:00:16,476 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:00:16,599 INFO L204 MainTranslator]: Completed translation [2024-11-19 05:00:16,600 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:00:16 WrapperNode [2024-11-19 05:00:16,600 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 05:00:16,602 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 05:00:16,602 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 05:00:16,602 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 05:00:16,610 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:00:16" (1/1) ... [2024-11-19 05:00:16,707 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:00:16" (1/1) ... [2024-11-19 05:00:16,879 INFO L138 Inliner]: procedures = 526, calls = 1370, calls flagged for inlining = 224, calls inlined = 135, statements flattened = 2586 [2024-11-19 05:00:16,880 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 05:00:16,880 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 05:00:16,881 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 05:00:16,881 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 05:00:16,893 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:00:16" (1/1) ... [2024-11-19 05:00:16,894 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:00:16" (1/1) ... [2024-11-19 05:00:16,931 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:00:16" (1/1) ... [2024-11-19 05:00:17,399 INFO L175 MemorySlicer]: Split 355 memory accesses to 11 slices as follows [3, 7, 1, 3, 2, 23, 2, 28, 4, 277, 5]. 78 percent of accesses are in the largest equivalence class. The 40 initializations are split as follows [0, 7, 1, 0, 2, 0, 0, 0, 4, 26, 0]. The 184 writes are split as follows [0, 0, 0, 0, 0, 23, 0, 24, 0, 132, 5]. [2024-11-19 05:00:17,400 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:00:16" (1/1) ... [2024-11-19 05:00:17,403 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:00:16" (1/1) ... [2024-11-19 05:00:17,501 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:00:16" (1/1) ... [2024-11-19 05:00:17,519 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:00:16" (1/1) ... [2024-11-19 05:00:17,534 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:00:16" (1/1) ... [2024-11-19 05:00:17,551 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:00:16" (1/1) ... [2024-11-19 05:00:17,585 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 05:00:17,587 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 05:00:17,588 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 05:00:17,588 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 05:00:17,589 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:00:16" (1/1) ... [2024-11-19 05:00:17,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:00:17,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:00:17,635 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 05:00:17,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 05:00:17,684 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2024-11-19 05:00:17,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2024-11-19 05:00:17,684 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-11-19 05:00:17,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-11-19 05:00:17,684 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2024-11-19 05:00:17,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2024-11-19 05:00:17,685 INFO L130 BoogieDeclarations]: Found specification of procedure __might_sleep [2024-11-19 05:00:17,685 INFO L138 BoogieDeclarations]: Found implementation of procedure __might_sleep [2024-11-19 05:00:17,685 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2024-11-19 05:00:17,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2024-11-19 05:00:17,685 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2024-11-19 05:00:17,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2024-11-19 05:00:17,685 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2024-11-19 05:00:17,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2024-11-19 05:00:17,685 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_read_buffer_lock_of_lego_usb_tower [2024-11-19 05:00:17,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_read_buffer_lock_of_lego_usb_tower [2024-11-19 05:00:17,686 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2024-11-19 05:00:17,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2024-11-19 05:00:17,687 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2024-11-19 05:00:17,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2024-11-19 05:00:17,687 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2024-11-19 05:00:17,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2024-11-19 05:00:17,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 05:00:17,687 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2024-11-19 05:00:17,687 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2024-11-19 05:00:17,687 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2024-11-19 05:00:17,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2024-11-19 05:00:17,688 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2024-11-19 05:00:17,688 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2024-11-19 05:00:17,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-11-19 05:00:17,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-11-19 05:00:17,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2024-11-19 05:00:17,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2024-11-19 05:00:17,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2024-11-19 05:00:17,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2024-11-19 05:00:17,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2024-11-19 05:00:17,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2024-11-19 05:00:17,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2024-11-19 05:00:17,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2024-11-19 05:00:17,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2024-11-19 05:00:17,689 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2024-11-19 05:00:17,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2024-11-19 05:00:17,689 INFO L130 BoogieDeclarations]: Found specification of procedure _dev_info [2024-11-19 05:00:17,689 INFO L138 BoogieDeclarations]: Found implementation of procedure _dev_info [2024-11-19 05:00:17,689 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2024-11-19 05:00:17,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2024-11-19 05:00:17,690 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irq_112 [2024-11-19 05:00:17,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irq_112 [2024-11-19 05:00:17,690 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2024-11-19 05:00:17,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2024-11-19 05:00:17,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 05:00:17,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 05:00:17,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 05:00:17,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-19 05:00:17,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-19 05:00:17,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-19 05:00:17,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-19 05:00:17,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-19 05:00:17,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-19 05:00:17,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-19 05:00:17,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-11-19 05:00:17,693 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2024-11-19 05:00:17,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2024-11-19 05:00:17,693 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2024-11-19 05:00:17,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2024-11-19 05:00:17,694 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2024-11-19 05:00:17,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2024-11-19 05:00:17,694 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2024-11-19 05:00:17,694 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2024-11-19 05:00:17,694 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2024-11-19 05:00:17,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2024-11-19 05:00:17,694 INFO L130 BoogieDeclarations]: Found specification of procedure prepare_to_wait_event [2024-11-19 05:00:17,694 INFO L138 BoogieDeclarations]: Found implementation of procedure prepare_to_wait_event [2024-11-19 05:00:17,694 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2024-11-19 05:00:17,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2024-11-19 05:00:17,694 INFO L130 BoogieDeclarations]: Found specification of procedure __dynamic_dev_dbg [2024-11-19 05:00:17,694 INFO L138 BoogieDeclarations]: Found implementation of procedure __dynamic_dev_dbg [2024-11-19 05:00:17,694 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_open_disc_mutex [2024-11-19 05:00:17,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_open_disc_mutex [2024-11-19 05:00:17,694 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_lock_of_lego_usb_tower [2024-11-19 05:00:17,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_lock_of_lego_usb_tower [2024-11-19 05:00:17,695 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2024-11-19 05:00:17,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2024-11-19 05:00:17,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 05:00:17,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 05:00:17,695 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2024-11-19 05:00:17,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2024-11-19 05:00:17,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 05:00:17,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 05:00:17,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 05:00:17,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-19 05:00:17,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-19 05:00:17,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-11-19 05:00:17,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-11-19 05:00:17,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-11-19 05:00:17,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-11-19 05:00:17,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-11-19 05:00:17,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2024-11-19 05:00:17,696 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2024-11-19 05:00:17,696 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2024-11-19 05:00:17,696 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2024-11-19 05:00:17,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2024-11-19 05:00:17,696 INFO L130 BoogieDeclarations]: Found specification of procedure usb_control_msg [2024-11-19 05:00:17,696 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_control_msg [2024-11-19 05:00:17,698 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_irq_check_alloc_flags [2024-11-19 05:00:17,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_irq_check_alloc_flags [2024-11-19 05:00:17,699 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2024-11-19 05:00:17,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2024-11-19 05:00:17,699 INFO L130 BoogieDeclarations]: Found specification of procedure __init_waitqueue_head [2024-11-19 05:00:17,699 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_waitqueue_head [2024-11-19 05:00:17,699 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_open_disc_mutex [2024-11-19 05:00:17,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_open_disc_mutex [2024-11-19 05:00:17,699 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_timeout [2024-11-19 05:00:17,700 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_timeout [2024-11-19 05:00:17,700 INFO L130 BoogieDeclarations]: Found specification of procedure finish_wait [2024-11-19 05:00:17,700 INFO L138 BoogieDeclarations]: Found implementation of procedure finish_wait [2024-11-19 05:00:17,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 05:00:17,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 05:00:17,703 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_intfdata [2024-11-19 05:00:17,703 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_intfdata [2024-11-19 05:00:17,703 INFO L130 BoogieDeclarations]: Found specification of procedure tower_disconnect [2024-11-19 05:00:17,703 INFO L138 BoogieDeclarations]: Found implementation of procedure tower_disconnect [2024-11-19 05:00:17,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2024-11-19 05:00:17,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2024-11-19 05:00:17,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2024-11-19 05:00:17,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2024-11-19 05:00:17,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2024-11-19 05:00:17,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2024-11-19 05:00:17,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2024-11-19 05:00:17,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2024-11-19 05:00:17,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2024-11-19 05:00:17,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2024-11-19 05:00:17,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2024-11-19 05:00:17,704 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2024-11-19 05:00:17,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2024-11-19 05:00:17,704 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2024-11-19 05:00:17,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2024-11-19 05:00:17,704 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_maxp [2024-11-19 05:00:17,704 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_maxp [2024-11-19 05:00:17,704 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2024-11-19 05:00:17,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2024-11-19 05:00:17,704 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_free_urb [2024-11-19 05:00:17,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_free_urb [2024-11-19 05:00:17,704 INFO L130 BoogieDeclarations]: Found specification of procedure poll_wait [2024-11-19 05:00:17,704 INFO L138 BoogieDeclarations]: Found implementation of procedure poll_wait [2024-11-19 05:00:17,704 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2024-11-19 05:00:17,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2024-11-19 05:00:17,705 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_lock_of_lego_usb_tower [2024-11-19 05:00:17,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_lock_of_lego_usb_tower [2024-11-19 05:00:17,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 05:00:17,705 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2024-11-19 05:00:17,705 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2024-11-19 05:00:17,705 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2024-11-19 05:00:17,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2024-11-19 05:00:17,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 05:00:17,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 05:00:17,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 05:00:17,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-19 05:00:17,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-19 05:00:17,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-11-19 05:00:17,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-11-19 05:00:17,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-11-19 05:00:17,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-11-19 05:00:17,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-11-19 05:00:17,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2024-11-19 05:00:17,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-19 05:00:17,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-19 05:00:17,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-19 05:00:17,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-11-19 05:00:17,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-11-19 05:00:17,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-11-19 05:00:17,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-11-19 05:00:17,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2024-11-19 05:00:17,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2024-11-19 05:00:17,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2024-11-19 05:00:17,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2024-11-19 05:00:17,708 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2024-11-19 05:00:17,708 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2024-11-19 05:00:17,708 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2024-11-19 05:00:17,709 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2024-11-19 05:00:17,709 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2024-11-19 05:00:17,709 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2024-11-19 05:00:17,709 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2024-11-19 05:00:17,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2024-11-19 05:00:17,709 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2024-11-19 05:00:17,709 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2024-11-19 05:00:17,709 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2024-11-19 05:00:17,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2024-11-19 05:00:17,709 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_interruptible_or_killable_lock_of_lego_usb_tower [2024-11-19 05:00:17,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_interruptible_or_killable_lock_of_lego_usb_tower [2024-11-19 05:00:17,709 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2024-11-19 05:00:17,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2024-11-19 05:00:17,709 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_alloc_urb [2024-11-19 05:00:17,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_alloc_urb [2024-11-19 05:00:17,710 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2024-11-19 05:00:17,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2024-11-19 05:00:17,710 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2024-11-19 05:00:17,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2024-11-19 05:00:17,710 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2024-11-19 05:00:17,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2024-11-19 05:00:17,710 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2024-11-19 05:00:17,710 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2024-11-19 05:00:17,711 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2024-11-19 05:00:17,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2024-11-19 05:00:17,711 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_int_urb [2024-11-19 05:00:17,711 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_int_urb [2024-11-19 05:00:17,711 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_read_buffer_lock_of_lego_usb_tower [2024-11-19 05:00:17,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_read_buffer_lock_of_lego_usb_tower [2024-11-19 05:00:17,711 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2024-11-19 05:00:17,711 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2024-11-19 05:00:17,712 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2024-11-19 05:00:17,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2024-11-19 05:00:17,712 INFO L130 BoogieDeclarations]: Found specification of procedure tower_delete [2024-11-19 05:00:17,712 INFO L138 BoogieDeclarations]: Found implementation of procedure tower_delete [2024-11-19 05:00:17,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 05:00:17,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 05:00:17,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 05:00:17,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-19 05:00:17,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-19 05:00:17,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-19 05:00:17,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-19 05:00:17,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-19 05:00:17,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-19 05:00:17,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-19 05:00:17,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-11-19 05:00:17,713 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2024-11-19 05:00:17,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2024-11-19 05:00:17,713 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2024-11-19 05:00:17,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2024-11-19 05:00:17,713 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2024-11-19 05:00:17,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2024-11-19 05:00:17,714 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2024-11-19 05:00:17,714 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2024-11-19 05:00:17,714 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2024-11-19 05:00:17,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2024-11-19 05:00:17,714 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2024-11-19 05:00:17,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2024-11-19 05:00:17,714 INFO L130 BoogieDeclarations]: Found specification of procedure tower_check_for_read_packet [2024-11-19 05:00:17,714 INFO L138 BoogieDeclarations]: Found implementation of procedure tower_check_for_read_packet [2024-11-19 05:00:17,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 05:00:17,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 05:00:17,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 05:00:17,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-19 05:00:17,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-19 05:00:17,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-19 05:00:17,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-19 05:00:17,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-19 05:00:17,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-19 05:00:17,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-19 05:00:17,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-19 05:00:17,715 INFO L130 BoogieDeclarations]: Found specification of procedure tower_abort_transfers [2024-11-19 05:00:17,715 INFO L138 BoogieDeclarations]: Found implementation of procedure tower_abort_transfers [2024-11-19 05:00:17,715 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_irq_111 [2024-11-19 05:00:17,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_irq_111 [2024-11-19 05:00:18,254 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 05:00:18,261 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 05:00:18,468 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2024-11-19 05:00:26,224 INFO L? ?]: Removed 1165 outVars from TransFormulas that were not future-live. [2024-11-19 05:00:26,225 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 05:00:26,280 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 05:00:26,280 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-19 05:00:26,281 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:00:26 BoogieIcfgContainer [2024-11-19 05:00:26,281 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 05:00:26,283 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 05:00:26,284 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 05:00:26,287 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 05:00:26,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:00:11" (1/3) ... [2024-11-19 05:00:26,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8cda77d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:00:26, skipping insertion in model container [2024-11-19 05:00:26,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:00:16" (2/3) ... [2024-11-19 05:00:26,289 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8cda77d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:00:26, skipping insertion in model container [2024-11-19 05:00:26,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:00:26" (3/3) ... [2024-11-19 05:00:26,292 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i [2024-11-19 05:00:26,309 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 05:00:26,310 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2024-11-19 05:00:26,424 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 05:00:26,431 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;@1fd84b2e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 05:00:26,432 INFO L334 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2024-11-19 05:00:26,446 INFO L276 IsEmpty]: Start isEmpty. Operand has 1078 states, 704 states have (on average 1.2784090909090908) internal successors, (900), 749 states have internal predecessors, (900), 264 states have call successors, (264), 80 states have call predecessors, (264), 79 states have return successors, (259), 256 states have call predecessors, (259), 259 states have call successors, (259) [2024-11-19 05:00:26,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-19 05:00:26,457 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:00:26,457 INFO L215 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] [2024-11-19 05:00:26,458 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2024-11-19 05:00:26,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:00:26,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1413892860, now seen corresponding path program 1 times [2024-11-19 05:00:26,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:00:26,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881750260] [2024-11-19 05:00:26,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:00:26,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:00:28,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:00:29,024 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-19 05:00:29,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:00:29,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881750260] [2024-11-19 05:00:29,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881750260] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:00:29,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:00:29,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 05:00:29,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676153546] [2024-11-19 05:00:29,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:00:29,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 05:00:29,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:00:29,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 05:00:29,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 05:00:29,083 INFO L87 Difference]: Start difference. First operand has 1078 states, 704 states have (on average 1.2784090909090908) internal successors, (900), 749 states have internal predecessors, (900), 264 states have call successors, (264), 80 states have call predecessors, (264), 79 states have return successors, (259), 256 states have call predecessors, (259), 259 states have call successors, (259) Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-19 05:00:29,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:00:29,380 INFO L93 Difference]: Finished difference Result 2107 states and 2876 transitions. [2024-11-19 05:00:29,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 05:00:29,383 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 [2024-11-19 05:00:29,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:00:29,419 INFO L225 Difference]: With dead ends: 2107 [2024-11-19 05:00:29,419 INFO L226 Difference]: Without dead ends: 1060 [2024-11-19 05:00:29,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 05:00:29,441 INFO L432 NwaCegarLoop]: 1380 mSDtfsCounter, 1350 mSDsluCounter, 1379 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1350 SdHoareTripleChecker+Valid, 2759 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 05:00:29,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1350 Valid, 2759 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 05:00:29,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2024-11-19 05:00:29,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 1060. [2024-11-19 05:00:29,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1060 states, 694 states have (on average 1.2219020172910662) internal successors, (848), 734 states have internal predecessors, (848), 259 states have call successors, (259), 79 states have call predecessors, (259), 78 states have return successors, (257), 254 states have call predecessors, (257), 257 states have call successors, (257) [2024-11-19 05:00:29,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1364 transitions. [2024-11-19 05:00:29,641 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 1364 transitions. Word has length 71 [2024-11-19 05:00:29,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:00:29,644 INFO L471 AbstractCegarLoop]: Abstraction has 1060 states and 1364 transitions. [2024-11-19 05:00:29,644 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) [2024-11-19 05:00:29,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1364 transitions. [2024-11-19 05:00:29,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-19 05:00:29,649 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:00:29,650 INFO L215 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] [2024-11-19 05:00:29,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 05:00:29,650 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_linux_block_genhd_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2024-11-19 05:00:29,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:00:29,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1401705639, now seen corresponding path program 1 times [2024-11-19 05:00:29,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:00:29,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068923694] [2024-11-19 05:00:29,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:00:29,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:00:30,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:00:31,345 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-19 05:00:31,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:00:31,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068923694] [2024-11-19 05:00:31,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068923694] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:00:31,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:00:31,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 05:00:31,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330593517] [2024-11-19 05:00:31,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:00:31,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 05:00:31,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:00:31,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 05:00:31,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 05:00:31,350 INFO L87 Difference]: Start difference. First operand 1060 states and 1364 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) [2024-11-19 05:00:31,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:00:31,492 INFO L93 Difference]: Finished difference Result 1060 states and 1364 transitions. [2024-11-19 05:00:31,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 05:00:31,493 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 [2024-11-19 05:00:31,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:00:31,504 INFO L225 Difference]: With dead ends: 1060 [2024-11-19 05:00:31,505 INFO L226 Difference]: Without dead ends: 1058 [2024-11-19 05:00:31,506 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 05:00:31,508 INFO L432 NwaCegarLoop]: 1360 mSDtfsCounter, 1329 mSDsluCounter, 1359 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1329 SdHoareTripleChecker+Valid, 2719 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 05:00:31,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1329 Valid, 2719 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 05:00:31,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2024-11-19 05:00:31,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 1058. [2024-11-19 05:00:31,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1058 states, 693 states have (on average 1.2207792207792207) internal successors, (846), 732 states have internal predecessors, (846), 259 states have call successors, (259), 79 states have call predecessors, (259), 78 states have return successors, (257), 254 states have call predecessors, (257), 257 states have call successors, (257) [2024-11-19 05:00:31,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 1058 states and 1362 transitions. [2024-11-19 05:00:31,597 INFO L78 Accepts]: Start accepts. Automaton has 1058 states and 1362 transitions. Word has length 77 [2024-11-19 05:00:31,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:00:31,600 INFO L471 AbstractCegarLoop]: Abstraction has 1058 states and 1362 transitions. [2024-11-19 05:00:31,600 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) [2024-11-19 05:00:31,600 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 1362 transitions. [2024-11-19 05:00:31,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-19 05:00:31,608 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:00:31,608 INFO L215 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] [2024-11-19 05:00:31,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 05:00:31,609 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2024-11-19 05:00:31,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:00:31,610 INFO L85 PathProgramCache]: Analyzing trace with hash -901111399, now seen corresponding path program 1 times [2024-11-19 05:00:31,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:00:31,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788524518] [2024-11-19 05:00:31,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:00:31,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:00:32,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:00:33,083 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-19 05:00:33,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:00:33,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788524518] [2024-11-19 05:00:33,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788524518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:00:33,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:00:33,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 05:00:33,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089915312] [2024-11-19 05:00:33,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:00:33,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 05:00:33,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:00:33,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 05:00:33,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 05:00:33,087 INFO L87 Difference]: Start difference. First operand 1058 states and 1362 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) [2024-11-19 05:00:33,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:00:33,217 INFO L93 Difference]: Finished difference Result 1058 states and 1362 transitions. [2024-11-19 05:00:33,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 05:00:33,218 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 [2024-11-19 05:00:33,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:00:33,225 INFO L225 Difference]: With dead ends: 1058 [2024-11-19 05:00:33,226 INFO L226 Difference]: Without dead ends: 1056 [2024-11-19 05:00:33,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 05:00:33,228 INFO L432 NwaCegarLoop]: 1358 mSDtfsCounter, 1326 mSDsluCounter, 1357 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1326 SdHoareTripleChecker+Valid, 2715 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 05:00:33,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1326 Valid, 2715 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 05:00:33,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2024-11-19 05:00:33,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 1056. [2024-11-19 05:00:33,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1056 states, 692 states have (on average 1.2196531791907514) internal successors, (844), 730 states have internal predecessors, (844), 259 states have call successors, (259), 79 states have call predecessors, (259), 78 states have return successors, (257), 254 states have call predecessors, (257), 257 states have call successors, (257) [2024-11-19 05:00:33,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 1360 transitions. [2024-11-19 05:00:33,312 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 1360 transitions. Word has length 83 [2024-11-19 05:00:33,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:00:33,316 INFO L471 AbstractCegarLoop]: Abstraction has 1056 states and 1360 transitions. [2024-11-19 05:00:33,316 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) [2024-11-19 05:00:33,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1360 transitions. [2024-11-19 05:00:33,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-19 05:00:33,322 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:00:33,322 INFO L215 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] [2024-11-19 05:00:33,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 05:00:33,322 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2024-11-19 05:00:33,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:00:33,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1889702649, now seen corresponding path program 1 times [2024-11-19 05:00:33,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:00:33,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806886944] [2024-11-19 05:00:33,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:00:33,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:00:34,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:00:34,604 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-19 05:00:34,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:00:34,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806886944] [2024-11-19 05:00:34,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806886944] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:00:34,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:00:34,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 05:00:34,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267492310] [2024-11-19 05:00:34,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:00:34,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 05:00:34,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:00:34,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 05:00:34,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 05:00:34,607 INFO L87 Difference]: Start difference. First operand 1056 states and 1360 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) [2024-11-19 05:00:34,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:00:34,714 INFO L93 Difference]: Finished difference Result 1056 states and 1360 transitions. [2024-11-19 05:00:34,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 05:00:34,715 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 [2024-11-19 05:00:34,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:00:34,721 INFO L225 Difference]: With dead ends: 1056 [2024-11-19 05:00:34,722 INFO L226 Difference]: Without dead ends: 1054 [2024-11-19 05:00:34,723 INFO L431 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 [2024-11-19 05:00:34,724 INFO L432 NwaCegarLoop]: 1356 mSDtfsCounter, 1323 mSDsluCounter, 1355 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1323 SdHoareTripleChecker+Valid, 2711 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 05:00:34,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1323 Valid, 2711 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 05:00:34,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2024-11-19 05:00:34,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 1054. [2024-11-19 05:00:34,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1054 states, 691 states have (on average 1.2185238784370478) internal successors, (842), 728 states have internal predecessors, (842), 259 states have call successors, (259), 79 states have call predecessors, (259), 78 states have return successors, (257), 254 states have call predecessors, (257), 257 states have call successors, (257) [2024-11-19 05:00:34,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 1358 transitions. [2024-11-19 05:00:34,793 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 1358 transitions. Word has length 89 [2024-11-19 05:00:34,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:00:34,794 INFO L471 AbstractCegarLoop]: Abstraction has 1054 states and 1358 transitions. [2024-11-19 05:00:34,794 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) [2024-11-19 05:00:34,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1358 transitions. [2024-11-19 05:00:34,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-19 05:00:34,796 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:00:34,796 INFO L215 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] [2024-11-19 05:00:34,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 05:00:34,797 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2024-11-19 05:00:34,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:00:34,798 INFO L85 PathProgramCache]: Analyzing trace with hash -400257096, now seen corresponding path program 1 times [2024-11-19 05:00:34,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:00:34,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058622612] [2024-11-19 05:00:34,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:00:34,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:00:35,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:00:36,162 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-19 05:00:36,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:00:36,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058622612] [2024-11-19 05:00:36,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058622612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:00:36,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:00:36,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 05:00:36,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766865120] [2024-11-19 05:00:36,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:00:36,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 05:00:36,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:00:36,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 05:00:36,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 05:00:36,168 INFO L87 Difference]: Start difference. First operand 1054 states and 1358 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) [2024-11-19 05:00:36,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:00:36,329 INFO L93 Difference]: Finished difference Result 1054 states and 1358 transitions. [2024-11-19 05:00:36,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 05:00:36,330 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 [2024-11-19 05:00:36,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:00:36,337 INFO L225 Difference]: With dead ends: 1054 [2024-11-19 05:00:36,337 INFO L226 Difference]: Without dead ends: 1052 [2024-11-19 05:00:36,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 05:00:36,340 INFO L432 NwaCegarLoop]: 1354 mSDtfsCounter, 1320 mSDsluCounter, 1353 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1320 SdHoareTripleChecker+Valid, 2707 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 05:00:36,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1320 Valid, 2707 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 05:00:36,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2024-11-19 05:00:36,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 1052. [2024-11-19 05:00:36,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1052 states, 690 states have (on average 1.2173913043478262) internal successors, (840), 726 states have internal predecessors, (840), 259 states have call successors, (259), 79 states have call predecessors, (259), 78 states have return successors, (257), 254 states have call predecessors, (257), 257 states have call successors, (257) [2024-11-19 05:00:36,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1356 transitions. [2024-11-19 05:00:36,447 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1356 transitions. Word has length 95 [2024-11-19 05:00:36,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:00:36,450 INFO L471 AbstractCegarLoop]: Abstraction has 1052 states and 1356 transitions. [2024-11-19 05:00:36,450 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) [2024-11-19 05:00:36,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1356 transitions. [2024-11-19 05:00:36,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-19 05:00:36,452 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:00:36,452 INFO L215 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] [2024-11-19 05:00:36,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 05:00:36,453 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2024-11-19 05:00:36,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:00:36,454 INFO L85 PathProgramCache]: Analyzing trace with hash -618641995, now seen corresponding path program 1 times [2024-11-19 05:00:36,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:00:36,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003439240] [2024-11-19 05:00:36,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:00:36,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:00:37,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:00:37,906 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-19 05:00:37,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:00:37,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003439240] [2024-11-19 05:00:37,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003439240] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:00:37,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:00:37,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 05:00:37,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61352723] [2024-11-19 05:00:37,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:00:37,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 05:00:37,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:00:37,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 05:00:37,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 05:00:37,909 INFO L87 Difference]: Start difference. First operand 1052 states and 1356 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) [2024-11-19 05:00:38,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:00:38,036 INFO L93 Difference]: Finished difference Result 1052 states and 1356 transitions. [2024-11-19 05:00:38,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 05:00:38,037 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 [2024-11-19 05:00:38,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:00:38,044 INFO L225 Difference]: With dead ends: 1052 [2024-11-19 05:00:38,045 INFO L226 Difference]: Without dead ends: 1050 [2024-11-19 05:00:38,046 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 05:00:38,048 INFO L432 NwaCegarLoop]: 1352 mSDtfsCounter, 1317 mSDsluCounter, 1351 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1317 SdHoareTripleChecker+Valid, 2703 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 05:00:38,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1317 Valid, 2703 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 05:00:38,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1050 states. [2024-11-19 05:00:38,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1050 to 1050. [2024-11-19 05:00:38,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1050 states, 689 states have (on average 1.216255442670537) internal successors, (838), 724 states have internal predecessors, (838), 259 states have call successors, (259), 79 states have call predecessors, (259), 78 states have return successors, (257), 254 states have call predecessors, (257), 257 states have call successors, (257) [2024-11-19 05:00:38,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 1354 transitions. [2024-11-19 05:00:38,132 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 1354 transitions. Word has length 101 [2024-11-19 05:00:38,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:00:38,132 INFO L471 AbstractCegarLoop]: Abstraction has 1050 states and 1354 transitions. [2024-11-19 05:00:38,133 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) [2024-11-19 05:00:38,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 1354 transitions. [2024-11-19 05:00:38,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-19 05:00:38,136 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:00:38,137 INFO L215 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] [2024-11-19 05:00:38,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 05:00:38,137 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2024-11-19 05:00:38,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:00:38,138 INFO L85 PathProgramCache]: Analyzing trace with hash 309259448, now seen corresponding path program 1 times [2024-11-19 05:00:38,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:00:38,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836569760] [2024-11-19 05:00:38,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:00:38,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:00:38,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:00:39,375 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-19 05:00:39,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:00:39,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836569760] [2024-11-19 05:00:39,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836569760] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:00:39,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:00:39,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 05:00:39,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315302051] [2024-11-19 05:00:39,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:00:39,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 05:00:39,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:00:39,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 05:00:39,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 05:00:39,378 INFO L87 Difference]: Start difference. First operand 1050 states and 1354 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) [2024-11-19 05:00:39,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:00:39,506 INFO L93 Difference]: Finished difference Result 1050 states and 1354 transitions. [2024-11-19 05:00:39,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 05:00:39,506 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 [2024-11-19 05:00:39,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:00:39,513 INFO L225 Difference]: With dead ends: 1050 [2024-11-19 05:00:39,514 INFO L226 Difference]: Without dead ends: 1048 [2024-11-19 05:00:39,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 05:00:39,518 INFO L432 NwaCegarLoop]: 1350 mSDtfsCounter, 1314 mSDsluCounter, 1349 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1314 SdHoareTripleChecker+Valid, 2699 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 05:00:39,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1314 Valid, 2699 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 05:00:39,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2024-11-19 05:00:39,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 1048. [2024-11-19 05:00:39,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1048 states, 688 states have (on average 1.2151162790697674) internal successors, (836), 722 states have internal predecessors, (836), 259 states have call successors, (259), 79 states have call predecessors, (259), 78 states have return successors, (257), 254 states have call predecessors, (257), 257 states have call successors, (257) [2024-11-19 05:00:39,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1352 transitions. [2024-11-19 05:00:39,603 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1352 transitions. Word has length 107 [2024-11-19 05:00:39,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:00:39,604 INFO L471 AbstractCegarLoop]: Abstraction has 1048 states and 1352 transitions. [2024-11-19 05:00:39,604 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) [2024-11-19 05:00:39,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1352 transitions. [2024-11-19 05:00:39,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-19 05:00:39,608 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:00:39,609 INFO L215 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] [2024-11-19 05:00:39,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 05:00:39,609 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2024-11-19 05:00:39,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:00:39,610 INFO L85 PathProgramCache]: Analyzing trace with hash -711546003, now seen corresponding path program 1 times [2024-11-19 05:00:39,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:00:39,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431579166] [2024-11-19 05:00:39,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:00:39,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:00:40,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:00:40,860 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-19 05:00:40,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:00:40,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431579166] [2024-11-19 05:00:40,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431579166] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:00:40,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:00:40,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 05:00:40,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415451934] [2024-11-19 05:00:40,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:00:40,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 05:00:40,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:00:40,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 05:00:40,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 05:00:40,864 INFO L87 Difference]: Start difference. First operand 1048 states and 1352 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) [2024-11-19 05:00:41,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:00:41,030 INFO L93 Difference]: Finished difference Result 1048 states and 1352 transitions. [2024-11-19 05:00:41,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 05:00:41,031 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 [2024-11-19 05:00:41,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:00:41,038 INFO L225 Difference]: With dead ends: 1048 [2024-11-19 05:00:41,039 INFO L226 Difference]: Without dead ends: 1046 [2024-11-19 05:00:41,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 05:00:41,042 INFO L432 NwaCegarLoop]: 1348 mSDtfsCounter, 1311 mSDsluCounter, 1347 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1311 SdHoareTripleChecker+Valid, 2695 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 05:00:41,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1311 Valid, 2695 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 05:00:41,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2024-11-19 05:00:41,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 1046. [2024-11-19 05:00:41,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1046 states, 687 states have (on average 1.2139737991266375) internal successors, (834), 720 states have internal predecessors, (834), 259 states have call successors, (259), 79 states have call predecessors, (259), 78 states have return successors, (257), 254 states have call predecessors, (257), 257 states have call successors, (257) [2024-11-19 05:00:41,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1350 transitions. [2024-11-19 05:00:41,167 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1350 transitions. Word has length 113 [2024-11-19 05:00:41,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:00:41,167 INFO L471 AbstractCegarLoop]: Abstraction has 1046 states and 1350 transitions. [2024-11-19 05:00:41,168 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) [2024-11-19 05:00:41,168 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1350 transitions. [2024-11-19 05:00:41,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-19 05:00:41,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:00:41,170 INFO L215 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] [2024-11-19 05:00:41,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 05:00:41,171 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2024-11-19 05:00:41,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:00:41,172 INFO L85 PathProgramCache]: Analyzing trace with hash -895776752, now seen corresponding path program 1 times [2024-11-19 05:00:41,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:00:41,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171166225] [2024-11-19 05:00:41,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:00:41,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:00:41,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:00:42,284 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-19 05:00:42,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:00:42,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171166225] [2024-11-19 05:00:42,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171166225] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:00:42,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:00:42,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 05:00:42,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120471939] [2024-11-19 05:00:42,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:00:42,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 05:00:42,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:00:42,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 05:00:42,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 05:00:42,287 INFO L87 Difference]: Start difference. First operand 1046 states and 1350 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) [2024-11-19 05:00:42,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:00:42,390 INFO L93 Difference]: Finished difference Result 1046 states and 1350 transitions. [2024-11-19 05:00:42,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 05:00:42,391 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 [2024-11-19 05:00:42,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:00:42,397 INFO L225 Difference]: With dead ends: 1046 [2024-11-19 05:00:42,397 INFO L226 Difference]: Without dead ends: 1044 [2024-11-19 05:00:42,397 INFO L431 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 [2024-11-19 05:00:42,399 INFO L432 NwaCegarLoop]: 1346 mSDtfsCounter, 1307 mSDsluCounter, 1345 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1307 SdHoareTripleChecker+Valid, 2691 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 05:00:42,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1307 Valid, 2691 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 05:00:42,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1044 states. [2024-11-19 05:00:42,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1044 to 1044. [2024-11-19 05:00:42,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1044 states, 686 states have (on average 1.2128279883381925) internal successors, (832), 718 states have internal predecessors, (832), 259 states have call successors, (259), 79 states have call predecessors, (259), 78 states have return successors, (257), 254 states have call predecessors, (257), 257 states have call successors, (257) [2024-11-19 05:00:42,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 1348 transitions. [2024-11-19 05:00:42,464 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 1348 transitions. Word has length 115 [2024-11-19 05:00:42,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:00:42,465 INFO L471 AbstractCegarLoop]: Abstraction has 1044 states and 1348 transitions. [2024-11-19 05:00:42,465 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) [2024-11-19 05:00:42,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 1348 transitions. [2024-11-19 05:00:42,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-19 05:00:42,467 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:00:42,467 INFO L215 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] [2024-11-19 05:00:42,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 05:00:42,467 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_linux_alloc_irq_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2024-11-19 05:00:42,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:00:42,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1797710777, now seen corresponding path program 1 times [2024-11-19 05:00:42,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:00:42,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448717749] [2024-11-19 05:00:42,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:00:42,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:00:43,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:00:45,092 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2024-11-19 05:00:45,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:00:45,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448717749] [2024-11-19 05:00:45,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448717749] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:00:45,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:00:45,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 05:00:45,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485561335] [2024-11-19 05:00:45,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:00:45,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:00:45,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:00:45,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:00:45,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:00:45,095 INFO L87 Difference]: Start difference. First operand 1044 states and 1348 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-19 05:00:49,126 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 [] [2024-11-19 05:00:52,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:00:52,118 INFO L93 Difference]: Finished difference Result 2049 states and 2648 transitions. [2024-11-19 05:00:52,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:00:52,118 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 164 [2024-11-19 05:00:52,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:00:52,126 INFO L225 Difference]: With dead ends: 2049 [2024-11-19 05:00:52,127 INFO L226 Difference]: Without dead ends: 1044 [2024-11-19 05:00:52,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-19 05:00:52,132 INFO L432 NwaCegarLoop]: 1344 mSDtfsCounter, 1306 mSDsluCounter, 3512 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1307 SdHoareTripleChecker+Valid, 4856 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2024-11-19 05:00:52,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1307 Valid, 4856 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 527 Invalid, 1 Unknown, 0 Unchecked, 6.7s Time] [2024-11-19 05:00:52,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1044 states. [2024-11-19 05:00:52,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1044 to 1044. [2024-11-19 05:00:52,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1044 states, 686 states have (on average 1.2113702623906706) internal successors, (831), 718 states have internal predecessors, (831), 259 states have call successors, (259), 79 states have call predecessors, (259), 78 states have return successors, (257), 254 states have call predecessors, (257), 257 states have call successors, (257) [2024-11-19 05:00:52,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 1347 transitions. [2024-11-19 05:00:52,287 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 1347 transitions. Word has length 164 [2024-11-19 05:00:52,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:00:52,290 INFO L471 AbstractCegarLoop]: Abstraction has 1044 states and 1347 transitions. [2024-11-19 05:00:52,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-19 05:00:52,291 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 1347 transitions. [2024-11-19 05:00:52,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-19 05:00:52,293 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:00:52,293 INFO L215 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] [2024-11-19 05:00:52,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 05:00:52,294 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_linux_alloc_irq_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2024-11-19 05:00:52,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:00:52,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1797770359, now seen corresponding path program 1 times [2024-11-19 05:00:52,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:00:52,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266265378] [2024-11-19 05:00:52,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:00:52,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:00:53,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:00:53,560 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2024-11-19 05:00:53,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:00:53,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266265378] [2024-11-19 05:00:53,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266265378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:00:53,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:00:53,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 05:00:53,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166832938] [2024-11-19 05:00:53,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:00:53,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 05:00:53,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:00:53,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 05:00:53,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 05:00:53,561 INFO L87 Difference]: Start difference. First operand 1044 states and 1347 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 05:00:53,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:00:53,741 INFO L93 Difference]: Finished difference Result 1044 states and 1347 transitions. [2024-11-19 05:00:53,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 05:00:53,742 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 164 [2024-11-19 05:00:53,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:00:53,749 INFO L225 Difference]: With dead ends: 1044 [2024-11-19 05:00:53,750 INFO L226 Difference]: Without dead ends: 1042 [2024-11-19 05:00:53,751 INFO L431 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 [2024-11-19 05:00:53,751 INFO L432 NwaCegarLoop]: 1343 mSDtfsCounter, 0 mSDsluCounter, 2683 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4026 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 05:00:53,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4026 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 05:00:53,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2024-11-19 05:00:53,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 1042. [2024-11-19 05:00:53,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1042 states, 685 states have (on average 1.2102189781021897) internal successors, (829), 716 states have internal predecessors, (829), 259 states have call successors, (259), 79 states have call predecessors, (259), 78 states have return successors, (257), 254 states have call predecessors, (257), 257 states have call successors, (257) [2024-11-19 05:00:53,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1345 transitions. [2024-11-19 05:00:53,864 INFO L78 Accepts]: Start accepts. Automaton has 1042 states and 1345 transitions. Word has length 164 [2024-11-19 05:00:53,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:00:53,865 INFO L471 AbstractCegarLoop]: Abstraction has 1042 states and 1345 transitions. [2024-11-19 05:00:53,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 05:00:53,865 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 1345 transitions. [2024-11-19 05:00:53,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-19 05:00:53,867 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:00:53,867 INFO L215 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] [2024-11-19 05:00:53,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 05:00:53,868 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_linux_kernel_module_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2024-11-19 05:00:53,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:00:53,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1430970719, now seen corresponding path program 1 times [2024-11-19 05:00:53,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:00:53,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850733795] [2024-11-19 05:00:53,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:00:53,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:00:54,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:00:54,979 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-19 05:00:54,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:00:54,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850733795] [2024-11-19 05:00:54,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850733795] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:00:54,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:00:54,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 05:00:54,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202306239] [2024-11-19 05:00:54,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:00:54,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 05:00:54,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:00:54,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 05:00:54,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 05:00:54,981 INFO L87 Difference]: Start difference. First operand 1042 states and 1345 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) [2024-11-19 05:00:55,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:00:55,096 INFO L93 Difference]: Finished difference Result 1042 states and 1345 transitions. [2024-11-19 05:00:55,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 05:00:55,097 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 [2024-11-19 05:00:55,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:00:55,103 INFO L225 Difference]: With dead ends: 1042 [2024-11-19 05:00:55,103 INFO L226 Difference]: Without dead ends: 1040 [2024-11-19 05:00:55,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 05:00:55,105 INFO L432 NwaCegarLoop]: 1341 mSDtfsCounter, 1303 mSDsluCounter, 1340 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1303 SdHoareTripleChecker+Valid, 2681 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 05:00:55,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1303 Valid, 2681 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 05:00:55,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2024-11-19 05:00:55,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 1040. [2024-11-19 05:00:55,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1040 states, 684 states have (on average 1.20906432748538) internal successors, (827), 714 states have internal predecessors, (827), 259 states have call successors, (259), 79 states have call predecessors, (259), 78 states have return successors, (257), 254 states have call predecessors, (257), 257 states have call successors, (257) [2024-11-19 05:00:55,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 1040 states and 1343 transitions. [2024-11-19 05:00:55,207 INFO L78 Accepts]: Start accepts. Automaton has 1040 states and 1343 transitions. Word has length 121 [2024-11-19 05:00:55,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:00:55,208 INFO L471 AbstractCegarLoop]: Abstraction has 1040 states and 1343 transitions. [2024-11-19 05:00:55,208 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) [2024-11-19 05:00:55,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 1343 transitions. [2024-11-19 05:00:55,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-19 05:00:55,210 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:00:55,210 INFO L215 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] [2024-11-19 05:00:55,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 05:00:55,210 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2024-11-19 05:00:55,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:00:55,211 INFO L85 PathProgramCache]: Analyzing trace with hash 940653396, now seen corresponding path program 1 times [2024-11-19 05:00:55,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:00:55,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534040360] [2024-11-19 05:00:55,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:00:55,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:00:55,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:00:56,124 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-19 05:00:56,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:00:56,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534040360] [2024-11-19 05:00:56,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534040360] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:00:56,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:00:56,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 05:00:56,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417420802] [2024-11-19 05:00:56,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:00:56,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 05:00:56,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:00:56,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 05:00:56,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 05:00:56,127 INFO L87 Difference]: Start difference. First operand 1040 states and 1343 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) [2024-11-19 05:00:56,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:00:56,240 INFO L93 Difference]: Finished difference Result 1040 states and 1343 transitions. [2024-11-19 05:00:56,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 05:00:56,241 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 [2024-11-19 05:00:56,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:00:56,247 INFO L225 Difference]: With dead ends: 1040 [2024-11-19 05:00:56,248 INFO L226 Difference]: Without dead ends: 1038 [2024-11-19 05:00:56,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 05:00:56,249 INFO L432 NwaCegarLoop]: 1339 mSDtfsCounter, 1300 mSDsluCounter, 1338 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1300 SdHoareTripleChecker+Valid, 2677 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 05:00:56,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1300 Valid, 2677 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 05:00:56,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states. [2024-11-19 05:00:56,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 1038. [2024-11-19 05:00:56,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1038 states, 683 states have (on average 1.2079062957540263) internal successors, (825), 712 states have internal predecessors, (825), 259 states have call successors, (259), 79 states have call predecessors, (259), 78 states have return successors, (257), 254 states have call predecessors, (257), 257 states have call successors, (257) [2024-11-19 05:00:56,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 1038 states and 1341 transitions. [2024-11-19 05:00:56,337 INFO L78 Accepts]: Start accepts. Automaton has 1038 states and 1341 transitions. Word has length 127 [2024-11-19 05:00:56,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:00:56,337 INFO L471 AbstractCegarLoop]: Abstraction has 1038 states and 1341 transitions. [2024-11-19 05:00:56,338 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) [2024-11-19 05:00:56,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 1341 transitions. [2024-11-19 05:00:56,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-19 05:00:56,340 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:00:56,341 INFO L215 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] [2024-11-19 05:00:56,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 05:00:56,341 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2024-11-19 05:00:56,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:00:56,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1450302045, now seen corresponding path program 1 times [2024-11-19 05:00:56,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:00:56,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997026832] [2024-11-19 05:00:56,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:00:56,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:00:56,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:00:57,203 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2024-11-19 05:00:57,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:00:57,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997026832] [2024-11-19 05:00:57,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997026832] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:00:57,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:00:57,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 05:00:57,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69325444] [2024-11-19 05:00:57,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:00:57,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:00:57,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:00:57,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:00:57,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:00:57,205 INFO L87 Difference]: Start difference. First operand 1038 states and 1341 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-19 05:00:57,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:00:57,295 INFO L93 Difference]: Finished difference Result 2033 states and 2630 transitions. [2024-11-19 05:00:57,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:00:57,296 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 171 [2024-11-19 05:00:57,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:00:57,304 INFO L225 Difference]: With dead ends: 2033 [2024-11-19 05:00:57,304 INFO L226 Difference]: Without dead ends: 1034 [2024-11-19 05:00:57,309 INFO L431 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 [2024-11-19 05:00:57,310 INFO L432 NwaCegarLoop]: 1335 mSDtfsCounter, 1295 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1295 SdHoareTripleChecker+Valid, 1335 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 05:00:57,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1295 Valid, 1335 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 05:00:57,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2024-11-19 05:00:57,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2024-11-19 05:00:57,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 680 states have (on average 1.2058823529411764) internal successors, (820), 708 states have internal predecessors, (820), 259 states have call successors, (259), 79 states have call predecessors, (259), 78 states have return successors, (257), 254 states have call predecessors, (257), 257 states have call successors, (257) [2024-11-19 05:00:57,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1336 transitions. [2024-11-19 05:00:57,410 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1336 transitions. Word has length 171 [2024-11-19 05:00:57,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:00:57,413 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1336 transitions. [2024-11-19 05:00:57,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-19 05:00:57,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1336 transitions. [2024-11-19 05:00:57,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-19 05:00:57,416 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:00:57,416 INFO L215 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] [2024-11-19 05:00:57,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 05:00:57,416 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2024-11-19 05:00:57,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:00:57,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1067765395, now seen corresponding path program 1 times [2024-11-19 05:00:57,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:00:57,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340043816] [2024-11-19 05:00:57,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:00:57,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:00:58,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:00:58,369 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-19 05:00:58,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:00:58,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340043816] [2024-11-19 05:00:58,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340043816] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:00:58,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:00:58,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 05:00:58,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453033373] [2024-11-19 05:00:58,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:00:58,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 05:00:58,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:00:58,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 05:00:58,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 05:00:58,372 INFO L87 Difference]: Start difference. First operand 1034 states and 1336 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) [2024-11-19 05:00:58,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:00:58,482 INFO L93 Difference]: Finished difference Result 1034 states and 1336 transitions. [2024-11-19 05:00:58,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 05:00:58,483 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 [2024-11-19 05:00:58,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:00:58,497 INFO L225 Difference]: With dead ends: 1034 [2024-11-19 05:00:58,498 INFO L226 Difference]: Without dead ends: 1032 [2024-11-19 05:00:58,500 INFO L431 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 [2024-11-19 05:00:58,501 INFO L432 NwaCegarLoop]: 1332 mSDtfsCounter, 1292 mSDsluCounter, 1331 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1292 SdHoareTripleChecker+Valid, 2663 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 05:00:58,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1292 Valid, 2663 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 05:00:58,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2024-11-19 05:00:58,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 1032. [2024-11-19 05:00:58,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1032 states, 679 states have (on average 1.2047128129602356) internal successors, (818), 706 states have internal predecessors, (818), 259 states have call successors, (259), 79 states have call predecessors, (259), 78 states have return successors, (257), 254 states have call predecessors, (257), 257 states have call successors, (257) [2024-11-19 05:00:58,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1334 transitions. [2024-11-19 05:00:58,605 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1334 transitions. Word has length 133 [2024-11-19 05:00:58,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:00:58,605 INFO L471 AbstractCegarLoop]: Abstraction has 1032 states and 1334 transitions. [2024-11-19 05:00:58,606 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) [2024-11-19 05:00:58,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1334 transitions. [2024-11-19 05:00:58,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-19 05:00:58,607 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:00:58,608 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 7, 7, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:00:58,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 05:00:58,608 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2024-11-19 05:00:58,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:00:58,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1706797227, now seen corresponding path program 1 times [2024-11-19 05:00:58,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:00:58,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464426576] [2024-11-19 05:00:58,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:00:58,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:00:59,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:00:59,975 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-11-19 05:00:59,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:00:59,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464426576] [2024-11-19 05:00:59,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464426576] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:00:59,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:00:59,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 05:00:59,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031564965] [2024-11-19 05:00:59,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:00:59,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:00:59,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:00:59,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:00:59,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:00:59,977 INFO L87 Difference]: Start difference. First operand 1032 states and 1334 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-19 05:01:00,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:01:00,189 INFO L93 Difference]: Finished difference Result 1761 states and 2240 transitions. [2024-11-19 05:01:00,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:01:00,190 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) Word has length 167 [2024-11-19 05:01:00,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:01:00,200 INFO L225 Difference]: With dead ends: 1761 [2024-11-19 05:01:00,201 INFO L226 Difference]: Without dead ends: 1037 [2024-11-19 05:01:00,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:01:00,204 INFO L432 NwaCegarLoop]: 1331 mSDtfsCounter, 0 mSDsluCounter, 5317 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6648 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 05:01:00,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6648 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 05:01:00,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2024-11-19 05:01:00,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 1037. [2024-11-19 05:01:00,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1037 states, 683 states have (on average 1.2035139092240117) internal successors, (822), 710 states have internal predecessors, (822), 259 states have call successors, (259), 79 states have call predecessors, (259), 79 states have return successors, (261), 255 states have call predecessors, (261), 257 states have call successors, (261) [2024-11-19 05:01:00,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1342 transitions. [2024-11-19 05:01:00,303 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1342 transitions. Word has length 167 [2024-11-19 05:01:00,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:01:00,304 INFO L471 AbstractCegarLoop]: Abstraction has 1037 states and 1342 transitions. [2024-11-19 05:01:00,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-19 05:01:00,305 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1342 transitions. [2024-11-19 05:01:00,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-19 05:01:00,307 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:01:00,307 INFO L215 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] [2024-11-19 05:01:00,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 05:01:00,307 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2024-11-19 05:01:00,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:01:00,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1588639798, now seen corresponding path program 1 times [2024-11-19 05:01:00,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:01:00,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286920355] [2024-11-19 05:01:00,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:01:00,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:01:00,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:01:01,274 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-19 05:01:01,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:01:01,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286920355] [2024-11-19 05:01:01,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286920355] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:01:01,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:01:01,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 05:01:01,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066302391] [2024-11-19 05:01:01,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:01:01,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 05:01:01,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:01:01,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 05:01:01,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 05:01:01,276 INFO L87 Difference]: Start difference. First operand 1037 states and 1342 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) [2024-11-19 05:01:01,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:01:01,404 INFO L93 Difference]: Finished difference Result 1037 states and 1342 transitions. [2024-11-19 05:01:01,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 05:01:01,405 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 [2024-11-19 05:01:01,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:01:01,412 INFO L225 Difference]: With dead ends: 1037 [2024-11-19 05:01:01,412 INFO L226 Difference]: Without dead ends: 1035 [2024-11-19 05:01:01,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 05:01:01,414 INFO L432 NwaCegarLoop]: 1330 mSDtfsCounter, 1289 mSDsluCounter, 1329 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1289 SdHoareTripleChecker+Valid, 2659 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 05:01:01,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1289 Valid, 2659 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 05:01:01,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2024-11-19 05:01:01,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 1035. [2024-11-19 05:01:01,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1035 states, 682 states have (on average 1.2023460410557185) internal successors, (820), 708 states have internal predecessors, (820), 259 states have call successors, (259), 79 states have call predecessors, (259), 79 states have return successors, (261), 255 states have call predecessors, (261), 257 states have call successors, (261) [2024-11-19 05:01:01,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1340 transitions. [2024-11-19 05:01:01,508 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1340 transitions. Word has length 139 [2024-11-19 05:01:01,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:01:01,509 INFO L471 AbstractCegarLoop]: Abstraction has 1035 states and 1340 transitions. [2024-11-19 05:01:01,509 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) [2024-11-19 05:01:01,509 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1340 transitions. [2024-11-19 05:01:01,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-19 05:01:01,511 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:01:01,511 INFO L215 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] [2024-11-19 05:01:01,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 05:01:01,512 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_linux_kernel_rcu_srcu_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2024-11-19 05:01:01,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:01:01,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1466647269, now seen corresponding path program 1 times [2024-11-19 05:01:01,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:01:01,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554232881] [2024-11-19 05:01:01,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:01:01,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:01:02,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:01:02,480 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-19 05:01:02,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:01:02,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554232881] [2024-11-19 05:01:02,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554232881] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:01:02,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:01:02,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 05:01:02,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489422150] [2024-11-19 05:01:02,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:01:02,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 05:01:02,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:01:02,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 05:01:02,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 05:01:02,483 INFO L87 Difference]: Start difference. First operand 1035 states and 1340 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) [2024-11-19 05:01:02,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:01:02,610 INFO L93 Difference]: Finished difference Result 1035 states and 1340 transitions. [2024-11-19 05:01:02,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 05:01:02,611 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 [2024-11-19 05:01:02,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:01:02,617 INFO L225 Difference]: With dead ends: 1035 [2024-11-19 05:01:02,618 INFO L226 Difference]: Without dead ends: 1033 [2024-11-19 05:01:02,619 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 05:01:02,619 INFO L432 NwaCegarLoop]: 1328 mSDtfsCounter, 1286 mSDsluCounter, 1327 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1286 SdHoareTripleChecker+Valid, 2655 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 05:01:02,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1286 Valid, 2655 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 05:01:02,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1033 states. [2024-11-19 05:01:02,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1033 to 1033. [2024-11-19 05:01:02,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 681 states have (on average 1.2011747430249633) internal successors, (818), 706 states have internal predecessors, (818), 259 states have call successors, (259), 79 states have call predecessors, (259), 79 states have return successors, (261), 255 states have call predecessors, (261), 257 states have call successors, (261) [2024-11-19 05:01:02,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1338 transitions. [2024-11-19 05:01:02,711 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1338 transitions. Word has length 145 [2024-11-19 05:01:02,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:01:02,712 INFO L471 AbstractCegarLoop]: Abstraction has 1033 states and 1338 transitions. [2024-11-19 05:01:02,712 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) [2024-11-19 05:01:02,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1338 transitions. [2024-11-19 05:01:02,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-19 05:01:02,715 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:01:02,715 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 7, 7, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:01:02,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 05:01:02,716 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 28 more)] === [2024-11-19 05:01:02,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:01:02,716 INFO L85 PathProgramCache]: Analyzing trace with hash 752845037, now seen corresponding path program 1 times [2024-11-19 05:01:02,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:01:02,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308613056] [2024-11-19 05:01:02,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:01:02,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:01:03,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:01:04,206 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2024-11-19 05:01:04,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:01:04,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308613056] [2024-11-19 05:01:04,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308613056] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:01:04,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:01:04,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:01:04,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973709818] [2024-11-19 05:01:04,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:01:04,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 05:01:04,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:01:04,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 05:01:04,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 05:01:04,208 INFO L87 Difference]: Start difference. First operand 1033 states and 1338 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (26), 3 states have call predecessors, (26), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-19 05:01:04,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:01:04,475 INFO L93 Difference]: Finished difference Result 1138 states and 1442 transitions. [2024-11-19 05:01:04,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 05:01:04,475 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (26), 3 states have call predecessors, (26), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 183 [2024-11-19 05:01:04,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:01:04,485 INFO L225 Difference]: With dead ends: 1138 [2024-11-19 05:01:04,485 INFO L226 Difference]: Without dead ends: 1136 [2024-11-19 05:01:04,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-19 05:01:04,487 INFO L432 NwaCegarLoop]: 1363 mSDtfsCounter, 1181 mSDsluCounter, 2920 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1182 SdHoareTripleChecker+Valid, 4283 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 05:01:04,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1182 Valid, 4283 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 05:01:04,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2024-11-19 05:01:04,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 1130. [2024-11-19 05:01:04,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1130 states, 746 states have (on average 1.1970509383378016) internal successors, (893), 771 states have internal predecessors, (893), 271 states have call successors, (271), 99 states have call predecessors, (271), 99 states have return successors, (273), 267 states have call predecessors, (273), 269 states have call successors, (273) [2024-11-19 05:01:04,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1437 transitions. [2024-11-19 05:01:04,597 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1437 transitions. Word has length 183 [2024-11-19 05:01:04,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:01:04,598 INFO L471 AbstractCegarLoop]: Abstraction has 1130 states and 1437 transitions. [2024-11-19 05:01:04,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (26), 3 states have call predecessors, (26), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-19 05:01:04,599 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1437 transitions. [2024-11-19 05:01:04,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-19 05:01:04,601 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:01:04,601 INFO L215 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] [2024-11-19 05:01:04,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 05:01:04,601 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_linux_lib_idr_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2024-11-19 05:01:04,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:01:04,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1229393326, now seen corresponding path program 1 times [2024-11-19 05:01:04,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:01:04,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383318220] [2024-11-19 05:01:04,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:01:04,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:01:05,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:01:05,734 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-19 05:01:05,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:01:05,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383318220] [2024-11-19 05:01:05,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383318220] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:01:05,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:01:05,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 05:01:05,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20565598] [2024-11-19 05:01:05,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:01:05,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 05:01:05,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:01:05,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 05:01:05,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 05:01:05,737 INFO L87 Difference]: Start difference. First operand 1130 states and 1437 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) [2024-11-19 05:01:05,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:01:05,913 INFO L93 Difference]: Finished difference Result 1130 states and 1437 transitions. [2024-11-19 05:01:05,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 05:01:05,913 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 [2024-11-19 05:01:05,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:01:05,920 INFO L225 Difference]: With dead ends: 1130 [2024-11-19 05:01:05,921 INFO L226 Difference]: Without dead ends: 1128 [2024-11-19 05:01:05,922 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 05:01:05,922 INFO L432 NwaCegarLoop]: 1326 mSDtfsCounter, 1283 mSDsluCounter, 1325 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1283 SdHoareTripleChecker+Valid, 2651 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 05:01:05,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1283 Valid, 2651 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 05:01:05,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2024-11-19 05:01:06,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 1128. [2024-11-19 05:01:06,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1128 states, 745 states have (on average 1.1959731543624161) internal successors, (891), 769 states have internal predecessors, (891), 271 states have call successors, (271), 99 states have call predecessors, (271), 99 states have return successors, (273), 267 states have call predecessors, (273), 269 states have call successors, (273) [2024-11-19 05:01:06,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 1435 transitions. [2024-11-19 05:01:06,037 INFO L78 Accepts]: Start accepts. Automaton has 1128 states and 1435 transitions. Word has length 151 [2024-11-19 05:01:06,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:01:06,038 INFO L471 AbstractCegarLoop]: Abstraction has 1128 states and 1435 transitions. [2024-11-19 05:01:06,038 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) [2024-11-19 05:01:06,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 1435 transitions. [2024-11-19 05:01:06,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-19 05:01:06,040 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:01:06,040 INFO L215 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] [2024-11-19 05:01:06,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-19 05:01:06,041 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2024-11-19 05:01:06,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:01:06,041 INFO L85 PathProgramCache]: Analyzing trace with hash 268790236, now seen corresponding path program 1 times [2024-11-19 05:01:06,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:01:06,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78914922] [2024-11-19 05:01:06,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:01:06,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:01:06,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:01:07,217 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-19 05:01:07,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:01:07,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78914922] [2024-11-19 05:01:07,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78914922] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:01:07,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:01:07,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 05:01:07,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992072909] [2024-11-19 05:01:07,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:01:07,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 05:01:07,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:01:07,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 05:01:07,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 05:01:07,222 INFO L87 Difference]: Start difference. First operand 1128 states and 1435 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) [2024-11-19 05:01:07,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:01:07,489 INFO L93 Difference]: Finished difference Result 1128 states and 1435 transitions. [2024-11-19 05:01:07,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 05:01:07,491 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 [2024-11-19 05:01:07,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:01:07,499 INFO L225 Difference]: With dead ends: 1128 [2024-11-19 05:01:07,500 INFO L226 Difference]: Without dead ends: 1126 [2024-11-19 05:01:07,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 05:01:07,502 INFO L432 NwaCegarLoop]: 1324 mSDtfsCounter, 1280 mSDsluCounter, 1323 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1280 SdHoareTripleChecker+Valid, 2647 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 05:01:07,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1280 Valid, 2647 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 05:01:07,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1126 states. [2024-11-19 05:01:07,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1126 to 1126. [2024-11-19 05:01:07,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1126 states, 744 states have (on average 1.1948924731182795) internal successors, (889), 767 states have internal predecessors, (889), 271 states have call successors, (271), 99 states have call predecessors, (271), 99 states have return successors, (273), 267 states have call predecessors, (273), 269 states have call successors, (273) [2024-11-19 05:01:07,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 1433 transitions. [2024-11-19 05:01:07,724 INFO L78 Accepts]: Start accepts. Automaton has 1126 states and 1433 transitions. Word has length 157 [2024-11-19 05:01:07,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:01:07,724 INFO L471 AbstractCegarLoop]: Abstraction has 1126 states and 1433 transitions. [2024-11-19 05:01:07,725 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) [2024-11-19 05:01:07,725 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1433 transitions. [2024-11-19 05:01:07,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-19 05:01:07,729 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:01:07,729 INFO L215 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] [2024-11-19 05:01:07,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-19 05:01:07,729 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2024-11-19 05:01:07,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:01:07,730 INFO L85 PathProgramCache]: Analyzing trace with hash 128188905, now seen corresponding path program 1 times [2024-11-19 05:01:07,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:01:07,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108214570] [2024-11-19 05:01:07,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:01:07,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:01:08,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:01:08,586 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 383 trivial. 0 not checked. [2024-11-19 05:01:08,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:01:08,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108214570] [2024-11-19 05:01:08,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108214570] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:01:08,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:01:08,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 05:01:08,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302454612] [2024-11-19 05:01:08,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:01:08,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:01:08,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:01:08,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:01:08,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:01:08,589 INFO L87 Difference]: Start difference. First operand 1126 states and 1433 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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) [2024-11-19 05:01:08,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:01:08,745 INFO L93 Difference]: Finished difference Result 2088 states and 2631 transitions. [2024-11-19 05:01:08,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:01:08,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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 204 [2024-11-19 05:01:08,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:01:08,753 INFO L225 Difference]: With dead ends: 2088 [2024-11-19 05:01:08,753 INFO L226 Difference]: Without dead ends: 1122 [2024-11-19 05:01:08,758 INFO L431 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 [2024-11-19 05:01:08,758 INFO L432 NwaCegarLoop]: 1320 mSDtfsCounter, 1304 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1304 SdHoareTripleChecker+Valid, 1320 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 05:01:08,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1304 Valid, 1320 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 05:01:08,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2024-11-19 05:01:08,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 1122. [2024-11-19 05:01:08,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1122 states, 741 states have (on average 1.1929824561403508) internal successors, (884), 763 states have internal predecessors, (884), 271 states have call successors, (271), 99 states have call predecessors, (271), 99 states have return successors, (273), 267 states have call predecessors, (273), 269 states have call successors, (273) [2024-11-19 05:01:08,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1428 transitions. [2024-11-19 05:01:08,961 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1428 transitions. Word has length 204 [2024-11-19 05:01:08,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:01:08,962 INFO L471 AbstractCegarLoop]: Abstraction has 1122 states and 1428 transitions. [2024-11-19 05:01:08,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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) [2024-11-19 05:01:08,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1428 transitions. [2024-11-19 05:01:08,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-19 05:01:08,964 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:01:08,964 INFO L215 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] [2024-11-19 05:01:08,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-19 05:01:08,964 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_linux_net_rtnetlink_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2024-11-19 05:01:08,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:01:08,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1226328602, now seen corresponding path program 1 times [2024-11-19 05:01:08,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:01:08,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006838881] [2024-11-19 05:01:08,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:01:08,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:01:09,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:01:09,808 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-19 05:01:09,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:01:09,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006838881] [2024-11-19 05:01:09,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006838881] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:01:09,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:01:09,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 05:01:09,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315063371] [2024-11-19 05:01:09,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:01:09,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 05:01:09,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:01:09,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 05:01:09,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 05:01:09,810 INFO L87 Difference]: Start difference. First operand 1122 states and 1428 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) [2024-11-19 05:01:09,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:01:09,964 INFO L93 Difference]: Finished difference Result 1122 states and 1428 transitions. [2024-11-19 05:01:09,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 05:01:09,965 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 [2024-11-19 05:01:09,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:01:09,971 INFO L225 Difference]: With dead ends: 1122 [2024-11-19 05:01:09,972 INFO L226 Difference]: Without dead ends: 1120 [2024-11-19 05:01:09,972 INFO L431 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 [2024-11-19 05:01:09,973 INFO L432 NwaCegarLoop]: 1317 mSDtfsCounter, 1272 mSDsluCounter, 1316 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1272 SdHoareTripleChecker+Valid, 2633 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 05:01:09,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1272 Valid, 2633 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 05:01:09,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2024-11-19 05:01:10,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 1120. [2024-11-19 05:01:10,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1120 states, 740 states have (on average 1.191891891891892) internal successors, (882), 761 states have internal predecessors, (882), 271 states have call successors, (271), 99 states have call predecessors, (271), 99 states have return successors, (273), 267 states have call predecessors, (273), 269 states have call successors, (273) [2024-11-19 05:01:10,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 1120 states and 1426 transitions. [2024-11-19 05:01:10,107 INFO L78 Accepts]: Start accepts. Automaton has 1120 states and 1426 transitions. Word has length 163 [2024-11-19 05:01:10,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:01:10,108 INFO L471 AbstractCegarLoop]: Abstraction has 1120 states and 1426 transitions. [2024-11-19 05:01:10,108 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) [2024-11-19 05:01:10,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 1426 transitions. [2024-11-19 05:01:10,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-19 05:01:10,110 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:01:10,110 INFO L215 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] [2024-11-19 05:01:10,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-19 05:01:10,112 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2024-11-19 05:01:10,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:01:10,113 INFO L85 PathProgramCache]: Analyzing trace with hash -2100561608, now seen corresponding path program 1 times [2024-11-19 05:01:10,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:01:10,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031618609] [2024-11-19 05:01:10,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:01:10,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:01:10,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:01:11,036 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2024-11-19 05:01:11,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:01:11,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031618609] [2024-11-19 05:01:11,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031618609] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 05:01:11,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057013293] [2024-11-19 05:01:11,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:01:11,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:01:11,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:01:11,039 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 05:01:11,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 05:01:12,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:01:12,741 INFO L255 TraceCheckSpWp]: Trace formula consists of 2434 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 05:01:12,760 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 05:01:13,060 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2024-11-19 05:01:13,060 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 05:01:13,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057013293] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:01:13,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 05:01:13,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-19 05:01:13,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429886717] [2024-11-19 05:01:13,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:01:13,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:01:13,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:01:13,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:01:13,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-19 05:01:13,062 INFO L87 Difference]: Start difference. First operand 1120 states and 1426 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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) [2024-11-19 05:01:13,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:01:13,259 INFO L93 Difference]: Finished difference Result 2129 states and 2683 transitions. [2024-11-19 05:01:13,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:01:13,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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 210 [2024-11-19 05:01:13,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:01:13,267 INFO L225 Difference]: With dead ends: 2129 [2024-11-19 05:01:13,267 INFO L226 Difference]: Without dead ends: 1172 [2024-11-19 05:01:13,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-19 05:01:13,271 INFO L432 NwaCegarLoop]: 1378 mSDtfsCounter, 1247 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1247 SdHoareTripleChecker+Valid, 1445 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 05:01:13,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1247 Valid, 1445 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 05:01:13,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2024-11-19 05:01:13,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 1169. [2024-11-19 05:01:13,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1169 states, 769 states have (on average 1.1859557867360209) internal successors, (912), 793 states have internal predecessors, (912), 286 states have call successors, (286), 105 states have call predecessors, (286), 105 states have return successors, (288), 280 states have call predecessors, (288), 284 states have call successors, (288) [2024-11-19 05:01:13,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1169 states to 1169 states and 1486 transitions. [2024-11-19 05:01:13,411 INFO L78 Accepts]: Start accepts. Automaton has 1169 states and 1486 transitions. Word has length 210 [2024-11-19 05:01:13,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:01:13,412 INFO L471 AbstractCegarLoop]: Abstraction has 1169 states and 1486 transitions. [2024-11-19 05:01:13,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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) [2024-11-19 05:01:13,412 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 1486 transitions. [2024-11-19 05:01:13,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-11-19 05:01:13,415 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:01:13,415 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 7, 7, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:01:13,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 05:01:13,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-19 05:01:13,616 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2024-11-19 05:01:13,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:01:13,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1587233531, now seen corresponding path program 1 times [2024-11-19 05:01:13,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:01:13,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754023921] [2024-11-19 05:01:13,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:01:13,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:01:14,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat