./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 59b1cfb91cc72e499bff6d8fc699fc231e5a5cccbbf2aefe05d1bfd2696fc05b --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:15:44,956 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:15:45,025 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-29 04:15:45,030 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:15:45,031 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:15:45,054 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:15:45,054 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:15:45,055 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:15:45,056 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:15:45,056 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:15:45,057 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:15:45,057 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:15:45,058 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:15:45,059 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:15:45,059 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:15:45,060 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:15:45,061 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 04:15:45,061 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 04:15:45,062 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:15:45,062 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 04:15:45,063 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:15:45,064 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 04:15:45,064 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 04:15:45,065 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:15:45,065 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:15:45,066 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:15:45,066 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:15:45,067 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:15:45,067 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:15:45,068 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:15:45,068 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:15:45,069 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 04:15:45,069 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 04:15:45,069 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 04:15:45,070 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:15:45,070 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:15:45,070 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 04:15:45,070 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:15:45,070 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:15:45,071 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/bin/uautomizer-verify-BQ2R08f2Ya/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 59b1cfb91cc72e499bff6d8fc699fc231e5a5cccbbf2aefe05d1bfd2696fc05b [2023-11-29 04:15:45,288 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:15:45,311 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:15:45,314 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:15:45,315 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:15:45,316 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:15:45,317 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i [2023-11-29 04:15:48,247 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:15:48,776 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:15:48,776 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i [2023-11-29 04:15:48,829 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/bin/uautomizer-verify-BQ2R08f2Ya/data/7b925e84e/4904a479d6554dcf9b3258daf786bfd1/FLAG72e8a08b6 [2023-11-29 04:15:48,845 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/bin/uautomizer-verify-BQ2R08f2Ya/data/7b925e84e/4904a479d6554dcf9b3258daf786bfd1 [2023-11-29 04:15:48,848 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:15:48,849 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:15:48,851 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:15:48,851 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:15:48,856 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:15:48,857 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:15:48" (1/1) ... [2023-11-29 04:15:48,858 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56c0d01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:15:48, skipping insertion in model container [2023-11-29 04:15:48,858 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:15:48" (1/1) ... [2023-11-29 04:15:49,083 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:15:53,705 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[434581,434594] [2023-11-29 04:15:53,710 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[434726,434739] [2023-11-29 04:15:53,710 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[434872,434885] [2023-11-29 04:15:53,711 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435037,435050] [2023-11-29 04:15:53,712 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435195,435208] [2023-11-29 04:15:53,712 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435353,435366] [2023-11-29 04:15:53,713 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435511,435524] [2023-11-29 04:15:53,713 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435671,435684] [2023-11-29 04:15:53,713 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435830,435843] [2023-11-29 04:15:53,714 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435969,435982] [2023-11-29 04:15:53,714 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[436111,436124] [2023-11-29 04:15:53,715 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[436260,436273] [2023-11-29 04:15:53,715 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[436399,436412] [2023-11-29 04:15:53,716 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[436554,436567] [2023-11-29 04:15:53,717 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[436714,436727] [2023-11-29 04:15:53,717 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[436865,436878] [2023-11-29 04:15:53,718 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437016,437029] [2023-11-29 04:15:53,719 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437168,437181] [2023-11-29 04:15:53,719 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437317,437330] [2023-11-29 04:15:53,720 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437465,437478] [2023-11-29 04:15:53,721 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437622,437635] [2023-11-29 04:15:53,721 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437771,437784] [2023-11-29 04:15:53,722 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437927,437940] [2023-11-29 04:15:53,722 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438080,438093] [2023-11-29 04:15:53,723 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438226,438239] [2023-11-29 04:15:53,724 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438369,438382] [2023-11-29 04:15:53,724 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438521,438534] [2023-11-29 04:15:53,725 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438667,438680] [2023-11-29 04:15:53,725 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438812,438825] [2023-11-29 04:15:53,726 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438966,438979] [2023-11-29 04:15:53,727 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[439117,439130] [2023-11-29 04:15:53,727 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[439272,439285] [2023-11-29 04:15:53,728 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[439424,439437] [2023-11-29 04:15:53,729 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[439579,439592] [2023-11-29 04:15:53,729 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[439743,439756] [2023-11-29 04:15:53,730 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[439899,439912] [2023-11-29 04:15:53,731 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440063,440076] [2023-11-29 04:15:53,731 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440205,440218] [2023-11-29 04:15:53,732 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440363,440376] [2023-11-29 04:15:53,732 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440530,440543] [2023-11-29 04:15:53,733 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440689,440702] [2023-11-29 04:15:53,733 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440848,440861] [2023-11-29 04:15:53,734 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440997,441010] [2023-11-29 04:15:53,735 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[441144,441157] [2023-11-29 04:15:53,735 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[441283,441296] [2023-11-29 04:15:53,736 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[441446,441459] [2023-11-29 04:15:53,736 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[441612,441625] [2023-11-29 04:15:53,737 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[441776,441789] [2023-11-29 04:15:53,738 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[441941,441954] [2023-11-29 04:15:53,738 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[442106,442119] [2023-11-29 04:15:53,739 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[442272,442285] [2023-11-29 04:15:53,739 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[442437,442450] [2023-11-29 04:15:53,740 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[442604,442617] [2023-11-29 04:15:53,741 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[442764,442777] [2023-11-29 04:15:53,741 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[442926,442939] [2023-11-29 04:15:53,742 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[443085,443098] [2023-11-29 04:15:53,742 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[443231,443244] [2023-11-29 04:15:53,743 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[443374,443387] [2023-11-29 04:15:53,743 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[443518,443531] [2023-11-29 04:15:53,744 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[443661,443674] [2023-11-29 04:15:53,745 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[443805,443818] [2023-11-29 04:15:53,745 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[443946,443959] [2023-11-29 04:15:53,746 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[444084,444097] [2023-11-29 04:15:53,746 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[444242,444255] [2023-11-29 04:15:53,747 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[444401,444414] [2023-11-29 04:15:53,747 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[444557,444570] [2023-11-29 04:15:53,748 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[444706,444719] [2023-11-29 04:15:53,748 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[444858,444871] [2023-11-29 04:15:53,749 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[445009,445022] [2023-11-29 04:15:53,750 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[445158,445171] [2023-11-29 04:15:53,750 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[445310,445323] [2023-11-29 04:15:53,751 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[445458,445471] [2023-11-29 04:15:53,751 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[445611,445624] [2023-11-29 04:15:53,752 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[445762,445775] [2023-11-29 04:15:53,752 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[445912,445925] [2023-11-29 04:15:53,753 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[446059,446072] [2023-11-29 04:15:53,753 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[446210,446223] [2023-11-29 04:15:53,754 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[446361,446374] [2023-11-29 04:15:53,754 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[446509,446522] [2023-11-29 04:15:53,755 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[446675,446688] [2023-11-29 04:15:53,755 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[446844,446857] [2023-11-29 04:15:53,756 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[447011,447024] [2023-11-29 04:15:53,756 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[447179,447192] [2023-11-29 04:15:53,757 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[447329,447342] [2023-11-29 04:15:53,757 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[447476,447489] [2023-11-29 04:15:53,758 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[447637,447650] [2023-11-29 04:15:53,758 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[447807,447820] [2023-11-29 04:15:53,758 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[447969,447982] [2023-11-29 04:15:53,805 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:15:53,832 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:15:53,909 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"./arch/x86/include/asm/paravirt.h"), "i" (804), "i" (12UL)); [4421-4422] [2023-11-29 04:15:53,910 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("771:\n\tcall *%c2;\n772:\n.pushsection .parainstructions,\"a\"\n .balign 8 \n .quad 771b\n .byte %c1\n .byte 772b-771b\n .short %c3\n.popsection\n": "=a" (__eax): [paravirt_typenum] "i" (44UL), [paravirt_opptr] "i" (& pv_irq_ops.save_fl.func), [paravirt_clobber] "i" (1): "memory", "cc"); [4427-4429] [2023-11-29 04:15:54,325 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[434581,434594] [2023-11-29 04:15:54,326 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[434726,434739] [2023-11-29 04:15:54,326 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[434872,434885] [2023-11-29 04:15:54,327 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435037,435050] [2023-11-29 04:15:54,327 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435195,435208] [2023-11-29 04:15:54,328 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435353,435366] [2023-11-29 04:15:54,328 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435511,435524] [2023-11-29 04:15:54,329 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435671,435684] [2023-11-29 04:15:54,329 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435830,435843] [2023-11-29 04:15:54,329 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435969,435982] [2023-11-29 04:15:54,330 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[436111,436124] [2023-11-29 04:15:54,330 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[436260,436273] [2023-11-29 04:15:54,331 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[436399,436412] [2023-11-29 04:15:54,331 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[436554,436567] [2023-11-29 04:15:54,332 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[436714,436727] [2023-11-29 04:15:54,332 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[436865,436878] [2023-11-29 04:15:54,333 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437016,437029] [2023-11-29 04:15:54,333 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437168,437181] [2023-11-29 04:15:54,333 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437317,437330] [2023-11-29 04:15:54,334 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437465,437478] [2023-11-29 04:15:54,334 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437622,437635] [2023-11-29 04:15:54,335 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437771,437784] [2023-11-29 04:15:54,335 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437927,437940] [2023-11-29 04:15:54,336 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438080,438093] [2023-11-29 04:15:54,336 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438226,438239] [2023-11-29 04:15:54,336 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438369,438382] [2023-11-29 04:15:54,337 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438521,438534] [2023-11-29 04:15:54,337 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438667,438680] [2023-11-29 04:15:54,338 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438812,438825] [2023-11-29 04:15:54,338 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438966,438979] [2023-11-29 04:15:54,338 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[439117,439130] [2023-11-29 04:15:54,339 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[439272,439285] [2023-11-29 04:15:54,339 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[439424,439437] [2023-11-29 04:15:54,340 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[439579,439592] [2023-11-29 04:15:54,340 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[439743,439756] [2023-11-29 04:15:54,340 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[439899,439912] [2023-11-29 04:15:54,341 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440063,440076] [2023-11-29 04:15:54,341 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440205,440218] [2023-11-29 04:15:54,342 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440363,440376] [2023-11-29 04:15:54,342 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440530,440543] [2023-11-29 04:15:54,343 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440689,440702] [2023-11-29 04:15:54,343 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440848,440861] [2023-11-29 04:15:54,343 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440997,441010] [2023-11-29 04:15:54,344 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[441144,441157] [2023-11-29 04:15:54,344 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[441283,441296] [2023-11-29 04:15:54,345 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[441446,441459] [2023-11-29 04:15:54,345 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[441612,441625] [2023-11-29 04:15:54,345 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[441776,441789] [2023-11-29 04:15:54,346 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[441941,441954] [2023-11-29 04:15:54,346 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[442106,442119] [2023-11-29 04:15:54,347 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[442272,442285] [2023-11-29 04:15:54,347 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[442437,442450] [2023-11-29 04:15:54,348 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[442604,442617] [2023-11-29 04:15:54,348 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[442764,442777] [2023-11-29 04:15:54,349 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[442926,442939] [2023-11-29 04:15:54,349 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[443085,443098] [2023-11-29 04:15:54,350 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[443231,443244] [2023-11-29 04:15:54,350 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[443374,443387] [2023-11-29 04:15:54,350 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[443518,443531] [2023-11-29 04:15:54,351 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[443661,443674] [2023-11-29 04:15:54,351 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[443805,443818] [2023-11-29 04:15:54,352 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[443946,443959] [2023-11-29 04:15:54,352 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[444084,444097] [2023-11-29 04:15:54,352 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[444242,444255] [2023-11-29 04:15:54,353 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[444401,444414] [2023-11-29 04:15:54,353 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[444557,444570] [2023-11-29 04:15:54,354 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[444706,444719] [2023-11-29 04:15:54,354 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[444858,444871] [2023-11-29 04:15:54,355 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[445009,445022] [2023-11-29 04:15:54,355 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[445158,445171] [2023-11-29 04:15:54,356 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[445310,445323] [2023-11-29 04:15:54,356 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[445458,445471] [2023-11-29 04:15:54,357 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[445611,445624] [2023-11-29 04:15:54,357 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[445762,445775] [2023-11-29 04:15:54,358 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[445912,445925] [2023-11-29 04:15:54,358 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[446059,446072] [2023-11-29 04:15:54,359 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[446210,446223] [2023-11-29 04:15:54,359 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[446361,446374] [2023-11-29 04:15:54,359 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[446509,446522] [2023-11-29 04:15:54,360 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[446675,446688] [2023-11-29 04:15:54,360 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[446844,446857] [2023-11-29 04:15:54,361 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[447011,447024] [2023-11-29 04:15:54,361 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[447179,447192] [2023-11-29 04:15:54,362 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[447329,447342] [2023-11-29 04:15:54,362 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[447476,447489] [2023-11-29 04:15:54,362 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[447637,447650] [2023-11-29 04:15:54,363 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[447807,447820] [2023-11-29 04:15:54,363 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[447969,447982] [2023-11-29 04:15:54,369 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:15:54,650 WARN L675 CHandler]: The function sprintf is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:15:54,659 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:15:54,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:15:54 WrapperNode [2023-11-29 04:15:54,659 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:15:54,661 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:15:54,661 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:15:54,661 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:15:54,669 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:15:54" (1/1) ... [2023-11-29 04:15:54,783 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:15:54" (1/1) ... [2023-11-29 04:15:55,046 INFO L138 Inliner]: procedures = 749, calls = 3534, calls flagged for inlining = 402, calls inlined = 238, statements flattened = 7451 [2023-11-29 04:15:55,046 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:15:55,047 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:15:55,047 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:15:55,047 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:15:55,062 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:15:54" (1/1) ... [2023-11-29 04:15:55,062 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:15:54" (1/1) ... [2023-11-29 04:15:55,097 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:15:54" (1/1) ... [2023-11-29 04:15:57,179 INFO L175 MemorySlicer]: Split 1090 memory accesses to 25 slices as follows [6, 4, 2, 7, 46, 2, 884, 2, 44, 12, 2, 2, 4, 23, 3, 5, 2, 1, 2, 16, 16, 2, 1, 1, 1]. 81 percent of accesses are in the largest equivalence class. The 172 initializations are split as follows [6, 4, 0, 7, 0, 0, 33, 0, 44, 12, 0, 0, 0, 23, 3, 5, 0, 1, 2, 16, 16, 0, 0, 0, 0]. The 329 writes are split as follows [0, 0, 0, 0, 0, 1, 321, 1, 0, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1]. [2023-11-29 04:15:57,179 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:15:54" (1/1) ... [2023-11-29 04:15:57,179 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:15:54" (1/1) ... [2023-11-29 04:15:57,308 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:15:54" (1/1) ... [2023-11-29 04:15:57,336 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:15:54" (1/1) ... [2023-11-29 04:15:57,372 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:15:54" (1/1) ... [2023-11-29 04:15:57,392 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:15:54" (1/1) ... [2023-11-29 04:15:57,447 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:15:57,448 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:15:57,448 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:15:57,448 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:15:57,449 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:15:54" (1/1) ... [2023-11-29 04:15:57,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:15:57,463 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:15:57,477 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 04:15:57,488 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 04:15:57,508 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2023-11-29 04:15:57,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2023-11-29 04:15:57,509 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2023-11-29 04:15:57,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2023-11-29 04:15:57,509 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2023-11-29 04:15:57,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2023-11-29 04:15:57,509 INFO L130 BoogieDeclarations]: Found specification of procedure cancel_delayed_work [2023-11-29 04:15:57,509 INFO L138 BoogieDeclarations]: Found implementation of procedure cancel_delayed_work [2023-11-29 04:15:57,509 INFO L130 BoogieDeclarations]: Found specification of procedure u132_disable [2023-11-29 04:15:57,509 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_disable [2023-11-29 04:15:57,509 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2023-11-29 04:15:57,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2023-11-29 04:15:57,510 INFO L130 BoogieDeclarations]: Found specification of procedure u132_remove [2023-11-29 04:15:57,510 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_remove [2023-11-29 04:15:57,510 INFO L130 BoogieDeclarations]: Found specification of procedure u132_udev_init_kref [2023-11-29 04:15:57,510 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_udev_init_kref [2023-11-29 04:15:57,510 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2023-11-29 04:15:57,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2023-11-29 04:15:57,511 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2023-11-29 04:15:57,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2023-11-29 04:15:57,511 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2023-11-29 04:15:57,511 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2023-11-29 04:15:57,511 INFO L130 BoogieDeclarations]: Found specification of procedure sprintf [2023-11-29 04:15:57,511 INFO L130 BoogieDeclarations]: Found specification of procedure u132_udev_put_kref [2023-11-29 04:15:57,511 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_udev_put_kref [2023-11-29 04:15:57,511 INFO L130 BoogieDeclarations]: Found specification of procedure usb_ftdi_elan_read_pcimem [2023-11-29 04:15:57,511 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_ftdi_elan_read_pcimem [2023-11-29 04:15:57,511 INFO L130 BoogieDeclarations]: Found specification of procedure u132_ring_requeue_work [2023-11-29 04:15:57,512 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_ring_requeue_work [2023-11-29 04:15:57,512 INFO L130 BoogieDeclarations]: Found specification of procedure u132_bus_suspend [2023-11-29 04:15:57,512 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_bus_suspend [2023-11-29 04:15:57,512 INFO L130 BoogieDeclarations]: Found specification of procedure u132_get_frame [2023-11-29 04:15:57,512 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_get_frame [2023-11-29 04:15:57,512 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2023-11-29 04:15:57,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2023-11-29 04:15:57,512 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2023-11-29 04:15:57,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2023-11-29 04:15:57,513 INFO L130 BoogieDeclarations]: Found specification of procedure edset_output [2023-11-29 04:15:57,513 INFO L138 BoogieDeclarations]: Found implementation of procedure edset_output [2023-11-29 04:15:57,513 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2023-11-29 04:15:57,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2023-11-29 04:15:57,513 INFO L130 BoogieDeclarations]: Found specification of procedure read_roothub_info [2023-11-29 04:15:57,513 INFO L138 BoogieDeclarations]: Found implementation of procedure read_roothub_info [2023-11-29 04:15:57,513 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_scheduler_lock_of_u132 [2023-11-29 04:15:57,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_scheduler_lock_of_u132 [2023-11-29 04:15:57,513 INFO L130 BoogieDeclarations]: Found specification of procedure edset_single [2023-11-29 04:15:57,513 INFO L138 BoogieDeclarations]: Found implementation of procedure edset_single [2023-11-29 04:15:57,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 04:15:57,514 INFO L130 BoogieDeclarations]: Found specification of procedure edset_setup [2023-11-29 04:15:57,514 INFO L138 BoogieDeclarations]: Found implementation of procedure edset_setup [2023-11-29 04:15:57,514 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2023-11-29 04:15:57,514 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2023-11-29 04:15:57,515 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2023-11-29 04:15:57,515 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2023-11-29 04:15:57,515 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2023-11-29 04:15:57,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2023-11-29 04:15:57,515 INFO L130 BoogieDeclarations]: Found specification of procedure u132_resume [2023-11-29 04:15:57,515 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_resume [2023-11-29 04:15:57,516 INFO L130 BoogieDeclarations]: Found specification of procedure ftdi_elan_gone_away [2023-11-29 04:15:57,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ftdi_elan_gone_away [2023-11-29 04:15:57,516 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2023-11-29 04:15:57,516 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2023-11-29 04:15:57,516 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2023-11-29 04:15:57,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2023-11-29 04:15:57,517 INFO L130 BoogieDeclarations]: Found specification of procedure _dev_info [2023-11-29 04:15:57,517 INFO L138 BoogieDeclarations]: Found implementation of procedure _dev_info [2023-11-29 04:15:57,517 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2023-11-29 04:15:57,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2023-11-29 04:15:57,517 INFO L130 BoogieDeclarations]: Found specification of procedure u132_endp_cancel_work [2023-11-29 04:15:57,517 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_endp_cancel_work [2023-11-29 04:15:57,517 INFO L130 BoogieDeclarations]: Found specification of procedure kref_get [2023-11-29 04:15:57,517 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_get [2023-11-29 04:15:57,517 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2023-11-29 04:15:57,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2023-11-29 04:15:57,518 INFO L130 BoogieDeclarations]: Found specification of procedure usb_hcd_unlink_urb_from_ep [2023-11-29 04:15:57,518 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_hcd_unlink_urb_from_ep [2023-11-29 04:15:57,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 04:15:57,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 04:15:57,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 04:15:57,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-29 04:15:57,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-29 04:15:57,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-11-29 04:15:57,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2023-11-29 04:15:57,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2023-11-29 04:15:57,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2023-11-29 04:15:57,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2023-11-29 04:15:57,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2023-11-29 04:15:57,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2023-11-29 04:15:57,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2023-11-29 04:15:57,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2023-11-29 04:15:57,520 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2023-11-29 04:15:57,520 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2023-11-29 04:15:57,520 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2023-11-29 04:15:57,520 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2023-11-29 04:15:57,520 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2023-11-29 04:15:57,520 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2023-11-29 04:15:57,520 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2023-11-29 04:15:57,520 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#21 [2023-11-29 04:15:57,520 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#22 [2023-11-29 04:15:57,520 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#23 [2023-11-29 04:15:57,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#24 [2023-11-29 04:15:57,521 INFO L130 BoogieDeclarations]: Found specification of procedure u132_hcd_ring_work_scheduler [2023-11-29 04:15:57,521 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_hcd_ring_work_scheduler [2023-11-29 04:15:57,521 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2023-11-29 04:15:57,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2023-11-29 04:15:57,521 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2023-11-29 04:15:57,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2023-11-29 04:15:57,522 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2023-11-29 04:15:57,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2023-11-29 04:15:57,522 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2023-11-29 04:15:57,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2023-11-29 04:15:57,522 INFO L130 BoogieDeclarations]: Found specification of procedure u132_u132_put_kref [2023-11-29 04:15:57,522 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_u132_put_kref [2023-11-29 04:15:57,522 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2023-11-29 04:15:57,522 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2023-11-29 04:15:57,523 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2023-11-29 04:15:57,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2023-11-29 04:15:57,523 INFO L130 BoogieDeclarations]: Found specification of procedure u132_hcd_endp_work_scheduler [2023-11-29 04:15:57,523 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_hcd_endp_work_scheduler [2023-11-29 04:15:57,523 INFO L130 BoogieDeclarations]: Found specification of procedure kref_put [2023-11-29 04:15:57,523 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_put [2023-11-29 04:15:57,523 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2023-11-29 04:15:57,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2023-11-29 04:15:57,524 INFO L130 BoogieDeclarations]: Found specification of procedure u132_hcd_monitor_work [2023-11-29 04:15:57,524 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_hcd_monitor_work [2023-11-29 04:15:57,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 04:15:57,524 INFO L130 BoogieDeclarations]: Found specification of procedure u132_monitor_requeue_work [2023-11-29 04:15:57,524 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_monitor_requeue_work [2023-11-29 04:15:57,524 INFO L130 BoogieDeclarations]: Found specification of procedure u132_hcd_stop [2023-11-29 04:15:57,525 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_hcd_stop [2023-11-29 04:15:57,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 04:15:57,525 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2023-11-29 04:15:57,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2023-11-29 04:15:57,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 04:15:57,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 04:15:57,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 04:15:57,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-29 04:15:57,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2023-11-29 04:15:57,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2023-11-29 04:15:57,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2023-11-29 04:15:57,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2023-11-29 04:15:57,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2023-11-29 04:15:57,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2023-11-29 04:15:57,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2023-11-29 04:15:57,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2023-11-29 04:15:57,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2023-11-29 04:15:57,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2023-11-29 04:15:57,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2023-11-29 04:15:57,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2023-11-29 04:15:57,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2023-11-29 04:15:57,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2023-11-29 04:15:57,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2023-11-29 04:15:57,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2023-11-29 04:15:57,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#20 [2023-11-29 04:15:57,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#21 [2023-11-29 04:15:57,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#22 [2023-11-29 04:15:57,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#23 [2023-11-29 04:15:57,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#24 [2023-11-29 04:15:57,528 INFO L130 BoogieDeclarations]: Found specification of procedure u132_hcd_giveback_urb [2023-11-29 04:15:57,528 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_hcd_giveback_urb [2023-11-29 04:15:57,529 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2023-11-29 04:15:57,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2023-11-29 04:15:57,529 INFO L130 BoogieDeclarations]: Found specification of procedure usb_ftdi_elan_write_pcimem [2023-11-29 04:15:57,529 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_ftdi_elan_write_pcimem [2023-11-29 04:15:57,529 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2023-11-29 04:15:57,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2023-11-29 04:15:57,529 INFO L130 BoogieDeclarations]: Found specification of procedure u132_endp_queue_work [2023-11-29 04:15:57,530 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_endp_queue_work [2023-11-29 04:15:57,530 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_u132_module_lock [2023-11-29 04:15:57,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_u132_module_lock [2023-11-29 04:15:57,530 INFO L130 BoogieDeclarations]: Found specification of procedure u132_ring_queue_work [2023-11-29 04:15:57,530 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_ring_queue_work [2023-11-29 04:15:57,530 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_drvdata [2023-11-29 04:15:57,530 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_drvdata [2023-11-29 04:15:57,530 INFO L130 BoogieDeclarations]: Found specification of procedure __init_work [2023-11-29 04:15:57,531 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_work [2023-11-29 04:15:57,531 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2023-11-29 04:15:57,531 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2023-11-29 04:15:57,531 INFO L130 BoogieDeclarations]: Found specification of procedure u132_hcd_start [2023-11-29 04:15:57,531 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_hcd_start [2023-11-29 04:15:57,531 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2023-11-29 04:15:57,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2023-11-29 04:15:57,531 INFO L130 BoogieDeclarations]: Found specification of procedure usb_ftdi_elan_edset_input [2023-11-29 04:15:57,532 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_ftdi_elan_edset_input [2023-11-29 04:15:57,532 INFO L130 BoogieDeclarations]: Found specification of procedure u132_to_hcd [2023-11-29 04:15:57,532 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_to_hcd [2023-11-29 04:15:57,532 INFO L130 BoogieDeclarations]: Found specification of procedure u132_probe [2023-11-29 04:15:57,532 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_probe [2023-11-29 04:15:57,532 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_sw_lock_of_u132 [2023-11-29 04:15:57,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_sw_lock_of_u132 [2023-11-29 04:15:57,532 INFO L130 BoogieDeclarations]: Found specification of procedure queue_delayed_work [2023-11-29 04:15:57,533 INFO L138 BoogieDeclarations]: Found implementation of procedure queue_delayed_work [2023-11-29 04:15:57,533 INFO L130 BoogieDeclarations]: Found specification of procedure dev_warn [2023-11-29 04:15:57,533 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_warn [2023-11-29 04:15:57,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:15:57,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:15:57,533 INFO L130 BoogieDeclarations]: Found specification of procedure u132_endp_init_kref [2023-11-29 04:15:57,533 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_endp_init_kref [2023-11-29 04:15:57,533 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_sw_lock_of_u132 [2023-11-29 04:15:57,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_sw_lock_of_u132 [2023-11-29 04:15:57,534 INFO L130 BoogieDeclarations]: Found specification of procedure msleep [2023-11-29 04:15:57,534 INFO L138 BoogieDeclarations]: Found implementation of procedure msleep [2023-11-29 04:15:57,534 INFO L130 BoogieDeclarations]: Found specification of procedure kref_sub [2023-11-29 04:15:57,534 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_sub [2023-11-29 04:15:57,534 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2023-11-29 04:15:57,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2023-11-29 04:15:57,534 INFO L130 BoogieDeclarations]: Found specification of procedure u132_udev_get_kref [2023-11-29 04:15:57,535 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_udev_get_kref [2023-11-29 04:15:57,535 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2023-11-29 04:15:57,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2023-11-29 04:15:57,535 INFO L130 BoogieDeclarations]: Found specification of procedure hcd_to_u132 [2023-11-29 04:15:57,535 INFO L138 BoogieDeclarations]: Found implementation of procedure hcd_to_u132 [2023-11-29 04:15:57,535 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2023-11-29 04:15:57,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2023-11-29 04:15:57,535 INFO L130 BoogieDeclarations]: Found specification of procedure usb_hcd_giveback_urb [2023-11-29 04:15:57,536 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_hcd_giveback_urb [2023-11-29 04:15:57,536 INFO L130 BoogieDeclarations]: Found specification of procedure u132_bus_resume [2023-11-29 04:15:57,536 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_bus_resume [2023-11-29 04:15:57,536 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_slock_of_u132_spin [2023-11-29 04:15:57,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_slock_of_u132_spin [2023-11-29 04:15:57,536 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2023-11-29 04:15:57,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2023-11-29 04:15:57,536 INFO L130 BoogieDeclarations]: Found specification of procedure u132_endp_delete [2023-11-29 04:15:57,536 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_endp_delete [2023-11-29 04:15:57,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 04:15:57,536 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_platdata [2023-11-29 04:15:57,537 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_platdata [2023-11-29 04:15:57,537 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2023-11-29 04:15:57,537 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2023-11-29 04:15:57,537 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2023-11-29 04:15:57,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2023-11-29 04:15:57,537 INFO L130 BoogieDeclarations]: Found specification of procedure u132_endp_put_kref [2023-11-29 04:15:57,537 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_endp_put_kref [2023-11-29 04:15:57,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 04:15:57,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 04:15:57,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 04:15:57,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-29 04:15:57,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2023-11-29 04:15:57,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2023-11-29 04:15:57,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2023-11-29 04:15:57,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2023-11-29 04:15:57,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2023-11-29 04:15:57,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2023-11-29 04:15:57,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2023-11-29 04:15:57,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2023-11-29 04:15:57,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2023-11-29 04:15:57,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2023-11-29 04:15:57,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2023-11-29 04:15:57,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2023-11-29 04:15:57,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2023-11-29 04:15:57,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2023-11-29 04:15:57,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2023-11-29 04:15:57,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2023-11-29 04:15:57,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#20 [2023-11-29 04:15:57,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#21 [2023-11-29 04:15:57,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#22 [2023-11-29 04:15:57,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#23 [2023-11-29 04:15:57,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#24 [2023-11-29 04:15:57,541 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_100 [2023-11-29 04:15:57,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_100 [2023-11-29 04:15:57,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-29 04:15:57,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-29 04:15:57,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-29 04:15:57,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2023-11-29 04:15:57,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2023-11-29 04:15:57,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2023-11-29 04:15:57,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2023-11-29 04:15:57,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2023-11-29 04:15:57,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2023-11-29 04:15:57,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2023-11-29 04:15:57,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2023-11-29 04:15:57,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2023-11-29 04:15:57,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2023-11-29 04:15:57,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2023-11-29 04:15:57,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2023-11-29 04:15:57,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2023-11-29 04:15:57,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2023-11-29 04:15:57,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2023-11-29 04:15:57,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2023-11-29 04:15:57,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2023-11-29 04:15:57,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#20 [2023-11-29 04:15:57,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#21 [2023-11-29 04:15:57,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#22 [2023-11-29 04:15:57,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#23 [2023-11-29 04:15:57,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#24 [2023-11-29 04:15:57,544 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2023-11-29 04:15:57,544 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2023-11-29 04:15:57,544 INFO L130 BoogieDeclarations]: Found specification of procedure u132_ring_put_kref [2023-11-29 04:15:57,545 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_ring_put_kref [2023-11-29 04:15:57,545 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2023-11-29 04:15:57,545 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2023-11-29 04:15:57,545 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2023-11-29 04:15:57,545 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2023-11-29 04:15:57,545 INFO L130 BoogieDeclarations]: Found specification of procedure u132_endp_urb_dequeue [2023-11-29 04:15:57,545 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_endp_urb_dequeue [2023-11-29 04:15:57,545 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2023-11-29 04:15:57,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2023-11-29 04:15:57,545 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2023-11-29 04:15:57,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2023-11-29 04:15:57,546 INFO L130 BoogieDeclarations]: Found specification of procedure lockdep_init_map [2023-11-29 04:15:57,546 INFO L138 BoogieDeclarations]: Found implementation of procedure lockdep_init_map [2023-11-29 04:15:57,546 INFO L130 BoogieDeclarations]: Found specification of procedure u132_hcd_reset [2023-11-29 04:15:57,546 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_hcd_reset [2023-11-29 04:15:57,546 INFO L130 BoogieDeclarations]: Found specification of procedure list_empty [2023-11-29 04:15:57,546 INFO L138 BoogieDeclarations]: Found implementation of procedure list_empty [2023-11-29 04:15:57,546 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2023-11-29 04:15:57,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2023-11-29 04:15:57,546 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2023-11-29 04:15:57,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2023-11-29 04:15:57,546 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2023-11-29 04:15:57,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2023-11-29 04:15:57,547 INFO L130 BoogieDeclarations]: Found specification of procedure port_power [2023-11-29 04:15:57,547 INFO L138 BoogieDeclarations]: Found implementation of procedure port_power [2023-11-29 04:15:57,547 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2023-11-29 04:15:57,547 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2023-11-29 04:15:57,547 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2023-11-29 04:15:57,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2023-11-29 04:15:57,547 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2023-11-29 04:15:57,547 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2023-11-29 04:15:57,547 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2023-11-29 04:15:57,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2023-11-29 04:15:57,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 04:15:57,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 04:15:57,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 04:15:57,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 04:15:57,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-29 04:15:57,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-11-29 04:15:57,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2023-11-29 04:15:57,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2023-11-29 04:15:57,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2023-11-29 04:15:57,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2023-11-29 04:15:57,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2023-11-29 04:15:57,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2023-11-29 04:15:57,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2023-11-29 04:15:57,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2023-11-29 04:15:57,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2023-11-29 04:15:57,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2023-11-29 04:15:57,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2023-11-29 04:15:57,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2023-11-29 04:15:57,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2023-11-29 04:15:57,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2023-11-29 04:15:57,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2023-11-29 04:15:57,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#21 [2023-11-29 04:15:57,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#22 [2023-11-29 04:15:57,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#23 [2023-11-29 04:15:57,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#24 [2023-11-29 04:15:57,550 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2023-11-29 04:15:57,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2023-11-29 04:15:57,550 INFO L130 BoogieDeclarations]: Found specification of procedure usb_hcd_link_urb_to_ep [2023-11-29 04:15:57,550 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_hcd_link_urb_to_ep [2023-11-29 04:15:57,550 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2023-11-29 04:15:57,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2023-11-29 04:15:57,550 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2023-11-29 04:15:57,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2023-11-29 04:15:57,550 INFO L130 BoogieDeclarations]: Found specification of procedure kref_init [2023-11-29 04:15:57,550 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_init [2023-11-29 04:15:57,551 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_scheduler_lock_of_u132 [2023-11-29 04:15:57,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_scheduler_lock_of_u132 [2023-11-29 04:15:57,551 INFO L130 BoogieDeclarations]: Found specification of procedure u132_ring_cancel_work [2023-11-29 04:15:57,551 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_ring_cancel_work [2023-11-29 04:15:57,551 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2023-11-29 04:15:57,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2023-11-29 04:15:57,551 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2023-11-29 04:15:57,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2023-11-29 04:15:57,551 INFO L130 BoogieDeclarations]: Found specification of procedure init_timer_key [2023-11-29 04:15:57,551 INFO L138 BoogieDeclarations]: Found implementation of procedure init_timer_key [2023-11-29 04:15:57,551 INFO L130 BoogieDeclarations]: Found specification of procedure msecs_to_jiffies [2023-11-29 04:15:57,552 INFO L138 BoogieDeclarations]: Found implementation of procedure msecs_to_jiffies [2023-11-29 04:15:57,552 INFO L130 BoogieDeclarations]: Found specification of procedure delayed_work_timer_fn [2023-11-29 04:15:57,552 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_u132_module_lock [2023-11-29 04:15:57,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_u132_module_lock [2023-11-29 04:15:57,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 04:15:57,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 04:15:57,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 04:15:57,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 04:15:57,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-29 04:15:57,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-11-29 04:15:57,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2023-11-29 04:15:57,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2023-11-29 04:15:57,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2023-11-29 04:15:57,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2023-11-29 04:15:57,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2023-11-29 04:15:57,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2023-11-29 04:15:57,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2023-11-29 04:15:57,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2023-11-29 04:15:57,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2023-11-29 04:15:57,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2023-11-29 04:15:57,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2023-11-29 04:15:57,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2023-11-29 04:15:57,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2023-11-29 04:15:57,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2023-11-29 04:15:57,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2023-11-29 04:15:57,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#21 [2023-11-29 04:15:57,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#22 [2023-11-29 04:15:57,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#23 [2023-11-29 04:15:57,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#24 [2023-11-29 04:15:58,520 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:15:58,524 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:15:58,615 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2023-11-29 04:16:06,273 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:16:06,587 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:16:06,587 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 04:16:06,589 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:16:06 BoogieIcfgContainer [2023-11-29 04:16:06,589 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:16:06,591 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 04:16:06,591 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 04:16:06,595 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 04:16:06,595 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 04:15:48" (1/3) ... [2023-11-29 04:16:06,596 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f0be999 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:16:06, skipping insertion in model container [2023-11-29 04:16:06,596 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:15:54" (2/3) ... [2023-11-29 04:16:06,596 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f0be999 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:16:06, skipping insertion in model container [2023-11-29 04:16:06,596 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:16:06" (3/3) ... [2023-11-29 04:16:06,597 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i [2023-11-29 04:16:06,620 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 04:16:06,620 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 29 error locations. [2023-11-29 04:16:06,717 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:16:06,724 INFO L357 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, mHoare=true, 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;@4b2faecf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:16:06,724 INFO L358 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2023-11-29 04:16:06,738 INFO L276 IsEmpty]: Start isEmpty. Operand has 2138 states, 1367 states have (on average 1.4169714703730798) internal successors, (1937), 1456 states have internal predecessors, (1937), 623 states have call successors, (623), 119 states have call predecessors, (623), 118 states have return successors, (617), 585 states have call predecessors, (617), 617 states have call successors, (617) [2023-11-29 04:16:06,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-29 04:16:06,751 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:16:06,752 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 04:16:06,752 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2023-11-29 04:16:06,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:16:06,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1736537239, now seen corresponding path program 1 times [2023-11-29 04:16:06,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:16:06,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213369052] [2023-11-29 04:16:06,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:16:06,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:16:07,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:16:07,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:16:07,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:16:07,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 04:16:07,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:16:07,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 04:16:07,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:16:07,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 04:16:07,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:16:07,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 04:16:07,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:16:07,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-29 04:16:07,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:16:07,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:16:07,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:16:07,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 04:16:07,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:16:07,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 04:16:07,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:16:07,665 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 04:16:07,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:16:07,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213369052] [2023-11-29 04:16:07,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213369052] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:16:07,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:16:07,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:16:07,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954577041] [2023-11-29 04:16:07,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:16:07,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:16:07,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:16:07,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:16:07,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:16:07,718 INFO L87 Difference]: Start difference. First operand has 2138 states, 1367 states have (on average 1.4169714703730798) internal successors, (1937), 1456 states have internal predecessors, (1937), 623 states have call successors, (623), 119 states have call predecessors, (623), 118 states have return successors, (617), 585 states have call predecessors, (617), 617 states have call successors, (617) Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-29 04:16:18,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:16:18,380 INFO L93 Difference]: Finished difference Result 4327 states and 6689 transitions. [2023-11-29 04:16:18,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 04:16:18,382 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 46 [2023-11-29 04:16:18,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:16:18,417 INFO L225 Difference]: With dead ends: 4327 [2023-11-29 04:16:18,417 INFO L226 Difference]: Without dead ends: 2205 [2023-11-29 04:16:18,433 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-11-29 04:16:18,436 INFO L413 NwaCegarLoop]: 1295 mSDtfsCounter, 4994 mSDsluCounter, 3009 mSDsCounter, 0 mSdLazyCounter, 6166 mSolverCounterSat, 3481 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5299 SdHoareTripleChecker+Valid, 4304 SdHoareTripleChecker+Invalid, 9647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3481 IncrementalHoareTripleChecker+Valid, 6166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:16:18,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5299 Valid, 4304 Invalid, 9647 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3481 Valid, 6166 Invalid, 0 Unknown, 0 Unchecked, 10.0s Time] [2023-11-29 04:16:18,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2205 states. [2023-11-29 04:16:18,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2205 to 2121. [2023-11-29 04:16:18,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2121 states, 1359 states have (on average 1.3855776306107432) internal successors, (1883), 1443 states have internal predecessors, (1883), 617 states have call successors, (617), 118 states have call predecessors, (617), 117 states have return successors, (615), 583 states have call predecessors, (615), 615 states have call successors, (615) [2023-11-29 04:16:18,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2121 states to 2121 states and 3115 transitions. [2023-11-29 04:16:18,688 INFO L78 Accepts]: Start accepts. Automaton has 2121 states and 3115 transitions. Word has length 46 [2023-11-29 04:16:18,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:16:18,689 INFO L495 AbstractCegarLoop]: Abstraction has 2121 states and 3115 transitions. [2023-11-29 04:16:18,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-29 04:16:18,689 INFO L276 IsEmpty]: Start isEmpty. Operand 2121 states and 3115 transitions. [2023-11-29 04:16:18,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-29 04:16:18,693 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:16:18,693 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 04:16:18,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 04:16:18,693 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_linux_block_genhd_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2023-11-29 04:16:18,694 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:16:18,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1290801642, now seen corresponding path program 1 times [2023-11-29 04:16:18,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:16:18,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523887139] [2023-11-29 04:16:18,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:16:18,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:16:18,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:16:18,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:16:18,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:16:19,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 04:16:19,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:16:19,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 04:16:19,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:16:19,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 04:16:19,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:16:19,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 04:16:19,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:16:19,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-29 04:16:19,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:16:19,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:16:19,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:16:19,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 04:16:19,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:16:19,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 04:16:19,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:16:19,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 04:16:19,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:16:19,112 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 04:16:19,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:16:19,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523887139] [2023-11-29 04:16:19,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523887139] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:16:19,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:16:19,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:16:19,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675715128] [2023-11-29 04:16:19,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:16:19,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:16:19,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:16:19,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:16:19,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:16:19,115 INFO L87 Difference]: Start difference. First operand 2121 states and 3115 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-29 04:16:28,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:16:28,760 INFO L93 Difference]: Finished difference Result 2205 states and 3267 transitions. [2023-11-29 04:16:28,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 04:16:28,761 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (11), 5 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 51 [2023-11-29 04:16:28,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:16:28,776 INFO L225 Difference]: With dead ends: 2205 [2023-11-29 04:16:28,776 INFO L226 Difference]: Without dead ends: 2203 [2023-11-29 04:16:28,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-11-29 04:16:28,778 INFO L413 NwaCegarLoop]: 1281 mSDtfsCounter, 4954 mSDsluCounter, 2979 mSDsCounter, 0 mSdLazyCounter, 6142 mSolverCounterSat, 3466 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5256 SdHoareTripleChecker+Valid, 4260 SdHoareTripleChecker+Invalid, 9608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3466 IncrementalHoareTripleChecker+Valid, 6142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:16:28,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5256 Valid, 4260 Invalid, 9608 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3466 Valid, 6142 Invalid, 0 Unknown, 0 Unchecked, 9.2s Time] [2023-11-29 04:16:28,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2203 states. [2023-11-29 04:16:28,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2203 to 2119. [2023-11-29 04:16:28,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2119 states, 1358 states have (on average 1.3851251840942562) internal successors, (1881), 1441 states have internal predecessors, (1881), 617 states have call successors, (617), 118 states have call predecessors, (617), 117 states have return successors, (615), 583 states have call predecessors, (615), 615 states have call successors, (615) [2023-11-29 04:16:28,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2119 states to 2119 states and 3113 transitions. [2023-11-29 04:16:28,898 INFO L78 Accepts]: Start accepts. Automaton has 2119 states and 3113 transitions. Word has length 51 [2023-11-29 04:16:28,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:16:28,898 INFO L495 AbstractCegarLoop]: Abstraction has 2119 states and 3113 transitions. [2023-11-29 04:16:28,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-29 04:16:28,899 INFO L276 IsEmpty]: Start isEmpty. Operand 2119 states and 3113 transitions. [2023-11-29 04:16:28,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-29 04:16:28,902 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:16:28,902 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2023-11-29 04:16:28,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 04:16:28,902 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2023-11-29 04:16:28,903 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:16:28,903 INFO L85 PathProgramCache]: Analyzing trace with hash 246367488, now seen corresponding path program 1 times [2023-11-29 04:16:28,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:16:28,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746679242] [2023-11-29 04:16:28,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:16:28,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:16:28,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:16:29,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:16:29,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:16:29,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 04:16:29,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:16:29,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 04:16:29,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:16:29,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 04:16:29,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:16:29,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 04:16:29,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:16:29,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-29 04:16:29,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:16:29,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:16:29,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:16:29,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 04:16:29,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:16:29,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 04:16:29,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:16:29,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 04:16:29,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:16:29,540 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-29 04:16:29,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:16:29,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746679242] [2023-11-29 04:16:29,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746679242] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:16:29,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:16:29,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 04:16:29,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467142484] [2023-11-29 04:16:29,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:16:29,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 04:16:29,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:16:29,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 04:16:29,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:16:29,543 INFO L87 Difference]: Start difference. First operand 2119 states and 3113 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-29 04:16:39,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:16:39,724 INFO L93 Difference]: Finished difference Result 2219 states and 3277 transitions. [2023-11-29 04:16:39,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 04:16:39,725 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 53 [2023-11-29 04:16:39,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:16:39,743 INFO L225 Difference]: With dead ends: 2219 [2023-11-29 04:16:39,743 INFO L226 Difference]: Without dead ends: 2217 [2023-11-29 04:16:39,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2023-11-29 04:16:39,745 INFO L413 NwaCegarLoop]: 1281 mSDtfsCounter, 4946 mSDsluCounter, 3978 mSDsCounter, 0 mSdLazyCounter, 8353 mSolverCounterSat, 3499 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5200 SdHoareTripleChecker+Valid, 5259 SdHoareTripleChecker+Invalid, 11852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3499 IncrementalHoareTripleChecker+Valid, 8353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.7s IncrementalHoareTripleChecker+Time [2023-11-29 04:16:39,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5200 Valid, 5259 Invalid, 11852 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3499 Valid, 8353 Invalid, 0 Unknown, 0 Unchecked, 9.7s Time] [2023-11-29 04:16:39,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2217 states. [2023-11-29 04:16:39,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2217 to 2131. [2023-11-29 04:16:39,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2131 states, 1366 states have (on average 1.383601756954612) internal successors, (1890), 1449 states have internal predecessors, (1890), 617 states have call successors, (617), 122 states have call predecessors, (617), 121 states have return successors, (615), 583 states have call predecessors, (615), 615 states have call successors, (615) [2023-11-29 04:16:39,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2131 states to 2131 states and 3122 transitions. [2023-11-29 04:16:39,869 INFO L78 Accepts]: Start accepts. Automaton has 2131 states and 3122 transitions. Word has length 53 [2023-11-29 04:16:39,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:16:39,869 INFO L495 AbstractCegarLoop]: Abstraction has 2131 states and 3122 transitions. [2023-11-29 04:16:39,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-29 04:16:39,870 INFO L276 IsEmpty]: Start isEmpty. Operand 2131 states and 3122 transitions. [2023-11-29 04:16:39,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-11-29 04:16:39,873 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:16:39,873 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 04:16:39,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 04:16:39,873 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2023-11-29 04:16:39,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:16:39,874 INFO L85 PathProgramCache]: Analyzing trace with hash 506288481, now seen corresponding path program 1 times [2023-11-29 04:16:39,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:16:39,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245712045] [2023-11-29 04:16:39,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:16:39,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:16:39,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:16:40,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:16:40,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:16:40,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 04:16:40,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:16:40,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 04:16:40,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:16:40,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 04:16:40,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:16:40,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 04:16:40,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:16:40,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-29 04:16:40,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:16:40,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:16:40,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:16:40,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 04:16:40,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:16:40,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 04:16:40,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:16:40,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 04:16:40,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:16:40,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 04:16:40,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:16:40,214 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 04:16:40,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:16:40,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245712045] [2023-11-29 04:16:40,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245712045] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:16:40,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:16:40,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:16:40,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801015435] [2023-11-29 04:16:40,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:16:40,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:16:40,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:16:40,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:16:40,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:16:40,217 INFO L87 Difference]: Start difference. First operand 2131 states and 3122 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-29 04:16:49,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:16:49,147 INFO L93 Difference]: Finished difference Result 2215 states and 3274 transitions. [2023-11-29 04:16:49,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 04:16:49,147 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (12), 5 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 56 [2023-11-29 04:16:49,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:16:49,160 INFO L225 Difference]: With dead ends: 2215 [2023-11-29 04:16:49,161 INFO L226 Difference]: Without dead ends: 2213 [2023-11-29 04:16:49,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-11-29 04:16:49,162 INFO L413 NwaCegarLoop]: 1281 mSDtfsCounter, 4943 mSDsluCounter, 2979 mSDsCounter, 0 mSdLazyCounter, 6143 mSolverCounterSat, 3459 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5244 SdHoareTripleChecker+Valid, 4260 SdHoareTripleChecker+Invalid, 9602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3459 IncrementalHoareTripleChecker+Valid, 6143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2023-11-29 04:16:49,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5244 Valid, 4260 Invalid, 9602 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3459 Valid, 6143 Invalid, 0 Unknown, 0 Unchecked, 8.5s Time] [2023-11-29 04:16:49,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2213 states. [2023-11-29 04:16:49,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2213 to 2129. [2023-11-29 04:16:49,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2129 states, 1365 states have (on average 1.3831501831501831) internal successors, (1888), 1447 states have internal predecessors, (1888), 617 states have call successors, (617), 122 states have call predecessors, (617), 121 states have return successors, (615), 583 states have call predecessors, (615), 615 states have call successors, (615) [2023-11-29 04:16:49,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2129 states to 2129 states and 3120 transitions. [2023-11-29 04:16:49,349 INFO L78 Accepts]: Start accepts. Automaton has 2129 states and 3120 transitions. Word has length 56 [2023-11-29 04:16:49,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:16:49,350 INFO L495 AbstractCegarLoop]: Abstraction has 2129 states and 3120 transitions. [2023-11-29 04:16:49,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-29 04:16:49,350 INFO L276 IsEmpty]: Start isEmpty. Operand 2129 states and 3120 transitions. [2023-11-29 04:16:49,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-11-29 04:16:49,353 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:16:49,354 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 04:16:49,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 04:16:49,354 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2023-11-29 04:16:49,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:16:49,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1487383623, now seen corresponding path program 1 times [2023-11-29 04:16:49,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:16:49,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044401922] [2023-11-29 04:16:49,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:16:49,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:16:49,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:16:49,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:16:49,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:16:49,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 04:16:49,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:16:49,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 04:16:49,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:16:49,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 04:16:49,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:16:49,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 04:16:49,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:16:49,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-29 04:16:49,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:16:49,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:16:49,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:16:49,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 04:16:49,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:16:49,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 04:16:49,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:16:49,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 04:16:49,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:16:49,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 04:16:49,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:16:49,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 04:16:49,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:16:49,850 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 04:16:49,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:16:49,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044401922] [2023-11-29 04:16:49,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044401922] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:16:49,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:16:49,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:16:49,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577678083] [2023-11-29 04:16:49,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:16:49,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:16:49,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:16:49,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:16:49,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:16:49,853 INFO L87 Difference]: Start difference. First operand 2129 states and 3120 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-29 04:16:58,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:16:58,406 INFO L93 Difference]: Finished difference Result 2213 states and 3272 transitions. [2023-11-29 04:16:58,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 04:16:58,406 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (13), 5 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 61 [2023-11-29 04:16:58,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:16:58,419 INFO L225 Difference]: With dead ends: 2213 [2023-11-29 04:16:58,420 INFO L226 Difference]: Without dead ends: 2211 [2023-11-29 04:16:58,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-11-29 04:16:58,421 INFO L413 NwaCegarLoop]: 1281 mSDtfsCounter, 4941 mSDsluCounter, 2979 mSDsCounter, 0 mSdLazyCounter, 6138 mSolverCounterSat, 3461 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5241 SdHoareTripleChecker+Valid, 4260 SdHoareTripleChecker+Invalid, 9599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3461 IncrementalHoareTripleChecker+Valid, 6138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:16:58,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5241 Valid, 4260 Invalid, 9599 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3461 Valid, 6138 Invalid, 0 Unknown, 0 Unchecked, 8.2s Time] [2023-11-29 04:16:58,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2211 states. [2023-11-29 04:16:58,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2211 to 2127. [2023-11-29 04:16:58,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2127 states, 1364 states have (on average 1.3826979472140764) internal successors, (1886), 1445 states have internal predecessors, (1886), 617 states have call successors, (617), 122 states have call predecessors, (617), 121 states have return successors, (615), 583 states have call predecessors, (615), 615 states have call successors, (615) [2023-11-29 04:16:58,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2127 states to 2127 states and 3118 transitions. [2023-11-29 04:16:58,620 INFO L78 Accepts]: Start accepts. Automaton has 2127 states and 3118 transitions. Word has length 61 [2023-11-29 04:16:58,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:16:58,621 INFO L495 AbstractCegarLoop]: Abstraction has 2127 states and 3118 transitions. [2023-11-29 04:16:58,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-29 04:16:58,621 INFO L276 IsEmpty]: Start isEmpty. Operand 2127 states and 3118 transitions. [2023-11-29 04:16:58,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-11-29 04:16:58,623 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:16:58,623 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2023-11-29 04:16:58,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 04:16:58,624 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2023-11-29 04:16:58,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:16:58,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1141810697, now seen corresponding path program 1 times [2023-11-29 04:16:58,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:16:58,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204108861] [2023-11-29 04:16:58,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:16:58,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:16:58,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:16:58,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:16:58,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:16:58,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 04:16:58,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:16:58,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 04:16:58,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:16:58,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 04:16:58,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:16:59,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 04:16:59,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:16:59,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-29 04:16:59,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:16:59,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:16:59,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:16:59,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 04:16:59,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:16:59,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 04:16:59,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:16:59,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 04:16:59,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:16:59,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 04:16:59,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:16:59,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:16:59,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:16:59,071 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-29 04:16:59,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:16:59,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204108861] [2023-11-29 04:16:59,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204108861] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:16:59,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:16:59,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 04:16:59,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602461199] [2023-11-29 04:16:59,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:16:59,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 04:16:59,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:16:59,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 04:16:59,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-29 04:16:59,073 INFO L87 Difference]: Start difference. First operand 2127 states and 3118 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (14), 7 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 04:17:10,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:17:10,646 INFO L93 Difference]: Finished difference Result 2303 states and 3459 transitions. [2023-11-29 04:17:10,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 04:17:10,646 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (14), 7 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) Word has length 63 [2023-11-29 04:17:10,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:17:10,660 INFO L225 Difference]: With dead ends: 2303 [2023-11-29 04:17:10,660 INFO L226 Difference]: Without dead ends: 2301 [2023-11-29 04:17:10,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=290, Unknown=0, NotChecked=0, Total=420 [2023-11-29 04:17:10,662 INFO L413 NwaCegarLoop]: 1281 mSDtfsCounter, 3893 mSDsluCounter, 5687 mSDsCounter, 0 mSdLazyCounter, 11222 mSolverCounterSat, 3882 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3893 SdHoareTripleChecker+Valid, 6968 SdHoareTripleChecker+Invalid, 15104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3882 IncrementalHoareTripleChecker+Valid, 11222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:17:10,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3893 Valid, 6968 Invalid, 15104 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3882 Valid, 11222 Invalid, 0 Unknown, 0 Unchecked, 11.0s Time] [2023-11-29 04:17:10,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2301 states. [2023-11-29 04:17:10,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2301 to 2127. [2023-11-29 04:17:10,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2127 states, 1364 states have (on average 1.3819648093841643) internal successors, (1885), 1445 states have internal predecessors, (1885), 617 states have call successors, (617), 122 states have call predecessors, (617), 121 states have return successors, (615), 583 states have call predecessors, (615), 615 states have call successors, (615) [2023-11-29 04:17:10,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2127 states to 2127 states and 3117 transitions. [2023-11-29 04:17:10,848 INFO L78 Accepts]: Start accepts. Automaton has 2127 states and 3117 transitions. Word has length 63 [2023-11-29 04:17:10,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:17:10,849 INFO L495 AbstractCegarLoop]: Abstraction has 2127 states and 3117 transitions. [2023-11-29 04:17:10,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (14), 7 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 04:17:10,849 INFO L276 IsEmpty]: Start isEmpty. Operand 2127 states and 3117 transitions. [2023-11-29 04:17:10,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-11-29 04:17:10,850 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:17:10,850 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 04:17:10,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 04:17:10,851 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2023-11-29 04:17:10,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:17:10,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1279196442, now seen corresponding path program 1 times [2023-11-29 04:17:10,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:17:10,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19056048] [2023-11-29 04:17:10,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:17:10,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:17:10,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:11,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:17:11,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:11,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 04:17:11,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:11,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 04:17:11,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:11,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 04:17:11,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:11,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 04:17:11,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:11,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-29 04:17:11,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:11,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:17:11,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:11,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 04:17:11,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:11,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 04:17:11,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:11,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 04:17:11,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:11,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 04:17:11,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:11,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 04:17:11,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:11,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 04:17:11,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:11,287 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 04:17:11,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:17:11,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19056048] [2023-11-29 04:17:11,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19056048] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:17:11,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:17:11,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:17:11,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032011049] [2023-11-29 04:17:11,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:17:11,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:17:11,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:17:11,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:17:11,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:17:11,290 INFO L87 Difference]: Start difference. First operand 2127 states and 3117 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-29 04:17:20,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:17:20,574 INFO L93 Difference]: Finished difference Result 2211 states and 3269 transitions. [2023-11-29 04:17:20,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 04:17:20,576 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (14), 5 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 66 [2023-11-29 04:17:20,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:17:20,590 INFO L225 Difference]: With dead ends: 2211 [2023-11-29 04:17:20,590 INFO L226 Difference]: Without dead ends: 2209 [2023-11-29 04:17:20,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-11-29 04:17:20,592 INFO L413 NwaCegarLoop]: 1281 mSDtfsCounter, 4906 mSDsluCounter, 2979 mSDsCounter, 0 mSdLazyCounter, 6157 mSolverCounterSat, 3450 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5205 SdHoareTripleChecker+Valid, 4260 SdHoareTripleChecker+Invalid, 9607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3450 IncrementalHoareTripleChecker+Valid, 6157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2023-11-29 04:17:20,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5205 Valid, 4260 Invalid, 9607 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3450 Valid, 6157 Invalid, 0 Unknown, 0 Unchecked, 8.8s Time] [2023-11-29 04:17:20,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2209 states. [2023-11-29 04:17:20,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2209 to 2125. [2023-11-29 04:17:20,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2125 states, 1363 states have (on average 1.3815113719735876) internal successors, (1883), 1443 states have internal predecessors, (1883), 617 states have call successors, (617), 122 states have call predecessors, (617), 121 states have return successors, (615), 583 states have call predecessors, (615), 615 states have call successors, (615) [2023-11-29 04:17:20,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2125 states to 2125 states and 3115 transitions. [2023-11-29 04:17:20,726 INFO L78 Accepts]: Start accepts. Automaton has 2125 states and 3115 transitions. Word has length 66 [2023-11-29 04:17:20,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:17:20,727 INFO L495 AbstractCegarLoop]: Abstraction has 2125 states and 3115 transitions. [2023-11-29 04:17:20,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-29 04:17:20,727 INFO L276 IsEmpty]: Start isEmpty. Operand 2125 states and 3115 transitions. [2023-11-29 04:17:20,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-11-29 04:17:20,728 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:17:20,728 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:17:20,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 04:17:20,728 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2023-11-29 04:17:20,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:17:20,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1595593589, now seen corresponding path program 1 times [2023-11-29 04:17:20,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:17:20,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162324610] [2023-11-29 04:17:20,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:17:20,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:17:20,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:20,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:17:20,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:20,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 04:17:21,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:21,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 04:17:21,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:21,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 04:17:21,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:21,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 04:17:21,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:21,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-29 04:17:21,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:21,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:17:21,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:21,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 04:17:21,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:21,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 04:17:21,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:21,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 04:17:21,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:21,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 04:17:21,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:21,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 04:17:21,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:21,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 04:17:21,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:21,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 04:17:21,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:21,181 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 04:17:21,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:17:21,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162324610] [2023-11-29 04:17:21,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162324610] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:17:21,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:17:21,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:17:21,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564869973] [2023-11-29 04:17:21,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:17:21,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:17:21,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:17:21,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:17:21,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:17:21,184 INFO L87 Difference]: Start difference. First operand 2125 states and 3115 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-29 04:17:30,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:17:30,240 INFO L93 Difference]: Finished difference Result 2209 states and 3267 transitions. [2023-11-29 04:17:30,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 04:17:30,241 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (15), 5 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 71 [2023-11-29 04:17:30,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:17:30,256 INFO L225 Difference]: With dead ends: 2209 [2023-11-29 04:17:30,257 INFO L226 Difference]: Without dead ends: 2207 [2023-11-29 04:17:30,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-11-29 04:17:30,258 INFO L413 NwaCegarLoop]: 1281 mSDtfsCounter, 4910 mSDsluCounter, 2979 mSDsCounter, 0 mSdLazyCounter, 6139 mSolverCounterSat, 3456 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5208 SdHoareTripleChecker+Valid, 4260 SdHoareTripleChecker+Invalid, 9595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3456 IncrementalHoareTripleChecker+Valid, 6139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2023-11-29 04:17:30,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5208 Valid, 4260 Invalid, 9595 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3456 Valid, 6139 Invalid, 0 Unknown, 0 Unchecked, 8.6s Time] [2023-11-29 04:17:30,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2207 states. [2023-11-29 04:17:30,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2207 to 2123. [2023-11-29 04:17:30,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2123 states, 1362 states have (on average 1.381057268722467) internal successors, (1881), 1441 states have internal predecessors, (1881), 617 states have call successors, (617), 122 states have call predecessors, (617), 121 states have return successors, (615), 583 states have call predecessors, (615), 615 states have call successors, (615) [2023-11-29 04:17:30,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2123 states to 2123 states and 3113 transitions. [2023-11-29 04:17:30,511 INFO L78 Accepts]: Start accepts. Automaton has 2123 states and 3113 transitions. Word has length 71 [2023-11-29 04:17:30,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:17:30,512 INFO L495 AbstractCegarLoop]: Abstraction has 2123 states and 3113 transitions. [2023-11-29 04:17:30,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-29 04:17:30,513 INFO L276 IsEmpty]: Start isEmpty. Operand 2123 states and 3113 transitions. [2023-11-29 04:17:30,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-11-29 04:17:30,514 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:17:30,515 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:17:30,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 04:17:30,515 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2023-11-29 04:17:30,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:17:30,516 INFO L85 PathProgramCache]: Analyzing trace with hash 944554448, now seen corresponding path program 1 times [2023-11-29 04:17:30,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:17:30,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800148412] [2023-11-29 04:17:30,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:17:30,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:17:30,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:30,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:17:30,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:30,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 04:17:30,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:30,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 04:17:30,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:30,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 04:17:30,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:30,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 04:17:30,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:30,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-29 04:17:30,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:30,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:17:30,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:30,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 04:17:30,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:30,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 04:17:30,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:30,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 04:17:30,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:30,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 04:17:30,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:30,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 04:17:30,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:30,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 04:17:30,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:30,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 04:17:30,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:30,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-29 04:17:30,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:30,989 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 04:17:30,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:17:30,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800148412] [2023-11-29 04:17:30,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800148412] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:17:30,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:17:30,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:17:30,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158509030] [2023-11-29 04:17:30,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:17:30,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:17:30,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:17:30,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:17:30,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:17:30,992 INFO L87 Difference]: Start difference. First operand 2123 states and 3113 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-29 04:17:40,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:17:40,127 INFO L93 Difference]: Finished difference Result 2207 states and 3265 transitions. [2023-11-29 04:17:40,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 04:17:40,127 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (16), 5 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 76 [2023-11-29 04:17:40,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:17:40,140 INFO L225 Difference]: With dead ends: 2207 [2023-11-29 04:17:40,141 INFO L226 Difference]: Without dead ends: 2205 [2023-11-29 04:17:40,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-11-29 04:17:40,142 INFO L413 NwaCegarLoop]: 1281 mSDtfsCounter, 4917 mSDsluCounter, 2979 mSDsCounter, 0 mSdLazyCounter, 6125 mSolverCounterSat, 3461 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5214 SdHoareTripleChecker+Valid, 4260 SdHoareTripleChecker+Invalid, 9586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3461 IncrementalHoareTripleChecker+Valid, 6125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2023-11-29 04:17:40,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5214 Valid, 4260 Invalid, 9586 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3461 Valid, 6125 Invalid, 0 Unknown, 0 Unchecked, 8.7s Time] [2023-11-29 04:17:40,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2205 states. [2023-11-29 04:17:40,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2205 to 2121. [2023-11-29 04:17:40,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2121 states, 1361 states have (on average 1.3806024981631153) internal successors, (1879), 1439 states have internal predecessors, (1879), 617 states have call successors, (617), 122 states have call predecessors, (617), 121 states have return successors, (615), 583 states have call predecessors, (615), 615 states have call successors, (615) [2023-11-29 04:17:40,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2121 states to 2121 states and 3111 transitions. [2023-11-29 04:17:40,292 INFO L78 Accepts]: Start accepts. Automaton has 2121 states and 3111 transitions. Word has length 76 [2023-11-29 04:17:40,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:17:40,292 INFO L495 AbstractCegarLoop]: Abstraction has 2121 states and 3111 transitions. [2023-11-29 04:17:40,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-29 04:17:40,293 INFO L276 IsEmpty]: Start isEmpty. Operand 2121 states and 3111 transitions. [2023-11-29 04:17:40,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-11-29 04:17:40,294 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:17:40,294 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:17:40,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 04:17:40,294 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2023-11-29 04:17:40,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:17:40,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1417385007, now seen corresponding path program 1 times [2023-11-29 04:17:40,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:17:40,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857828303] [2023-11-29 04:17:40,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:17:40,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:17:40,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:40,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:17:40,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:40,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 04:17:40,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:40,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 04:17:40,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:40,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 04:17:40,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:40,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 04:17:40,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:40,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-29 04:17:40,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:40,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:17:40,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:40,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 04:17:40,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:40,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 04:17:40,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:40,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 04:17:40,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:40,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 04:17:40,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:40,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 04:17:40,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:40,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 04:17:40,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:40,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 04:17:40,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:40,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-29 04:17:40,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:40,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-29 04:17:40,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:40,701 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 04:17:40,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:17:40,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857828303] [2023-11-29 04:17:40,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857828303] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:17:40,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:17:40,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:17:40,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056272347] [2023-11-29 04:17:40,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:17:40,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:17:40,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:17:40,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:17:40,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:17:40,704 INFO L87 Difference]: Start difference. First operand 2121 states and 3111 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-29 04:17:49,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:17:49,540 INFO L93 Difference]: Finished difference Result 2205 states and 3263 transitions. [2023-11-29 04:17:49,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 04:17:49,541 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (17), 5 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 81 [2023-11-29 04:17:49,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:17:49,553 INFO L225 Difference]: With dead ends: 2205 [2023-11-29 04:17:49,553 INFO L226 Difference]: Without dead ends: 2203 [2023-11-29 04:17:49,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-11-29 04:17:49,554 INFO L413 NwaCegarLoop]: 1281 mSDtfsCounter, 4894 mSDsluCounter, 2979 mSDsCounter, 0 mSdLazyCounter, 6140 mSolverCounterSat, 3442 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5190 SdHoareTripleChecker+Valid, 4260 SdHoareTripleChecker+Invalid, 9582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3442 IncrementalHoareTripleChecker+Valid, 6140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2023-11-29 04:17:49,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5190 Valid, 4260 Invalid, 9582 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3442 Valid, 6140 Invalid, 0 Unknown, 0 Unchecked, 8.4s Time] [2023-11-29 04:17:49,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2203 states. [2023-11-29 04:17:49,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2203 to 2119. [2023-11-29 04:17:49,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2119 states, 1360 states have (on average 1.3801470588235294) internal successors, (1877), 1437 states have internal predecessors, (1877), 617 states have call successors, (617), 122 states have call predecessors, (617), 121 states have return successors, (615), 583 states have call predecessors, (615), 615 states have call successors, (615) [2023-11-29 04:17:49,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2119 states to 2119 states and 3109 transitions. [2023-11-29 04:17:49,710 INFO L78 Accepts]: Start accepts. Automaton has 2119 states and 3109 transitions. Word has length 81 [2023-11-29 04:17:49,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:17:49,711 INFO L495 AbstractCegarLoop]: Abstraction has 2119 states and 3109 transitions. [2023-11-29 04:17:49,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-29 04:17:49,711 INFO L276 IsEmpty]: Start isEmpty. Operand 2119 states and 3109 transitions. [2023-11-29 04:17:49,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-11-29 04:17:49,712 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:17:49,712 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:17:49,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 04:17:49,713 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2023-11-29 04:17:49,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:17:49,713 INFO L85 PathProgramCache]: Analyzing trace with hash 602518610, now seen corresponding path program 1 times [2023-11-29 04:17:49,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:17:49,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083157211] [2023-11-29 04:17:49,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:17:49,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:17:49,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:49,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:17:49,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:49,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 04:17:49,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:49,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 04:17:49,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:49,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 04:17:49,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:50,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 04:17:50,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:50,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-29 04:17:50,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:50,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:17:50,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:50,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 04:17:50,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:50,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 04:17:50,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:50,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 04:17:50,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:50,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 04:17:50,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:50,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 04:17:50,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:50,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 04:17:50,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:50,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 04:17:50,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:50,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-29 04:17:50,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:50,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-29 04:17:50,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:50,120 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 04:17:50,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:17:50,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083157211] [2023-11-29 04:17:50,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083157211] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:17:50,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:17:50,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:17:50,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423295772] [2023-11-29 04:17:50,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:17:50,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:17:50,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:17:50,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:17:50,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:17:50,122 INFO L87 Difference]: Start difference. First operand 2119 states and 3109 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-29 04:17:58,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:17:58,657 INFO L93 Difference]: Finished difference Result 2203 states and 3261 transitions. [2023-11-29 04:17:58,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 04:17:58,658 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (17), 5 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 [2023-11-29 04:17:58,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:17:58,672 INFO L225 Difference]: With dead ends: 2203 [2023-11-29 04:17:58,672 INFO L226 Difference]: Without dead ends: 2201 [2023-11-29 04:17:58,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-11-29 04:17:58,674 INFO L413 NwaCegarLoop]: 1281 mSDtfsCounter, 4869 mSDsluCounter, 2979 mSDsCounter, 0 mSdLazyCounter, 6156 mSolverCounterSat, 3430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5165 SdHoareTripleChecker+Valid, 4260 SdHoareTripleChecker+Invalid, 9586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3430 IncrementalHoareTripleChecker+Valid, 6156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:17:58,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5165 Valid, 4260 Invalid, 9586 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3430 Valid, 6156 Invalid, 0 Unknown, 0 Unchecked, 8.1s Time] [2023-11-29 04:17:58,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2201 states. [2023-11-29 04:17:58,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2201 to 2117. [2023-11-29 04:17:58,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2117 states, 1359 states have (on average 1.379690949227373) internal successors, (1875), 1435 states have internal predecessors, (1875), 617 states have call successors, (617), 122 states have call predecessors, (617), 121 states have return successors, (615), 583 states have call predecessors, (615), 615 states have call successors, (615) [2023-11-29 04:17:58,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2117 states to 2117 states and 3107 transitions. [2023-11-29 04:17:58,839 INFO L78 Accepts]: Start accepts. Automaton has 2117 states and 3107 transitions. Word has length 83 [2023-11-29 04:17:58,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:17:58,839 INFO L495 AbstractCegarLoop]: Abstraction has 2117 states and 3107 transitions. [2023-11-29 04:17:58,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-29 04:17:58,840 INFO L276 IsEmpty]: Start isEmpty. Operand 2117 states and 3107 transitions. [2023-11-29 04:17:58,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-11-29 04:17:58,841 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:17:58,841 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:17:58,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 04:17:58,841 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_linux_kernel_module_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2023-11-29 04:17:58,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:17:58,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1578179457, now seen corresponding path program 1 times [2023-11-29 04:17:58,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:17:58,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176645417] [2023-11-29 04:17:58,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:17:58,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:17:58,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:59,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:17:59,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:59,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 04:17:59,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:59,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 04:17:59,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:59,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 04:17:59,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:59,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 04:17:59,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:59,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-29 04:17:59,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:59,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:17:59,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:59,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 04:17:59,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:59,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 04:17:59,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:59,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 04:17:59,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:59,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 04:17:59,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:59,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 04:17:59,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:59,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 04:17:59,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:59,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 04:17:59,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:59,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-29 04:17:59,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:59,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-29 04:17:59,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:59,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 04:17:59,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:59,181 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 04:17:59,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:17:59,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176645417] [2023-11-29 04:17:59,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176645417] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:17:59,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:17:59,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:17:59,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469258377] [2023-11-29 04:17:59,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:17:59,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:17:59,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:17:59,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:17:59,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:17:59,183 INFO L87 Difference]: Start difference. First operand 2117 states and 3107 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (18), 5 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-29 04:18:08,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:18:08,190 INFO L93 Difference]: Finished difference Result 2201 states and 3259 transitions. [2023-11-29 04:18:08,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 04:18:08,190 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (18), 5 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 [2023-11-29 04:18:08,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:18:08,202 INFO L225 Difference]: With dead ends: 2201 [2023-11-29 04:18:08,202 INFO L226 Difference]: Without dead ends: 2199 [2023-11-29 04:18:08,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-11-29 04:18:08,204 INFO L413 NwaCegarLoop]: 1281 mSDtfsCounter, 4878 mSDsluCounter, 2979 mSDsCounter, 0 mSdLazyCounter, 6131 mSolverCounterSat, 3442 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5173 SdHoareTripleChecker+Valid, 4260 SdHoareTripleChecker+Invalid, 9573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3442 IncrementalHoareTripleChecker+Valid, 6131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2023-11-29 04:18:08,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5173 Valid, 4260 Invalid, 9573 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3442 Valid, 6131 Invalid, 0 Unknown, 0 Unchecked, 8.5s Time] [2023-11-29 04:18:08,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2199 states. [2023-11-29 04:18:08,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2199 to 2115. [2023-11-29 04:18:08,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2115 states, 1358 states have (on average 1.3792341678939617) internal successors, (1873), 1433 states have internal predecessors, (1873), 617 states have call successors, (617), 122 states have call predecessors, (617), 121 states have return successors, (615), 583 states have call predecessors, (615), 615 states have call successors, (615) [2023-11-29 04:18:08,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2115 states to 2115 states and 3105 transitions. [2023-11-29 04:18:08,446 INFO L78 Accepts]: Start accepts. Automaton has 2115 states and 3105 transitions. Word has length 88 [2023-11-29 04:18:08,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:18:08,447 INFO L495 AbstractCegarLoop]: Abstraction has 2115 states and 3105 transitions. [2023-11-29 04:18:08,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (18), 5 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-29 04:18:08,447 INFO L276 IsEmpty]: Start isEmpty. Operand 2115 states and 3105 transitions. [2023-11-29 04:18:08,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-11-29 04:18:08,449 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:18:08,449 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:18:08,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 04:18:08,449 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2023-11-29 04:18:08,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:18:08,450 INFO L85 PathProgramCache]: Analyzing trace with hash 807373949, now seen corresponding path program 1 times [2023-11-29 04:18:08,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:18:08,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873991094] [2023-11-29 04:18:08,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:18:08,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:18:08,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:08,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:18:08,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:08,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 04:18:08,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:08,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 04:18:08,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:08,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 04:18:08,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:08,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 04:18:08,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:08,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:18:08,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:08,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 04:18:08,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:08,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 04:18:08,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:08,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-29 04:18:08,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:08,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:18:08,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:08,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:18:08,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:08,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 04:18:08,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:08,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 04:18:08,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:08,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:18:08,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:08,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:18:08,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:08,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 04:18:08,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:08,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 04:18:08,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:08,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 04:18:08,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:08,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 04:18:08,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:08,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 04:18:08,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:09,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:18:09,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:09,037 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-29 04:18:09,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:18:09,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873991094] [2023-11-29 04:18:09,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873991094] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:18:09,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:18:09,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 04:18:09,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037749617] [2023-11-29 04:18:09,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:18:09,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 04:18:09,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:18:09,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 04:18:09,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-29 04:18:09,040 INFO L87 Difference]: Start difference. First operand 2115 states and 3105 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (18), 6 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-29 04:18:21,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:18:21,939 INFO L93 Difference]: Finished difference Result 4507 states and 6656 transitions. [2023-11-29 04:18:21,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 04:18:21,940 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (18), 6 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) Word has length 98 [2023-11-29 04:18:21,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:18:21,949 INFO L225 Difference]: With dead ends: 4507 [2023-11-29 04:18:21,949 INFO L226 Difference]: Without dead ends: 2417 [2023-11-29 04:18:21,956 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2023-11-29 04:18:21,957 INFO L413 NwaCegarLoop]: 1292 mSDtfsCounter, 6586 mSDsluCounter, 3360 mSDsCounter, 0 mSdLazyCounter, 8011 mSolverCounterSat, 5327 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6889 SdHoareTripleChecker+Valid, 4652 SdHoareTripleChecker+Invalid, 13338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 5327 IncrementalHoareTripleChecker+Valid, 8011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.9s IncrementalHoareTripleChecker+Time [2023-11-29 04:18:21,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6889 Valid, 4652 Invalid, 13338 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [5327 Valid, 8011 Invalid, 0 Unknown, 0 Unchecked, 11.9s Time] [2023-11-29 04:18:21,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2417 states. [2023-11-29 04:18:22,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2417 to 2205. [2023-11-29 04:18:22,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2205 states, 1424 states have (on average 1.3679775280898876) internal successors, (1948), 1499 states have internal predecessors, (1948), 618 states have call successors, (618), 145 states have call predecessors, (618), 144 states have return successors, (616), 584 states have call predecessors, (616), 616 states have call successors, (616) [2023-11-29 04:18:22,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2205 states to 2205 states and 3182 transitions. [2023-11-29 04:18:22,194 INFO L78 Accepts]: Start accepts. Automaton has 2205 states and 3182 transitions. Word has length 98 [2023-11-29 04:18:22,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:18:22,195 INFO L495 AbstractCegarLoop]: Abstraction has 2205 states and 3182 transitions. [2023-11-29 04:18:22,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (18), 6 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-29 04:18:22,196 INFO L276 IsEmpty]: Start isEmpty. Operand 2205 states and 3182 transitions. [2023-11-29 04:18:22,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-11-29 04:18:22,198 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:18:22,198 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:18:22,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 04:18:22,198 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2023-11-29 04:18:22,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:18:22,199 INFO L85 PathProgramCache]: Analyzing trace with hash 59597538, now seen corresponding path program 1 times [2023-11-29 04:18:22,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:18:22,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550546039] [2023-11-29 04:18:22,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:18:22,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:18:22,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:22,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:18:22,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:22,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 04:18:22,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:22,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 04:18:22,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:22,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 04:18:22,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:22,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 04:18:22,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:22,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-29 04:18:22,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:22,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:18:22,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:22,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 04:18:22,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:22,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 04:18:22,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:22,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 04:18:22,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:22,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 04:18:22,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:22,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 04:18:22,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:22,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 04:18:22,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:22,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 04:18:22,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:22,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-29 04:18:22,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:22,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-29 04:18:22,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:22,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 04:18:22,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:22,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 04:18:22,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:22,678 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 04:18:22,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:18:22,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550546039] [2023-11-29 04:18:22,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550546039] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:18:22,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:18:22,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:18:22,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203362836] [2023-11-29 04:18:22,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:18:22,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:18:22,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:18:22,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:18:22,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:18:22,681 INFO L87 Difference]: Start difference. First operand 2205 states and 3182 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-29 04:18:31,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:18:31,620 INFO L93 Difference]: Finished difference Result 2289 states and 3334 transitions. [2023-11-29 04:18:31,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 04:18:31,621 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (19), 5 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 93 [2023-11-29 04:18:31,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:18:31,628 INFO L225 Difference]: With dead ends: 2289 [2023-11-29 04:18:31,628 INFO L226 Difference]: Without dead ends: 2287 [2023-11-29 04:18:31,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-11-29 04:18:31,630 INFO L413 NwaCegarLoop]: 1293 mSDtfsCounter, 4879 mSDsluCounter, 2979 mSDsCounter, 0 mSdLazyCounter, 6151 mSolverCounterSat, 3467 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5161 SdHoareTripleChecker+Valid, 4272 SdHoareTripleChecker+Invalid, 9618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3467 IncrementalHoareTripleChecker+Valid, 6151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2023-11-29 04:18:31,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5161 Valid, 4272 Invalid, 9618 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3467 Valid, 6151 Invalid, 0 Unknown, 0 Unchecked, 8.4s Time] [2023-11-29 04:18:31,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2287 states. [2023-11-29 04:18:31,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2287 to 2203. [2023-11-29 04:18:31,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2203 states, 1423 states have (on average 1.3668306394940266) internal successors, (1945), 1497 states have internal predecessors, (1945), 618 states have call successors, (618), 145 states have call predecessors, (618), 144 states have return successors, (616), 584 states have call predecessors, (616), 616 states have call successors, (616) [2023-11-29 04:18:31,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2203 states to 2203 states and 3179 transitions. [2023-11-29 04:18:31,893 INFO L78 Accepts]: Start accepts. Automaton has 2203 states and 3179 transitions. Word has length 93 [2023-11-29 04:18:31,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:18:31,893 INFO L495 AbstractCegarLoop]: Abstraction has 2203 states and 3179 transitions. [2023-11-29 04:18:31,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-29 04:18:31,894 INFO L276 IsEmpty]: Start isEmpty. Operand 2203 states and 3179 transitions. [2023-11-29 04:18:31,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-29 04:18:31,895 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:18:31,895 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:18:31,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 04:18:31,895 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2023-11-29 04:18:31,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:18:31,896 INFO L85 PathProgramCache]: Analyzing trace with hash 496440439, now seen corresponding path program 1 times [2023-11-29 04:18:31,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:18:31,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103348339] [2023-11-29 04:18:31,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:18:31,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:18:31,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:32,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:18:32,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:32,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 04:18:32,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:32,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 04:18:32,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:32,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 04:18:32,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:32,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 04:18:32,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:32,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:18:32,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:32,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 04:18:32,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:32,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 04:18:32,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:32,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-29 04:18:32,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:32,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:18:32,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:32,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:18:32,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:32,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 04:18:32,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:32,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 04:18:32,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:32,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:18:32,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:32,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:18:32,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:32,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 04:18:32,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:32,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 04:18:32,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:32,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 04:18:32,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:32,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 04:18:32,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:32,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 04:18:32,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:32,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:18:32,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:32,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:18:32,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:32,360 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-29 04:18:32,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:18:32,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103348339] [2023-11-29 04:18:32,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103348339] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:18:32,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:18:32,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 04:18:32,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425673461] [2023-11-29 04:18:32,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:18:32,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 04:18:32,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:18:32,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 04:18:32,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:18:32,364 INFO L87 Difference]: Start difference. First operand 2203 states and 3179 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (19), 6 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-29 04:18:43,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:18:43,454 INFO L93 Difference]: Finished difference Result 4565 states and 6685 transitions. [2023-11-29 04:18:43,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 04:18:43,454 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (19), 6 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 103 [2023-11-29 04:18:43,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:18:43,463 INFO L225 Difference]: With dead ends: 4565 [2023-11-29 04:18:43,463 INFO L226 Difference]: Without dead ends: 2387 [2023-11-29 04:18:43,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2023-11-29 04:18:43,469 INFO L413 NwaCegarLoop]: 991 mSDtfsCounter, 6050 mSDsluCounter, 2628 mSDsCounter, 0 mSdLazyCounter, 5662 mSolverCounterSat, 5313 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6359 SdHoareTripleChecker+Valid, 3619 SdHoareTripleChecker+Invalid, 10975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 5313 IncrementalHoareTripleChecker+Valid, 5662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2023-11-29 04:18:43,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6359 Valid, 3619 Invalid, 10975 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [5313 Valid, 5662 Invalid, 0 Unknown, 0 Unchecked, 10.3s Time] [2023-11-29 04:18:43,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2387 states. [2023-11-29 04:18:43,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2387 to 2199. [2023-11-29 04:18:43,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2199 states, 1420 states have (on average 1.3661971830985915) internal successors, (1940), 1493 states have internal predecessors, (1940), 618 states have call successors, (618), 145 states have call predecessors, (618), 144 states have return successors, (616), 584 states have call predecessors, (616), 616 states have call successors, (616) [2023-11-29 04:18:43,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2199 states to 2199 states and 3174 transitions. [2023-11-29 04:18:43,752 INFO L78 Accepts]: Start accepts. Automaton has 2199 states and 3174 transitions. Word has length 103 [2023-11-29 04:18:43,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:18:43,752 INFO L495 AbstractCegarLoop]: Abstraction has 2199 states and 3174 transitions. [2023-11-29 04:18:43,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (19), 6 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-29 04:18:43,753 INFO L276 IsEmpty]: Start isEmpty. Operand 2199 states and 3174 transitions. [2023-11-29 04:18:43,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-11-29 04:18:43,754 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:18:43,754 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:18:43,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 04:18:43,755 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2023-11-29 04:18:43,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:18:43,755 INFO L85 PathProgramCache]: Analyzing trace with hash -95082442, now seen corresponding path program 1 times [2023-11-29 04:18:43,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:18:43,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207436498] [2023-11-29 04:18:43,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:18:43,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:18:43,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:44,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:18:44,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:44,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 04:18:44,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:44,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 04:18:44,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:44,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 04:18:44,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:44,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 04:18:44,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:44,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-29 04:18:44,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:44,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:18:44,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:44,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 04:18:44,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:44,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 04:18:44,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:44,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 04:18:44,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:44,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 04:18:44,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:44,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 04:18:44,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:44,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 04:18:44,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:44,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 04:18:44,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:44,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-29 04:18:44,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:44,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-29 04:18:44,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:44,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 04:18:44,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:44,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 04:18:44,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:44,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 04:18:44,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:44,215 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 04:18:44,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:18:44,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207436498] [2023-11-29 04:18:44,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207436498] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:18:44,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:18:44,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:18:44,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798046903] [2023-11-29 04:18:44,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:18:44,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:18:44,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:18:44,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:18:44,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:18:44,218 INFO L87 Difference]: Start difference. First operand 2199 states and 3174 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-29 04:18:54,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:18:54,001 INFO L93 Difference]: Finished difference Result 2283 states and 3326 transitions. [2023-11-29 04:18:54,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 04:18:54,002 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (20), 5 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 98 [2023-11-29 04:18:54,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:18:54,008 INFO L225 Difference]: With dead ends: 2283 [2023-11-29 04:18:54,008 INFO L226 Difference]: Without dead ends: 2281 [2023-11-29 04:18:54,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-11-29 04:18:54,009 INFO L413 NwaCegarLoop]: 1288 mSDtfsCounter, 4866 mSDsluCounter, 2960 mSDsCounter, 0 mSdLazyCounter, 6145 mSolverCounterSat, 3467 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5147 SdHoareTripleChecker+Valid, 4248 SdHoareTripleChecker+Invalid, 9612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3467 IncrementalHoareTripleChecker+Valid, 6145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:18:54,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5147 Valid, 4248 Invalid, 9612 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3467 Valid, 6145 Invalid, 0 Unknown, 0 Unchecked, 9.2s Time] [2023-11-29 04:18:54,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2281 states. [2023-11-29 04:18:54,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2281 to 2197. [2023-11-29 04:18:54,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2197 states, 1419 states have (on average 1.365045806906272) internal successors, (1937), 1491 states have internal predecessors, (1937), 618 states have call successors, (618), 145 states have call predecessors, (618), 144 states have return successors, (616), 584 states have call predecessors, (616), 616 states have call successors, (616) [2023-11-29 04:18:54,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2197 states to 2197 states and 3171 transitions. [2023-11-29 04:18:54,258 INFO L78 Accepts]: Start accepts. Automaton has 2197 states and 3171 transitions. Word has length 98 [2023-11-29 04:18:54,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:18:54,259 INFO L495 AbstractCegarLoop]: Abstraction has 2197 states and 3171 transitions. [2023-11-29 04:18:54,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-29 04:18:54,259 INFO L276 IsEmpty]: Start isEmpty. Operand 2197 states and 3171 transitions. [2023-11-29 04:18:54,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-29 04:18:54,261 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:18:54,261 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:18:54,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 04:18:54,261 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2023-11-29 04:18:54,261 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:18:54,262 INFO L85 PathProgramCache]: Analyzing trace with hash -615329387, now seen corresponding path program 1 times [2023-11-29 04:18:54,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:18:54,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982399063] [2023-11-29 04:18:54,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:18:54,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:18:54,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:54,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:18:54,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:54,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 04:18:54,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:54,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 04:18:54,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:54,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 04:18:54,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:54,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 04:18:54,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:54,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:18:54,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:54,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 04:18:54,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:54,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 04:18:54,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:54,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-29 04:18:54,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:54,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:18:54,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:54,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:18:54,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:54,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 04:18:54,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:54,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 04:18:54,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:54,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:18:54,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:54,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:18:54,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:54,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 04:18:54,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:54,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 04:18:54,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:54,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 04:18:54,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:54,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 04:18:54,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:54,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 04:18:54,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:54,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:18:54,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:54,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:18:54,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:54,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 04:18:54,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:54,776 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2023-11-29 04:18:54,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:18:54,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982399063] [2023-11-29 04:18:54,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982399063] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:18:54,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886983026] [2023-11-29 04:18:54,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:18:54,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:18:54,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:18:54,781 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:18:54,784 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 04:18:55,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:55,615 INFO L262 TraceCheckSpWp]: Trace formula consists of 2020 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 04:18:55,628 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:18:55,684 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-29 04:18:55,684 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:18:55,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [886983026] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:18:55,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 04:18:55,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2023-11-29 04:18:55,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304936772] [2023-11-29 04:18:55,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:18:55,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:18:55,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:18:55,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:18:55,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2023-11-29 04:18:55,686 INFO L87 Difference]: Start difference. First operand 2197 states and 3171 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 04:18:56,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:18:56,399 INFO L93 Difference]: Finished difference Result 4365 states and 6299 transitions. [2023-11-29 04:18:56,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:18:56,399 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 108 [2023-11-29 04:18:56,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:18:56,406 INFO L225 Difference]: With dead ends: 4365 [2023-11-29 04:18:56,406 INFO L226 Difference]: Without dead ends: 2193 [2023-11-29 04:18:56,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2023-11-29 04:18:56,412 INFO L413 NwaCegarLoop]: 2855 mSDtfsCounter, 3059 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3059 SdHoareTripleChecker+Valid, 2855 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 04:18:56,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3059 Valid, 2855 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 04:18:56,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2193 states. [2023-11-29 04:18:56,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2193 to 2193. [2023-11-29 04:18:56,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2193 states, 1416 states have (on average 1.3644067796610169) internal successors, (1932), 1487 states have internal predecessors, (1932), 618 states have call successors, (618), 145 states have call predecessors, (618), 144 states have return successors, (616), 584 states have call predecessors, (616), 616 states have call successors, (616) [2023-11-29 04:18:56,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2193 states to 2193 states and 3166 transitions. [2023-11-29 04:18:56,661 INFO L78 Accepts]: Start accepts. Automaton has 2193 states and 3166 transitions. Word has length 108 [2023-11-29 04:18:56,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:18:56,661 INFO L495 AbstractCegarLoop]: Abstraction has 2193 states and 3166 transitions. [2023-11-29 04:18:56,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 04:18:56,662 INFO L276 IsEmpty]: Start isEmpty. Operand 2193 states and 3166 transitions. [2023-11-29 04:18:56,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-29 04:18:56,663 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:18:56,663 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:18:56,677 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 04:18:56,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21d37ea8-9d8b-4189-833b-82f6761157e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-29 04:18:56,864 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2023-11-29 04:18:56,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:18:56,864 INFO L85 PathProgramCache]: Analyzing trace with hash 301861936, now seen corresponding path program 1 times [2023-11-29 04:18:56,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:18:56,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18568650] [2023-11-29 04:18:56,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:18:56,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:18:56,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:57,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:18:57,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:57,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 04:18:57,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:57,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 04:18:57,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:57,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 04:18:57,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:57,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 04:18:57,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:57,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-29 04:18:57,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:57,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:18:57,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:57,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 04:18:57,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:57,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 04:18:57,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:57,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 04:18:57,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:57,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 04:18:57,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:57,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 04:18:57,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:57,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 04:18:57,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:57,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 04:18:57,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:57,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-29 04:18:57,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:57,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-29 04:18:57,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:57,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 04:18:57,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:57,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 04:18:57,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:57,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 04:18:57,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:57,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-29 04:18:57,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:57,339 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 04:18:57,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:18:57,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18568650] [2023-11-29 04:18:57,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18568650] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:18:57,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:18:57,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:18:57,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087176629] [2023-11-29 04:18:57,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:18:57,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:18:57,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:18:57,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:18:57,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:18:57,342 INFO L87 Difference]: Start difference. First operand 2193 states and 3166 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 04:19:06,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:19:06,337 INFO L93 Difference]: Finished difference Result 2277 states and 3318 transitions. [2023-11-29 04:19:06,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 04:19:06,338 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (21), 5 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 103 [2023-11-29 04:19:06,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:19:06,344 INFO L225 Difference]: With dead ends: 2277 [2023-11-29 04:19:06,344 INFO L226 Difference]: Without dead ends: 2275 [2023-11-29 04:19:06,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-11-29 04:19:06,346 INFO L413 NwaCegarLoop]: 1283 mSDtfsCounter, 4853 mSDsluCounter, 2941 mSDsCounter, 0 mSdLazyCounter, 6146 mSolverCounterSat, 3461 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5133 SdHoareTripleChecker+Valid, 4224 SdHoareTripleChecker+Invalid, 9607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3461 IncrementalHoareTripleChecker+Valid, 6146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2023-11-29 04:19:06,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5133 Valid, 4224 Invalid, 9607 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3461 Valid, 6146 Invalid, 0 Unknown, 0 Unchecked, 8.3s Time] [2023-11-29 04:19:06,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2275 states. [2023-11-29 04:19:06,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2275 to 2191. [2023-11-29 04:19:06,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2191 states, 1415 states have (on average 1.363250883392226) internal successors, (1929), 1485 states have internal predecessors, (1929), 618 states have call successors, (618), 145 states have call predecessors, (618), 144 states have return successors, (616), 584 states have call predecessors, (616), 616 states have call successors, (616) [2023-11-29 04:19:06,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2191 states to 2191 states and 3163 transitions. [2023-11-29 04:19:06,664 INFO L78 Accepts]: Start accepts. Automaton has 2191 states and 3163 transitions. Word has length 103 [2023-11-29 04:19:06,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:19:06,664 INFO L495 AbstractCegarLoop]: Abstraction has 2191 states and 3163 transitions. [2023-11-29 04:19:06,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 04:19:06,665 INFO L276 IsEmpty]: Start isEmpty. Operand 2191 states and 3163 transitions. [2023-11-29 04:19:06,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-29 04:19:06,666 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:19:06,666 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:19:06,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 04:19:06,666 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_linux_kernel_rcu_srcu_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2023-11-29 04:19:06,667 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:19:06,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1828375679, now seen corresponding path program 1 times [2023-11-29 04:19:06,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:19:06,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415255613] [2023-11-29 04:19:06,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:19:06,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:19:06,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:06,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:19:06,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:06,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 04:19:06,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:06,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 04:19:06,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:06,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 04:19:06,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:06,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 04:19:06,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:06,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-29 04:19:06,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:06,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:19:06,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:06,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 04:19:06,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:06,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 04:19:06,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:06,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 04:19:06,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:06,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 04:19:06,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:06,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 04:19:06,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:06,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 04:19:06,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:06,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 04:19:06,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:06,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-29 04:19:06,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:06,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-29 04:19:06,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:06,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 04:19:06,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:06,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 04:19:06,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:07,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 04:19:07,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:07,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-29 04:19:07,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:07,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-29 04:19:07,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:07,046 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 04:19:07,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:19:07,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415255613] [2023-11-29 04:19:07,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415255613] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:19:07,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:19:07,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:19:07,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351288982] [2023-11-29 04:19:07,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:19:07,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:19:07,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:19:07,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:19:07,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:19:07,049 INFO L87 Difference]: Start difference. First operand 2191 states and 3163 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (22), 5 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-29 04:19:15,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:19:15,888 INFO L93 Difference]: Finished difference Result 2275 states and 3315 transitions. [2023-11-29 04:19:15,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 04:19:15,888 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (22), 5 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 108 [2023-11-29 04:19:15,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:19:15,894 INFO L225 Difference]: With dead ends: 2275 [2023-11-29 04:19:15,894 INFO L226 Difference]: Without dead ends: 2273 [2023-11-29 04:19:15,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-11-29 04:19:15,895 INFO L413 NwaCegarLoop]: 1283 mSDtfsCounter, 4851 mSDsluCounter, 2941 mSDsCounter, 0 mSdLazyCounter, 6131 mSolverCounterSat, 3471 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5130 SdHoareTripleChecker+Valid, 4224 SdHoareTripleChecker+Invalid, 9602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3471 IncrementalHoareTripleChecker+Valid, 6131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:19:15,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5130 Valid, 4224 Invalid, 9602 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3471 Valid, 6131 Invalid, 0 Unknown, 0 Unchecked, 8.2s Time] [2023-11-29 04:19:15,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2273 states. [2023-11-29 04:19:16,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2273 to 2189. [2023-11-29 04:19:16,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2189 states, 1414 states have (on average 1.3620933521923622) internal successors, (1926), 1483 states have internal predecessors, (1926), 618 states have call successors, (618), 145 states have call predecessors, (618), 144 states have return successors, (616), 584 states have call predecessors, (616), 616 states have call successors, (616) [2023-11-29 04:19:16,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2189 states to 2189 states and 3160 transitions. [2023-11-29 04:19:16,184 INFO L78 Accepts]: Start accepts. Automaton has 2189 states and 3160 transitions. Word has length 108 [2023-11-29 04:19:16,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:19:16,184 INFO L495 AbstractCegarLoop]: Abstraction has 2189 states and 3160 transitions. [2023-11-29 04:19:16,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (22), 5 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-29 04:19:16,185 INFO L276 IsEmpty]: Start isEmpty. Operand 2189 states and 3160 transitions. [2023-11-29 04:19:16,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-11-29 04:19:16,186 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:19:16,186 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:19:16,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 04:19:16,186 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2023-11-29 04:19:16,187 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:19:16,187 INFO L85 PathProgramCache]: Analyzing trace with hash -655914780, now seen corresponding path program 1 times [2023-11-29 04:19:16,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:19:16,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36685128] [2023-11-29 04:19:16,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:19:16,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:19:16,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:16,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:19:16,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:16,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 04:19:16,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:16,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 04:19:16,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:16,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 04:19:16,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:16,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 04:19:16,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:16,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-29 04:19:16,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:16,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:19:16,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:16,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 04:19:16,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:16,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 04:19:16,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:16,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 04:19:16,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:16,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 04:19:16,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:16,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:19:16,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:16,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:19:16,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:16,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 04:19:16,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:16,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 04:19:16,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:16,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:19:16,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:16,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:19:16,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:16,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 04:19:16,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:16,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 04:19:16,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:16,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:19:16,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:16,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:19:16,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:16,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 04:19:16,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:16,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-29 04:19:16,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:16,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:19:16,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:16,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:19:16,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:16,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 04:19:16,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:16,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-11-29 04:19:16,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:16,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-29 04:19:16,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:17,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-29 04:19:17,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:17,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-11-29 04:19:17,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:17,028 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2023-11-29 04:19:17,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:19:17,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36685128] [2023-11-29 04:19:17,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36685128] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:19:17,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:19:17,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 04:19:17,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822492628] [2023-11-29 04:19:17,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:19:17,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 04:19:17,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:19:17,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 04:19:17,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-29 04:19:17,031 INFO L87 Difference]: Start difference. First operand 2189 states and 3160 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (24), 7 states have call predecessors, (24), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-29 04:19:31,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:19:31,206 INFO L93 Difference]: Finished difference Result 2919 states and 4400 transitions. [2023-11-29 04:19:31,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 04:19:31,207 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (24), 7 states have call predecessors, (24), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 142 [2023-11-29 04:19:31,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:19:31,219 INFO L225 Difference]: With dead ends: 2919 [2023-11-29 04:19:31,219 INFO L226 Difference]: Without dead ends: 2917 [2023-11-29 04:19:31,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2023-11-29 04:19:31,221 INFO L413 NwaCegarLoop]: 1283 mSDtfsCounter, 6105 mSDsluCounter, 4791 mSDsCounter, 0 mSdLazyCounter, 11071 mSolverCounterSat, 5651 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6344 SdHoareTripleChecker+Valid, 6074 SdHoareTripleChecker+Invalid, 16722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 5651 IncrementalHoareTripleChecker+Valid, 11071 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:19:31,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6344 Valid, 6074 Invalid, 16722 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [5651 Valid, 11071 Invalid, 0 Unknown, 0 Unchecked, 13.1s Time] [2023-11-29 04:19:31,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2917 states. [2023-11-29 04:19:31,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2917 to 2637. [2023-11-29 04:19:31,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2637 states, 1663 states have (on average 1.3475646422128682) internal successors, (2241), 1770 states have internal predecessors, (2241), 752 states have call successors, (752), 207 states have call predecessors, (752), 209 states have return successors, (808), 691 states have call predecessors, (808), 750 states have call successors, (808) [2023-11-29 04:19:31,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2637 states to 2637 states and 3801 transitions. [2023-11-29 04:19:31,641 INFO L78 Accepts]: Start accepts. Automaton has 2637 states and 3801 transitions. Word has length 142 [2023-11-29 04:19:31,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:19:31,641 INFO L495 AbstractCegarLoop]: Abstraction has 2637 states and 3801 transitions. [2023-11-29 04:19:31,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (24), 7 states have call predecessors, (24), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-29 04:19:31,641 INFO L276 IsEmpty]: Start isEmpty. Operand 2637 states and 3801 transitions. [2023-11-29 04:19:31,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-29 04:19:31,643 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:19:31,644 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:19:31,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 04:19:31,644 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_linux_lib_idr_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2023-11-29 04:19:31,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:19:31,644 INFO L85 PathProgramCache]: Analyzing trace with hash -618984718, now seen corresponding path program 1 times [2023-11-29 04:19:31,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:19:31,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731041696] [2023-11-29 04:19:31,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:19:31,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:19:31,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:31,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:19:31,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:31,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 04:19:31,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:31,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 04:19:31,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:32,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 04:19:32,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:32,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 04:19:32,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:32,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-29 04:19:32,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:32,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:19:32,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:32,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 04:19:32,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:32,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 04:19:32,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:32,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 04:19:32,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:32,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 04:19:32,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:32,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 04:19:32,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:32,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 04:19:32,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:32,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 04:19:32,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:32,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-29 04:19:32,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:32,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-29 04:19:32,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:32,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 04:19:32,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:32,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 04:19:32,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:32,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 04:19:32,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:32,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-29 04:19:32,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:32,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-29 04:19:32,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:32,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 04:19:32,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:32,199 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 04:19:32,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:19:32,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731041696] [2023-11-29 04:19:32,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731041696] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:19:32,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:19:32,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:19:32,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395374838] [2023-11-29 04:19:32,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:19:32,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:19:32,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:19:32,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:19:32,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:19:32,202 INFO L87 Difference]: Start difference. First operand 2637 states and 3801 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (23), 5 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2023-11-29 04:19:41,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:19:41,654 INFO L93 Difference]: Finished difference Result 2730 states and 3971 transitions. [2023-11-29 04:19:41,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 04:19:41,655 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (23), 5 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 113 [2023-11-29 04:19:41,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:19:41,661 INFO L225 Difference]: With dead ends: 2730 [2023-11-29 04:19:41,662 INFO L226 Difference]: Without dead ends: 2728 [2023-11-29 04:19:41,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-11-29 04:19:41,663 INFO L413 NwaCegarLoop]: 1281 mSDtfsCounter, 4822 mSDsluCounter, 2941 mSDsCounter, 0 mSdLazyCounter, 6136 mSolverCounterSat, 3461 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5102 SdHoareTripleChecker+Valid, 4222 SdHoareTripleChecker+Invalid, 9597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3461 IncrementalHoareTripleChecker+Valid, 6136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2023-11-29 04:19:41,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5102 Valid, 4222 Invalid, 9597 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3461 Valid, 6136 Invalid, 0 Unknown, 0 Unchecked, 8.6s Time] [2023-11-29 04:19:41,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2728 states. [2023-11-29 04:19:42,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2728 to 2635. [2023-11-29 04:19:42,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2635 states, 1662 states have (on average 1.3465703971119134) internal successors, (2238), 1768 states have internal predecessors, (2238), 752 states have call successors, (752), 207 states have call predecessors, (752), 209 states have return successors, (808), 691 states have call predecessors, (808), 750 states have call successors, (808) [2023-11-29 04:19:42,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2635 states to 2635 states and 3798 transitions. [2023-11-29 04:19:42,111 INFO L78 Accepts]: Start accepts. Automaton has 2635 states and 3798 transitions. Word has length 113 [2023-11-29 04:19:42,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:19:42,111 INFO L495 AbstractCegarLoop]: Abstraction has 2635 states and 3798 transitions. [2023-11-29 04:19:42,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (23), 5 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2023-11-29 04:19:42,111 INFO L276 IsEmpty]: Start isEmpty. Operand 2635 states and 3798 transitions. [2023-11-29 04:19:42,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-29 04:19:42,113 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:19:42,113 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:19:42,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-29 04:19:42,113 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2023-11-29 04:19:42,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:19:42,113 INFO L85 PathProgramCache]: Analyzing trace with hash 568779882, now seen corresponding path program 1 times [2023-11-29 04:19:42,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:19:42,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475504203] [2023-11-29 04:19:42,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:19:42,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:19:42,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:42,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:19:42,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:42,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 04:19:42,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:42,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 04:19:42,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:42,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 04:19:42,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:42,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 04:19:42,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:42,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-29 04:19:42,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:42,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:19:42,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:42,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 04:19:42,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:42,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 04:19:42,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:42,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 04:19:42,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:42,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 04:19:42,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:42,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 04:19:42,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:42,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 04:19:42,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:42,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 04:19:42,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:42,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-29 04:19:42,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:42,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-29 04:19:42,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:42,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 04:19:42,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:42,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 04:19:42,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:42,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 04:19:42,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:42,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-29 04:19:42,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:42,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-29 04:19:42,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:42,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 04:19:42,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:42,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 04:19:42,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:42,557 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 04:19:42,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:19:42,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475504203] [2023-11-29 04:19:42,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475504203] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:19:42,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:19:42,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:19:42,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923458039] [2023-11-29 04:19:42,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:19:42,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:19:42,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:19:42,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:19:42,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:19:42,585 INFO L87 Difference]: Start difference. First operand 2635 states and 3798 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (24), 5 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2023-11-29 04:19:51,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:19:51,823 INFO L93 Difference]: Finished difference Result 2728 states and 3968 transitions. [2023-11-29 04:19:51,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 04:19:51,823 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (24), 5 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 118 [2023-11-29 04:19:51,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:19:51,831 INFO L225 Difference]: With dead ends: 2728 [2023-11-29 04:19:51,831 INFO L226 Difference]: Without dead ends: 2726 [2023-11-29 04:19:51,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-11-29 04:19:51,832 INFO L413 NwaCegarLoop]: 1282 mSDtfsCounter, 4814 mSDsluCounter, 2941 mSDsCounter, 0 mSdLazyCounter, 6139 mSolverCounterSat, 3452 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5092 SdHoareTripleChecker+Valid, 4223 SdHoareTripleChecker+Invalid, 9591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3452 IncrementalHoareTripleChecker+Valid, 6139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2023-11-29 04:19:51,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5092 Valid, 4223 Invalid, 9591 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3452 Valid, 6139 Invalid, 0 Unknown, 0 Unchecked, 8.4s Time] [2023-11-29 04:19:51,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2726 states. [2023-11-29 04:19:52,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2726 to 2633. [2023-11-29 04:19:52,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2633 states, 1661 states have (on average 1.345574954846478) internal successors, (2235), 1766 states have internal predecessors, (2235), 752 states have call successors, (752), 207 states have call predecessors, (752), 209 states have return successors, (808), 691 states have call predecessors, (808), 750 states have call successors, (808) [2023-11-29 04:19:52,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2633 states to 2633 states and 3795 transitions. [2023-11-29 04:19:52,262 INFO L78 Accepts]: Start accepts. Automaton has 2633 states and 3795 transitions. Word has length 118 [2023-11-29 04:19:52,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:19:52,263 INFO L495 AbstractCegarLoop]: Abstraction has 2633 states and 3795 transitions. [2023-11-29 04:19:52,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (24), 5 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2023-11-29 04:19:52,263 INFO L276 IsEmpty]: Start isEmpty. Operand 2633 states and 3795 transitions. [2023-11-29 04:19:52,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-11-29 04:19:52,264 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:19:52,265 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:19:52,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-29 04:19:52,265 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_linux_net_rtnetlink_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2023-11-29 04:19:52,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:19:52,265 INFO L85 PathProgramCache]: Analyzing trace with hash -382028203, now seen corresponding path program 1 times [2023-11-29 04:19:52,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:19:52,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302076239] [2023-11-29 04:19:52,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:19:52,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:19:52,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:52,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:19:52,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:52,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 04:19:52,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:52,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 04:19:52,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:52,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 04:19:52,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:52,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 04:19:52,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:52,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-29 04:19:52,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:52,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:19:52,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:52,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 04:19:52,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:52,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 04:19:52,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:52,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 04:19:52,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:52,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 04:19:52,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:52,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 04:19:52,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:52,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 04:19:52,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:52,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 04:19:52,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:52,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-29 04:19:52,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:52,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-29 04:19:52,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:52,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 04:19:52,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:52,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 04:19:52,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:52,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 04:19:52,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:52,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-29 04:19:52,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:52,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-29 04:19:52,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:52,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 04:19:52,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:52,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 04:19:52,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:52,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-11-29 04:19:52,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:52,742 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 04:19:52,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:19:52,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302076239] [2023-11-29 04:19:52,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302076239] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:19:52,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:19:52,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:19:52,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764421089] [2023-11-29 04:19:52,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:19:52,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:19:52,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:19:52,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:19:52,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:19:52,744 INFO L87 Difference]: Start difference. First operand 2633 states and 3795 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2023-11-29 04:20:01,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:20:01,797 INFO L93 Difference]: Finished difference Result 2726 states and 3965 transitions. [2023-11-29 04:20:01,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 04:20:01,798 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 123 [2023-11-29 04:20:01,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:20:01,809 INFO L225 Difference]: With dead ends: 2726 [2023-11-29 04:20:01,809 INFO L226 Difference]: Without dead ends: 2724 [2023-11-29 04:20:01,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-11-29 04:20:01,811 INFO L413 NwaCegarLoop]: 1282 mSDtfsCounter, 4833 mSDsluCounter, 2941 mSDsCounter, 0 mSdLazyCounter, 6102 mSolverCounterSat, 3478 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5110 SdHoareTripleChecker+Valid, 4223 SdHoareTripleChecker+Invalid, 9580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3478 IncrementalHoareTripleChecker+Valid, 6102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:20:01,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5110 Valid, 4223 Invalid, 9580 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3478 Valid, 6102 Invalid, 0 Unknown, 0 Unchecked, 8.2s Time] [2023-11-29 04:20:01,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2724 states. [2023-11-29 04:20:02,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2724 to 2631. [2023-11-29 04:20:02,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2631 states, 1660 states have (on average 1.344578313253012) internal successors, (2232), 1764 states have internal predecessors, (2232), 752 states have call successors, (752), 207 states have call predecessors, (752), 209 states have return successors, (808), 691 states have call predecessors, (808), 750 states have call successors, (808) [2023-11-29 04:20:02,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2631 states to 2631 states and 3792 transitions. [2023-11-29 04:20:02,380 INFO L78 Accepts]: Start accepts. Automaton has 2631 states and 3792 transitions. Word has length 123 [2023-11-29 04:20:02,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:20:02,380 INFO L495 AbstractCegarLoop]: Abstraction has 2631 states and 3792 transitions. [2023-11-29 04:20:02,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2023-11-29 04:20:02,380 INFO L276 IsEmpty]: Start isEmpty. Operand 2631 states and 3792 transitions. [2023-11-29 04:20:02,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-11-29 04:20:02,383 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:20:02,383 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:20:02,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-29 04:20:02,383 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_linux_net_sock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2023-11-29 04:20:02,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:20:02,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1542879101, now seen corresponding path program 1 times [2023-11-29 04:20:02,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:20:02,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188080750] [2023-11-29 04:20:02,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:20:02,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:20:02,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:02,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:20:02,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:02,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 04:20:02,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:02,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 04:20:02,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:02,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 04:20:02,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:02,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 04:20:02,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:02,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-29 04:20:02,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:02,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:20:02,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:02,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 04:20:02,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:02,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 04:20:02,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:02,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 04:20:02,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:02,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 04:20:02,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:02,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 04:20:02,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:02,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 04:20:02,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:02,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 04:20:02,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:02,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-29 04:20:02,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:02,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-29 04:20:02,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:02,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 04:20:02,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:02,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 04:20:02,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:02,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 04:20:02,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:02,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-29 04:20:02,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:02,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-29 04:20:02,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:02,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 04:20:02,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:02,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 04:20:02,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:02,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-11-29 04:20:02,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:02,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 04:20:02,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:02,743 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 04:20:02,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:20:02,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188080750] [2023-11-29 04:20:02,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188080750] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:20:02,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:20:02,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:20:02,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935262581] [2023-11-29 04:20:02,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:20:02,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:20:02,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:20:02,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:20:02,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:20:02,745 INFO L87 Difference]: Start difference. First operand 2631 states and 3792 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (26), 5 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2023-11-29 04:20:12,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:20:12,197 INFO L93 Difference]: Finished difference Result 2724 states and 3962 transitions. [2023-11-29 04:20:12,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 04:20:12,198 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (26), 5 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 128 [2023-11-29 04:20:12,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:20:12,207 INFO L225 Difference]: With dead ends: 2724 [2023-11-29 04:20:12,207 INFO L226 Difference]: Without dead ends: 2722 [2023-11-29 04:20:12,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-11-29 04:20:12,209 INFO L413 NwaCegarLoop]: 1282 mSDtfsCounter, 4795 mSDsluCounter, 2941 mSDsCounter, 0 mSdLazyCounter, 6136 mSolverCounterSat, 3446 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5071 SdHoareTripleChecker+Valid, 4223 SdHoareTripleChecker+Invalid, 9582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3446 IncrementalHoareTripleChecker+Valid, 6136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2023-11-29 04:20:12,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5071 Valid, 4223 Invalid, 9582 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3446 Valid, 6136 Invalid, 0 Unknown, 0 Unchecked, 8.6s Time] [2023-11-29 04:20:12,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2722 states. [2023-11-29 04:20:12,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2722 to 2629. [2023-11-29 04:20:12,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2629 states, 1659 states have (on average 1.3435804701627487) internal successors, (2229), 1762 states have internal predecessors, (2229), 752 states have call successors, (752), 207 states have call predecessors, (752), 209 states have return successors, (808), 691 states have call predecessors, (808), 750 states have call successors, (808) [2023-11-29 04:20:12,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2629 states to 2629 states and 3789 transitions. [2023-11-29 04:20:12,712 INFO L78 Accepts]: Start accepts. Automaton has 2629 states and 3789 transitions. Word has length 128 [2023-11-29 04:20:12,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:20:12,712 INFO L495 AbstractCegarLoop]: Abstraction has 2629 states and 3789 transitions. [2023-11-29 04:20:12,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (26), 5 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2023-11-29 04:20:12,712 INFO L276 IsEmpty]: Start isEmpty. Operand 2629 states and 3789 transitions. [2023-11-29 04:20:12,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-11-29 04:20:12,715 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:20:12,715 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:20:12,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-29 04:20:12,716 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2023-11-29 04:20:12,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:20:12,716 INFO L85 PathProgramCache]: Analyzing trace with hash -802163449, now seen corresponding path program 1 times [2023-11-29 04:20:12,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:20:12,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191053899] [2023-11-29 04:20:12,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:20:12,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:20:12,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:12,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:20:12,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:12,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 04:20:12,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:12,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 04:20:12,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:12,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 04:20:12,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:13,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 04:20:13,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:13,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-29 04:20:13,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:13,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:20:13,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:13,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 04:20:13,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:13,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 04:20:13,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:13,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 04:20:13,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:13,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 04:20:13,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:13,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 04:20:13,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:13,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 04:20:13,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:13,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 04:20:13,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:13,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-29 04:20:13,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:13,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-29 04:20:13,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:13,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 04:20:13,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:13,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 04:20:13,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:13,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 04:20:13,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:13,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-29 04:20:13,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:13,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-29 04:20:13,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:13,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 04:20:13,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:13,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 04:20:13,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:13,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-11-29 04:20:13,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:13,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 04:20:13,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:13,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-29 04:20:13,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:13,136 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 04:20:13,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:20:13,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191053899] [2023-11-29 04:20:13,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191053899] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:20:13,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:20:13,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:20:13,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015638448] [2023-11-29 04:20:13,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:20:13,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:20:13,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:20:13,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:20:13,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:20:13,138 INFO L87 Difference]: Start difference. First operand 2629 states and 3789 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2023-11-29 04:20:21,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:20:21,989 INFO L93 Difference]: Finished difference Result 2722 states and 3959 transitions. [2023-11-29 04:20:21,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 04:20:21,990 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 133 [2023-11-29 04:20:21,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:20:21,996 INFO L225 Difference]: With dead ends: 2722 [2023-11-29 04:20:21,996 INFO L226 Difference]: Without dead ends: 2720 [2023-11-29 04:20:21,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-11-29 04:20:21,998 INFO L413 NwaCegarLoop]: 1282 mSDtfsCounter, 4787 mSDsluCounter, 2941 mSDsCounter, 0 mSdLazyCounter, 6132 mSolverCounterSat, 3449 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5062 SdHoareTripleChecker+Valid, 4223 SdHoareTripleChecker+Invalid, 9581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3449 IncrementalHoareTripleChecker+Valid, 6132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:20:21,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5062 Valid, 4223 Invalid, 9581 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3449 Valid, 6132 Invalid, 0 Unknown, 0 Unchecked, 8.0s Time] [2023-11-29 04:20:22,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2720 states. [2023-11-29 04:20:22,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2720 to 2627. [2023-11-29 04:20:22,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2627 states, 1658 states have (on average 1.3425814234016888) internal successors, (2226), 1760 states have internal predecessors, (2226), 752 states have call successors, (752), 207 states have call predecessors, (752), 209 states have return successors, (808), 691 states have call predecessors, (808), 750 states have call successors, (808) [2023-11-29 04:20:22,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2627 states to 2627 states and 3786 transitions. [2023-11-29 04:20:22,458 INFO L78 Accepts]: Start accepts. Automaton has 2627 states and 3786 transitions. Word has length 133 [2023-11-29 04:20:22,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:20:22,458 INFO L495 AbstractCegarLoop]: Abstraction has 2627 states and 3786 transitions. [2023-11-29 04:20:22,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2023-11-29 04:20:22,458 INFO L276 IsEmpty]: Start isEmpty. Operand 2627 states and 3786 transitions. [2023-11-29 04:20:22,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-11-29 04:20:22,460 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:20:22,461 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:20:22,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-29 04:20:22,461 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2023-11-29 04:20:22,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:20:22,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1586969354, now seen corresponding path program 1 times [2023-11-29 04:20:22,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:20:22,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662547152] [2023-11-29 04:20:22,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:20:22,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:20:22,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:22,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:20:22,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:22,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 04:20:22,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:22,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 04:20:22,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:22,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 04:20:22,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:22,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 04:20:22,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:22,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-29 04:20:22,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:22,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:20:22,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:22,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 04:20:22,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:22,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 04:20:22,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:22,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 04:20:22,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:22,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 04:20:22,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:22,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 04:20:22,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:22,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 04:20:22,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:22,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 04:20:22,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:22,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-29 04:20:22,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:22,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-29 04:20:22,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:22,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 04:20:22,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:22,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 04:20:22,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:22,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 04:20:22,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:22,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-29 04:20:22,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:22,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-29 04:20:22,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:22,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 04:20:22,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:22,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 04:20:22,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:22,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-11-29 04:20:22,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:22,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 04:20:22,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:22,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-29 04:20:22,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:22,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-11-29 04:20:22,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:22,852 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 04:20:22,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:20:22,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662547152] [2023-11-29 04:20:22,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662547152] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:20:22,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:20:22,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:20:22,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037842112] [2023-11-29 04:20:22,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:20:22,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:20:22,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:20:22,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:20:22,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:20:22,855 INFO L87 Difference]: Start difference. First operand 2627 states and 3786 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (28), 5 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2023-11-29 04:20:33,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 04:20:33,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:20:33,707 INFO L93 Difference]: Finished difference Result 2720 states and 3956 transitions. [2023-11-29 04:20:33,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 04:20:33,707 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (28), 5 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 138 [2023-11-29 04:20:33,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:20:33,714 INFO L225 Difference]: With dead ends: 2720 [2023-11-29 04:20:33,714 INFO L226 Difference]: Without dead ends: 2718 [2023-11-29 04:20:33,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-11-29 04:20:33,715 INFO L413 NwaCegarLoop]: 1281 mSDtfsCounter, 4806 mSDsluCounter, 2941 mSDsCounter, 0 mSdLazyCounter, 6088 mSolverCounterSat, 3478 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5081 SdHoareTripleChecker+Valid, 4222 SdHoareTripleChecker+Invalid, 9566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3478 IncrementalHoareTripleChecker+Valid, 6088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.9s IncrementalHoareTripleChecker+Time [2023-11-29 04:20:33,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5081 Valid, 4222 Invalid, 9566 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3478 Valid, 6088 Invalid, 0 Unknown, 0 Unchecked, 9.9s Time] [2023-11-29 04:20:33,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2718 states. [2023-11-29 04:20:34,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2718 to 2625. [2023-11-29 04:20:34,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2625 states, 1657 states have (on average 1.3415811707905854) internal successors, (2223), 1758 states have internal predecessors, (2223), 752 states have call successors, (752), 207 states have call predecessors, (752), 209 states have return successors, (808), 691 states have call predecessors, (808), 750 states have call successors, (808) [2023-11-29 04:20:34,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2625 states to 2625 states and 3783 transitions. [2023-11-29 04:20:34,193 INFO L78 Accepts]: Start accepts. Automaton has 2625 states and 3783 transitions. Word has length 138 [2023-11-29 04:20:34,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:20:34,193 INFO L495 AbstractCegarLoop]: Abstraction has 2625 states and 3783 transitions. [2023-11-29 04:20:34,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (28), 5 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2023-11-29 04:20:34,193 INFO L276 IsEmpty]: Start isEmpty. Operand 2625 states and 3783 transitions. [2023-11-29 04:20:34,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2023-11-29 04:20:34,196 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:20:34,196 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:20:34,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-29 04:20:34,197 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2023-11-29 04:20:34,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:20:34,197 INFO L85 PathProgramCache]: Analyzing trace with hash -852751500, now seen corresponding path program 1 times [2023-11-29 04:20:34,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:20:34,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858116874] [2023-11-29 04:20:34,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:20:34,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:20:34,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:34,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:20:34,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:34,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 04:20:34,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:34,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 04:20:34,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:34,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 04:20:34,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:34,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 04:20:34,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:34,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-29 04:20:34,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:34,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:20:34,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:34,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 04:20:34,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:34,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 04:20:34,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:34,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 04:20:34,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:34,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 04:20:34,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:34,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:20:34,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:34,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:20:34,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:34,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 04:20:34,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:34,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 04:20:34,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:34,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:20:34,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:34,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:20:34,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:34,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 04:20:34,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:34,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 04:20:34,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:34,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:20:34,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:34,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:20:34,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:34,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 04:20:34,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:34,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-29 04:20:34,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:34,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:20:34,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:34,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:20:34,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:34,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 04:20:34,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:34,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-11-29 04:20:34,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:34,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 04:20:34,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:34,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:20:34,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:34,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 04:20:34,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:34,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-29 04:20:34,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:34,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:20:34,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:34,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-29 04:20:34,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:34,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-11-29 04:20:34,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:34,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2023-11-29 04:20:34,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:34,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2023-11-29 04:20:34,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:34,904 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2023-11-29 04:20:34,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:20:34,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858116874] [2023-11-29 04:20:34,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858116874] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:20:34,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:20:34,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 04:20:34,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187696559] [2023-11-29 04:20:34,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:20:34,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 04:20:34,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:20:34,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 04:20:34,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-29 04:20:34,907 INFO L87 Difference]: Start difference. First operand 2625 states and 3783 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (29), 8 states have call predecessors, (29), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2023-11-29 04:20:49,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:20:49,906 INFO L93 Difference]: Finished difference Result 3007 states and 4483 transitions. [2023-11-29 04:20:49,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 04:20:49,907 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (29), 8 states have call predecessors, (29), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 171 [2023-11-29 04:20:49,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:20:49,913 INFO L225 Difference]: With dead ends: 3007 [2023-11-29 04:20:49,913 INFO L226 Difference]: Without dead ends: 3005 [2023-11-29 04:20:49,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=320, Unknown=0, NotChecked=0, Total=462 [2023-11-29 04:20:49,915 INFO L413 NwaCegarLoop]: 1283 mSDtfsCounter, 4999 mSDsluCounter, 5332 mSDsCounter, 0 mSdLazyCounter, 11237 mSolverCounterSat, 3974 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5162 SdHoareTripleChecker+Valid, 6615 SdHoareTripleChecker+Invalid, 15211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3974 IncrementalHoareTripleChecker+Valid, 11237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.7s IncrementalHoareTripleChecker+Time [2023-11-29 04:20:49,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5162 Valid, 6615 Invalid, 15211 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3974 Valid, 11237 Invalid, 0 Unknown, 0 Unchecked, 13.7s Time] [2023-11-29 04:20:49,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3005 states. [2023-11-29 04:20:50,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3005 to 2723. [2023-11-29 04:20:50,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2723 states, 1713 states have (on average 1.3345008756567425) internal successors, (2286), 1815 states have internal predecessors, (2286), 767 states have call successors, (767), 233 states have call predecessors, (767), 237 states have return successors, (827), 707 states have call predecessors, (827), 765 states have call successors, (827) [2023-11-29 04:20:50,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2723 states to 2723 states and 3880 transitions. [2023-11-29 04:20:50,424 INFO L78 Accepts]: Start accepts. Automaton has 2723 states and 3880 transitions. Word has length 171 [2023-11-29 04:20:50,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:20:50,424 INFO L495 AbstractCegarLoop]: Abstraction has 2723 states and 3880 transitions. [2023-11-29 04:20:50,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (29), 8 states have call predecessors, (29), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2023-11-29 04:20:50,425 INFO L276 IsEmpty]: Start isEmpty. Operand 2723 states and 3880 transitions. [2023-11-29 04:20:50,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-11-29 04:20:50,427 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:20:50,427 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:20:50,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-29 04:20:50,427 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ldv_linux_usb_urb_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2023-11-29 04:20:50,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:20:50,428 INFO L85 PathProgramCache]: Analyzing trace with hash -292608149, now seen corresponding path program 1 times [2023-11-29 04:20:50,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:20:50,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584612146] [2023-11-29 04:20:50,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:20:50,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:20:50,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:50,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:20:50,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:50,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 04:20:50,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:50,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 04:20:50,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:50,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 04:20:50,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:50,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 04:20:50,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:50,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-29 04:20:50,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:50,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:20:50,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:50,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 04:20:50,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:50,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 04:20:50,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:50,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 04:20:50,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:50,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 04:20:50,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:50,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 04:20:50,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:50,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 04:20:50,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:50,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 04:20:50,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:50,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-29 04:20:50,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:50,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-29 04:20:50,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:50,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 04:20:50,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:50,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 04:20:50,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:50,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 04:20:50,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:50,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-29 04:20:50,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:50,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-29 04:20:50,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:50,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 04:20:50,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:50,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 04:20:50,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:50,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-11-29 04:20:50,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:50,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 04:20:50,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:50,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-29 04:20:50,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:50,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-11-29 04:20:50,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:50,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-29 04:20:50,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:50,799 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 04:20:50,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:20:50,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584612146] [2023-11-29 04:20:50,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584612146] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:20:50,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:20:50,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:20:50,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762286666] [2023-11-29 04:20:50,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:20:50,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:20:50,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:20:50,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:20:50,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:20:50,802 INFO L87 Difference]: Start difference. First operand 2723 states and 3880 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2023-11-29 04:21:00,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:21:00,178 INFO L93 Difference]: Finished difference Result 2818 states and 4051 transitions. [2023-11-29 04:21:00,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 04:21:00,179 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 143 [2023-11-29 04:21:00,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:21:00,186 INFO L225 Difference]: With dead ends: 2818 [2023-11-29 04:21:00,186 INFO L226 Difference]: Without dead ends: 2577 [2023-11-29 04:21:00,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-11-29 04:21:00,189 INFO L413 NwaCegarLoop]: 1282 mSDtfsCounter, 4798 mSDsluCounter, 2941 mSDsCounter, 0 mSdLazyCounter, 6074 mSolverCounterSat, 3492 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5071 SdHoareTripleChecker+Valid, 4223 SdHoareTripleChecker+Invalid, 9566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3492 IncrementalHoareTripleChecker+Valid, 6074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2023-11-29 04:21:00,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5071 Valid, 4223 Invalid, 9566 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3492 Valid, 6074 Invalid, 0 Unknown, 0 Unchecked, 8.4s Time] [2023-11-29 04:21:00,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2577 states. [2023-11-29 04:21:00,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2577 to 2482. [2023-11-29 04:21:00,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2482 states, 1567 states have (on average 1.360561582641991) internal successors, (2132), 1666 states have internal predecessors, (2132), 715 states have call successors, (715), 190 states have call predecessors, (715), 195 states have return successors, (777), 657 states have call predecessors, (777), 715 states have call successors, (777) [2023-11-29 04:21:00,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2482 states to 2482 states and 3624 transitions. [2023-11-29 04:21:00,681 INFO L78 Accepts]: Start accepts. Automaton has 2482 states and 3624 transitions. Word has length 143 [2023-11-29 04:21:00,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:21:00,681 INFO L495 AbstractCegarLoop]: Abstraction has 2482 states and 3624 transitions. [2023-11-29 04:21:00,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2023-11-29 04:21:00,681 INFO L276 IsEmpty]: Start isEmpty. Operand 2482 states and 3624 transitions. [2023-11-29 04:21:00,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2023-11-29 04:21:00,684 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:21:00,685 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:21:00,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-11-29 04:21:00,685 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2023-11-29 04:21:00,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:21:00,685 INFO L85 PathProgramCache]: Analyzing trace with hash -375635515, now seen corresponding path program 1 times [2023-11-29 04:21:00,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:21:00,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359745016] [2023-11-29 04:21:00,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:21:00,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:21:00,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:01,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:21:01,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:01,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 04:21:01,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:01,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 04:21:01,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:01,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 04:21:01,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:01,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 04:21:01,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:01,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-29 04:21:01,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:01,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:21:01,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:01,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 04:21:01,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:01,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 04:21:01,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:01,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 04:21:01,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:01,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 04:21:01,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:01,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:21:01,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:01,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:21:01,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:01,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 04:21:01,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:01,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 04:21:01,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:01,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:21:01,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:01,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:21:01,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:01,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 04:21:01,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:01,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 04:21:01,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:01,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:21:01,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:01,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:21:01,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:01,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 04:21:01,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:01,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-29 04:21:01,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:01,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:21:01,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:01,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:21:01,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:01,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 04:21:01,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:01,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-11-29 04:21:01,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:01,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-29 04:21:01,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:01,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-29 04:21:01,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:01,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-11-29 04:21:01,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:01,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-11-29 04:21:01,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:01,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:21:01,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:01,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-11-29 04:21:01,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:01,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2023-11-29 04:21:01,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:01,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:21:01,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:01,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2023-11-29 04:21:01,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:01,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2023-11-29 04:21:01,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:01,381 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2023-11-29 04:21:01,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:21:01,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359745016] [2023-11-29 04:21:01,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359745016] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:21:01,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:21:01,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 04:21:01,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995426991] [2023-11-29 04:21:01,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:21:01,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 04:21:01,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:21:01,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 04:21:01,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-11-29 04:21:01,383 INFO L87 Difference]: Start difference. First operand 2482 states and 3624 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (31), 8 states have call predecessors, (31), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2023-11-29 04:21:18,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:21:18,623 INFO L93 Difference]: Finished difference Result 2929 states and 4604 transitions. [2023-11-29 04:21:18,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 04:21:18,623 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (31), 8 states have call predecessors, (31), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 176 [2023-11-29 04:21:18,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:21:18,630 INFO L225 Difference]: With dead ends: 2929 [2023-11-29 04:21:18,630 INFO L226 Difference]: Without dead ends: 2927 [2023-11-29 04:21:18,632 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=250, Invalid=620, Unknown=0, NotChecked=0, Total=870 [2023-11-29 04:21:18,632 INFO L413 NwaCegarLoop]: 1154 mSDtfsCounter, 5030 mSDsluCounter, 5806 mSDsCounter, 0 mSdLazyCounter, 13764 mSolverCounterSat, 5503 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5046 SdHoareTripleChecker+Valid, 6960 SdHoareTripleChecker+Invalid, 19267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 5503 IncrementalHoareTripleChecker+Valid, 13764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.8s IncrementalHoareTripleChecker+Time [2023-11-29 04:21:18,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5046 Valid, 6960 Invalid, 19267 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [5503 Valid, 13764 Invalid, 0 Unknown, 0 Unchecked, 15.8s Time] [2023-11-29 04:21:18,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2927 states. [2023-11-29 04:21:19,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2927 to 2536. [2023-11-29 04:21:19,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2536 states, 1595 states have (on average 1.354858934169279) internal successors, (2161), 1692 states have internal predecessors, (2161), 728 states have call successors, (728), 191 states have call predecessors, (728), 208 states have return successors, (837), 686 states have call predecessors, (837), 728 states have call successors, (837) [2023-11-29 04:21:19,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2536 states to 2536 states and 3726 transitions. [2023-11-29 04:21:19,116 INFO L78 Accepts]: Start accepts. Automaton has 2536 states and 3726 transitions. Word has length 176 [2023-11-29 04:21:19,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:21:19,117 INFO L495 AbstractCegarLoop]: Abstraction has 2536 states and 3726 transitions. [2023-11-29 04:21:19,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (31), 8 states have call predecessors, (31), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2023-11-29 04:21:19,117 INFO L276 IsEmpty]: Start isEmpty. Operand 2536 states and 3726 transitions. [2023-11-29 04:21:19,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2023-11-29 04:21:19,120 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:21:19,120 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:21:19,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-11-29 04:21:19,120 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ldv_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 27 more)] === [2023-11-29 04:21:19,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:21:19,120 INFO L85 PathProgramCache]: Analyzing trace with hash -890938308, now seen corresponding path program 1 times [2023-11-29 04:21:19,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:21:19,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128487308] [2023-11-29 04:21:19,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:21:19,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:21:19,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:19,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:21:19,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:19,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 04:21:19,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:19,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 04:21:19,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:19,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 04:21:19,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:19,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 04:21:19,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:19,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-29 04:21:19,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:19,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:21:19,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:19,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 04:21:19,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:19,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 04:21:19,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:19,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 04:21:19,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:19,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 04:21:19,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:19,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:21:19,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:19,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:21:19,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:19,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 04:21:19,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:19,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 04:21:19,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:19,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:21:19,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:19,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:21:19,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:19,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 04:21:19,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:19,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 04:21:19,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:19,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:21:19,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:19,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:21:19,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:19,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 04:21:19,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:19,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-29 04:21:19,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:19,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:21:19,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:19,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:21:19,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:19,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 04:21:19,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:19,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-11-29 04:21:19,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:19,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 04:21:19,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:19,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:21:19,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:19,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 04:21:19,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:19,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-29 04:21:19,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:19,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:21:19,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:19,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-29 04:21:19,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:19,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-11-29 04:21:19,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:19,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2023-11-29 04:21:19,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:19,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2023-11-29 04:21:19,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:19,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2023-11-29 04:21:19,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:19,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2023-11-29 04:21:19,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:19,753 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2023-11-29 04:21:19,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:21:19,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128487308] [2023-11-29 04:21:19,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128487308] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:21:19,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:21:19,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 04:21:19,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215228374] [2023-11-29 04:21:19,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:21:19,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 04:21:19,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:21:19,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 04:21:19,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-29 04:21:19,755 INFO L87 Difference]: Start difference. First operand 2536 states and 3726 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (30), 6 states have call predecessors, (30), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2023-11-29 04:21:31,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:21:31,294 INFO L93 Difference]: Finished difference Result 2893 states and 4510 transitions. [2023-11-29 04:21:31,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 04:21:31,295 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (30), 6 states have call predecessors, (30), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 187 [2023-11-29 04:21:31,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:21:31,301 INFO L225 Difference]: With dead ends: 2893 [2023-11-29 04:21:31,301 INFO L226 Difference]: Without dead ends: 2891 [2023-11-29 04:21:31,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2023-11-29 04:21:31,303 INFO L413 NwaCegarLoop]: 1169 mSDtfsCounter, 3175 mSDsluCounter, 4399 mSDsCounter, 0 mSdLazyCounter, 9217 mSolverCounterSat, 3654 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3175 SdHoareTripleChecker+Valid, 5568 SdHoareTripleChecker+Invalid, 12871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3654 IncrementalHoareTripleChecker+Valid, 9217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2023-11-29 04:21:31,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3175 Valid, 5568 Invalid, 12871 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3654 Valid, 9217 Invalid, 0 Unknown, 0 Unchecked, 10.4s Time] [2023-11-29 04:21:31,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2891 states. [2023-11-29 04:21:31,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2891 to 2540. [2023-11-29 04:21:31,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2540 states, 1599 states have (on average 1.3539712320200126) internal successors, (2165), 1696 states have internal predecessors, (2165), 728 states have call successors, (728), 191 states have call predecessors, (728), 208 states have return successors, (837), 686 states have call predecessors, (837), 728 states have call successors, (837) [2023-11-29 04:21:31,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2540 states to 2540 states and 3730 transitions. [2023-11-29 04:21:31,795 INFO L78 Accepts]: Start accepts. Automaton has 2540 states and 3730 transitions. Word has length 187 [2023-11-29 04:21:31,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:21:31,795 INFO L495 AbstractCegarLoop]: Abstraction has 2540 states and 3730 transitions. [2023-11-29 04:21:31,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (30), 6 states have call predecessors, (30), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2023-11-29 04:21:31,795 INFO L276 IsEmpty]: Start isEmpty. Operand 2540 states and 3730 transitions. [2023-11-29 04:21:31,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2023-11-29 04:21:31,798 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:21:31,798 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:21:31,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-11-29 04:21:31,798 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ldv_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 27 more)] === [2023-11-29 04:21:31,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:21:31,799 INFO L85 PathProgramCache]: Analyzing trace with hash -890997890, now seen corresponding path program 1 times [2023-11-29 04:21:31,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:21:31,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757112001] [2023-11-29 04:21:31,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:21:31,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:21:31,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:32,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:21:32,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:32,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 04:21:32,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:32,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 04:21:32,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:32,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 04:21:32,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:32,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 04:21:32,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:32,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-29 04:21:32,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:32,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:21:32,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:32,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 04:21:32,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:32,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 04:21:32,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:32,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 04:21:32,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:32,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 04:21:32,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:32,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:21:32,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:32,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:21:32,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:32,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 04:21:32,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:32,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 04:21:32,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:32,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:21:32,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:32,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:21:32,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:32,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 04:21:32,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:32,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 04:21:32,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:32,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:21:32,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:32,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:21:32,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:32,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 04:21:32,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:32,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-29 04:21:32,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:32,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:21:32,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:32,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:21:32,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:32,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 04:21:32,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:32,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-11-29 04:21:32,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:32,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 04:21:32,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:32,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:21:32,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:32,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 04:21:32,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:32,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-29 04:21:32,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:32,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:21:32,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:32,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-29 04:21:32,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:32,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-11-29 04:21:32,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:32,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2023-11-29 04:21:32,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:32,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2023-11-29 04:21:32,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:32,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2023-11-29 04:21:32,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:32,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2023-11-29 04:21:32,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:32,623 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2023-11-29 04:21:32,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:21:32,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757112001] [2023-11-29 04:21:32,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757112001] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:21:32,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:21:32,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 04:21:32,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479831929] [2023-11-29 04:21:32,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:21:32,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 04:21:32,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:21:32,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 04:21:32,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-11-29 04:21:32,625 INFO L87 Difference]: Start difference. First operand 2540 states and 3730 transitions. Second operand has 11 states, 10 states have (on average 6.6) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (30), 7 states have call predecessors, (30), 2 states have return successors, (28), 3 states have call predecessors, (28), 2 states have call successors, (28) [2023-11-29 04:21:48,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 04:21:49,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:21:49,056 INFO L93 Difference]: Finished difference Result 5004 states and 7623 transitions. [2023-11-29 04:21:49,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 04:21:49,057 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.6) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (30), 7 states have call predecessors, (30), 2 states have return successors, (28), 3 states have call predecessors, (28), 2 states have call successors, (28) Word has length 187 [2023-11-29 04:21:49,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:21:49,064 INFO L225 Difference]: With dead ends: 5004 [2023-11-29 04:21:49,064 INFO L226 Difference]: Without dead ends: 2883 [2023-11-29 04:21:49,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=294, Unknown=0, NotChecked=0, Total=420 [2023-11-29 04:21:49,071 INFO L413 NwaCegarLoop]: 1172 mSDtfsCounter, 4810 mSDsluCounter, 5577 mSDsCounter, 0 mSdLazyCounter, 12581 mSolverCounterSat, 3747 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5049 SdHoareTripleChecker+Valid, 6749 SdHoareTripleChecker+Invalid, 16328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3747 IncrementalHoareTripleChecker+Valid, 12581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:21:49,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5049 Valid, 6749 Invalid, 16328 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3747 Valid, 12581 Invalid, 0 Unknown, 0 Unchecked, 15.2s Time] [2023-11-29 04:21:49,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2883 states. [2023-11-29 04:21:49,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2883 to 2534. [2023-11-29 04:21:49,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2534 states, 1594 states have (on average 1.3525721455457966) internal successors, (2156), 1690 states have internal predecessors, (2156), 728 states have call successors, (728), 191 states have call predecessors, (728), 208 states have return successors, (837), 686 states have call predecessors, (837), 728 states have call successors, (837) [2023-11-29 04:21:49,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2534 states to 2534 states and 3721 transitions. [2023-11-29 04:21:49,594 INFO L78 Accepts]: Start accepts. Automaton has 2534 states and 3721 transitions. Word has length 187 [2023-11-29 04:21:49,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:21:49,594 INFO L495 AbstractCegarLoop]: Abstraction has 2534 states and 3721 transitions. [2023-11-29 04:21:49,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.6) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (30), 7 states have call predecessors, (30), 2 states have return successors, (28), 3 states have call predecessors, (28), 2 states have call successors, (28) [2023-11-29 04:21:49,594 INFO L276 IsEmpty]: Start isEmpty. Operand 2534 states and 3721 transitions. [2023-11-29 04:21:49,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2023-11-29 04:21:49,597 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:21:49,597 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:21:49,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-11-29 04:21:49,598 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2023-11-29 04:21:49,598 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:21:49,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1187625219, now seen corresponding path program 1 times [2023-11-29 04:21:49,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:21:49,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443193431] [2023-11-29 04:21:49,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:21:49,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:21:49,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:49,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:21:49,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:49,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 04:21:49,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:49,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 04:21:49,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:49,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 04:21:49,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:49,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 04:21:49,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:49,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-29 04:21:49,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:49,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:21:49,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:49,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 04:21:49,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:49,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 04:21:49,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:49,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 04:21:49,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:49,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 04:21:49,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:49,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:21:49,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:49,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:21:49,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:49,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 04:21:49,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:49,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 04:21:49,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:50,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:21:50,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:50,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:21:50,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:50,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 04:21:50,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:50,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 04:21:50,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:50,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:21:50,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:50,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:21:50,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:50,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 04:21:50,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:50,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-29 04:21:50,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:50,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:21:50,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:50,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:21:50,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:50,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 04:21:50,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:50,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-11-29 04:21:50,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:50,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 04:21:50,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:50,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:21:50,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:50,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 04:21:50,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:50,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-29 04:21:50,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:50,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:21:50,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:50,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-29 04:21:50,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:50,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-11-29 04:21:50,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:50,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2023-11-29 04:21:50,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:50,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2023-11-29 04:21:50,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:50,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2023-11-29 04:21:50,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:50,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 04:21:50,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:50,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:21:50,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:50,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2023-11-29 04:21:50,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:50,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2023-11-29 04:21:50,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:50,157 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2023-11-29 04:21:50,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:21:50,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443193431] [2023-11-29 04:21:50,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443193431] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:21:50,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:21:50,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 04:21:50,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24954981] [2023-11-29 04:21:50,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:21:50,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 04:21:50,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:21:50,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 04:21:50,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-11-29 04:21:50,159 INFO L87 Difference]: Start difference. First operand 2534 states and 3721 transitions. Second operand has 11 states, 10 states have (on average 6.3) internal successors, (63), 4 states have internal predecessors, (63), 3 states have call successors, (34), 9 states have call predecessors, (34), 2 states have return successors, (31), 2 states have call predecessors, (31), 3 states have call successors, (31) [2023-11-29 04:22:04,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:22:04,212 INFO L93 Difference]: Finished difference Result 3279 states and 5645 transitions. [2023-11-29 04:22:04,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-29 04:22:04,212 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.3) internal successors, (63), 4 states have internal predecessors, (63), 3 states have call successors, (34), 9 states have call predecessors, (34), 2 states have return successors, (31), 2 states have call predecessors, (31), 3 states have call successors, (31) Word has length 193 [2023-11-29 04:22:04,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:22:04,222 INFO L225 Difference]: With dead ends: 3279 [2023-11-29 04:22:04,222 INFO L226 Difference]: Without dead ends: 3277 [2023-11-29 04:22:04,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=223, Invalid=533, Unknown=0, NotChecked=0, Total=756 [2023-11-29 04:22:04,224 INFO L413 NwaCegarLoop]: 1104 mSDtfsCounter, 4727 mSDsluCounter, 5762 mSDsCounter, 0 mSdLazyCounter, 11723 mSolverCounterSat, 5198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4798 SdHoareTripleChecker+Valid, 6866 SdHoareTripleChecker+Invalid, 16921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 5198 IncrementalHoareTripleChecker+Valid, 11723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.6s IncrementalHoareTripleChecker+Time [2023-11-29 04:22:04,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4798 Valid, 6866 Invalid, 16921 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [5198 Valid, 11723 Invalid, 0 Unknown, 0 Unchecked, 12.6s Time] [2023-11-29 04:22:04,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3277 states. [2023-11-29 04:22:04,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3277 to 2532. [2023-11-29 04:22:04,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2532 states, 1593 states have (on average 1.3515379786566226) internal successors, (2153), 1688 states have internal predecessors, (2153), 728 states have call successors, (728), 191 states have call predecessors, (728), 208 states have return successors, (837), 686 states have call predecessors, (837), 728 states have call successors, (837) [2023-11-29 04:22:04,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2532 states to 2532 states and 3718 transitions. [2023-11-29 04:22:04,773 INFO L78 Accepts]: Start accepts. Automaton has 2532 states and 3718 transitions. Word has length 193 [2023-11-29 04:22:04,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:22:04,773 INFO L495 AbstractCegarLoop]: Abstraction has 2532 states and 3718 transitions. [2023-11-29 04:22:04,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.3) internal successors, (63), 4 states have internal predecessors, (63), 3 states have call successors, (34), 9 states have call predecessors, (34), 2 states have return successors, (31), 2 states have call predecessors, (31), 3 states have call successors, (31) [2023-11-29 04:22:04,773 INFO L276 IsEmpty]: Start isEmpty. Operand 2532 states and 3718 transitions. [2023-11-29 04:22:04,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-29 04:22:04,777 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:22:04,777 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:22:04,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-11-29 04:22:04,777 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ldv_check_alloc_flagsErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2023-11-29 04:22:04,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:22:04,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1115574483, now seen corresponding path program 1 times [2023-11-29 04:22:04,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:22:04,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659992103] [2023-11-29 04:22:04,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:22:04,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:22:04,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:05,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:22:05,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:05,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 04:22:05,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:05,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 04:22:05,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:05,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 04:22:05,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:05,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 04:22:05,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:05,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-29 04:22:05,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:05,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:22:05,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:05,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 04:22:05,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:05,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 04:22:05,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:05,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 04:22:05,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:05,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 04:22:05,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:05,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:22:05,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:05,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:22:05,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:05,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 04:22:05,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:05,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 04:22:05,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:05,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:22:05,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:05,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:22:05,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:05,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 04:22:05,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:05,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 04:22:05,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:05,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:22:05,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:05,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:22:05,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:05,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 04:22:05,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:05,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-29 04:22:05,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:05,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:22:05,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:05,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:22:05,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:05,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 04:22:05,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:05,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-11-29 04:22:05,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:05,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 04:22:05,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:05,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:22:05,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:05,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 04:22:05,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:05,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-29 04:22:05,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:05,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:22:05,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:05,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-29 04:22:05,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:05,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-11-29 04:22:05,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:05,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2023-11-29 04:22:05,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:05,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2023-11-29 04:22:05,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:05,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2023-11-29 04:22:05,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:05,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2023-11-29 04:22:05,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:05,264 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2023-11-29 04:22:05,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:22:05,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659992103] [2023-11-29 04:22:05,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659992103] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:22:05,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:22:05,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 04:22:05,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116177338] [2023-11-29 04:22:05,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:22:05,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 04:22:05,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:22:05,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 04:22:05,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:22:05,266 INFO L87 Difference]: Start difference. First operand 2532 states and 3718 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (30), 7 states have call predecessors, (30), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2023-11-29 04:22:16,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:22:16,263 INFO L93 Difference]: Finished difference Result 4988 states and 7599 transitions. [2023-11-29 04:22:16,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 04:22:16,264 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (30), 7 states have call predecessors, (30), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 190 [2023-11-29 04:22:16,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:22:16,272 INFO L225 Difference]: With dead ends: 4988 [2023-11-29 04:22:16,272 INFO L226 Difference]: Without dead ends: 2875 [2023-11-29 04:22:16,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2023-11-29 04:22:16,278 INFO L413 NwaCegarLoop]: 1172 mSDtfsCounter, 5140 mSDsluCounter, 2557 mSDsCounter, 0 mSdLazyCounter, 4940 mSolverCounterSat, 4456 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5379 SdHoareTripleChecker+Valid, 3729 SdHoareTripleChecker+Invalid, 9396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4456 IncrementalHoareTripleChecker+Valid, 4940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.8s IncrementalHoareTripleChecker+Time [2023-11-29 04:22:16,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5379 Valid, 3729 Invalid, 9396 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4456 Valid, 4940 Invalid, 0 Unknown, 0 Unchecked, 9.8s Time] [2023-11-29 04:22:16,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2875 states. [2023-11-29 04:22:16,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2875 to 2526. [2023-11-29 04:22:16,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2526 states, 1588 states have (on average 1.350125944584383) internal successors, (2144), 1682 states have internal predecessors, (2144), 728 states have call successors, (728), 191 states have call predecessors, (728), 208 states have return successors, (837), 686 states have call predecessors, (837), 728 states have call successors, (837) [2023-11-29 04:22:16,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2526 states to 2526 states and 3709 transitions. [2023-11-29 04:22:16,822 INFO L78 Accepts]: Start accepts. Automaton has 2526 states and 3709 transitions. Word has length 190 [2023-11-29 04:22:16,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:22:16,823 INFO L495 AbstractCegarLoop]: Abstraction has 2526 states and 3709 transitions. [2023-11-29 04:22:16,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (30), 7 states have call predecessors, (30), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2023-11-29 04:22:16,823 INFO L276 IsEmpty]: Start isEmpty. Operand 2526 states and 3709 transitions. [2023-11-29 04:22:16,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2023-11-29 04:22:16,829 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:22:16,829 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:22:16,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-11-29 04:22:16,829 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2023-11-29 04:22:16,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:22:16,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1915763464, now seen corresponding path program 1 times [2023-11-29 04:22:16,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:22:16,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994785795] [2023-11-29 04:22:16,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:22:16,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:22:16,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:17,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:22:17,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:17,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 04:22:17,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:17,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 04:22:17,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:17,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 04:22:17,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:17,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 04:22:17,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:17,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-29 04:22:17,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:17,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:22:17,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:17,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 04:22:17,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:17,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 04:22:17,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:17,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 04:22:17,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:17,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 04:22:17,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:17,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:22:17,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:17,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:22:17,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:17,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 04:22:17,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:17,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 04:22:17,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:17,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:22:17,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:17,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:22:17,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:17,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 04:22:17,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:17,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 04:22:17,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:17,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:22:17,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:17,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:22:17,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:17,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 04:22:17,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:17,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-29 04:22:17,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:17,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:22:17,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:17,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:22:17,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:17,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 04:22:17,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:17,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-11-29 04:22:17,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:17,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 04:22:17,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:17,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:22:17,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:17,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 04:22:17,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:17,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-29 04:22:17,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:17,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:22:17,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:17,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-29 04:22:17,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:17,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-11-29 04:22:17,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:17,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2023-11-29 04:22:17,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:17,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2023-11-29 04:22:17,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:17,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2023-11-29 04:22:17,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:17,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2023-11-29 04:22:17,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:17,609 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2023-11-29 04:22:17,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:22:17,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994785795] [2023-11-29 04:22:17,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994785795] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:22:17,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:22:17,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-29 04:22:17,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353032337] [2023-11-29 04:22:17,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:22:17,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 04:22:17,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:22:17,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 04:22:17,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2023-11-29 04:22:17,613 INFO L87 Difference]: Start difference. First operand 2526 states and 3709 transitions. Second operand has 12 states, 11 states have (on average 6.545454545454546) internal successors, (72), 5 states have internal predecessors, (72), 4 states have call successors, (35), 10 states have call predecessors, (35), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2023-11-29 04:22:33,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:22:33,911 INFO L93 Difference]: Finished difference Result 4909 states and 7400 transitions. [2023-11-29 04:22:33,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-29 04:22:33,911 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.545454545454546) internal successors, (72), 5 states have internal predecessors, (72), 4 states have call successors, (35), 10 states have call predecessors, (35), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 199 [2023-11-29 04:22:33,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:22:33,916 INFO L225 Difference]: With dead ends: 4909 [2023-11-29 04:22:33,916 INFO L226 Difference]: Without dead ends: 1556 [2023-11-29 04:22:33,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=207, Invalid=663, Unknown=0, NotChecked=0, Total=870 [2023-11-29 04:22:33,925 INFO L413 NwaCegarLoop]: 1170 mSDtfsCounter, 2858 mSDsluCounter, 7648 mSDsCounter, 0 mSdLazyCounter, 16219 mSolverCounterSat, 3030 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2858 SdHoareTripleChecker+Valid, 8818 SdHoareTripleChecker+Invalid, 19249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3030 IncrementalHoareTripleChecker+Valid, 16219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:22:33,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2858 Valid, 8818 Invalid, 19249 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3030 Valid, 16219 Invalid, 0 Unknown, 0 Unchecked, 15.0s Time] [2023-11-29 04:22:33,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1556 states. [2023-11-29 04:22:34,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1556 to 1377. [2023-11-29 04:22:34,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1377 states, 868 states have (on average 1.3214285714285714) internal successors, (1147), 916 states have internal predecessors, (1147), 382 states have call successors, (382), 125 states have call predecessors, (382), 125 states have return successors, (383), 355 states have call predecessors, (383), 382 states have call successors, (383) [2023-11-29 04:22:34,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1377 states to 1377 states and 1912 transitions. [2023-11-29 04:22:34,229 INFO L78 Accepts]: Start accepts. Automaton has 1377 states and 1912 transitions. Word has length 199 [2023-11-29 04:22:34,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:22:34,230 INFO L495 AbstractCegarLoop]: Abstraction has 1377 states and 1912 transitions. [2023-11-29 04:22:34,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.545454545454546) internal successors, (72), 5 states have internal predecessors, (72), 4 states have call successors, (35), 10 states have call predecessors, (35), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2023-11-29 04:22:34,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 1912 transitions. [2023-11-29 04:22:34,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-29 04:22:34,232 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:22:34,233 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:22:34,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-11-29 04:22:34,233 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2023-11-29 04:22:34,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:22:34,233 INFO L85 PathProgramCache]: Analyzing trace with hash -817885986, now seen corresponding path program 1 times [2023-11-29 04:22:34,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:22:34,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750596914] [2023-11-29 04:22:34,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:22:34,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:22:34,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:34,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:22:34,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:34,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 04:22:34,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:34,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 04:22:34,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:34,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 04:22:34,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:34,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 04:22:34,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:34,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:22:34,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:34,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 04:22:34,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:34,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 04:22:34,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:34,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-29 04:22:34,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:34,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:22:34,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:34,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:22:34,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:34,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 04:22:34,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:34,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 04:22:34,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:34,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:22:34,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:34,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:22:34,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:34,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 04:22:34,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:34,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 04:22:34,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:34,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 04:22:34,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:34,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 04:22:34,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:35,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 04:22:35,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:35,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:22:35,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:35,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:22:35,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:35,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 04:22:35,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:35,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 04:22:35,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:35,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 04:22:35,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:35,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:22:35,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:35,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 04:22:35,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:35,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-29 04:22:35,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:35,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-29 04:22:35,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:35,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-11-29 04:22:35,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:35,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:22:35,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:35,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:22:35,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:35,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 04:22:35,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:35,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-29 04:22:35,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:35,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2023-11-29 04:22:35,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:35,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2023-11-29 04:22:35,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:35,145 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2023-11-29 04:22:35,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:22:35,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750596914] [2023-11-29 04:22:35,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750596914] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:22:35,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:22:35,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 04:22:35,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163963662] [2023-11-29 04:22:35,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:22:35,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 04:22:35,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:22:35,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 04:22:35,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-11-29 04:22:35,148 INFO L87 Difference]: Start difference. First operand 1377 states and 1912 transitions. Second operand has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (34), 8 states have call predecessors, (34), 2 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2023-11-29 04:22:44,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:22:44,917 INFO L93 Difference]: Finished difference Result 1681 states and 2382 transitions. [2023-11-29 04:22:44,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-29 04:22:44,918 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (34), 8 states have call predecessors, (34), 2 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) Word has length 190 [2023-11-29 04:22:44,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:22:44,922 INFO L225 Difference]: With dead ends: 1681 [2023-11-29 04:22:44,922 INFO L226 Difference]: Without dead ends: 1679 [2023-11-29 04:22:44,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=322, Invalid=734, Unknown=0, NotChecked=0, Total=1056 [2023-11-29 04:22:44,923 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 4694 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 7511 mSolverCounterSat, 3684 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4706 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 11195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3684 IncrementalHoareTripleChecker+Valid, 7511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2023-11-29 04:22:44,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4706 Valid, 1114 Invalid, 11195 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3684 Valid, 7511 Invalid, 0 Unknown, 0 Unchecked, 8.4s Time] [2023-11-29 04:22:44,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2023-11-29 04:22:45,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 1490. [2023-11-29 04:22:45,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1490 states, 934 states have (on average 1.310492505353319) internal successors, (1224), 986 states have internal predecessors, (1224), 410 states have call successors, (410), 145 states have call predecessors, (410), 145 states have return successors, (411), 381 states have call predecessors, (411), 410 states have call successors, (411) [2023-11-29 04:22:45,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1490 states to 1490 states and 2045 transitions. [2023-11-29 04:22:45,251 INFO L78 Accepts]: Start accepts. Automaton has 1490 states and 2045 transitions. Word has length 190 [2023-11-29 04:22:45,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:22:45,251 INFO L495 AbstractCegarLoop]: Abstraction has 1490 states and 2045 transitions. [2023-11-29 04:22:45,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (34), 8 states have call predecessors, (34), 2 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2023-11-29 04:22:45,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 2045 transitions. [2023-11-29 04:22:45,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2023-11-29 04:22:45,255 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:22:45,255 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:22:45,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-11-29 04:22:45,255 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2023-11-29 04:22:45,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:22:45,255 INFO L85 PathProgramCache]: Analyzing trace with hash 495550450, now seen corresponding path program 1 times [2023-11-29 04:22:45,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:22:45,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175759914] [2023-11-29 04:22:45,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:22:45,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:22:45,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:45,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:22:45,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:45,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 04:22:45,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:45,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 04:22:45,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:45,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 04:22:45,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:45,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 04:22:45,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:45,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:22:45,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:45,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 04:22:45,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:45,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 04:22:45,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:45,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-29 04:22:45,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:45,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:22:45,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:45,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:22:45,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:45,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 04:22:45,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:45,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 04:22:45,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:45,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:22:45,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:45,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:22:45,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:45,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 04:22:45,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:45,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 04:22:45,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:45,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 04:22:45,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:45,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 04:22:45,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:45,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 04:22:45,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:45,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:22:45,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:45,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:22:45,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:45,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 04:22:45,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:45,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 04:22:45,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:45,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 04:22:45,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:45,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:22:45,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:45,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 04:22:45,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:45,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-29 04:22:45,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:45,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-29 04:22:45,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:45,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-11-29 04:22:45,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:45,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:22:45,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:45,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:22:45,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:45,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 04:22:45,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:45,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-29 04:22:45,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:45,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2023-11-29 04:22:45,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:45,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2023-11-29 04:22:45,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:45,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2023-11-29 04:22:45,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:45,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:22:45,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:45,892 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2023-11-29 04:22:45,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:22:45,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175759914] [2023-11-29 04:22:45,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175759914] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:22:45,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:22:45,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 04:22:45,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836123343] [2023-11-29 04:22:45,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:22:45,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 04:22:45,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:22:45,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 04:22:45,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-11-29 04:22:45,895 INFO L87 Difference]: Start difference. First operand 1490 states and 2045 transitions. Second operand has 11 states, 11 states have (on average 7.818181818181818) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (36), 9 states have call predecessors, (36), 2 states have return successors, (32), 2 states have call predecessors, (32), 1 states have call successors, (32) [2023-11-29 04:22:56,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:22:56,259 INFO L93 Difference]: Finished difference Result 1685 states and 2386 transitions. [2023-11-29 04:22:56,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-29 04:22:56,260 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.818181818181818) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (36), 9 states have call predecessors, (36), 2 states have return successors, (32), 2 states have call predecessors, (32), 1 states have call successors, (32) Word has length 201 [2023-11-29 04:22:56,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:22:56,260 INFO L225 Difference]: With dead ends: 1685 [2023-11-29 04:22:56,260 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 04:22:56,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=274, Invalid=656, Unknown=0, NotChecked=0, Total=930 [2023-11-29 04:22:56,265 INFO L413 NwaCegarLoop]: 251 mSDtfsCounter, 3998 mSDsluCounter, 1114 mSDsCounter, 0 mSdLazyCounter, 8900 mSolverCounterSat, 3833 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3998 SdHoareTripleChecker+Valid, 1365 SdHoareTripleChecker+Invalid, 12733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3833 IncrementalHoareTripleChecker+Valid, 8900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:22:56,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3998 Valid, 1365 Invalid, 12733 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3833 Valid, 8900 Invalid, 0 Unknown, 0 Unchecked, 9.1s Time] [2023-11-29 04:22:56,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 04:22:56,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 04:22:56,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:56,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 04:22:56,266 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 201 [2023-11-29 04:22:56,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:22:56,267 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 04:22:56,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.818181818181818) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (36), 9 states have call predecessors, (36), 2 states have return successors, (32), 2 states have call predecessors, (32), 1 states have call successors, (32) [2023-11-29 04:22:56,267 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 04:22:56,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 04:22:56,270 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (28 of 29 remaining) [2023-11-29 04:22:56,270 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (27 of 29 remaining) [2023-11-29 04:22:56,270 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (26 of 29 remaining) [2023-11-29 04:22:56,270 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (25 of 29 remaining) [2023-11-29 04:22:56,271 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (24 of 29 remaining) [2023-11-29 04:22:56,271 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_kernel_module_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (23 of 29 remaining) [2023-11-29 04:22:56,271 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_net_sock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (22 of 29 remaining) [2023-11-29 04:22:56,271 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (21 of 29 remaining) [2023-11-29 04:22:56,271 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (20 of 29 remaining) [2023-11-29 04:22:56,271 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (19 of 29 remaining) [2023-11-29 04:22:56,271 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_net_rtnetlink_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (18 of 29 remaining) [2023-11-29 04:22:56,271 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (17 of 29 remaining) [2023-11-29 04:22:56,272 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (16 of 29 remaining) [2023-11-29 04:22:56,272 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (15 of 29 remaining) [2023-11-29 04:22:56,272 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (14 of 29 remaining) [2023-11-29 04:22:56,272 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_block_genhd_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (13 of 29 remaining) [2023-11-29 04:22:56,272 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_usb_urb_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (12 of 29 remaining) [2023-11-29 04:22:56,272 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION (11 of 29 remaining) [2023-11-29 04:22:56,272 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_check_alloc_flagsErr1ASSERT_VIOLATIONERROR_FUNCTION (10 of 29 remaining) [2023-11-29 04:22:56,272 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_kernel_locking_rwlock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (9 of 29 remaining) [2023-11-29 04:22:56,273 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION (8 of 29 remaining) [2023-11-29 04:22:56,273 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (7 of 29 remaining) [2023-11-29 04:22:56,273 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_lib_idr_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 29 remaining) [2023-11-29 04:22:56,273 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 29 remaining) [2023-11-29 04:22:56,273 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_kernel_rcu_srcu_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 29 remaining) [2023-11-29 04:22:56,273 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 29 remaining) [2023-11-29 04:22:56,273 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 29 remaining) [2023-11-29 04:22:56,273 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 29 remaining) [2023-11-29 04:22:56,273 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 29 remaining) [2023-11-29 04:22:56,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-11-29 04:22:56,275 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-29 04:23:58,252 WARN L293 SmtUtils]: Spent 1.02m on a formula simplification. DAG size of input: 126 DAG size of output: 119 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-29 04:24:57,438 WARN L293 SmtUtils]: Spent 59.19s on a formula simplification. DAG size of input: 126 DAG size of output: 122 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-29 04:25:56,908 WARN L293 SmtUtils]: Spent 59.47s on a formula simplification. DAG size of input: 126 DAG size of output: 123 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-29 04:26:51,768 WARN L293 SmtUtils]: Spent 54.86s on a formula simplification. DAG size of input: 124 DAG size of output: 120 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-29 04:27:46,624 WARN L293 SmtUtils]: Spent 54.86s on a formula simplification. DAG size of input: 124 DAG size of output: 120 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-29 04:28:25,003 WARN L293 SmtUtils]: Spent 26.87s on a formula simplification. DAG size of input: 119 DAG size of output: 108 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or)