./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.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 6fbcf05da5228307460c10a1ab2d8431ff74359811f7e2c9b55e8eaa9db8f14c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 14:35:57,364 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 14:35:57,403 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-24 14:35:57,407 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 14:35:57,407 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 14:35:57,422 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 14:35:57,423 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 14:35:57,423 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 14:35:57,424 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 14:35:57,424 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 14:35:57,424 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 14:35:57,425 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 14:35:57,425 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 14:35:57,426 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 14:35:57,426 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 14:35:57,426 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 14:35:57,426 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 14:35:57,427 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 14:35:57,427 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 14:35:57,427 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 14:35:57,428 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 14:35:57,428 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 14:35:57,428 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 14:35:57,429 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 14:35:57,429 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 14:35:57,429 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 14:35:57,430 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 14:35:57,430 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 14:35:57,430 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 14:35:57,430 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 14:35:57,431 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 14:35:57,431 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 14:35:57,431 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 14:35:57,431 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 14:35:57,431 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 14:35:57,432 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 14:35:57,432 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 14:35:57,432 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 14:35:57,432 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 14:35:57,432 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 -> 6fbcf05da5228307460c10a1ab2d8431ff74359811f7e2c9b55e8eaa9db8f14c [2024-10-24 14:35:57,609 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 14:35:57,631 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 14:35:57,633 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 14:35:57,634 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 14:35:57,634 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 14:35:57,635 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i [2024-10-24 14:35:59,109 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 14:35:59,544 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 14:35:59,545 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i [2024-10-24 14:35:59,599 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb25e5568/eff6e6486ff545d8a7341cf53470ccd1/FLAGb0d4416dd [2024-10-24 14:35:59,611 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb25e5568/eff6e6486ff545d8a7341cf53470ccd1 [2024-10-24 14:35:59,613 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 14:35:59,615 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 14:35:59,616 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 14:35:59,616 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 14:35:59,620 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 14:35:59,621 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:35:59" (1/1) ... [2024-10-24 14:35:59,621 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b430d5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:35:59, skipping insertion in model container [2024-10-24 14:35:59,625 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:35:59" (1/1) ... [2024-10-24 14:35:59,806 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 14:36:01,803 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[307309,307322] [2024-10-24 14:36:01,807 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[307454,307467] [2024-10-24 14:36:01,807 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[307600,307613] [2024-10-24 14:36:01,807 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[307765,307778] [2024-10-24 14:36:01,808 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[307923,307936] [2024-10-24 14:36:01,808 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308081,308094] [2024-10-24 14:36:01,808 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308239,308252] [2024-10-24 14:36:01,809 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308399,308412] [2024-10-24 14:36:01,809 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308558,308571] [2024-10-24 14:36:01,809 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308697,308710] [2024-10-24 14:36:01,809 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308839,308852] [2024-10-24 14:36:01,810 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308988,309001] [2024-10-24 14:36:01,810 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[309127,309140] [2024-10-24 14:36:01,811 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[309282,309295] [2024-10-24 14:36:01,811 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[309442,309455] [2024-10-24 14:36:01,811 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[309593,309606] [2024-10-24 14:36:01,812 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[309744,309757] [2024-10-24 14:36:01,812 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[309896,309909] [2024-10-24 14:36:01,812 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310045,310058] [2024-10-24 14:36:01,813 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310193,310206] [2024-10-24 14:36:01,813 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310350,310363] [2024-10-24 14:36:01,813 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310499,310512] [2024-10-24 14:36:01,814 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310655,310668] [2024-10-24 14:36:01,814 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310808,310821] [2024-10-24 14:36:01,814 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310954,310967] [2024-10-24 14:36:01,815 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[311097,311110] [2024-10-24 14:36:01,815 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[311249,311262] [2024-10-24 14:36:01,815 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[311395,311408] [2024-10-24 14:36:01,816 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[311540,311553] [2024-10-24 14:36:01,816 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[311694,311707] [2024-10-24 14:36:01,816 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[311845,311858] [2024-10-24 14:36:01,817 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312000,312013] [2024-10-24 14:36:01,817 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312152,312165] [2024-10-24 14:36:01,818 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312307,312320] [2024-10-24 14:36:01,818 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312471,312484] [2024-10-24 14:36:01,819 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312627,312640] [2024-10-24 14:36:01,819 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312791,312804] [2024-10-24 14:36:01,819 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312933,312946] [2024-10-24 14:36:01,820 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[313091,313104] [2024-10-24 14:36:01,820 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[313258,313271] [2024-10-24 14:36:01,821 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[313417,313430] [2024-10-24 14:36:01,821 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[313576,313589] [2024-10-24 14:36:01,821 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[313725,313738] [2024-10-24 14:36:01,823 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[313872,313885] [2024-10-24 14:36:01,823 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[314011,314024] [2024-10-24 14:36:01,824 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[314174,314187] [2024-10-24 14:36:01,824 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[314340,314353] [2024-10-24 14:36:01,824 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[314504,314517] [2024-10-24 14:36:01,825 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[314669,314682] [2024-10-24 14:36:01,826 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[314834,314847] [2024-10-24 14:36:01,826 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315000,315013] [2024-10-24 14:36:01,826 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315165,315178] [2024-10-24 14:36:01,827 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315332,315345] [2024-10-24 14:36:01,828 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315492,315505] [2024-10-24 14:36:01,828 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315654,315667] [2024-10-24 14:36:01,828 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315813,315826] [2024-10-24 14:36:01,829 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315959,315972] [2024-10-24 14:36:01,829 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316102,316115] [2024-10-24 14:36:01,830 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316246,316259] [2024-10-24 14:36:01,830 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316389,316402] [2024-10-24 14:36:01,831 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316533,316546] [2024-10-24 14:36:01,831 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316674,316687] [2024-10-24 14:36:01,832 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316812,316825] [2024-10-24 14:36:01,832 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316970,316983] [2024-10-24 14:36:01,832 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[317129,317142] [2024-10-24 14:36:01,833 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[317285,317298] [2024-10-24 14:36:01,833 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[317434,317447] [2024-10-24 14:36:01,833 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[317586,317599] [2024-10-24 14:36:01,834 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[317737,317750] [2024-10-24 14:36:01,834 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[317886,317899] [2024-10-24 14:36:01,835 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318038,318051] [2024-10-24 14:36:01,835 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318186,318199] [2024-10-24 14:36:01,836 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318339,318352] [2024-10-24 14:36:01,836 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318490,318503] [2024-10-24 14:36:01,837 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318640,318653] [2024-10-24 14:36:01,837 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318787,318800] [2024-10-24 14:36:01,837 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318938,318951] [2024-10-24 14:36:01,838 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[319089,319102] [2024-10-24 14:36:01,838 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[319237,319250] [2024-10-24 14:36:01,838 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[319403,319416] [2024-10-24 14:36:01,838 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[319572,319585] [2024-10-24 14:36:01,839 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[319739,319752] [2024-10-24 14:36:01,839 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[319907,319920] [2024-10-24 14:36:01,839 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[320057,320070] [2024-10-24 14:36:01,840 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[320204,320217] [2024-10-24 14:36:01,840 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[320365,320378] [2024-10-24 14:36:01,840 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[320535,320548] [2024-10-24 14:36:01,840 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[320697,320710] [2024-10-24 14:36:01,847 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 14:36:01,876 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 14:36:02,037 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; bts %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [4177] [2024-10-24 14:36:02,039 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; btr %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr)); [4184] [2024-10-24 14:36:02,039 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("":); [4191] [2024-10-24 14:36:02,207 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[307309,307322] [2024-10-24 14:36:02,208 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[307454,307467] [2024-10-24 14:36:02,208 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[307600,307613] [2024-10-24 14:36:02,208 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[307765,307778] [2024-10-24 14:36:02,209 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[307923,307936] [2024-10-24 14:36:02,209 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308081,308094] [2024-10-24 14:36:02,209 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308239,308252] [2024-10-24 14:36:02,209 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308399,308412] [2024-10-24 14:36:02,209 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308558,308571] [2024-10-24 14:36:02,210 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308697,308710] [2024-10-24 14:36:02,210 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308839,308852] [2024-10-24 14:36:02,210 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308988,309001] [2024-10-24 14:36:02,210 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[309127,309140] [2024-10-24 14:36:02,210 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[309282,309295] [2024-10-24 14:36:02,211 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[309442,309455] [2024-10-24 14:36:02,211 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[309593,309606] [2024-10-24 14:36:02,213 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[309744,309757] [2024-10-24 14:36:02,213 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[309896,309909] [2024-10-24 14:36:02,214 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310045,310058] [2024-10-24 14:36:02,214 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310193,310206] [2024-10-24 14:36:02,214 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310350,310363] [2024-10-24 14:36:02,215 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310499,310512] [2024-10-24 14:36:02,215 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310655,310668] [2024-10-24 14:36:02,215 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310808,310821] [2024-10-24 14:36:02,215 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310954,310967] [2024-10-24 14:36:02,216 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[311097,311110] [2024-10-24 14:36:02,216 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[311249,311262] [2024-10-24 14:36:02,217 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[311395,311408] [2024-10-24 14:36:02,217 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[311540,311553] [2024-10-24 14:36:02,220 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[311694,311707] [2024-10-24 14:36:02,220 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[311845,311858] [2024-10-24 14:36:02,221 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312000,312013] [2024-10-24 14:36:02,221 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312152,312165] [2024-10-24 14:36:02,221 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312307,312320] [2024-10-24 14:36:02,221 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312471,312484] [2024-10-24 14:36:02,221 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312627,312640] [2024-10-24 14:36:02,222 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312791,312804] [2024-10-24 14:36:02,222 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312933,312946] [2024-10-24 14:36:02,222 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[313091,313104] [2024-10-24 14:36:02,222 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[313258,313271] [2024-10-24 14:36:02,222 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[313417,313430] [2024-10-24 14:36:02,223 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[313576,313589] [2024-10-24 14:36:02,223 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[313725,313738] [2024-10-24 14:36:02,224 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[313872,313885] [2024-10-24 14:36:02,225 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[314011,314024] [2024-10-24 14:36:02,225 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[314174,314187] [2024-10-24 14:36:02,225 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[314340,314353] [2024-10-24 14:36:02,226 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[314504,314517] [2024-10-24 14:36:02,226 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[314669,314682] [2024-10-24 14:36:02,226 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[314834,314847] [2024-10-24 14:36:02,226 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315000,315013] [2024-10-24 14:36:02,227 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315165,315178] [2024-10-24 14:36:02,227 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315332,315345] [2024-10-24 14:36:02,227 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315492,315505] [2024-10-24 14:36:02,227 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315654,315667] [2024-10-24 14:36:02,228 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315813,315826] [2024-10-24 14:36:02,228 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315959,315972] [2024-10-24 14:36:02,228 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316102,316115] [2024-10-24 14:36:02,229 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316246,316259] [2024-10-24 14:36:02,229 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316389,316402] [2024-10-24 14:36:02,230 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316533,316546] [2024-10-24 14:36:02,230 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316674,316687] [2024-10-24 14:36:02,230 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316812,316825] [2024-10-24 14:36:02,230 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316970,316983] [2024-10-24 14:36:02,231 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[317129,317142] [2024-10-24 14:36:02,231 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[317285,317298] [2024-10-24 14:36:02,232 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[317434,317447] [2024-10-24 14:36:02,232 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[317586,317599] [2024-10-24 14:36:02,232 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[317737,317750] [2024-10-24 14:36:02,233 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[317886,317899] [2024-10-24 14:36:02,233 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318038,318051] [2024-10-24 14:36:02,234 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318186,318199] [2024-10-24 14:36:02,234 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318339,318352] [2024-10-24 14:36:02,235 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318490,318503] [2024-10-24 14:36:02,235 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318640,318653] [2024-10-24 14:36:02,236 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318787,318800] [2024-10-24 14:36:02,236 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318938,318951] [2024-10-24 14:36:02,236 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[319089,319102] [2024-10-24 14:36:02,236 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[319237,319250] [2024-10-24 14:36:02,236 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[319403,319416] [2024-10-24 14:36:02,237 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[319572,319585] [2024-10-24 14:36:02,237 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[319739,319752] [2024-10-24 14:36:02,237 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[319907,319920] [2024-10-24 14:36:02,237 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[320057,320070] [2024-10-24 14:36:02,237 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[320204,320217] [2024-10-24 14:36:02,238 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[320365,320378] [2024-10-24 14:36:02,238 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[320535,320548] [2024-10-24 14:36:02,238 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[320697,320710] [2024-10-24 14:36:02,241 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 14:36:02,411 INFO L204 MainTranslator]: Completed translation [2024-10-24 14:36:02,411 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:36:02 WrapperNode [2024-10-24 14:36:02,412 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 14:36:02,413 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 14:36:02,413 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 14:36:02,414 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 14:36:02,421 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:36:02" (1/1) ... [2024-10-24 14:36:02,484 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:36:02" (1/1) ... [2024-10-24 14:36:02,597 INFO L138 Inliner]: procedures = 592, calls = 1939, calls flagged for inlining = 265, calls inlined = 171, statements flattened = 3498 [2024-10-24 14:36:02,598 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 14:36:02,598 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 14:36:02,598 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 14:36:02,599 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 14:36:02,607 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:36:02" (1/1) ... [2024-10-24 14:36:02,608 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:36:02" (1/1) ... [2024-10-24 14:36:02,625 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:36:02" (1/1) ... [2024-10-24 14:36:03,192 INFO L175 MemorySlicer]: Split 575 memory accesses to 24 slices as follows [3, 8, 8, 8, 2, 8, 8, 8, 8, 1, 2, 291, 4, 8, 7, 30, 56, 4, 21, 10, 8, 49, 2, 21]. 51 percent of accesses are in the largest equivalence class. The 269 initializations are split as follows [0, 8, 8, 8, 0, 8, 8, 8, 8, 1, 2, 52, 0, 8, 0, 30, 56, 4, 21, 10, 8, 0, 0, 21]. The 133 writes are split as follows [0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 83, 1, 0, 6, 0, 0, 0, 0, 0, 0, 42, 0, 0]. [2024-10-24 14:36:03,192 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:36:02" (1/1) ... [2024-10-24 14:36:03,192 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:36:02" (1/1) ... [2024-10-24 14:36:03,268 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:36:02" (1/1) ... [2024-10-24 14:36:03,283 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:36:02" (1/1) ... [2024-10-24 14:36:03,312 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:36:02" (1/1) ... [2024-10-24 14:36:03,329 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:36:02" (1/1) ... [2024-10-24 14:36:03,359 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 14:36:03,360 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 14:36:03,360 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 14:36:03,360 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 14:36:03,361 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:36:02" (1/1) ... [2024-10-24 14:36:03,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 14:36:03,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 14:36:03,393 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-10-24 14:36:03,396 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-10-24 14:36:03,441 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2024-10-24 14:36:03,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2024-10-24 14:36:03,441 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-10-24 14:36:03,442 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-10-24 14:36:03,442 INFO L130 BoogieDeclarations]: Found specification of procedure recover_from_urb_loss [2024-10-24 14:36:03,442 INFO L138 BoogieDeclarations]: Found implementation of procedure recover_from_urb_loss [2024-10-24 14:36:03,442 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_control_urb [2024-10-24 14:36:03,442 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_control_urb [2024-10-24 14:36:03,442 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-10-24 14:36:03,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-10-24 14:36:03,443 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2024-10-24 14:36:03,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2024-10-24 14:36:03,443 INFO L130 BoogieDeclarations]: Found specification of procedure __might_sleep [2024-10-24 14:36:03,443 INFO L138 BoogieDeclarations]: Found implementation of procedure __might_sleep [2024-10-24 14:36:03,443 INFO L130 BoogieDeclarations]: Found specification of procedure usb_autopm_get_interface [2024-10-24 14:36:03,444 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_autopm_get_interface [2024-10-24 14:36:03,445 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2024-10-24 14:36:03,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2024-10-24 14:36:03,445 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2024-10-24 14:36:03,445 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2024-10-24 14:36:03,445 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2024-10-24 14:36:03,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2024-10-24 14:36:03,445 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2024-10-24 14:36:03,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2024-10-24 14:36:03,446 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_ioctl [2024-10-24 14:36:03,446 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_ioctl [2024-10-24 14:36:03,446 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2024-10-24 14:36:03,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2024-10-24 14:36:03,446 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_iuspin_of_wdm_device [2024-10-24 14:36:03,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_iuspin_of_wdm_device [2024-10-24 14:36:03,447 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2024-10-24 14:36:03,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2024-10-24 14:36:03,447 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2024-10-24 14:36:03,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2024-10-24 14:36:03,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 14:36:03,448 INFO L130 BoogieDeclarations]: Found specification of procedure cancel_work_sync [2024-10-24 14:36:03,448 INFO L138 BoogieDeclarations]: Found implementation of procedure cancel_work_sync [2024-10-24 14:36:03,448 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2024-10-24 14:36:03,448 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2024-10-24 14:36:03,448 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2024-10-24 14:36:03,448 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2024-10-24 14:36:03,448 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2024-10-24 14:36:03,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2024-10-24 14:36:03,448 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2024-10-24 14:36:03,449 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2024-10-24 14:36:03,449 INFO L130 BoogieDeclarations]: Found specification of procedure schedule [2024-10-24 14:36:03,449 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule [2024-10-24 14:36:03,449 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2024-10-24 14:36:03,449 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2024-10-24 14:36:03,449 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~TO~int [2024-10-24 14:36:03,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~TO~int [2024-10-24 14:36:03,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-10-24 14:36:03,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-10-24 14:36:03,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2024-10-24 14:36:03,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2024-10-24 14:36:03,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2024-10-24 14:36:03,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2024-10-24 14:36:03,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2024-10-24 14:36:03,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2024-10-24 14:36:03,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2024-10-24 14:36:03,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2024-10-24 14:36:03,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2024-10-24 14:36:03,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2024-10-24 14:36:03,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2024-10-24 14:36:03,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2024-10-24 14:36:03,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2024-10-24 14:36:03,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2024-10-24 14:36:03,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2024-10-24 14:36:03,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2024-10-24 14:36:03,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2024-10-24 14:36:03,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2024-10-24 14:36:03,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#20 [2024-10-24 14:36:03,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#21 [2024-10-24 14:36:03,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#22 [2024-10-24 14:36:03,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#23 [2024-10-24 14:36:03,451 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2024-10-24 14:36:03,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2024-10-24 14:36:03,452 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2024-10-24 14:36:03,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2024-10-24 14:36:03,453 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irq_111 [2024-10-24 14:36:03,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irq_111 [2024-10-24 14:36:03,453 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2024-10-24 14:36:03,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2024-10-24 14:36:03,453 INFO L130 BoogieDeclarations]: Found specification of procedure usb_autopm_put_interface [2024-10-24 14:36:03,453 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_autopm_put_interface [2024-10-24 14:36:03,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 14:36:03,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 14:36:03,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-24 14:36:03,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-24 14:36:03,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-24 14:36:03,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-24 14:36:03,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-24 14:36:03,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-24 14:36:03,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-10-24 14:36:03,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-10-24 14:36:03,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-10-24 14:36:03,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-10-24 14:36:03,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-10-24 14:36:03,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-10-24 14:36:03,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2024-10-24 14:36:03,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2024-10-24 14:36:03,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2024-10-24 14:36:03,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2024-10-24 14:36:03,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2024-10-24 14:36:03,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2024-10-24 14:36:03,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2024-10-24 14:36:03,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#21 [2024-10-24 14:36:03,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#22 [2024-10-24 14:36:03,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#23 [2024-10-24 14:36:03,458 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2024-10-24 14:36:03,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2024-10-24 14:36:03,460 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2024-10-24 14:36:03,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2024-10-24 14:36:03,460 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2024-10-24 14:36:03,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2024-10-24 14:36:03,461 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2024-10-24 14:36:03,461 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2024-10-24 14:36:03,461 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_wlock_of_wdm_device [2024-10-24 14:36:03,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_wlock_of_wdm_device [2024-10-24 14:36:03,461 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2024-10-24 14:36:03,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2024-10-24 14:36:03,461 INFO L130 BoogieDeclarations]: Found specification of procedure kill_urbs [2024-10-24 14:36:03,461 INFO L138 BoogieDeclarations]: Found implementation of procedure kill_urbs [2024-10-24 14:36:03,461 INFO L130 BoogieDeclarations]: Found specification of procedure prepare_to_wait_event [2024-10-24 14:36:03,461 INFO L138 BoogieDeclarations]: Found implementation of procedure prepare_to_wait_event [2024-10-24 14:36:03,461 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2024-10-24 14:36:03,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2024-10-24 14:36:03,461 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2024-10-24 14:36:03,461 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2024-10-24 14:36:03,462 INFO L130 BoogieDeclarations]: Found specification of procedure __dynamic_dev_dbg [2024-10-24 14:36:03,462 INFO L138 BoogieDeclarations]: Found implementation of procedure __dynamic_dev_dbg [2024-10-24 14:36:03,462 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2024-10-24 14:36:03,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2024-10-24 14:36:03,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-24 14:36:03,462 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_iuspin_of_wdm_device [2024-10-24 14:36:03,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_iuspin_of_wdm_device [2024-10-24 14:36:03,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 14:36:03,462 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2024-10-24 14:36:03,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2024-10-24 14:36:03,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-24 14:36:03,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-24 14:36:03,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-24 14:36:03,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-24 14:36:03,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-10-24 14:36:03,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-10-24 14:36:03,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-10-24 14:36:03,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-10-24 14:36:03,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-10-24 14:36:03,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-10-24 14:36:03,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2024-10-24 14:36:03,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2024-10-24 14:36:03,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2024-10-24 14:36:03,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2024-10-24 14:36:03,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2024-10-24 14:36:03,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2024-10-24 14:36:03,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2024-10-24 14:36:03,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2024-10-24 14:36:03,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2024-10-24 14:36:03,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2024-10-24 14:36:03,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#20 [2024-10-24 14:36:03,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#21 [2024-10-24 14:36:03,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#22 [2024-10-24 14:36:03,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#23 [2024-10-24 14:36:03,464 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2024-10-24 14:36:03,464 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2024-10-24 14:36:03,465 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-24 14:36:03,466 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-24 14:36:03,466 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_irq_check_alloc_flags [2024-10-24 14:36:03,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_irq_check_alloc_flags [2024-10-24 14:36:03,466 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2024-10-24 14:36:03,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2024-10-24 14:36:03,466 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_find_device [2024-10-24 14:36:03,466 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_find_device [2024-10-24 14:36:03,466 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2024-10-24 14:36:03,466 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2024-10-24 14:36:03,466 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2024-10-24 14:36:03,466 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2024-10-24 14:36:03,466 INFO L130 BoogieDeclarations]: Found specification of procedure finish_wait [2024-10-24 14:36:03,466 INFO L138 BoogieDeclarations]: Found implementation of procedure finish_wait [2024-10-24 14:36:03,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 14:36:03,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 14:36:03,467 INFO L130 BoogieDeclarations]: Found specification of procedure usb_translate_errors [2024-10-24 14:36:03,467 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_translate_errors [2024-10-24 14:36:03,467 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2024-10-24 14:36:03,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2024-10-24 14:36:03,467 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2024-10-24 14:36:03,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2024-10-24 14:36:03,467 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_create [2024-10-24 14:36:03,467 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_create [2024-10-24 14:36:03,467 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_128 [2024-10-24 14:36:03,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_128 [2024-10-24 14:36:03,467 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2024-10-24 14:36:03,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2024-10-24 14:36:03,467 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_free_urb [2024-10-24 14:36:03,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_free_urb [2024-10-24 14:36:03,467 INFO L130 BoogieDeclarations]: Found specification of procedure clear_wdm_read_flag [2024-10-24 14:36:03,467 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_wdm_read_flag [2024-10-24 14:36:03,468 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2024-10-24 14:36:03,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2024-10-24 14:36:03,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-24 14:36:03,468 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2024-10-24 14:36:03,468 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2024-10-24 14:36:03,468 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2024-10-24 14:36:03,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2024-10-24 14:36:03,468 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_disconnect [2024-10-24 14:36:03,468 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_disconnect [2024-10-24 14:36:03,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-24 14:36:03,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-24 14:36:03,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-24 14:36:03,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-24 14:36:03,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-10-24 14:36:03,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-10-24 14:36:03,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-10-24 14:36:03,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-10-24 14:36:03,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-10-24 14:36:03,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-10-24 14:36:03,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2024-10-24 14:36:03,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2024-10-24 14:36:03,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2024-10-24 14:36:03,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2024-10-24 14:36:03,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2024-10-24 14:36:03,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2024-10-24 14:36:03,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2024-10-24 14:36:03,473 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2024-10-24 14:36:03,473 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2024-10-24 14:36:03,473 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2024-10-24 14:36:03,473 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#20 [2024-10-24 14:36:03,473 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#21 [2024-10-24 14:36:03,473 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#22 [2024-10-24 14:36:03,474 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#23 [2024-10-24 14:36:03,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-24 14:36:03,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-24 14:36:03,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-24 14:36:03,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-10-24 14:36:03,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-10-24 14:36:03,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-10-24 14:36:03,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-10-24 14:36:03,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2024-10-24 14:36:03,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2024-10-24 14:36:03,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2024-10-24 14:36:03,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2024-10-24 14:36:03,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2024-10-24 14:36:03,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2024-10-24 14:36:03,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2024-10-24 14:36:03,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2024-10-24 14:36:03,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2024-10-24 14:36:03,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2024-10-24 14:36:03,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2024-10-24 14:36:03,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2024-10-24 14:36:03,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2024-10-24 14:36:03,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#20 [2024-10-24 14:36:03,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#21 [2024-10-24 14:36:03,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#22 [2024-10-24 14:36:03,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#23 [2024-10-24 14:36:03,475 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_wdm_mutex [2024-10-24 14:36:03,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_wdm_mutex [2024-10-24 14:36:03,475 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2024-10-24 14:36:03,475 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2024-10-24 14:36:03,475 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2024-10-24 14:36:03,475 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2024-10-24 14:36:03,475 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2024-10-24 14:36:03,475 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2024-10-24 14:36:03,476 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2024-10-24 14:36:03,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2024-10-24 14:36:03,476 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_rlock_of_wdm_device [2024-10-24 14:36:03,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_rlock_of_wdm_device [2024-10-24 14:36:03,476 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2024-10-24 14:36:03,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2024-10-24 14:36:03,476 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2024-10-24 14:36:03,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2024-10-24 14:36:03,476 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2024-10-24 14:36:03,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2024-10-24 14:36:03,480 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_alloc_urb [2024-10-24 14:36:03,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_alloc_urb [2024-10-24 14:36:03,480 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2024-10-24 14:36:03,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2024-10-24 14:36:03,481 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2024-10-24 14:36:03,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2024-10-24 14:36:03,481 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2024-10-24 14:36:03,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2024-10-24 14:36:03,481 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2024-10-24 14:36:03,481 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2024-10-24 14:36:03,481 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2024-10-24 14:36:03,481 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2024-10-24 14:36:03,481 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2024-10-24 14:36:03,481 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2024-10-24 14:36:03,481 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_wdm_mutex [2024-10-24 14:36:03,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_wdm_mutex [2024-10-24 14:36:03,481 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2024-10-24 14:36:03,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2024-10-24 14:36:03,481 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2024-10-24 14:36:03,481 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2024-10-24 14:36:03,481 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2024-10-24 14:36:03,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2024-10-24 14:36:03,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 14:36:03,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 14:36:03,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-24 14:36:03,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-24 14:36:03,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-24 14:36:03,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-24 14:36:03,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-24 14:36:03,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-24 14:36:03,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-10-24 14:36:03,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-10-24 14:36:03,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-10-24 14:36:03,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-10-24 14:36:03,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-10-24 14:36:03,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-10-24 14:36:03,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2024-10-24 14:36:03,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2024-10-24 14:36:03,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2024-10-24 14:36:03,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2024-10-24 14:36:03,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2024-10-24 14:36:03,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2024-10-24 14:36:03,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2024-10-24 14:36:03,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#21 [2024-10-24 14:36:03,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#22 [2024-10-24 14:36:03,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#23 [2024-10-24 14:36:03,483 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2024-10-24 14:36:03,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2024-10-24 14:36:03,487 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2024-10-24 14:36:03,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2024-10-24 14:36:03,487 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_95 [2024-10-24 14:36:03,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_95 [2024-10-24 14:36:03,487 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_resume [2024-10-24 14:36:03,487 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_resume [2024-10-24 14:36:03,487 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2024-10-24 14:36:03,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2024-10-24 14:36:03,488 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_96 [2024-10-24 14:36:03,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_96 [2024-10-24 14:36:03,488 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_rlock_of_wdm_device [2024-10-24 14:36:03,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_rlock_of_wdm_device [2024-10-24 14:36:03,488 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2024-10-24 14:36:03,488 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2024-10-24 14:36:03,488 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2024-10-24 14:36:03,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2024-10-24 14:36:03,488 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2024-10-24 14:36:03,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2024-10-24 14:36:03,488 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2024-10-24 14:36:03,488 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2024-10-24 14:36:03,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 14:36:03,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 14:36:03,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-24 14:36:03,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-24 14:36:03,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-24 14:36:03,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-24 14:36:03,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-24 14:36:03,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-24 14:36:03,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-24 14:36:03,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-24 14:36:03,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-24 14:36:03,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-24 14:36:03,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-24 14:36:03,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-24 14:36:03,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-24 14:36:03,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-24 14:36:03,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-10-24 14:36:03,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-10-24 14:36:03,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-10-24 14:36:03,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-10-24 14:36:03,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2024-10-24 14:36:03,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#21 [2024-10-24 14:36:03,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#22 [2024-10-24 14:36:03,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#23 [2024-10-24 14:36:03,490 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_wlock_of_wdm_device [2024-10-24 14:36:03,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_wlock_of_wdm_device [2024-10-24 14:36:03,490 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_irq_110 [2024-10-24 14:36:03,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_irq_110 [2024-10-24 14:36:04,005 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 14:36:04,008 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 14:36:04,059 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2024-10-24 14:36:06,653 INFO L? ?]: Removed 1513 outVars from TransFormulas that were not future-live. [2024-10-24 14:36:06,654 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 14:36:06,895 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 14:36:06,895 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-24 14:36:06,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:36:06 BoogieIcfgContainer [2024-10-24 14:36:06,896 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 14:36:06,897 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 14:36:06,897 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 14:36:06,903 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 14:36:06,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:35:59" (1/3) ... [2024-10-24 14:36:06,904 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@befac9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:36:06, skipping insertion in model container [2024-10-24 14:36:06,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:36:02" (2/3) ... [2024-10-24 14:36:06,904 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@befac9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:36:06, skipping insertion in model container [2024-10-24 14:36:06,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:36:06" (3/3) ... [2024-10-24 14:36:06,905 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i [2024-10-24 14:36:06,936 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 14:36:06,940 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2024-10-24 14:36:07,037 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 14:36:07,047 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;@3ffbe8d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 14:36:07,048 INFO L334 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2024-10-24 14:36:07,060 INFO L276 IsEmpty]: Start isEmpty. Operand has 1225 states, 699 states have (on average 1.3204577968526467) internal successors, (923), 751 states have internal predecessors, (923), 399 states have call successors, (399), 97 states have call predecessors, (399), 96 states have return successors, (394), 392 states have call predecessors, (394), 394 states have call successors, (394) [2024-10-24 14:36:07,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-24 14:36:07,073 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:36:07,074 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-24 14:36:07,074 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2024-10-24 14:36:07,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:36:07,080 INFO L85 PathProgramCache]: Analyzing trace with hash -276970603, now seen corresponding path program 1 times [2024-10-24 14:36:07,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:36:07,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754358555] [2024-10-24 14:36:07,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:36:07,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:36:07,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:07,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:07,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:07,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 14:36:07,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:07,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 14:36:07,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:07,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 14:36:07,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:07,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 14:36:07,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:07,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 14:36:07,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:07,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 14:36:07,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:07,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:07,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:07,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 14:36:07,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:07,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 14:36:07,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:07,876 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 14:36:07,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:36:07,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754358555] [2024-10-24 14:36:07,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754358555] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:36:07,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:36:07,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 14:36:07,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991905339] [2024-10-24 14:36:07,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:36:07,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 14:36:07,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:36:07,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 14:36:07,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 14:36:07,902 INFO L87 Difference]: Start difference. First operand has 1225 states, 699 states have (on average 1.3204577968526467) internal successors, (923), 751 states have internal predecessors, (923), 399 states have call successors, (399), 97 states have call predecessors, (399), 96 states have return successors, (394), 392 states have call predecessors, (394), 394 states have call successors, (394) Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 14:36:12,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:36:12,072 INFO L93 Difference]: Finished difference Result 2393 states and 3499 transitions. [2024-10-24 14:36:12,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 14:36:12,074 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (11), 4 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 53 [2024-10-24 14:36:12,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:36:12,092 INFO L225 Difference]: With dead ends: 2393 [2024-10-24 14:36:12,093 INFO L226 Difference]: Without dead ends: 1210 [2024-10-24 14:36:12,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-24 14:36:12,110 INFO L432 NwaCegarLoop]: 920 mSDtfsCounter, 2005 mSDsluCounter, 1460 mSDsCounter, 0 mSdLazyCounter, 2391 mSolverCounterSat, 1344 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2253 SdHoareTripleChecker+Valid, 2380 SdHoareTripleChecker+Invalid, 3735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1344 IncrementalHoareTripleChecker+Valid, 2391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-10-24 14:36:12,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2253 Valid, 2380 Invalid, 3735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1344 Valid, 2391 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-10-24 14:36:12,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2024-10-24 14:36:12,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 1210. [2024-10-24 14:36:12,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1210 states, 692 states have (on average 1.2658959537572254) internal successors, (876), 739 states have internal predecessors, (876), 394 states have call successors, (394), 96 states have call predecessors, (394), 95 states have return successors, (392), 390 states have call predecessors, (392), 392 states have call successors, (392) [2024-10-24 14:36:12,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 1662 transitions. [2024-10-24 14:36:12,289 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 1662 transitions. Word has length 53 [2024-10-24 14:36:12,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:36:12,291 INFO L471 AbstractCegarLoop]: Abstraction has 1210 states and 1662 transitions. [2024-10-24 14:36:12,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 14:36:12,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 1662 transitions. [2024-10-24 14:36:12,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-24 14:36:12,293 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:36:12,294 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-24 14:36:12,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 14:36:12,294 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_linux_block_genhd_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2024-10-24 14:36:12,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:36:12,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1303405297, now seen corresponding path program 1 times [2024-10-24 14:36:12,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:36:12,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160993601] [2024-10-24 14:36:12,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:36:12,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:36:12,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:12,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:12,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:12,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 14:36:12,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:12,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 14:36:12,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:12,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 14:36:12,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:12,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 14:36:12,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:12,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 14:36:12,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:12,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 14:36:12,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:12,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:12,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:12,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 14:36:12,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:13,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 14:36:13,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:13,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 14:36:13,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:13,023 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 14:36:13,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:36:13,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160993601] [2024-10-24 14:36:13,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160993601] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:36:13,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:36:13,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 14:36:13,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109314366] [2024-10-24 14:36:13,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:36:13,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 14:36:13,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:36:13,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 14:36:13,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 14:36:13,026 INFO L87 Difference]: Start difference. First operand 1210 states and 1662 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 14:36:16,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:36:16,617 INFO L93 Difference]: Finished difference Result 1210 states and 1662 transitions. [2024-10-24 14:36:16,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 14:36:16,618 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (12), 4 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 58 [2024-10-24 14:36:16,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:36:16,625 INFO L225 Difference]: With dead ends: 1210 [2024-10-24 14:36:16,625 INFO L226 Difference]: Without dead ends: 1208 [2024-10-24 14:36:16,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-24 14:36:16,627 INFO L432 NwaCegarLoop]: 908 mSDtfsCounter, 1974 mSDsluCounter, 1440 mSDsCounter, 0 mSdLazyCounter, 2371 mSolverCounterSat, 1334 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2219 SdHoareTripleChecker+Valid, 2348 SdHoareTripleChecker+Invalid, 3705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1334 IncrementalHoareTripleChecker+Valid, 2371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-24 14:36:16,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2219 Valid, 2348 Invalid, 3705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1334 Valid, 2371 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-24 14:36:16,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2024-10-24 14:36:16,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 1208. [2024-10-24 14:36:16,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1208 states, 691 states have (on average 1.264833574529667) internal successors, (874), 737 states have internal predecessors, (874), 394 states have call successors, (394), 96 states have call predecessors, (394), 95 states have return successors, (392), 390 states have call predecessors, (392), 392 states have call successors, (392) [2024-10-24 14:36:16,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 1208 states and 1660 transitions. [2024-10-24 14:36:16,686 INFO L78 Accepts]: Start accepts. Automaton has 1208 states and 1660 transitions. Word has length 58 [2024-10-24 14:36:16,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:36:16,688 INFO L471 AbstractCegarLoop]: Abstraction has 1208 states and 1660 transitions. [2024-10-24 14:36:16,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 14:36:16,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1208 states and 1660 transitions. [2024-10-24 14:36:16,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-24 14:36:16,693 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:36:16,693 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-24 14:36:16,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 14:36:16,695 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2024-10-24 14:36:16,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:36:16,695 INFO L85 PathProgramCache]: Analyzing trace with hash -878167394, now seen corresponding path program 1 times [2024-10-24 14:36:16,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:36:16,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563866292] [2024-10-24 14:36:16,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:36:16,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:36:16,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:17,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:17,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:17,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 14:36:17,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:17,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 14:36:17,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:17,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 14:36:17,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:17,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 14:36:17,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:17,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 14:36:17,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:17,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 14:36:17,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:17,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:17,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:17,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 14:36:17,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:17,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 14:36:17,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:17,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 14:36:17,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:17,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 14:36:17,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:17,231 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 14:36:17,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:36:17,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563866292] [2024-10-24 14:36:17,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563866292] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:36:17,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:36:17,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 14:36:17,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050303991] [2024-10-24 14:36:17,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:36:17,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 14:36:17,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:36:17,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 14:36:17,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 14:36:17,233 INFO L87 Difference]: Start difference. First operand 1208 states and 1660 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 14:36:20,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:36:20,704 INFO L93 Difference]: Finished difference Result 1208 states and 1660 transitions. [2024-10-24 14:36:20,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 14:36:20,704 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (13), 4 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 63 [2024-10-24 14:36:20,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:36:20,710 INFO L225 Difference]: With dead ends: 1208 [2024-10-24 14:36:20,711 INFO L226 Difference]: Without dead ends: 1206 [2024-10-24 14:36:20,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-24 14:36:20,714 INFO L432 NwaCegarLoop]: 908 mSDtfsCounter, 1968 mSDsluCounter, 1440 mSDsCounter, 0 mSdLazyCounter, 2367 mSolverCounterSat, 1334 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2212 SdHoareTripleChecker+Valid, 2348 SdHoareTripleChecker+Invalid, 3701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1334 IncrementalHoareTripleChecker+Valid, 2367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-24 14:36:20,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2212 Valid, 2348 Invalid, 3701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1334 Valid, 2367 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-24 14:36:20,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2024-10-24 14:36:20,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 1206. [2024-10-24 14:36:20,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1206 states, 690 states have (on average 1.263768115942029) internal successors, (872), 735 states have internal predecessors, (872), 394 states have call successors, (394), 96 states have call predecessors, (394), 95 states have return successors, (392), 390 states have call predecessors, (392), 392 states have call successors, (392) [2024-10-24 14:36:20,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1206 states to 1206 states and 1658 transitions. [2024-10-24 14:36:20,770 INFO L78 Accepts]: Start accepts. Automaton has 1206 states and 1658 transitions. Word has length 63 [2024-10-24 14:36:20,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:36:20,770 INFO L471 AbstractCegarLoop]: Abstraction has 1206 states and 1658 transitions. [2024-10-24 14:36:20,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 14:36:20,770 INFO L276 IsEmpty]: Start isEmpty. Operand 1206 states and 1658 transitions. [2024-10-24 14:36:20,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-24 14:36:20,773 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:36:20,773 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-24 14:36:20,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 14:36:20,773 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2024-10-24 14:36:20,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:36:20,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1247864032, now seen corresponding path program 1 times [2024-10-24 14:36:20,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:36:20,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250205881] [2024-10-24 14:36:20,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:36:20,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:36:20,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:21,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:21,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:21,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 14:36:21,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:21,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 14:36:21,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:21,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 14:36:21,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:21,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 14:36:21,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:21,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 14:36:21,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:21,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 14:36:21,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:21,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:21,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:21,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 14:36:21,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:21,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 14:36:21,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:21,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 14:36:21,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:21,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 14:36:21,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:21,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 14:36:21,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:21,207 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 14:36:21,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:36:21,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250205881] [2024-10-24 14:36:21,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250205881] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:36:21,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:36:21,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 14:36:21,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197327364] [2024-10-24 14:36:21,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:36:21,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 14:36:21,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:36:21,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 14:36:21,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 14:36:21,210 INFO L87 Difference]: Start difference. First operand 1206 states and 1658 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 14:36:24,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:36:24,956 INFO L93 Difference]: Finished difference Result 1206 states and 1658 transitions. [2024-10-24 14:36:24,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 14:36:24,957 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (14), 4 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 68 [2024-10-24 14:36:24,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:36:24,965 INFO L225 Difference]: With dead ends: 1206 [2024-10-24 14:36:24,965 INFO L226 Difference]: Without dead ends: 1204 [2024-10-24 14:36:24,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-24 14:36:24,967 INFO L432 NwaCegarLoop]: 908 mSDtfsCounter, 1962 mSDsluCounter, 1440 mSDsCounter, 0 mSdLazyCounter, 2363 mSolverCounterSat, 1334 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2205 SdHoareTripleChecker+Valid, 2348 SdHoareTripleChecker+Invalid, 3697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1334 IncrementalHoareTripleChecker+Valid, 2363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-10-24 14:36:24,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2205 Valid, 2348 Invalid, 3697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1334 Valid, 2363 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-10-24 14:36:24,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2024-10-24 14:36:25,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 1204. [2024-10-24 14:36:25,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1204 states, 689 states have (on average 1.262699564586357) internal successors, (870), 733 states have internal predecessors, (870), 394 states have call successors, (394), 96 states have call predecessors, (394), 95 states have return successors, (392), 390 states have call predecessors, (392), 392 states have call successors, (392) [2024-10-24 14:36:25,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 1656 transitions. [2024-10-24 14:36:25,056 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 1656 transitions. Word has length 68 [2024-10-24 14:36:25,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:36:25,057 INFO L471 AbstractCegarLoop]: Abstraction has 1204 states and 1656 transitions. [2024-10-24 14:36:25,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 14:36:25,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1656 transitions. [2024-10-24 14:36:25,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-24 14:36:25,059 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:36:25,059 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-24 14:36:25,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 14:36:25,059 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2024-10-24 14:36:25,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:36:25,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1851749976, now seen corresponding path program 1 times [2024-10-24 14:36:25,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:36:25,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167165569] [2024-10-24 14:36:25,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:36:25,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:36:25,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:25,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:25,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:25,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 14:36:25,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:25,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 14:36:25,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:25,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 14:36:25,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:25,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 14:36:25,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:25,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 14:36:25,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:25,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 14:36:25,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:25,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:25,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:25,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 14:36:25,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:25,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 14:36:25,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:25,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 14:36:25,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:25,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 14:36:25,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:25,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 14:36:25,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:25,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 14:36:25,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:25,509 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 14:36:25,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:36:25,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167165569] [2024-10-24 14:36:25,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167165569] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:36:25,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:36:25,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 14:36:25,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895622991] [2024-10-24 14:36:25,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:36:25,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 14:36:25,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:36:25,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 14:36:25,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 14:36:25,512 INFO L87 Difference]: Start difference. First operand 1204 states and 1656 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 14:36:29,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:36:29,023 INFO L93 Difference]: Finished difference Result 1204 states and 1656 transitions. [2024-10-24 14:36:29,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 14:36:29,023 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (15), 4 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 73 [2024-10-24 14:36:29,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:36:29,030 INFO L225 Difference]: With dead ends: 1204 [2024-10-24 14:36:29,030 INFO L226 Difference]: Without dead ends: 1202 [2024-10-24 14:36:29,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-24 14:36:29,031 INFO L432 NwaCegarLoop]: 908 mSDtfsCounter, 1956 mSDsluCounter, 1440 mSDsCounter, 0 mSdLazyCounter, 2359 mSolverCounterSat, 1334 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2198 SdHoareTripleChecker+Valid, 2348 SdHoareTripleChecker+Invalid, 3693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1334 IncrementalHoareTripleChecker+Valid, 2359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-24 14:36:29,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2198 Valid, 2348 Invalid, 3693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1334 Valid, 2359 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-24 14:36:29,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2024-10-24 14:36:29,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 1202. [2024-10-24 14:36:29,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1202 states, 688 states have (on average 1.2616279069767442) internal successors, (868), 731 states have internal predecessors, (868), 394 states have call successors, (394), 96 states have call predecessors, (394), 95 states have return successors, (392), 390 states have call predecessors, (392), 392 states have call successors, (392) [2024-10-24 14:36:29,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 1202 states and 1654 transitions. [2024-10-24 14:36:29,088 INFO L78 Accepts]: Start accepts. Automaton has 1202 states and 1654 transitions. Word has length 73 [2024-10-24 14:36:29,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:36:29,090 INFO L471 AbstractCegarLoop]: Abstraction has 1202 states and 1654 transitions. [2024-10-24 14:36:29,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 14:36:29,090 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 1654 transitions. [2024-10-24 14:36:29,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-24 14:36:29,091 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:36:29,091 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-24 14:36:29,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 14:36:29,091 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2024-10-24 14:36:29,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:36:29,092 INFO L85 PathProgramCache]: Analyzing trace with hash -698493511, now seen corresponding path program 1 times [2024-10-24 14:36:29,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:36:29,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477417560] [2024-10-24 14:36:29,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:36:29,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:36:29,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:29,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:29,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:29,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 14:36:29,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:29,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 14:36:29,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:29,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 14:36:29,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:29,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 14:36:29,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:29,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 14:36:29,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:29,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 14:36:29,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:29,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:29,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:29,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 14:36:29,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:29,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 14:36:29,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:29,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 14:36:29,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:29,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 14:36:29,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:29,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 14:36:29,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:29,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 14:36:29,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:29,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 14:36:29,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:29,521 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 14:36:29,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:36:29,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477417560] [2024-10-24 14:36:29,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477417560] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:36:29,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:36:29,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 14:36:29,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352822505] [2024-10-24 14:36:29,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:36:29,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 14:36:29,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:36:29,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 14:36:29,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 14:36:29,523 INFO L87 Difference]: Start difference. First operand 1202 states and 1654 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 14:36:33,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:36:33,246 INFO L93 Difference]: Finished difference Result 1202 states and 1654 transitions. [2024-10-24 14:36:33,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 14:36:33,246 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (16), 4 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 78 [2024-10-24 14:36:33,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:36:33,251 INFO L225 Difference]: With dead ends: 1202 [2024-10-24 14:36:33,251 INFO L226 Difference]: Without dead ends: 1200 [2024-10-24 14:36:33,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-24 14:36:33,252 INFO L432 NwaCegarLoop]: 908 mSDtfsCounter, 1950 mSDsluCounter, 1440 mSDsCounter, 0 mSdLazyCounter, 2355 mSolverCounterSat, 1334 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2191 SdHoareTripleChecker+Valid, 2348 SdHoareTripleChecker+Invalid, 3689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1334 IncrementalHoareTripleChecker+Valid, 2355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-10-24 14:36:33,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2191 Valid, 2348 Invalid, 3689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1334 Valid, 2355 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-10-24 14:36:33,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2024-10-24 14:36:33,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 1200. [2024-10-24 14:36:33,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1200 states, 687 states have (on average 1.2605531295487626) internal successors, (866), 729 states have internal predecessors, (866), 394 states have call successors, (394), 96 states have call predecessors, (394), 95 states have return successors, (392), 390 states have call predecessors, (392), 392 states have call successors, (392) [2024-10-24 14:36:33,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1200 states to 1200 states and 1652 transitions. [2024-10-24 14:36:33,310 INFO L78 Accepts]: Start accepts. Automaton has 1200 states and 1652 transitions. Word has length 78 [2024-10-24 14:36:33,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:36:33,310 INFO L471 AbstractCegarLoop]: Abstraction has 1200 states and 1652 transitions. [2024-10-24 14:36:33,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 14:36:33,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 1652 transitions. [2024-10-24 14:36:33,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-24 14:36:33,311 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:36:33,312 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-24 14:36:33,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 14:36:33,312 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2024-10-24 14:36:33,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:36:33,312 INFO L85 PathProgramCache]: Analyzing trace with hash -845264781, now seen corresponding path program 1 times [2024-10-24 14:36:33,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:36:33,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921876127] [2024-10-24 14:36:33,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:36:33,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:36:33,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:33,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:33,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:33,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 14:36:33,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:33,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 14:36:33,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:33,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 14:36:33,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:33,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 14:36:33,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:33,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 14:36:33,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:33,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 14:36:33,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:33,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:33,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:33,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 14:36:33,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:33,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 14:36:33,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:33,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 14:36:33,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:33,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 14:36:33,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:33,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 14:36:33,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:33,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 14:36:33,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:33,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 14:36:33,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:33,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 14:36:33,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:33,756 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 14:36:33,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:36:33,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921876127] [2024-10-24 14:36:33,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921876127] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:36:33,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:36:33,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 14:36:33,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652140998] [2024-10-24 14:36:33,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:36:33,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 14:36:33,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:36:33,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 14:36:33,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 14:36:33,758 INFO L87 Difference]: Start difference. First operand 1200 states and 1652 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-24 14:36:37,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:36:37,550 INFO L93 Difference]: Finished difference Result 1200 states and 1652 transitions. [2024-10-24 14:36:37,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 14:36:37,551 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (17), 4 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 83 [2024-10-24 14:36:37,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:36:37,556 INFO L225 Difference]: With dead ends: 1200 [2024-10-24 14:36:37,556 INFO L226 Difference]: Without dead ends: 1198 [2024-10-24 14:36:37,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-24 14:36:37,557 INFO L432 NwaCegarLoop]: 908 mSDtfsCounter, 1944 mSDsluCounter, 1440 mSDsCounter, 0 mSdLazyCounter, 2351 mSolverCounterSat, 1334 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2184 SdHoareTripleChecker+Valid, 2348 SdHoareTripleChecker+Invalid, 3685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1334 IncrementalHoareTripleChecker+Valid, 2351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-10-24 14:36:37,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2184 Valid, 2348 Invalid, 3685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1334 Valid, 2351 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-10-24 14:36:37,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2024-10-24 14:36:37,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 1198. [2024-10-24 14:36:37,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1198 states, 686 states have (on average 1.2594752186588922) internal successors, (864), 727 states have internal predecessors, (864), 394 states have call successors, (394), 96 states have call predecessors, (394), 95 states have return successors, (392), 390 states have call predecessors, (392), 392 states have call successors, (392) [2024-10-24 14:36:37,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1650 transitions. [2024-10-24 14:36:37,616 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1650 transitions. Word has length 83 [2024-10-24 14:36:37,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:36:37,618 INFO L471 AbstractCegarLoop]: Abstraction has 1198 states and 1650 transitions. [2024-10-24 14:36:37,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-24 14:36:37,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1650 transitions. [2024-10-24 14:36:37,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-24 14:36:37,621 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:36:37,621 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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-10-24 14:36:37,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 14:36:37,621 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2024-10-24 14:36:37,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:36:37,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1166711135, now seen corresponding path program 1 times [2024-10-24 14:36:37,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:36:37,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289393474] [2024-10-24 14:36:37,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:36:37,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:36:37,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:37,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:37,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:37,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 14:36:37,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:37,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 14:36:37,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:37,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 14:36:37,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:37,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 14:36:37,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:37,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 14:36:37,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:37,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 14:36:37,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:37,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:37,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:37,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 14:36:37,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:37,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 14:36:37,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:37,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 14:36:37,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:37,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 14:36:37,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:37,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 14:36:37,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:37,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 14:36:37,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:37,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 14:36:37,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:37,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 14:36:37,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:37,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 14:36:37,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:37,993 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 14:36:37,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:36:37,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289393474] [2024-10-24 14:36:37,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289393474] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:36:37,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:36:37,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 14:36:37,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72318641] [2024-10-24 14:36:37,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:36:37,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 14:36:37,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:36:37,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 14:36:37,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 14:36:37,995 INFO L87 Difference]: Start difference. First operand 1198 states and 1650 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 14:36:41,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:36:41,476 INFO L93 Difference]: Finished difference Result 1198 states and 1650 transitions. [2024-10-24 14:36:41,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 14:36:41,477 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (18), 4 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 88 [2024-10-24 14:36:41,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:36:41,483 INFO L225 Difference]: With dead ends: 1198 [2024-10-24 14:36:41,483 INFO L226 Difference]: Without dead ends: 1196 [2024-10-24 14:36:41,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-24 14:36:41,485 INFO L432 NwaCegarLoop]: 908 mSDtfsCounter, 1938 mSDsluCounter, 1440 mSDsCounter, 0 mSdLazyCounter, 2347 mSolverCounterSat, 1334 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2177 SdHoareTripleChecker+Valid, 2348 SdHoareTripleChecker+Invalid, 3681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1334 IncrementalHoareTripleChecker+Valid, 2347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-24 14:36:41,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2177 Valid, 2348 Invalid, 3681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1334 Valid, 2347 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-24 14:36:41,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2024-10-24 14:36:41,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 1196. [2024-10-24 14:36:41,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1196 states, 685 states have (on average 1.2583941605839417) internal successors, (862), 725 states have internal predecessors, (862), 394 states have call successors, (394), 96 states have call predecessors, (394), 95 states have return successors, (392), 390 states have call predecessors, (392), 392 states have call successors, (392) [2024-10-24 14:36:41,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1196 states to 1196 states and 1648 transitions. [2024-10-24 14:36:41,600 INFO L78 Accepts]: Start accepts. Automaton has 1196 states and 1648 transitions. Word has length 88 [2024-10-24 14:36:41,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:36:41,601 INFO L471 AbstractCegarLoop]: Abstraction has 1196 states and 1648 transitions. [2024-10-24 14:36:41,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 14:36:41,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1196 states and 1648 transitions. [2024-10-24 14:36:41,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-24 14:36:41,602 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:36:41,602 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-24 14:36:41,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 14:36:41,602 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2024-10-24 14:36:41,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:36:41,602 INFO L85 PathProgramCache]: Analyzing trace with hash -222784732, now seen corresponding path program 1 times [2024-10-24 14:36:41,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:36:41,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612834933] [2024-10-24 14:36:41,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:36:41,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:36:41,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:41,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:41,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:41,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 14:36:41,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:41,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 14:36:41,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:41,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 14:36:41,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:41,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 14:36:41,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:41,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 14:36:41,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:41,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 14:36:41,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:41,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:41,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:41,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 14:36:41,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:41,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 14:36:41,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:41,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 14:36:41,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:41,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 14:36:41,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:41,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 14:36:41,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:41,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 14:36:41,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:41,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 14:36:41,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:41,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 14:36:41,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:41,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 14:36:41,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:41,966 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 14:36:41,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:36:41,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612834933] [2024-10-24 14:36:41,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612834933] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:36:41,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:36:41,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 14:36:41,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371306045] [2024-10-24 14:36:41,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:36:41,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 14:36:41,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:36:41,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 14:36:41,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 14:36:41,969 INFO L87 Difference]: Start difference. First operand 1196 states and 1648 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 14:36:45,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:36:45,387 INFO L93 Difference]: Finished difference Result 1196 states and 1648 transitions. [2024-10-24 14:36:45,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 14:36:45,388 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (18), 4 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 90 [2024-10-24 14:36:45,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:36:45,393 INFO L225 Difference]: With dead ends: 1196 [2024-10-24 14:36:45,393 INFO L226 Difference]: Without dead ends: 1194 [2024-10-24 14:36:45,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-24 14:36:45,394 INFO L432 NwaCegarLoop]: 908 mSDtfsCounter, 1930 mSDsluCounter, 1440 mSDsCounter, 0 mSdLazyCounter, 2343 mSolverCounterSat, 1334 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2169 SdHoareTripleChecker+Valid, 2348 SdHoareTripleChecker+Invalid, 3677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1334 IncrementalHoareTripleChecker+Valid, 2343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-24 14:36:45,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2169 Valid, 2348 Invalid, 3677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1334 Valid, 2343 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-24 14:36:45,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2024-10-24 14:36:45,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 1194. [2024-10-24 14:36:45,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1194 states, 684 states have (on average 1.2573099415204678) internal successors, (860), 723 states have internal predecessors, (860), 394 states have call successors, (394), 96 states have call predecessors, (394), 95 states have return successors, (392), 390 states have call predecessors, (392), 392 states have call successors, (392) [2024-10-24 14:36:45,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1194 states to 1194 states and 1646 transitions. [2024-10-24 14:36:45,463 INFO L78 Accepts]: Start accepts. Automaton has 1194 states and 1646 transitions. Word has length 90 [2024-10-24 14:36:45,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:36:45,463 INFO L471 AbstractCegarLoop]: Abstraction has 1194 states and 1646 transitions. [2024-10-24 14:36:45,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 14:36:45,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1194 states and 1646 transitions. [2024-10-24 14:36:45,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-24 14:36:45,464 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:36:45,465 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-24 14:36:45,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 14:36:45,465 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_linux_kernel_module_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2024-10-24 14:36:45,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:36:45,465 INFO L85 PathProgramCache]: Analyzing trace with hash -147193555, now seen corresponding path program 1 times [2024-10-24 14:36:45,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:36:45,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885601242] [2024-10-24 14:36:45,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:36:45,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:36:45,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:45,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:45,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:45,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 14:36:45,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:45,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 14:36:45,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:45,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 14:36:45,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:45,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 14:36:45,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:45,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 14:36:45,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:45,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 14:36:45,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:45,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:45,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:45,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 14:36:45,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:45,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 14:36:45,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:45,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 14:36:45,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:45,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 14:36:45,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:45,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 14:36:45,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:45,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 14:36:45,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:45,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 14:36:45,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:45,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 14:36:45,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:45,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 14:36:45,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:45,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 14:36:45,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:45,792 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 14:36:45,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:36:45,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885601242] [2024-10-24 14:36:45,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885601242] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:36:45,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:36:45,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 14:36:45,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797559267] [2024-10-24 14:36:45,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:36:45,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 14:36:45,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:36:45,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 14:36:45,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 14:36:45,794 INFO L87 Difference]: Start difference. First operand 1194 states and 1646 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-24 14:36:49,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:36:49,230 INFO L93 Difference]: Finished difference Result 1194 states and 1646 transitions. [2024-10-24 14:36:49,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 14:36:49,230 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (19), 4 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 95 [2024-10-24 14:36:49,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:36:49,235 INFO L225 Difference]: With dead ends: 1194 [2024-10-24 14:36:49,235 INFO L226 Difference]: Without dead ends: 1192 [2024-10-24 14:36:49,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-24 14:36:49,236 INFO L432 NwaCegarLoop]: 908 mSDtfsCounter, 1926 mSDsluCounter, 1440 mSDsCounter, 0 mSdLazyCounter, 2339 mSolverCounterSat, 1334 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2164 SdHoareTripleChecker+Valid, 2348 SdHoareTripleChecker+Invalid, 3673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1334 IncrementalHoareTripleChecker+Valid, 2339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-24 14:36:49,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2164 Valid, 2348 Invalid, 3673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1334 Valid, 2339 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-24 14:36:49,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2024-10-24 14:36:49,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 1192. [2024-10-24 14:36:49,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1192 states, 683 states have (on average 1.2562225475841875) internal successors, (858), 721 states have internal predecessors, (858), 394 states have call successors, (394), 96 states have call predecessors, (394), 95 states have return successors, (392), 390 states have call predecessors, (392), 392 states have call successors, (392) [2024-10-24 14:36:49,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 1644 transitions. [2024-10-24 14:36:49,309 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 1644 transitions. Word has length 95 [2024-10-24 14:36:49,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:36:49,309 INFO L471 AbstractCegarLoop]: Abstraction has 1192 states and 1644 transitions. [2024-10-24 14:36:49,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-24 14:36:49,309 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 1644 transitions. [2024-10-24 14:36:49,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-24 14:36:49,310 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:36:49,311 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2024-10-24 14:36:49,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 14:36:49,311 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2024-10-24 14:36:49,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:36:49,311 INFO L85 PathProgramCache]: Analyzing trace with hash -297412976, now seen corresponding path program 1 times [2024-10-24 14:36:49,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:36:49,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302624792] [2024-10-24 14:36:49,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:36:49,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:36:49,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:49,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:49,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:49,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 14:36:49,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:49,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 14:36:49,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:49,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 14:36:49,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:49,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-24 14:36:49,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:49,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:49,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:49,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 14:36:49,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:49,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 14:36:49,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:49,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 14:36:49,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:49,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:49,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:49,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 14:36:49,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:49,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 14:36:49,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:49,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 14:36:49,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:49,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:49,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:49,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 14:36:49,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:49,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 14:36:49,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:49,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 14:36:49,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:49,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:49,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:49,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 14:36:49,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:49,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 14:36:49,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:49,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 14:36:49,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:49,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:49,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:49,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 14:36:49,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:49,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 14:36:49,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:49,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 14:36:49,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:49,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 14:36:49,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:49,663 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2024-10-24 14:36:49,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:36:49,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302624792] [2024-10-24 14:36:49,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302624792] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:36:49,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:36:49,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 14:36:49,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441077760] [2024-10-24 14:36:49,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:36:49,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 14:36:49,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:36:49,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 14:36:49,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 14:36:49,665 INFO L87 Difference]: Start difference. First operand 1192 states and 1644 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 14:36:53,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:36:53,538 INFO L93 Difference]: Finished difference Result 2213 states and 3034 transitions. [2024-10-24 14:36:53,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 14:36:53,539 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 122 [2024-10-24 14:36:53,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:36:53,545 INFO L225 Difference]: With dead ends: 2213 [2024-10-24 14:36:53,545 INFO L226 Difference]: Without dead ends: 1200 [2024-10-24 14:36:53,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-24 14:36:53,548 INFO L432 NwaCegarLoop]: 647 mSDtfsCounter, 2240 mSDsluCounter, 1160 mSDsCounter, 0 mSdLazyCounter, 2155 mSolverCounterSat, 1803 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2491 SdHoareTripleChecker+Valid, 1807 SdHoareTripleChecker+Invalid, 3958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1803 IncrementalHoareTripleChecker+Valid, 2155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-10-24 14:36:53,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2491 Valid, 1807 Invalid, 3958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1803 Valid, 2155 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-10-24 14:36:53,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2024-10-24 14:36:53,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 1188. [2024-10-24 14:36:53,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1188 states, 680 states have (on average 1.2544117647058823) internal successors, (853), 717 states have internal predecessors, (853), 394 states have call successors, (394), 96 states have call predecessors, (394), 95 states have return successors, (392), 390 states have call predecessors, (392), 392 states have call successors, (392) [2024-10-24 14:36:53,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1188 states to 1188 states and 1639 transitions. [2024-10-24 14:36:53,633 INFO L78 Accepts]: Start accepts. Automaton has 1188 states and 1639 transitions. Word has length 122 [2024-10-24 14:36:53,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:36:53,633 INFO L471 AbstractCegarLoop]: Abstraction has 1188 states and 1639 transitions. [2024-10-24 14:36:53,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 14:36:53,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1188 states and 1639 transitions. [2024-10-24 14:36:53,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-24 14:36:53,635 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:36:53,635 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 6, 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] [2024-10-24 14:36:53,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 14:36:53,636 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2024-10-24 14:36:53,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:36:53,636 INFO L85 PathProgramCache]: Analyzing trace with hash 26463836, now seen corresponding path program 1 times [2024-10-24 14:36:53,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:36:53,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447266143] [2024-10-24 14:36:53,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:36:53,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:36:53,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:54,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:54,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:54,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 14:36:54,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:54,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 14:36:54,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:54,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 14:36:54,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:54,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 14:36:54,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:54,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 14:36:54,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:54,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 14:36:54,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:54,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:54,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:54,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 14:36:54,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:54,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 14:36:54,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:54,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 14:36:54,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:54,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 14:36:54,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:54,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:54,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:54,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 14:36:54,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:54,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 14:36:54,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:54,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 14:36:54,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:54,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:54,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:54,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 14:36:54,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:54,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 14:36:54,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:54,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 14:36:54,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:54,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:36:54,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:54,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 14:36:54,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:54,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 14:36:54,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:54,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 14:36:54,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:54,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 14:36:54,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:36:54,274 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-10-24 14:36:54,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:36:54,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447266143] [2024-10-24 14:36:54,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447266143] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:36:54,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:36:54,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 14:36:54,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992317580] [2024-10-24 14:36:54,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:36:54,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 14:36:54,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:36:54,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 14:36:54,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 14:36:54,276 INFO L87 Difference]: Start difference. First operand 1188 states and 1639 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 14:37:00,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:37:00,302 INFO L93 Difference]: Finished difference Result 1387 states and 1847 transitions. [2024-10-24 14:37:00,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 14:37:00,303 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 119 [2024-10-24 14:37:00,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:37:00,308 INFO L225 Difference]: With dead ends: 1387 [2024-10-24 14:37:00,309 INFO L226 Difference]: Without dead ends: 1385 [2024-10-24 14:37:00,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2024-10-24 14:37:00,310 INFO L432 NwaCegarLoop]: 903 mSDtfsCounter, 2250 mSDsluCounter, 2528 mSDsCounter, 0 mSdLazyCounter, 4469 mSolverCounterSat, 1861 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2463 SdHoareTripleChecker+Valid, 3431 SdHoareTripleChecker+Invalid, 6330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1861 IncrementalHoareTripleChecker+Valid, 4469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2024-10-24 14:37:00,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2463 Valid, 3431 Invalid, 6330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1861 Valid, 4469 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2024-10-24 14:37:00,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2024-10-24 14:37:00,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 1359. [2024-10-24 14:37:00,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1359 states, 778 states have (on average 1.2416452442159382) internal successors, (966), 815 states have internal predecessors, (966), 426 states have call successors, (426), 137 states have call predecessors, (426), 136 states have return successors, (424), 422 states have call predecessors, (424), 424 states have call successors, (424) [2024-10-24 14:37:00,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1359 states to 1359 states and 1816 transitions. [2024-10-24 14:37:00,541 INFO L78 Accepts]: Start accepts. Automaton has 1359 states and 1816 transitions. Word has length 119 [2024-10-24 14:37:00,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:37:00,546 INFO L471 AbstractCegarLoop]: Abstraction has 1359 states and 1816 transitions. [2024-10-24 14:37:00,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 14:37:00,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1359 states and 1816 transitions. [2024-10-24 14:37:00,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-24 14:37:00,547 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:37:00,547 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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-10-24 14:37:00,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 14:37:00,547 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2024-10-24 14:37:00,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:37:00,547 INFO L85 PathProgramCache]: Analyzing trace with hash 691351690, now seen corresponding path program 1 times [2024-10-24 14:37:00,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:37:00,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469497819] [2024-10-24 14:37:00,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:37:00,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:37:00,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:01,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:01,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:01,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 14:37:01,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:01,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 14:37:01,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:01,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 14:37:01,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:01,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 14:37:01,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:01,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 14:37:01,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:01,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 14:37:01,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:01,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:01,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:01,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 14:37:01,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:01,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 14:37:01,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:01,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 14:37:01,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:01,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 14:37:01,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:01,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 14:37:01,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:01,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 14:37:01,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:01,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 14:37:01,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:01,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 14:37:01,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:01,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 14:37:01,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:01,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 14:37:01,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:01,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 14:37:01,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:01,147 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 14:37:01,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:37:01,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469497819] [2024-10-24 14:37:01,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469497819] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:37:01,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:37:01,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 14:37:01,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862317598] [2024-10-24 14:37:01,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:37:01,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 14:37:01,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:37:01,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 14:37:01,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 14:37:01,149 INFO L87 Difference]: Start difference. First operand 1359 states and 1816 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 14:37:05,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:37:05,230 INFO L93 Difference]: Finished difference Result 1359 states and 1816 transitions. [2024-10-24 14:37:05,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 14:37:05,231 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (20), 4 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 100 [2024-10-24 14:37:05,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:37:05,237 INFO L225 Difference]: With dead ends: 1359 [2024-10-24 14:37:05,237 INFO L226 Difference]: Without dead ends: 1357 [2024-10-24 14:37:05,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-24 14:37:05,238 INFO L432 NwaCegarLoop]: 903 mSDtfsCounter, 1915 mSDsluCounter, 1426 mSDsCounter, 0 mSdLazyCounter, 2334 mSolverCounterSat, 1334 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2152 SdHoareTripleChecker+Valid, 2329 SdHoareTripleChecker+Invalid, 3668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1334 IncrementalHoareTripleChecker+Valid, 2334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-10-24 14:37:05,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2152 Valid, 2329 Invalid, 3668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1334 Valid, 2334 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-10-24 14:37:05,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2024-10-24 14:37:05,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 1357. [2024-10-24 14:37:05,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1357 states, 777 states have (on average 1.2406692406692406) internal successors, (964), 813 states have internal predecessors, (964), 426 states have call successors, (426), 137 states have call predecessors, (426), 136 states have return successors, (424), 422 states have call predecessors, (424), 424 states have call successors, (424) [2024-10-24 14:37:05,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1357 states to 1357 states and 1814 transitions. [2024-10-24 14:37:05,350 INFO L78 Accepts]: Start accepts. Automaton has 1357 states and 1814 transitions. Word has length 100 [2024-10-24 14:37:05,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:37:05,350 INFO L471 AbstractCegarLoop]: Abstraction has 1357 states and 1814 transitions. [2024-10-24 14:37:05,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 14:37:05,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1357 states and 1814 transitions. [2024-10-24 14:37:05,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-24 14:37:05,352 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:37:05,352 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 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] [2024-10-24 14:37:05,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 14:37:05,352 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2024-10-24 14:37:05,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:37:05,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1897579963, now seen corresponding path program 1 times [2024-10-24 14:37:05,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:37:05,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091079285] [2024-10-24 14:37:05,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:37:05,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:37:05,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:05,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:05,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:05,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 14:37:05,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:05,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 14:37:05,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:05,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 14:37:05,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:05,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-24 14:37:05,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:05,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:05,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:05,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 14:37:05,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:05,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 14:37:05,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:05,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 14:37:05,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:05,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:05,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:05,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 14:37:05,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:05,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 14:37:05,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:05,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 14:37:05,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:05,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:05,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:05,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 14:37:05,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:05,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 14:37:05,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:05,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 14:37:05,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:05,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:05,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:05,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 14:37:05,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:05,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 14:37:05,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:05,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 14:37:05,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:05,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:05,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:05,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 14:37:05,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:05,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 14:37:05,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:05,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 14:37:05,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:05,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 14:37:05,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:05,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-24 14:37:05,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:05,684 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2024-10-24 14:37:05,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:37:05,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091079285] [2024-10-24 14:37:05,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091079285] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 14:37:05,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659229961] [2024-10-24 14:37:05,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:37:05,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 14:37:05,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 14:37:05,686 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-10-24 14:37:05,691 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-10-24 14:37:06,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:06,437 INFO L255 TraceCheckSpWp]: Trace formula consists of 2119 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 14:37:06,495 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 14:37:06,524 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2024-10-24 14:37:06,524 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 14:37:06,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1659229961] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:37:06,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 14:37:06,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-10-24 14:37:06,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948877569] [2024-10-24 14:37:06,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:37:06,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 14:37:06,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:37:06,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 14:37:06,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-24 14:37:06,526 INFO L87 Difference]: Start difference. First operand 1357 states and 1814 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 14:37:07,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:37:07,082 INFO L93 Difference]: Finished difference Result 2547 states and 3373 transitions. [2024-10-24 14:37:07,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 14:37:07,082 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 127 [2024-10-24 14:37:07,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:37:07,090 INFO L225 Difference]: With dead ends: 2547 [2024-10-24 14:37:07,090 INFO L226 Difference]: Without dead ends: 1400 [2024-10-24 14:37:07,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-24 14:37:07,094 INFO L432 NwaCegarLoop]: 1532 mSDtfsCounter, 1620 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1620 SdHoareTripleChecker+Valid, 1583 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 14:37:07,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1620 Valid, 1583 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 14:37:07,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2024-10-24 14:37:07,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 1397. [2024-10-24 14:37:07,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1397 states, 797 states have (on average 1.2358845671267251) internal successors, (985), 836 states have internal predecessors, (985), 441 states have call successors, (441), 143 states have call predecessors, (441), 142 states have return successors, (439), 435 states have call predecessors, (439), 439 states have call successors, (439) [2024-10-24 14:37:07,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1397 states to 1397 states and 1865 transitions. [2024-10-24 14:37:07,217 INFO L78 Accepts]: Start accepts. Automaton has 1397 states and 1865 transitions. Word has length 127 [2024-10-24 14:37:07,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:37:07,218 INFO L471 AbstractCegarLoop]: Abstraction has 1397 states and 1865 transitions. [2024-10-24 14:37:07,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 14:37:07,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1397 states and 1865 transitions. [2024-10-24 14:37:07,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-24 14:37:07,219 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:37:07,219 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-24 14:37:07,239 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 14:37:07,420 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,SelfDestructingSolverStorable13 [2024-10-24 14:37:07,421 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2024-10-24 14:37:07,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:37:07,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1398468863, now seen corresponding path program 1 times [2024-10-24 14:37:07,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:37:07,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990972570] [2024-10-24 14:37:07,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:37:07,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:37:07,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:07,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:07,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:07,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 14:37:07,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:07,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 14:37:07,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:07,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 14:37:07,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:07,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 14:37:07,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:07,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 14:37:07,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:07,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 14:37:07,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:07,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:07,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:07,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 14:37:07,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:07,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 14:37:07,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:07,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 14:37:07,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:07,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 14:37:07,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:07,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 14:37:07,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:07,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 14:37:07,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:07,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 14:37:07,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:07,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 14:37:07,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:07,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 14:37:07,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:07,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 14:37:07,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:07,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 14:37:07,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:07,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 14:37:07,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:07,797 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 14:37:07,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:37:07,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990972570] [2024-10-24 14:37:07,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990972570] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:37:07,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:37:07,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 14:37:07,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209077485] [2024-10-24 14:37:07,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:37:07,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 14:37:07,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:37:07,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 14:37:07,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 14:37:07,800 INFO L87 Difference]: Start difference. First operand 1397 states and 1865 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-24 14:37:11,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:37:11,718 INFO L93 Difference]: Finished difference Result 1397 states and 1865 transitions. [2024-10-24 14:37:11,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 14:37:11,719 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (21), 4 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 105 [2024-10-24 14:37:11,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:37:11,727 INFO L225 Difference]: With dead ends: 1397 [2024-10-24 14:37:11,727 INFO L226 Difference]: Without dead ends: 1395 [2024-10-24 14:37:11,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-24 14:37:11,728 INFO L432 NwaCegarLoop]: 898 mSDtfsCounter, 1904 mSDsluCounter, 1412 mSDsCounter, 0 mSdLazyCounter, 2329 mSolverCounterSat, 1334 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2140 SdHoareTripleChecker+Valid, 2310 SdHoareTripleChecker+Invalid, 3663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1334 IncrementalHoareTripleChecker+Valid, 2329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-10-24 14:37:11,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2140 Valid, 2310 Invalid, 3663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1334 Valid, 2329 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-10-24 14:37:11,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2024-10-24 14:37:11,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 1395. [2024-10-24 14:37:11,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1395 states, 796 states have (on average 1.234924623115578) internal successors, (983), 834 states have internal predecessors, (983), 441 states have call successors, (441), 143 states have call predecessors, (441), 142 states have return successors, (439), 435 states have call predecessors, (439), 439 states have call successors, (439) [2024-10-24 14:37:11,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1395 states to 1395 states and 1863 transitions. [2024-10-24 14:37:11,860 INFO L78 Accepts]: Start accepts. Automaton has 1395 states and 1863 transitions. Word has length 105 [2024-10-24 14:37:11,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:37:11,861 INFO L471 AbstractCegarLoop]: Abstraction has 1395 states and 1863 transitions. [2024-10-24 14:37:11,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-24 14:37:11,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1395 states and 1863 transitions. [2024-10-24 14:37:11,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-24 14:37:11,862 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:37:11,863 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2024-10-24 14:37:11,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 14:37:11,863 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_linux_alloc_irq_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2024-10-24 14:37:11,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:37:11,863 INFO L85 PathProgramCache]: Analyzing trace with hash 302646838, now seen corresponding path program 1 times [2024-10-24 14:37:11,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:37:11,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468116104] [2024-10-24 14:37:11,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:37:11,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:37:12,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:12,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:12,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:12,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 14:37:12,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:12,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 14:37:12,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:13,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 14:37:13,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:13,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-24 14:37:13,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:13,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:13,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:13,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 14:37:13,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:13,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 14:37:13,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:13,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 14:37:13,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:13,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:13,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:13,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 14:37:13,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:13,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 14:37:13,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:13,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 14:37:13,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:13,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:13,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:13,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 14:37:13,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:13,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 14:37:13,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:13,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 14:37:13,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:13,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:13,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:13,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 14:37:13,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:13,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 14:37:13,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:13,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 14:37:13,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:13,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:13,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:13,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 14:37:13,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:13,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 14:37:13,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:13,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 14:37:13,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:13,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 14:37:13,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:13,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-24 14:37:13,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:13,158 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2024-10-24 14:37:13,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:37:13,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468116104] [2024-10-24 14:37:13,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468116104] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:37:13,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:37:13,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 14:37:13,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850857220] [2024-10-24 14:37:13,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:37:13,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 14:37:13,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:37:13,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 14:37:13,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 14:37:13,160 INFO L87 Difference]: Start difference. First operand 1395 states and 1863 transitions. Second operand has 9 states, 8 states have (on average 4.75) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 14:37:19,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:37:19,925 INFO L93 Difference]: Finished difference Result 2707 states and 3634 transitions. [2024-10-24 14:37:19,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 14:37:19,925 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (18), 5 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 134 [2024-10-24 14:37:19,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:37:19,933 INFO L225 Difference]: With dead ends: 2707 [2024-10-24 14:37:19,933 INFO L226 Difference]: Without dead ends: 1407 [2024-10-24 14:37:19,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2024-10-24 14:37:19,937 INFO L432 NwaCegarLoop]: 898 mSDtfsCounter, 2196 mSDsluCounter, 2820 mSDsCounter, 0 mSdLazyCounter, 5105 mSolverCounterSat, 1803 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2441 SdHoareTripleChecker+Valid, 3718 SdHoareTripleChecker+Invalid, 6908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1803 IncrementalHoareTripleChecker+Valid, 5105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2024-10-24 14:37:19,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2441 Valid, 3718 Invalid, 6908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1803 Valid, 5105 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2024-10-24 14:37:19,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1407 states. [2024-10-24 14:37:20,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1407 to 1395. [2024-10-24 14:37:20,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1395 states, 796 states have (on average 1.2324120603015076) internal successors, (981), 834 states have internal predecessors, (981), 441 states have call successors, (441), 143 states have call predecessors, (441), 142 states have return successors, (439), 435 states have call predecessors, (439), 439 states have call successors, (439) [2024-10-24 14:37:20,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1395 states to 1395 states and 1861 transitions. [2024-10-24 14:37:20,128 INFO L78 Accepts]: Start accepts. Automaton has 1395 states and 1861 transitions. Word has length 134 [2024-10-24 14:37:20,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:37:20,129 INFO L471 AbstractCegarLoop]: Abstraction has 1395 states and 1861 transitions. [2024-10-24 14:37:20,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 14:37:20,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1395 states and 1861 transitions. [2024-10-24 14:37:20,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-24 14:37:20,130 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:37:20,131 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2024-10-24 14:37:20,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 14:37:20,131 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_linux_alloc_irq_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2024-10-24 14:37:20,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:37:20,135 INFO L85 PathProgramCache]: Analyzing trace with hash 302706420, now seen corresponding path program 1 times [2024-10-24 14:37:20,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:37:20,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354857151] [2024-10-24 14:37:20,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:37:20,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:37:20,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:20,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:20,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:20,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 14:37:20,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:20,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 14:37:20,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:20,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 14:37:20,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:20,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-24 14:37:20,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:20,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:20,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:20,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 14:37:20,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:20,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 14:37:20,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:20,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 14:37:20,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:20,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:20,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:20,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 14:37:20,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:20,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 14:37:20,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:20,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 14:37:20,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:20,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:20,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:20,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 14:37:20,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:20,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 14:37:20,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:20,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 14:37:20,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:20,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:20,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:20,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 14:37:20,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:20,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 14:37:20,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:20,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 14:37:20,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:20,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 14:37:20,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:20,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 14:37:20,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:20,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 14:37:20,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:20,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 14:37:20,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:20,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 14:37:20,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:20,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-24 14:37:20,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:37:20,793 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2024-10-24 14:37:20,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:37:20,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354857151] [2024-10-24 14:37:20,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354857151] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:37:20,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:37:20,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 14:37:20,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895990390] [2024-10-24 14:37:20,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:37:20,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 14:37:20,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:37:20,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 14:37:20,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 14:37:20,796 INFO L87 Difference]: Start difference. First operand 1395 states and 1861 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)