./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--class--cdc-wdm.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 6fbcf05da5228307460c10a1ab2d8431ff74359811f7e2c9b55e8eaa9db8f14c --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 15:42:12,775 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 15:42:12,778 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 15:42:12,814 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 15:42:12,814 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 15:42:12,816 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 15:42:12,820 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 15:42:12,822 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 15:42:12,824 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 15:42:12,828 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 15:42:12,830 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 15:42:12,831 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 15:42:12,831 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 15:42:12,832 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 15:42:12,833 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 15:42:12,836 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 15:42:12,837 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 15:42:12,838 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 15:42:12,840 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 15:42:12,847 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 15:42:12,849 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 15:42:12,850 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 15:42:12,852 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 15:42:12,852 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 15:42:12,854 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 15:42:12,860 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 15:42:12,860 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 15:42:12,860 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 15:42:12,861 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 15:42:12,861 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 15:42:12,862 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 15:42:12,862 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 15:42:12,864 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 15:42:12,864 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 15:42:12,865 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 15:42:12,866 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 15:42:12,866 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 15:42:12,867 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 15:42:12,867 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 15:42:12,867 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 15:42:12,868 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 15:42:12,869 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 15:42:12,877 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-21 15:42:12,911 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 15:42:12,912 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 15:42:12,912 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 15:42:12,913 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 15:42:12,913 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 15:42:12,913 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 15:42:12,914 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 15:42:12,914 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 15:42:12,914 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 15:42:12,915 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 15:42:12,916 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 15:42:12,916 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 15:42:12,916 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 15:42:12,916 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 15:42:12,916 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 15:42:12,916 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 15:42:12,917 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 15:42:12,917 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 15:42:12,917 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 15:42:12,917 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 15:42:12,917 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 15:42:12,918 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 15:42:12,918 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 15:42:12,918 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 15:42:12,918 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 15:42:12,918 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 15:42:12,918 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 15:42:12,919 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 15:42:12,919 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 15:42:12,919 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 15:42:12,919 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6fbcf05da5228307460c10a1ab2d8431ff74359811f7e2c9b55e8eaa9db8f14c [2022-07-21 15:42:13,229 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 15:42:13,264 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 15:42:13,266 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 15:42:13,267 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 15:42:13,269 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 15:42:13,270 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i [2022-07-21 15:42:13,315 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e3d1157e/796a68ef533a4eb485b253e54bd24a69/FLAG1e1d1ccd5 [2022-07-21 15:42:13,969 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 15:42:13,970 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i [2022-07-21 15:42:14,001 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e3d1157e/796a68ef533a4eb485b253e54bd24a69/FLAG1e1d1ccd5 [2022-07-21 15:42:14,345 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e3d1157e/796a68ef533a4eb485b253e54bd24a69 [2022-07-21 15:42:14,348 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 15:42:14,349 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 15:42:14,350 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 15:42:14,350 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 15:42:14,353 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 15:42:14,354 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 03:42:14" (1/1) ... [2022-07-21 15:42:14,355 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17611c9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:42:14, skipping insertion in model container [2022-07-21 15:42:14,355 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 03:42:14" (1/1) ... [2022-07-21 15:42:14,360 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 15:42:14,489 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 15:42:16,843 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[307309,307322] [2022-07-21 15:42:16,846 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[307454,307467] [2022-07-21 15:42:16,847 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[307600,307613] [2022-07-21 15:42:16,848 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[307765,307778] [2022-07-21 15:42:16,848 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[307923,307936] [2022-07-21 15:42:16,848 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308081,308094] [2022-07-21 15:42:16,849 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308239,308252] [2022-07-21 15:42:16,849 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308399,308412] [2022-07-21 15:42:16,849 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308558,308571] [2022-07-21 15:42:16,850 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308697,308710] [2022-07-21 15:42:16,850 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308839,308852] [2022-07-21 15:42:16,850 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308988,309001] [2022-07-21 15:42:16,851 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[309127,309140] [2022-07-21 15:42:16,851 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[309282,309295] [2022-07-21 15:42:16,851 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[309442,309455] [2022-07-21 15:42:16,852 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[309593,309606] [2022-07-21 15:42:16,852 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[309744,309757] [2022-07-21 15:42:16,852 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[309896,309909] [2022-07-21 15:42:16,853 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310045,310058] [2022-07-21 15:42:16,853 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310193,310206] [2022-07-21 15:42:16,853 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310350,310363] [2022-07-21 15:42:16,854 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310499,310512] [2022-07-21 15:42:16,854 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310655,310668] [2022-07-21 15:42:16,854 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310808,310821] [2022-07-21 15:42:16,855 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310954,310967] [2022-07-21 15:42:16,855 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[311097,311110] [2022-07-21 15:42:16,855 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[311249,311262] [2022-07-21 15:42:16,856 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[311395,311408] [2022-07-21 15:42:16,856 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[311540,311553] [2022-07-21 15:42:16,856 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[311694,311707] [2022-07-21 15:42:16,857 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[311845,311858] [2022-07-21 15:42:16,857 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312000,312013] [2022-07-21 15:42:16,857 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312152,312165] [2022-07-21 15:42:16,858 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312307,312320] [2022-07-21 15:42:16,858 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312471,312484] [2022-07-21 15:42:16,858 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312627,312640] [2022-07-21 15:42:16,859 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312791,312804] [2022-07-21 15:42:16,859 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312933,312946] [2022-07-21 15:42:16,859 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[313091,313104] [2022-07-21 15:42:16,860 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[313258,313271] [2022-07-21 15:42:16,860 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[313417,313430] [2022-07-21 15:42:16,860 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[313576,313589] [2022-07-21 15:42:16,861 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[313725,313738] [2022-07-21 15:42:16,861 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[313872,313885] [2022-07-21 15:42:16,861 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[314011,314024] [2022-07-21 15:42:16,862 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[314174,314187] [2022-07-21 15:42:16,862 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[314340,314353] [2022-07-21 15:42:16,862 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[314504,314517] [2022-07-21 15:42:16,862 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[314669,314682] [2022-07-21 15:42:16,863 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[314834,314847] [2022-07-21 15:42:16,863 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315000,315013] [2022-07-21 15:42:16,863 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315165,315178] [2022-07-21 15:42:16,864 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315332,315345] [2022-07-21 15:42:16,864 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315492,315505] [2022-07-21 15:42:16,864 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315654,315667] [2022-07-21 15:42:16,865 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315813,315826] [2022-07-21 15:42:16,865 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315959,315972] [2022-07-21 15:42:16,865 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316102,316115] [2022-07-21 15:42:16,866 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316246,316259] [2022-07-21 15:42:16,866 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316389,316402] [2022-07-21 15:42:16,866 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316533,316546] [2022-07-21 15:42:16,866 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316674,316687] [2022-07-21 15:42:16,867 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316812,316825] [2022-07-21 15:42:16,867 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316970,316983] [2022-07-21 15:42:16,867 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[317129,317142] [2022-07-21 15:42:16,868 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[317285,317298] [2022-07-21 15:42:16,868 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[317434,317447] [2022-07-21 15:42:16,868 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[317586,317599] [2022-07-21 15:42:16,869 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[317737,317750] [2022-07-21 15:42:16,869 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[317886,317899] [2022-07-21 15:42:16,869 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318038,318051] [2022-07-21 15:42:16,870 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318186,318199] [2022-07-21 15:42:16,870 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318339,318352] [2022-07-21 15:42:16,870 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318490,318503] [2022-07-21 15:42:16,871 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318640,318653] [2022-07-21 15:42:16,871 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318787,318800] [2022-07-21 15:42:16,871 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318938,318951] [2022-07-21 15:42:16,872 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[319089,319102] [2022-07-21 15:42:16,872 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[319237,319250] [2022-07-21 15:42:16,872 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[319403,319416] [2022-07-21 15:42:16,873 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[319572,319585] [2022-07-21 15:42:16,873 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[319739,319752] [2022-07-21 15:42:16,873 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[319907,319920] [2022-07-21 15:42:16,874 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[320057,320070] [2022-07-21 15:42:16,874 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[320204,320217] [2022-07-21 15:42:16,874 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[320365,320378] [2022-07-21 15:42:16,875 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[320535,320548] [2022-07-21 15:42:16,875 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[320697,320710] [2022-07-21 15:42:16,884 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 15:42:16,905 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 15:42:17,146 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[307309,307322] [2022-07-21 15:42:17,147 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[307454,307467] [2022-07-21 15:42:17,148 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[307600,307613] [2022-07-21 15:42:17,148 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[307765,307778] [2022-07-21 15:42:17,149 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[307923,307936] [2022-07-21 15:42:17,152 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308081,308094] [2022-07-21 15:42:17,152 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308239,308252] [2022-07-21 15:42:17,152 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308399,308412] [2022-07-21 15:42:17,153 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308558,308571] [2022-07-21 15:42:17,153 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308697,308710] [2022-07-21 15:42:17,154 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308839,308852] [2022-07-21 15:42:17,154 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308988,309001] [2022-07-21 15:42:17,154 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[309127,309140] [2022-07-21 15:42:17,155 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[309282,309295] [2022-07-21 15:42:17,155 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[309442,309455] [2022-07-21 15:42:17,155 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[309593,309606] [2022-07-21 15:42:17,155 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[309744,309757] [2022-07-21 15:42:17,156 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[309896,309909] [2022-07-21 15:42:17,156 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310045,310058] [2022-07-21 15:42:17,156 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310193,310206] [2022-07-21 15:42:17,157 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310350,310363] [2022-07-21 15:42:17,157 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310499,310512] [2022-07-21 15:42:17,157 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310655,310668] [2022-07-21 15:42:17,157 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310808,310821] [2022-07-21 15:42:17,158 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310954,310967] [2022-07-21 15:42:17,159 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[311097,311110] [2022-07-21 15:42:17,159 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[311249,311262] [2022-07-21 15:42:17,159 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[311395,311408] [2022-07-21 15:42:17,160 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[311540,311553] [2022-07-21 15:42:17,160 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[311694,311707] [2022-07-21 15:42:17,160 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[311845,311858] [2022-07-21 15:42:17,161 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312000,312013] [2022-07-21 15:42:17,161 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312152,312165] [2022-07-21 15:42:17,161 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312307,312320] [2022-07-21 15:42:17,162 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312471,312484] [2022-07-21 15:42:17,162 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312627,312640] [2022-07-21 15:42:17,162 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312791,312804] [2022-07-21 15:42:17,165 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312933,312946] [2022-07-21 15:42:17,165 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[313091,313104] [2022-07-21 15:42:17,166 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[313258,313271] [2022-07-21 15:42:17,167 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[313417,313430] [2022-07-21 15:42:17,167 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[313576,313589] [2022-07-21 15:42:17,167 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[313725,313738] [2022-07-21 15:42:17,167 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[313872,313885] [2022-07-21 15:42:17,168 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[314011,314024] [2022-07-21 15:42:17,168 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[314174,314187] [2022-07-21 15:42:17,168 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[314340,314353] [2022-07-21 15:42:17,169 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[314504,314517] [2022-07-21 15:42:17,169 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[314669,314682] [2022-07-21 15:42:17,169 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[314834,314847] [2022-07-21 15:42:17,170 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315000,315013] [2022-07-21 15:42:17,170 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315165,315178] [2022-07-21 15:42:17,170 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315332,315345] [2022-07-21 15:42:17,171 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315492,315505] [2022-07-21 15:42:17,171 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315654,315667] [2022-07-21 15:42:17,172 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315813,315826] [2022-07-21 15:42:17,172 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315959,315972] [2022-07-21 15:42:17,172 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316102,316115] [2022-07-21 15:42:17,173 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316246,316259] [2022-07-21 15:42:17,173 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316389,316402] [2022-07-21 15:42:17,173 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316533,316546] [2022-07-21 15:42:17,174 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316674,316687] [2022-07-21 15:42:17,175 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316812,316825] [2022-07-21 15:42:17,177 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316970,316983] [2022-07-21 15:42:17,177 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[317129,317142] [2022-07-21 15:42:17,177 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[317285,317298] [2022-07-21 15:42:17,178 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[317434,317447] [2022-07-21 15:42:17,178 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[317586,317599] [2022-07-21 15:42:17,181 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[317737,317750] [2022-07-21 15:42:17,182 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[317886,317899] [2022-07-21 15:42:17,182 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318038,318051] [2022-07-21 15:42:17,182 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318186,318199] [2022-07-21 15:42:17,186 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318339,318352] [2022-07-21 15:42:17,186 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318490,318503] [2022-07-21 15:42:17,186 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318640,318653] [2022-07-21 15:42:17,187 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318787,318800] [2022-07-21 15:42:17,187 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318938,318951] [2022-07-21 15:42:17,188 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[319089,319102] [2022-07-21 15:42:17,188 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[319237,319250] [2022-07-21 15:42:17,189 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[319403,319416] [2022-07-21 15:42:17,189 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[319572,319585] [2022-07-21 15:42:17,190 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[319739,319752] [2022-07-21 15:42:17,190 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[319907,319920] [2022-07-21 15:42:17,190 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[320057,320070] [2022-07-21 15:42:17,191 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[320204,320217] [2022-07-21 15:42:17,191 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[320365,320378] [2022-07-21 15:42:17,191 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[320535,320548] [2022-07-21 15:42:17,191 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[320697,320710] [2022-07-21 15:42:17,194 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 15:42:17,325 INFO L208 MainTranslator]: Completed translation [2022-07-21 15:42:17,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:42:17 WrapperNode [2022-07-21 15:42:17,325 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 15:42:17,326 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 15:42:17,326 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 15:42:17,326 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 15:42:17,330 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:42:17" (1/1) ... [2022-07-21 15:42:17,410 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:42:17" (1/1) ... [2022-07-21 15:42:17,529 INFO L137 Inliner]: procedures = 592, calls = 1771, calls flagged for inlining = 263, calls inlined = 169, statements flattened = 3189 [2022-07-21 15:42:17,530 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 15:42:17,530 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 15:42:17,530 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 15:42:17,531 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 15:42:17,536 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:42:17" (1/1) ... [2022-07-21 15:42:17,536 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:42:17" (1/1) ... [2022-07-21 15:42:17,550 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:42:17" (1/1) ... [2022-07-21 15:42:17,551 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:42:17" (1/1) ... [2022-07-21 15:42:17,629 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:42:17" (1/1) ... [2022-07-21 15:42:17,645 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:42:17" (1/1) ... [2022-07-21 15:42:17,664 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:42:17" (1/1) ... [2022-07-21 15:42:17,685 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 15:42:17,687 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 15:42:17,687 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 15:42:17,687 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 15:42:17,687 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:42:17" (1/1) ... [2022-07-21 15:42:17,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 15:42:17,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 15:42:17,720 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-21 15:42:17,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-21 15:42:17,752 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-07-21 15:42:17,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-07-21 15:42:17,752 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-21 15:42:17,752 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-21 15:42:17,752 INFO L130 BoogieDeclarations]: Found specification of procedure recover_from_urb_loss [2022-07-21 15:42:17,752 INFO L138 BoogieDeclarations]: Found implementation of procedure recover_from_urb_loss [2022-07-21 15:42:17,753 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_control_urb [2022-07-21 15:42:17,753 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_control_urb [2022-07-21 15:42:17,753 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-21 15:42:17,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-21 15:42:17,753 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-21 15:42:17,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-21 15:42:17,753 INFO L130 BoogieDeclarations]: Found specification of procedure __might_sleep [2022-07-21 15:42:17,753 INFO L138 BoogieDeclarations]: Found implementation of procedure __might_sleep [2022-07-21 15:42:17,753 INFO L130 BoogieDeclarations]: Found specification of procedure usb_autopm_get_interface [2022-07-21 15:42:17,753 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_autopm_get_interface [2022-07-21 15:42:17,754 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-21 15:42:17,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-21 15:42:17,755 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-07-21 15:42:17,755 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-07-21 15:42:17,755 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-07-21 15:42:17,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-07-21 15:42:17,755 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-07-21 15:42:17,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-07-21 15:42:17,755 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_ioctl [2022-07-21 15:42:17,755 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_ioctl [2022-07-21 15:42:17,755 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-21 15:42:17,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-21 15:42:17,756 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_iuspin_of_wdm_device [2022-07-21 15:42:17,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_iuspin_of_wdm_device [2022-07-21 15:42:17,756 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-21 15:42:17,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-21 15:42:17,756 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-07-21 15:42:17,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-07-21 15:42:17,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 15:42:17,756 INFO L130 BoogieDeclarations]: Found specification of procedure cancel_work_sync [2022-07-21 15:42:17,756 INFO L138 BoogieDeclarations]: Found implementation of procedure cancel_work_sync [2022-07-21 15:42:17,757 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2022-07-21 15:42:17,757 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2022-07-21 15:42:17,757 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-07-21 15:42:17,757 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-07-21 15:42:17,757 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-07-21 15:42:17,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-07-21 15:42:17,757 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2022-07-21 15:42:17,757 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2022-07-21 15:42:17,757 INFO L130 BoogieDeclarations]: Found specification of procedure schedule [2022-07-21 15:42:17,757 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule [2022-07-21 15:42:17,758 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2022-07-21 15:42:17,758 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2022-07-21 15:42:17,758 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~TO~int [2022-07-21 15:42:17,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~TO~int [2022-07-21 15:42:17,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-21 15:42:17,758 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2022-07-21 15:42:17,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2022-07-21 15:42:17,758 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-21 15:42:17,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-21 15:42:17,759 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irq_111 [2022-07-21 15:42:17,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irq_111 [2022-07-21 15:42:17,759 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-21 15:42:17,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-21 15:42:17,759 INFO L130 BoogieDeclarations]: Found specification of procedure usb_autopm_put_interface [2022-07-21 15:42:17,759 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_autopm_put_interface [2022-07-21 15:42:17,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 15:42:17,759 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-07-21 15:42:17,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-07-21 15:42:17,760 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2022-07-21 15:42:17,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2022-07-21 15:42:17,760 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-07-21 15:42:17,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-07-21 15:42:17,760 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-07-21 15:42:17,760 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-07-21 15:42:17,761 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_wlock_of_wdm_device [2022-07-21 15:42:17,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_wlock_of_wdm_device [2022-07-21 15:42:17,763 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-07-21 15:42:17,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-07-21 15:42:17,763 INFO L130 BoogieDeclarations]: Found specification of procedure kill_urbs [2022-07-21 15:42:17,763 INFO L138 BoogieDeclarations]: Found implementation of procedure kill_urbs [2022-07-21 15:42:17,763 INFO L130 BoogieDeclarations]: Found specification of procedure prepare_to_wait_event [2022-07-21 15:42:17,763 INFO L138 BoogieDeclarations]: Found implementation of procedure prepare_to_wait_event [2022-07-21 15:42:17,764 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-07-21 15:42:17,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-07-21 15:42:17,765 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2022-07-21 15:42:17,765 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2022-07-21 15:42:17,765 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-21 15:42:17,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-21 15:42:17,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 15:42:17,765 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_iuspin_of_wdm_device [2022-07-21 15:42:17,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_iuspin_of_wdm_device [2022-07-21 15:42:17,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 15:42:17,765 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-21 15:42:17,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-21 15:42:17,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 15:42:17,766 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2022-07-21 15:42:17,766 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2022-07-21 15:42:17,766 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2022-07-21 15:42:17,766 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2022-07-21 15:42:17,766 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_irq_check_alloc_flags [2022-07-21 15:42:17,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_irq_check_alloc_flags [2022-07-21 15:42:17,766 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-07-21 15:42:17,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-07-21 15:42:17,766 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_find_device [2022-07-21 15:42:17,766 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_find_device [2022-07-21 15:42:17,767 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2022-07-21 15:42:17,767 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2022-07-21 15:42:17,767 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2022-07-21 15:42:17,767 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2022-07-21 15:42:17,767 INFO L130 BoogieDeclarations]: Found specification of procedure finish_wait [2022-07-21 15:42:17,767 INFO L138 BoogieDeclarations]: Found implementation of procedure finish_wait [2022-07-21 15:42:17,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 15:42:17,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 15:42:17,767 INFO L130 BoogieDeclarations]: Found specification of procedure usb_translate_errors [2022-07-21 15:42:17,767 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_translate_errors [2022-07-21 15:42:17,768 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-21 15:42:17,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-21 15:42:17,768 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-21 15:42:17,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-21 15:42:17,768 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_create [2022-07-21 15:42:17,768 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_create [2022-07-21 15:42:17,768 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_128 [2022-07-21 15:42:17,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_128 [2022-07-21 15:42:17,769 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-07-21 15:42:17,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-07-21 15:42:17,769 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_free_urb [2022-07-21 15:42:17,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_free_urb [2022-07-21 15:42:17,769 INFO L130 BoogieDeclarations]: Found specification of procedure clear_wdm_read_flag [2022-07-21 15:42:17,769 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_wdm_read_flag [2022-07-21 15:42:17,769 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-07-21 15:42:17,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-07-21 15:42:17,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 15:42:17,770 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2022-07-21 15:42:17,770 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2022-07-21 15:42:17,770 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-21 15:42:17,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-21 15:42:17,770 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_disconnect [2022-07-21 15:42:17,770 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_disconnect [2022-07-21 15:42:17,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 15:42:17,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-21 15:42:17,770 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_wdm_mutex [2022-07-21 15:42:17,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_wdm_mutex [2022-07-21 15:42:17,770 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-07-21 15:42:17,771 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-07-21 15:42:17,771 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2022-07-21 15:42:17,771 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2022-07-21 15:42:17,771 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-21 15:42:17,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-21 15:42:17,771 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_rlock_of_wdm_device [2022-07-21 15:42:17,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_rlock_of_wdm_device [2022-07-21 15:42:17,771 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-21 15:42:17,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-21 15:42:17,771 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-21 15:42:17,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-21 15:42:17,772 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2022-07-21 15:42:17,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2022-07-21 15:42:17,813 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_alloc_urb [2022-07-21 15:42:17,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_alloc_urb [2022-07-21 15:42:17,814 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-21 15:42:17,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-21 15:42:17,814 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-21 15:42:17,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-21 15:42:17,814 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-07-21 15:42:17,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-07-21 15:42:17,814 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2022-07-21 15:42:17,815 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2022-07-21 15:42:17,815 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-21 15:42:17,815 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-21 15:42:17,815 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-07-21 15:42:17,815 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-07-21 15:42:17,815 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_wdm_mutex [2022-07-21 15:42:17,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_wdm_mutex [2022-07-21 15:42:17,815 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-21 15:42:17,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-21 15:42:17,815 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-21 15:42:17,815 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-21 15:42:17,816 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-21 15:42:17,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-21 15:42:17,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 15:42:17,816 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-21 15:42:17,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-21 15:42:17,816 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-21 15:42:17,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-21 15:42:17,816 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_95 [2022-07-21 15:42:17,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_95 [2022-07-21 15:42:17,816 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_resume [2022-07-21 15:42:17,817 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_resume [2022-07-21 15:42:17,817 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-21 15:42:17,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-21 15:42:17,817 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_96 [2022-07-21 15:42:17,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_96 [2022-07-21 15:42:17,817 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_rlock_of_wdm_device [2022-07-21 15:42:17,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_rlock_of_wdm_device [2022-07-21 15:42:17,817 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2022-07-21 15:42:17,817 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2022-07-21 15:42:17,817 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-21 15:42:17,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-21 15:42:17,818 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-21 15:42:17,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-21 15:42:17,818 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2022-07-21 15:42:17,818 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2022-07-21 15:42:17,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 15:42:17,818 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_wlock_of_wdm_device [2022-07-21 15:42:17,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_wlock_of_wdm_device [2022-07-21 15:42:17,818 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_irq_110 [2022-07-21 15:42:17,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_irq_110 [2022-07-21 15:42:18,218 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 15:42:18,220 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 15:42:18,307 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-21 15:42:20,886 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 15:42:20,897 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 15:42:20,897 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-21 15:42:20,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 03:42:20 BoogieIcfgContainer [2022-07-21 15:42:20,900 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 15:42:20,901 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 15:42:20,901 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 15:42:20,903 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 15:42:20,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 03:42:14" (1/3) ... [2022-07-21 15:42:20,904 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69f160e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 03:42:20, skipping insertion in model container [2022-07-21 15:42:20,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:42:17" (2/3) ... [2022-07-21 15:42:20,904 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69f160e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 03:42:20, skipping insertion in model container [2022-07-21 15:42:20,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 03:42:20" (3/3) ... [2022-07-21 15:42:20,905 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i [2022-07-21 15:42:20,915 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 15:42:20,915 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2022-07-21 15:42:20,961 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 15:42:20,965 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=LoopsAndPotentialCycles, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2a7214a6, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6862b338 [2022-07-21 15:42:20,966 INFO L358 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2022-07-21 15:42:20,972 INFO L276 IsEmpty]: Start isEmpty. Operand has 1351 states, 842 states have (on average 1.2541567695961995) internal successors, (1056), 894 states have internal predecessors, (1056), 384 states have call successors, (384), 95 states have call predecessors, (384), 94 states have return successors, (379), 377 states have call predecessors, (379), 379 states have call successors, (379) [2022-07-21 15:42:20,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-21 15:42:20,979 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:42:20,980 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:42:20,980 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:42:20,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:42:20,984 INFO L85 PathProgramCache]: Analyzing trace with hash 975260104, now seen corresponding path program 1 times [2022-07-21 15:42:20,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:42:20,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110574317] [2022-07-21 15:42:20,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:42:20,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:42:21,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:21,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:42:21,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:21,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:42:21,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:21,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:42:21,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:21,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:42:21,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:21,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:42:21,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:21,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:42:21,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:21,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 15:42:21,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:21,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:42:21,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:21,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 15:42:21,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:21,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 15:42:21,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:21,490 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-21 15:42:21,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:42:21,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110574317] [2022-07-21 15:42:21,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110574317] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:42:21,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:42:21,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:42:21,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434243130] [2022-07-21 15:42:21,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:42:21,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:42:21,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:42:21,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:42:21,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:42:21,525 INFO L87 Difference]: Start difference. First operand has 1351 states, 842 states have (on average 1.2541567695961995) internal successors, (1056), 894 states have internal predecessors, (1056), 384 states have call successors, (384), 95 states have call predecessors, (384), 94 states have return successors, (379), 377 states have call predecessors, (379), 379 states have call successors, (379) Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-21 15:42:24,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:42:24,348 INFO L93 Difference]: Finished difference Result 2639 states and 3702 transitions. [2022-07-21 15:42:24,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:42:24,350 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 71 [2022-07-21 15:42:24,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:42:24,370 INFO L225 Difference]: With dead ends: 2639 [2022-07-21 15:42:24,370 INFO L226 Difference]: Without dead ends: 1333 [2022-07-21 15:42:24,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:42:24,380 INFO L413 NwaCegarLoop]: 1643 mSDtfsCounter, 2296 mSDsluCounter, 1708 mSDsCounter, 0 mSdLazyCounter, 1673 mSolverCounterSat, 1298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2533 SdHoareTripleChecker+Valid, 3351 SdHoareTripleChecker+Invalid, 2971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1298 IncrementalHoareTripleChecker+Valid, 1673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-21 15:42:24,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2533 Valid, 3351 Invalid, 2971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1298 Valid, 1673 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-07-21 15:42:24,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1333 states. [2022-07-21 15:42:24,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1333 to 1333. [2022-07-21 15:42:24,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1333 states, 832 states have (on average 1.2067307692307692) internal successors, (1004), 879 states have internal predecessors, (1004), 379 states have call successors, (379), 94 states have call predecessors, (379), 93 states have return successors, (377), 375 states have call predecessors, (377), 377 states have call successors, (377) [2022-07-21 15:42:24,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 1760 transitions. [2022-07-21 15:42:24,528 INFO L78 Accepts]: Start accepts. Automaton has 1333 states and 1760 transitions. Word has length 71 [2022-07-21 15:42:24,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:42:24,531 INFO L495 AbstractCegarLoop]: Abstraction has 1333 states and 1760 transitions. [2022-07-21 15:42:24,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-21 15:42:24,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 1760 transitions. [2022-07-21 15:42:24,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-21 15:42:24,540 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:42:24,540 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:42:24,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 15:42:24,541 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_linux_block_genhd_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:42:24,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:42:24,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1189993464, now seen corresponding path program 1 times [2022-07-21 15:42:24,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:42:24,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130965980] [2022-07-21 15:42:24,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:42:24,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:42:24,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:24,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:42:24,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:24,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:42:24,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:24,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:42:24,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:24,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:42:24,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:24,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:42:24,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:24,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:42:24,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:24,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 15:42:24,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:24,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:42:24,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:24,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 15:42:24,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:24,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 15:42:24,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:24,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 15:42:24,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:24,807 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-21 15:42:24,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:42:24,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130965980] [2022-07-21 15:42:24,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130965980] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:42:24,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:42:24,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:42:24,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337374776] [2022-07-21 15:42:24,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:42:24,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:42:24,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:42:24,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:42:24,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:42:24,811 INFO L87 Difference]: Start difference. First operand 1333 states and 1760 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-21 15:42:27,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:42:27,388 INFO L93 Difference]: Finished difference Result 1333 states and 1760 transitions. [2022-07-21 15:42:27,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:42:27,388 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 77 [2022-07-21 15:42:27,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:42:27,396 INFO L225 Difference]: With dead ends: 1333 [2022-07-21 15:42:27,396 INFO L226 Difference]: Without dead ends: 1331 [2022-07-21 15:42:27,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:42:27,398 INFO L413 NwaCegarLoop]: 1623 mSDtfsCounter, 2262 mSDsluCounter, 1688 mSDsCounter, 0 mSdLazyCounter, 1659 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2496 SdHoareTripleChecker+Valid, 3311 SdHoareTripleChecker+Invalid, 2947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 1659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-21 15:42:27,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2496 Valid, 3311 Invalid, 2947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 1659 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-07-21 15:42:27,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2022-07-21 15:42:27,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 1331. [2022-07-21 15:42:27,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1331 states, 831 states have (on average 1.2057761732851986) internal successors, (1002), 877 states have internal predecessors, (1002), 379 states have call successors, (379), 94 states have call predecessors, (379), 93 states have return successors, (377), 375 states have call predecessors, (377), 377 states have call successors, (377) [2022-07-21 15:42:27,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 1758 transitions. [2022-07-21 15:42:27,451 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 1758 transitions. Word has length 77 [2022-07-21 15:42:27,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:42:27,452 INFO L495 AbstractCegarLoop]: Abstraction has 1331 states and 1758 transitions. [2022-07-21 15:42:27,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-21 15:42:27,452 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 1758 transitions. [2022-07-21 15:42:27,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-21 15:42:27,454 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:42:27,454 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:42:27,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 15:42:27,454 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:42:27,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:42:27,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1626433505, now seen corresponding path program 1 times [2022-07-21 15:42:27,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:42:27,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327271544] [2022-07-21 15:42:27,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:42:27,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:42:27,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:27,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:42:27,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:27,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:42:27,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:27,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:42:27,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:27,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:42:27,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:27,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:42:27,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:27,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:42:27,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:27,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 15:42:27,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:27,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:42:27,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:27,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 15:42:27,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:27,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 15:42:27,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:27,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 15:42:27,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:27,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 15:42:27,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:27,663 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-21 15:42:27,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:42:27,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327271544] [2022-07-21 15:42:27,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327271544] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:42:27,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:42:27,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:42:27,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497935202] [2022-07-21 15:42:27,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:42:27,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:42:27,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:42:27,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:42:27,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:42:27,666 INFO L87 Difference]: Start difference. First operand 1331 states and 1758 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-21 15:42:30,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:42:30,353 INFO L93 Difference]: Finished difference Result 1331 states and 1758 transitions. [2022-07-21 15:42:30,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:42:30,353 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 83 [2022-07-21 15:42:30,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:42:30,359 INFO L225 Difference]: With dead ends: 1331 [2022-07-21 15:42:30,359 INFO L226 Difference]: Without dead ends: 1329 [2022-07-21 15:42:30,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:42:30,360 INFO L413 NwaCegarLoop]: 1621 mSDtfsCounter, 2256 mSDsluCounter, 1688 mSDsCounter, 0 mSdLazyCounter, 1657 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2489 SdHoareTripleChecker+Valid, 3309 SdHoareTripleChecker+Invalid, 2945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 1657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-07-21 15:42:30,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2489 Valid, 3309 Invalid, 2945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 1657 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-07-21 15:42:30,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2022-07-21 15:42:30,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 1329. [2022-07-21 15:42:30,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1329 states, 830 states have (on average 1.2048192771084338) internal successors, (1000), 875 states have internal predecessors, (1000), 379 states have call successors, (379), 94 states have call predecessors, (379), 93 states have return successors, (377), 375 states have call predecessors, (377), 377 states have call successors, (377) [2022-07-21 15:42:30,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1329 states to 1329 states and 1756 transitions. [2022-07-21 15:42:30,400 INFO L78 Accepts]: Start accepts. Automaton has 1329 states and 1756 transitions. Word has length 83 [2022-07-21 15:42:30,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:42:30,401 INFO L495 AbstractCegarLoop]: Abstraction has 1329 states and 1756 transitions. [2022-07-21 15:42:30,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-21 15:42:30,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1329 states and 1756 transitions. [2022-07-21 15:42:30,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-21 15:42:30,403 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:42:30,403 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:42:30,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 15:42:30,403 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:42:30,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:42:30,404 INFO L85 PathProgramCache]: Analyzing trace with hash -586799079, now seen corresponding path program 1 times [2022-07-21 15:42:30,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:42:30,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341879786] [2022-07-21 15:42:30,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:42:30,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:42:30,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:30,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:42:30,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:30,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:42:30,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:30,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:42:30,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:30,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:42:30,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:30,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:42:30,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:30,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:42:30,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:30,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 15:42:30,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:30,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:42:30,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:30,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 15:42:30,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:30,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 15:42:30,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:30,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 15:42:30,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:30,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 15:42:30,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:30,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-21 15:42:30,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:30,606 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-21 15:42:30,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:42:30,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341879786] [2022-07-21 15:42:30,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341879786] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:42:30,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:42:30,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:42:30,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381557200] [2022-07-21 15:42:30,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:42:30,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:42:30,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:42:30,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:42:30,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:42:30,609 INFO L87 Difference]: Start difference. First operand 1329 states and 1756 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-21 15:42:33,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:42:33,035 INFO L93 Difference]: Finished difference Result 1329 states and 1756 transitions. [2022-07-21 15:42:33,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:42:33,035 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 89 [2022-07-21 15:42:33,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:42:33,044 INFO L225 Difference]: With dead ends: 1329 [2022-07-21 15:42:33,044 INFO L226 Difference]: Without dead ends: 1327 [2022-07-21 15:42:33,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:42:33,047 INFO L413 NwaCegarLoop]: 1619 mSDtfsCounter, 2250 mSDsluCounter, 1688 mSDsCounter, 0 mSdLazyCounter, 1655 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2482 SdHoareTripleChecker+Valid, 3307 SdHoareTripleChecker+Invalid, 2943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 1655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-21 15:42:33,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2482 Valid, 3307 Invalid, 2943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 1655 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-07-21 15:42:33,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1327 states. [2022-07-21 15:42:33,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1327 to 1327. [2022-07-21 15:42:33,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1327 states, 829 states have (on average 1.203860072376357) internal successors, (998), 873 states have internal predecessors, (998), 379 states have call successors, (379), 94 states have call predecessors, (379), 93 states have return successors, (377), 375 states have call predecessors, (377), 377 states have call successors, (377) [2022-07-21 15:42:33,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1327 states to 1327 states and 1754 transitions. [2022-07-21 15:42:33,089 INFO L78 Accepts]: Start accepts. Automaton has 1327 states and 1754 transitions. Word has length 89 [2022-07-21 15:42:33,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:42:33,090 INFO L495 AbstractCegarLoop]: Abstraction has 1327 states and 1754 transitions. [2022-07-21 15:42:33,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-21 15:42:33,090 INFO L276 IsEmpty]: Start isEmpty. Operand 1327 states and 1754 transitions. [2022-07-21 15:42:33,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-21 15:42:33,091 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:42:33,091 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:42:33,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 15:42:33,091 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:42:33,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:42:33,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1454441485, now seen corresponding path program 1 times [2022-07-21 15:42:33,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:42:33,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622701204] [2022-07-21 15:42:33,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:42:33,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:42:33,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:33,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:42:33,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:33,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:42:33,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:33,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:42:33,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:33,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:42:33,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:33,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:42:33,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:33,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:42:33,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:33,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 15:42:33,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:33,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:42:33,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:33,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 15:42:33,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:33,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 15:42:33,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:33,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 15:42:33,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:33,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 15:42:33,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:33,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-21 15:42:33,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:33,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 15:42:33,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:33,320 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-21 15:42:33,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:42:33,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622701204] [2022-07-21 15:42:33,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622701204] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:42:33,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:42:33,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:42:33,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829705414] [2022-07-21 15:42:33,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:42:33,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:42:33,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:42:33,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:42:33,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:42:33,322 INFO L87 Difference]: Start difference. First operand 1327 states and 1754 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-21 15:42:35,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:42:35,606 INFO L93 Difference]: Finished difference Result 1327 states and 1754 transitions. [2022-07-21 15:42:35,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:42:35,608 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 95 [2022-07-21 15:42:35,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:42:35,613 INFO L225 Difference]: With dead ends: 1327 [2022-07-21 15:42:35,613 INFO L226 Difference]: Without dead ends: 1325 [2022-07-21 15:42:35,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:42:35,614 INFO L413 NwaCegarLoop]: 1617 mSDtfsCounter, 2244 mSDsluCounter, 1688 mSDsCounter, 0 mSdLazyCounter, 1653 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2475 SdHoareTripleChecker+Valid, 3305 SdHoareTripleChecker+Invalid, 2941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 1653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-21 15:42:35,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2475 Valid, 3305 Invalid, 2941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 1653 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-07-21 15:42:35,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1325 states. [2022-07-21 15:42:35,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1325 to 1325. [2022-07-21 15:42:35,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1325 states, 828 states have (on average 1.2028985507246377) internal successors, (996), 871 states have internal predecessors, (996), 379 states have call successors, (379), 94 states have call predecessors, (379), 93 states have return successors, (377), 375 states have call predecessors, (377), 377 states have call successors, (377) [2022-07-21 15:42:35,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 1752 transitions. [2022-07-21 15:42:35,657 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 1752 transitions. Word has length 95 [2022-07-21 15:42:35,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:42:35,659 INFO L495 AbstractCegarLoop]: Abstraction has 1325 states and 1752 transitions. [2022-07-21 15:42:35,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-21 15:42:35,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 1752 transitions. [2022-07-21 15:42:35,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-21 15:42:35,660 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:42:35,660 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:42:35,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 15:42:35,660 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:42:35,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:42:35,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1693669281, now seen corresponding path program 1 times [2022-07-21 15:42:35,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:42:35,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783445115] [2022-07-21 15:42:35,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:42:35,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:42:35,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:35,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:42:35,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:35,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:42:35,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:35,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:42:35,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:35,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:42:35,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:35,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:42:35,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:35,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:42:35,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:35,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 15:42:35,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:35,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:42:35,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:35,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 15:42:35,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:35,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 15:42:35,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:35,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 15:42:35,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:35,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 15:42:35,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:35,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-21 15:42:35,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:35,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 15:42:35,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:35,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-21 15:42:35,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:35,850 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-21 15:42:35,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:42:35,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783445115] [2022-07-21 15:42:35,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783445115] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:42:35,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:42:35,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:42:35,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356981463] [2022-07-21 15:42:35,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:42:35,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:42:35,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:42:35,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:42:35,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:42:35,852 INFO L87 Difference]: Start difference. First operand 1325 states and 1752 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-21 15:42:38,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:42:38,706 INFO L93 Difference]: Finished difference Result 1325 states and 1752 transitions. [2022-07-21 15:42:38,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:42:38,707 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 101 [2022-07-21 15:42:38,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:42:38,712 INFO L225 Difference]: With dead ends: 1325 [2022-07-21 15:42:38,712 INFO L226 Difference]: Without dead ends: 1323 [2022-07-21 15:42:38,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:42:38,713 INFO L413 NwaCegarLoop]: 1615 mSDtfsCounter, 2238 mSDsluCounter, 1688 mSDsCounter, 0 mSdLazyCounter, 1651 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2468 SdHoareTripleChecker+Valid, 3303 SdHoareTripleChecker+Invalid, 2939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 1651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-07-21 15:42:38,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2468 Valid, 3303 Invalid, 2939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 1651 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-07-21 15:42:38,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2022-07-21 15:42:38,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 1323. [2022-07-21 15:42:38,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1323 states, 827 states have (on average 1.2019347037484884) internal successors, (994), 869 states have internal predecessors, (994), 379 states have call successors, (379), 94 states have call predecessors, (379), 93 states have return successors, (377), 375 states have call predecessors, (377), 377 states have call successors, (377) [2022-07-21 15:42:38,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1323 states to 1323 states and 1750 transitions. [2022-07-21 15:42:38,761 INFO L78 Accepts]: Start accepts. Automaton has 1323 states and 1750 transitions. Word has length 101 [2022-07-21 15:42:38,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:42:38,761 INFO L495 AbstractCegarLoop]: Abstraction has 1323 states and 1750 transitions. [2022-07-21 15:42:38,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-21 15:42:38,761 INFO L276 IsEmpty]: Start isEmpty. Operand 1323 states and 1750 transitions. [2022-07-21 15:42:38,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-21 15:42:38,762 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:42:38,763 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:42:38,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 15:42:38,763 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:42:38,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:42:38,763 INFO L85 PathProgramCache]: Analyzing trace with hash 203341486, now seen corresponding path program 1 times [2022-07-21 15:42:38,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:42:38,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903869519] [2022-07-21 15:42:38,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:42:38,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:42:38,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:38,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:42:38,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:38,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:42:38,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:38,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:42:38,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:38,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:42:38,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:38,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:42:38,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:38,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:42:38,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:38,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 15:42:38,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:38,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:42:38,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:38,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 15:42:38,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:38,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 15:42:38,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:38,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 15:42:38,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:38,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 15:42:38,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:38,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-21 15:42:38,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:38,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 15:42:38,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:38,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-21 15:42:38,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:38,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-21 15:42:38,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:38,974 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-21 15:42:38,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:42:38,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903869519] [2022-07-21 15:42:38,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903869519] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:42:38,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:42:38,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:42:38,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645970426] [2022-07-21 15:42:38,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:42:38,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:42:38,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:42:38,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:42:38,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:42:38,976 INFO L87 Difference]: Start difference. First operand 1323 states and 1750 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-21 15:42:41,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:42:41,470 INFO L93 Difference]: Finished difference Result 1323 states and 1750 transitions. [2022-07-21 15:42:41,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:42:41,471 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 107 [2022-07-21 15:42:41,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:42:41,476 INFO L225 Difference]: With dead ends: 1323 [2022-07-21 15:42:41,476 INFO L226 Difference]: Without dead ends: 1321 [2022-07-21 15:42:41,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:42:41,477 INFO L413 NwaCegarLoop]: 1613 mSDtfsCounter, 2232 mSDsluCounter, 1688 mSDsCounter, 0 mSdLazyCounter, 1649 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2461 SdHoareTripleChecker+Valid, 3301 SdHoareTripleChecker+Invalid, 2937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 1649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-21 15:42:41,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2461 Valid, 3301 Invalid, 2937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 1649 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-07-21 15:42:41,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2022-07-21 15:42:41,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 1321. [2022-07-21 15:42:41,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1321 states, 826 states have (on average 1.2009685230024214) internal successors, (992), 867 states have internal predecessors, (992), 379 states have call successors, (379), 94 states have call predecessors, (379), 93 states have return successors, (377), 375 states have call predecessors, (377), 377 states have call successors, (377) [2022-07-21 15:42:41,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1748 transitions. [2022-07-21 15:42:41,515 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1748 transitions. Word has length 107 [2022-07-21 15:42:41,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:42:41,515 INFO L495 AbstractCegarLoop]: Abstraction has 1321 states and 1748 transitions. [2022-07-21 15:42:41,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-21 15:42:41,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1748 transitions. [2022-07-21 15:42:41,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-07-21 15:42:41,517 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:42:41,517 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:42:41,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-21 15:42:41,517 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:42:41,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:42:41,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1038477238, now seen corresponding path program 1 times [2022-07-21 15:42:41,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:42:41,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047303412] [2022-07-21 15:42:41,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:42:41,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:42:41,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:41,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:42:41,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:41,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:42:41,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:41,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:42:41,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:41,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:42:41,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:41,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:42:41,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:41,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:42:41,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:41,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 15:42:41,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:41,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:42:41,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:41,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 15:42:41,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:41,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 15:42:41,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:41,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 15:42:41,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:41,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 15:42:41,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:41,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-21 15:42:41,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:41,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 15:42:41,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:41,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-21 15:42:41,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:41,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-21 15:42:41,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:41,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-21 15:42:41,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:41,687 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-21 15:42:41,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:42:41,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047303412] [2022-07-21 15:42:41,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047303412] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:42:41,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:42:41,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:42:41,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081078481] [2022-07-21 15:42:41,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:42:41,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:42:41,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:42:41,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:42:41,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:42:41,705 INFO L87 Difference]: Start difference. First operand 1321 states and 1748 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-21 15:42:44,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:42:44,145 INFO L93 Difference]: Finished difference Result 1321 states and 1748 transitions. [2022-07-21 15:42:44,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:42:44,146 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 113 [2022-07-21 15:42:44,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:42:44,152 INFO L225 Difference]: With dead ends: 1321 [2022-07-21 15:42:44,152 INFO L226 Difference]: Without dead ends: 1319 [2022-07-21 15:42:44,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:42:44,153 INFO L413 NwaCegarLoop]: 1611 mSDtfsCounter, 2230 mSDsluCounter, 1688 mSDsCounter, 0 mSdLazyCounter, 1643 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2458 SdHoareTripleChecker+Valid, 3299 SdHoareTripleChecker+Invalid, 2931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 1643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-21 15:42:44,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2458 Valid, 3299 Invalid, 2931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 1643 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-07-21 15:42:44,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2022-07-21 15:42:44,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1319. [2022-07-21 15:42:44,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1319 states, 825 states have (on average 1.2) internal successors, (990), 865 states have internal predecessors, (990), 379 states have call successors, (379), 94 states have call predecessors, (379), 93 states have return successors, (377), 375 states have call predecessors, (377), 377 states have call successors, (377) [2022-07-21 15:42:44,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1319 states and 1746 transitions. [2022-07-21 15:42:44,210 INFO L78 Accepts]: Start accepts. Automaton has 1319 states and 1746 transitions. Word has length 113 [2022-07-21 15:42:44,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:42:44,211 INFO L495 AbstractCegarLoop]: Abstraction has 1319 states and 1746 transitions. [2022-07-21 15:42:44,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-21 15:42:44,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 1746 transitions. [2022-07-21 15:42:44,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-07-21 15:42:44,214 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:42:44,214 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:42:44,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-21 15:42:44,215 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:42:44,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:42:44,216 INFO L85 PathProgramCache]: Analyzing trace with hash 470652601, now seen corresponding path program 1 times [2022-07-21 15:42:44,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:42:44,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701464772] [2022-07-21 15:42:44,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:42:44,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:42:44,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:44,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:42:44,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:44,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:42:44,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:44,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:42:44,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:44,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:42:44,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:44,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 15:42:44,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:44,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:42:44,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:44,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:42:44,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:44,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:42:44,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:44,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 15:42:44,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:44,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:42:44,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:44,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:42:44,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:44,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:42:44,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:44,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 15:42:44,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:44,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:42:44,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:44,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:42:44,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:44,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:42:44,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:44,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 15:42:44,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:44,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:42:44,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:44,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:42:44,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:44,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:42:44,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:44,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 15:42:44,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:44,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:42:44,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:44,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:42:44,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:44,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:42:44,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:44,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 15:42:44,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:44,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-21 15:42:44,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:44,509 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2022-07-21 15:42:44,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:42:44,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701464772] [2022-07-21 15:42:44,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701464772] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:42:44,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:42:44,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:42:44,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219869502] [2022-07-21 15:42:44,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:42:44,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:42:44,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:42:44,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:42:44,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:42:44,512 INFO L87 Difference]: Start difference. First operand 1319 states and 1746 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-21 15:42:47,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:42:47,393 INFO L93 Difference]: Finished difference Result 2452 states and 3227 transitions. [2022-07-21 15:42:47,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 15:42:47,394 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 155 [2022-07-21 15:42:47,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:42:47,427 INFO L225 Difference]: With dead ends: 2452 [2022-07-21 15:42:47,427 INFO L226 Difference]: Without dead ends: 1329 [2022-07-21 15:42:47,433 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-21 15:42:47,435 INFO L413 NwaCegarLoop]: 1355 mSDtfsCounter, 2602 mSDsluCounter, 1411 mSDsCounter, 0 mSdLazyCounter, 1394 mSolverCounterSat, 1770 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2842 SdHoareTripleChecker+Valid, 2766 SdHoareTripleChecker+Invalid, 3164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1770 IncrementalHoareTripleChecker+Valid, 1394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-07-21 15:42:47,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2842 Valid, 2766 Invalid, 3164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1770 Valid, 1394 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-07-21 15:42:47,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2022-07-21 15:42:47,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 1315. [2022-07-21 15:42:47,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1315 states, 822 states have (on average 1.1982968369829683) internal successors, (985), 861 states have internal predecessors, (985), 379 states have call successors, (379), 94 states have call predecessors, (379), 93 states have return successors, (377), 375 states have call predecessors, (377), 377 states have call successors, (377) [2022-07-21 15:42:47,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1315 states to 1315 states and 1741 transitions. [2022-07-21 15:42:47,533 INFO L78 Accepts]: Start accepts. Automaton has 1315 states and 1741 transitions. Word has length 155 [2022-07-21 15:42:47,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:42:47,534 INFO L495 AbstractCegarLoop]: Abstraction has 1315 states and 1741 transitions. [2022-07-21 15:42:47,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-21 15:42:47,534 INFO L276 IsEmpty]: Start isEmpty. Operand 1315 states and 1741 transitions. [2022-07-21 15:42:47,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-21 15:42:47,552 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:42:47,552 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:42:47,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-21 15:42:47,552 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:42:47,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:42:47,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1544345977, now seen corresponding path program 1 times [2022-07-21 15:42:47,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:42:47,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821065741] [2022-07-21 15:42:47,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:42:47,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:42:47,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:47,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:42:47,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:47,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:42:47,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:47,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:42:47,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:47,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:42:47,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:47,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:42:47,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:47,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:42:47,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:47,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 15:42:47,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:47,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:42:47,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:47,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 15:42:47,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:47,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 15:42:47,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:47,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 15:42:47,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:47,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 15:42:47,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:47,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-21 15:42:47,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:47,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 15:42:47,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:47,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-21 15:42:47,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:47,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-21 15:42:47,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:47,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-21 15:42:47,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:47,726 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-21 15:42:47,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:42:47,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821065741] [2022-07-21 15:42:47,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821065741] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:42:47,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:42:47,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:42:47,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038568632] [2022-07-21 15:42:47,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:42:47,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:42:47,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:42:47,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:42:47,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:42:47,728 INFO L87 Difference]: Start difference. First operand 1315 states and 1741 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-21 15:42:50,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:42:50,310 INFO L93 Difference]: Finished difference Result 1315 states and 1741 transitions. [2022-07-21 15:42:50,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:42:50,310 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 115 [2022-07-21 15:42:50,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:42:50,315 INFO L225 Difference]: With dead ends: 1315 [2022-07-21 15:42:50,315 INFO L226 Difference]: Without dead ends: 1313 [2022-07-21 15:42:50,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:42:50,316 INFO L413 NwaCegarLoop]: 1604 mSDtfsCounter, 2213 mSDsluCounter, 1674 mSDsCounter, 0 mSdLazyCounter, 1644 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2441 SdHoareTripleChecker+Valid, 3278 SdHoareTripleChecker+Invalid, 2932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 1644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-21 15:42:50,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2441 Valid, 3278 Invalid, 2932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 1644 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-07-21 15:42:50,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1313 states. [2022-07-21 15:42:50,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1313 to 1313. [2022-07-21 15:42:50,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1313 states, 821 states have (on average 1.197320341047503) internal successors, (983), 859 states have internal predecessors, (983), 379 states have call successors, (379), 94 states have call predecessors, (379), 93 states have return successors, (377), 375 states have call predecessors, (377), 377 states have call successors, (377) [2022-07-21 15:42:50,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1313 states to 1313 states and 1739 transitions. [2022-07-21 15:42:50,358 INFO L78 Accepts]: Start accepts. Automaton has 1313 states and 1739 transitions. Word has length 115 [2022-07-21 15:42:50,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:42:50,358 INFO L495 AbstractCegarLoop]: Abstraction has 1313 states and 1739 transitions. [2022-07-21 15:42:50,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-21 15:42:50,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1313 states and 1739 transitions. [2022-07-21 15:42:50,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-07-21 15:42:50,360 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:42:50,360 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2022-07-21 15:42:50,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-21 15:42:50,360 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:42:50,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:42:50,361 INFO L85 PathProgramCache]: Analyzing trace with hash 800072008, now seen corresponding path program 1 times [2022-07-21 15:42:50,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:42:50,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743923668] [2022-07-21 15:42:50,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:42:50,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:42:50,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:50,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:42:50,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:50,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:42:50,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:50,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:42:50,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:50,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:42:50,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:50,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 15:42:50,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:50,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:42:50,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:50,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:42:50,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:50,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:42:50,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:50,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 15:42:50,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:50,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:42:50,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:50,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:42:50,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:50,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:42:50,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:50,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 15:42:50,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:50,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:42:50,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:50,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:42:50,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:50,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:42:50,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:50,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 15:42:50,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:50,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:42:50,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:50,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:42:50,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:50,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:42:50,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:50,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 15:42:50,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:50,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:42:50,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:50,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:42:50,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:50,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:42:50,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:50,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 15:42:50,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:50,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-21 15:42:50,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:50,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-21 15:42:50,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:50,557 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2022-07-21 15:42:50,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:42:50,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743923668] [2022-07-21 15:42:50,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743923668] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 15:42:50,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479514321] [2022-07-21 15:42:50,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:42:50,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 15:42:50,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 15:42:50,560 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 15:42:50,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-21 15:42:51,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:51,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 2056 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 15:42:51,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 15:42:51,160 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2022-07-21 15:42:51,161 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 15:42:51,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479514321] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:42:51,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 15:42:51,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2022-07-21 15:42:51,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886134761] [2022-07-21 15:42:51,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:42:51,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 15:42:51,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:42:51,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 15:42:51,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:42:51,163 INFO L87 Difference]: Start difference. First operand 1313 states and 1739 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-21 15:42:51,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:42:51,231 INFO L93 Difference]: Finished difference Result 2479 states and 3255 transitions. [2022-07-21 15:42:51,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 15:42:51,232 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 161 [2022-07-21 15:42:51,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:42:51,239 INFO L225 Difference]: With dead ends: 2479 [2022-07-21 15:42:51,239 INFO L226 Difference]: Without dead ends: 1365 [2022-07-21 15:42:51,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:42:51,243 INFO L413 NwaCegarLoop]: 1798 mSDtfsCounter, 1717 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1717 SdHoareTripleChecker+Valid, 1865 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 15:42:51,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1717 Valid, 1865 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 15:42:51,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2022-07-21 15:42:51,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 1362. [2022-07-21 15:42:51,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1362 states, 850 states have (on average 1.1917647058823528) internal successors, (1013), 891 states have internal predecessors, (1013), 394 states have call successors, (394), 100 states have call predecessors, (394), 99 states have return successors, (392), 388 states have call predecessors, (392), 392 states have call successors, (392) [2022-07-21 15:42:51,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 1799 transitions. [2022-07-21 15:42:51,314 INFO L78 Accepts]: Start accepts. Automaton has 1362 states and 1799 transitions. Word has length 161 [2022-07-21 15:42:51,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:42:51,316 INFO L495 AbstractCegarLoop]: Abstraction has 1362 states and 1799 transitions. [2022-07-21 15:42:51,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-21 15:42:51,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 1799 transitions. [2022-07-21 15:42:51,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-21 15:42:51,318 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:42:51,318 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:42:51,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-21 15:42:51,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-21 15:42:51,540 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_linux_kernel_module_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:42:51,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:42:51,541 INFO L85 PathProgramCache]: Analyzing trace with hash 2087551557, now seen corresponding path program 1 times [2022-07-21 15:42:51,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:42:51,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260236952] [2022-07-21 15:42:51,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:42:51,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:42:51,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:51,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:42:51,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:51,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:42:51,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:51,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:42:51,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:51,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:42:51,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:51,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:42:51,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:51,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:42:51,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:51,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 15:42:51,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:51,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:42:51,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:51,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 15:42:51,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:51,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 15:42:51,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:51,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 15:42:51,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:51,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 15:42:51,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:51,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-21 15:42:51,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:51,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 15:42:51,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:51,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-21 15:42:51,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:51,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-21 15:42:51,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:51,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-21 15:42:51,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:51,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 15:42:51,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:51,706 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-21 15:42:51,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:42:51,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260236952] [2022-07-21 15:42:51,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260236952] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:42:51,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:42:51,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:42:51,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839739549] [2022-07-21 15:42:51,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:42:51,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:42:51,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:42:51,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:42:51,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:42:51,708 INFO L87 Difference]: Start difference. First operand 1362 states and 1799 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-21 15:42:54,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:42:54,495 INFO L93 Difference]: Finished difference Result 1362 states and 1799 transitions. [2022-07-21 15:42:54,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:42:54,495 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 121 [2022-07-21 15:42:54,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:42:54,500 INFO L225 Difference]: With dead ends: 1362 [2022-07-21 15:42:54,500 INFO L226 Difference]: Without dead ends: 1360 [2022-07-21 15:42:54,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:42:54,501 INFO L413 NwaCegarLoop]: 1597 mSDtfsCounter, 2204 mSDsluCounter, 1660 mSDsCounter, 0 mSdLazyCounter, 1641 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2431 SdHoareTripleChecker+Valid, 3257 SdHoareTripleChecker+Invalid, 2929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 1641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-07-21 15:42:54,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2431 Valid, 3257 Invalid, 2929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 1641 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-07-21 15:42:54,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2022-07-21 15:42:54,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 1360. [2022-07-21 15:42:54,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1360 states, 849 states have (on average 1.1908127208480566) internal successors, (1011), 889 states have internal predecessors, (1011), 394 states have call successors, (394), 100 states have call predecessors, (394), 99 states have return successors, (392), 388 states have call predecessors, (392), 392 states have call successors, (392) [2022-07-21 15:42:54,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 1797 transitions. [2022-07-21 15:42:54,620 INFO L78 Accepts]: Start accepts. Automaton has 1360 states and 1797 transitions. Word has length 121 [2022-07-21 15:42:54,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:42:54,620 INFO L495 AbstractCegarLoop]: Abstraction has 1360 states and 1797 transitions. [2022-07-21 15:42:54,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-21 15:42:54,621 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 1797 transitions. [2022-07-21 15:42:54,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-07-21 15:42:54,622 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:42:54,622 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:42:54,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-21 15:42:54,622 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:42:54,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:42:54,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1837786247, now seen corresponding path program 1 times [2022-07-21 15:42:54,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:42:54,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070044525] [2022-07-21 15:42:54,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:42:54,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:42:54,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:54,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:42:54,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:54,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:42:54,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:54,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:42:54,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:54,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:42:54,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:54,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:42:54,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:54,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:42:54,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:54,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 15:42:54,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:54,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:42:54,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:54,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 15:42:54,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:54,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 15:42:54,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:54,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:42:54,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:54,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:42:54,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:54,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:42:54,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:54,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:42:54,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:54,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:42:54,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:54,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-21 15:42:54,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:54,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:42:54,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:54,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:42:54,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:54,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:42:54,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:54,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-21 15:42:54,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:54,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:42:54,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:54,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:42:54,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:54,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:42:54,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:54,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-21 15:42:54,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:54,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-21 15:42:54,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:54,843 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2022-07-21 15:42:54,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:42:54,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070044525] [2022-07-21 15:42:54,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070044525] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:42:54,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:42:54,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 15:42:54,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059888516] [2022-07-21 15:42:54,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:42:54,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 15:42:54,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:42:54,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 15:42:54,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 15:42:54,845 INFO L87 Difference]: Start difference. First operand 1360 states and 1797 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-21 15:42:59,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:42:59,304 INFO L93 Difference]: Finished difference Result 1593 states and 2040 transitions. [2022-07-21 15:42:59,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 15:42:59,304 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 153 [2022-07-21 15:42:59,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:42:59,311 INFO L225 Difference]: With dead ends: 1593 [2022-07-21 15:42:59,311 INFO L226 Difference]: Without dead ends: 1591 [2022-07-21 15:42:59,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2022-07-21 15:42:59,314 INFO L413 NwaCegarLoop]: 1663 mSDtfsCounter, 2718 mSDsluCounter, 2908 mSDsCounter, 0 mSdLazyCounter, 3744 mSolverCounterSat, 1881 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2922 SdHoareTripleChecker+Valid, 4571 SdHoareTripleChecker+Invalid, 5625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1881 IncrementalHoareTripleChecker+Valid, 3744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-21 15:42:59,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2922 Valid, 4571 Invalid, 5625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1881 Valid, 3744 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-07-21 15:42:59,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2022-07-21 15:42:59,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 1563. [2022-07-21 15:42:59,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1563 states, 981 states have (on average 1.17940876656473) internal successors, (1157), 1021 states have internal predecessors, (1157), 426 states have call successors, (426), 139 states have call predecessors, (426), 138 states have return successors, (424), 420 states have call predecessors, (424), 424 states have call successors, (424) [2022-07-21 15:42:59,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 2007 transitions. [2022-07-21 15:42:59,381 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 2007 transitions. Word has length 153 [2022-07-21 15:42:59,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:42:59,381 INFO L495 AbstractCegarLoop]: Abstraction has 1563 states and 2007 transitions. [2022-07-21 15:42:59,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-21 15:42:59,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 2007 transitions. [2022-07-21 15:42:59,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-07-21 15:42:59,383 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:42:59,383 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:42:59,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-21 15:42:59,384 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_linux_alloc_irq_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:42:59,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:42:59,384 INFO L85 PathProgramCache]: Analyzing trace with hash -2107684610, now seen corresponding path program 1 times [2022-07-21 15:42:59,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:42:59,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93237084] [2022-07-21 15:42:59,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:42:59,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:42:59,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:59,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:42:59,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:59,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:42:59,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:59,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:42:59,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:59,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:42:59,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:59,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 15:42:59,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:59,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:42:59,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:59,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:42:59,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:59,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:42:59,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:59,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 15:42:59,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:59,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:42:59,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:59,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:42:59,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:59,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:42:59,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:59,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 15:42:59,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:59,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:42:59,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:59,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:42:59,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:59,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:42:59,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:59,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 15:42:59,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:59,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:42:59,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:59,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:42:59,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:59,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:42:59,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:59,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 15:42:59,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:59,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:42:59,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:59,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:42:59,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:59,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:42:59,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:59,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 15:42:59,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:59,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-21 15:42:59,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:59,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-21 15:42:59,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:59,637 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2022-07-21 15:42:59,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:42:59,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93237084] [2022-07-21 15:42:59,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93237084] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:42:59,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:42:59,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 15:42:59,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527807017] [2022-07-21 15:42:59,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:42:59,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 15:42:59,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:42:59,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 15:42:59,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-21 15:42:59,640 INFO L87 Difference]: Start difference. First operand 1563 states and 2007 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-21 15:43:04,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:43:04,537 INFO L93 Difference]: Finished difference Result 3034 states and 3916 transitions. [2022-07-21 15:43:04,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 15:43:04,537 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 166 [2022-07-21 15:43:04,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:43:04,543 INFO L225 Difference]: With dead ends: 3034 [2022-07-21 15:43:04,544 INFO L226 Difference]: Without dead ends: 1577 [2022-07-21 15:43:04,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2022-07-21 15:43:04,548 INFO L413 NwaCegarLoop]: 1587 mSDtfsCounter, 2561 mSDsluCounter, 3309 mSDsCounter, 0 mSdLazyCounter, 4426 mSolverCounterSat, 1770 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2795 SdHoareTripleChecker+Valid, 4896 SdHoareTripleChecker+Invalid, 6196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1770 IncrementalHoareTripleChecker+Valid, 4426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-07-21 15:43:04,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2795 Valid, 4896 Invalid, 6196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1770 Valid, 4426 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-07-21 15:43:04,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1577 states. [2022-07-21 15:43:04,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1577 to 1563. [2022-07-21 15:43:04,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1563 states, 981 states have (on average 1.1773700305810397) internal successors, (1155), 1021 states have internal predecessors, (1155), 426 states have call successors, (426), 139 states have call predecessors, (426), 138 states have return successors, (424), 420 states have call predecessors, (424), 424 states have call successors, (424) [2022-07-21 15:43:04,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 2005 transitions. [2022-07-21 15:43:04,608 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 2005 transitions. Word has length 166 [2022-07-21 15:43:04,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:43:04,608 INFO L495 AbstractCegarLoop]: Abstraction has 1563 states and 2005 transitions. [2022-07-21 15:43:04,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-21 15:43:04,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 2005 transitions. [2022-07-21 15:43:04,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-07-21 15:43:04,610 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:43:04,610 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:43:04,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-21 15:43:04,611 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_linux_alloc_irq_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:43:04,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:43:04,611 INFO L85 PathProgramCache]: Analyzing trace with hash -2107625028, now seen corresponding path program 1 times [2022-07-21 15:43:04,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:43:04,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809852676] [2022-07-21 15:43:04,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:43:04,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:43:04,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:04,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:43:04,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:04,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:43:04,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:04,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:43:04,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:04,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:43:04,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:04,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 15:43:04,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:04,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:43:04,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:04,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:43:04,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:04,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:43:04,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:04,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 15:43:04,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:04,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:43:04,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:04,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:43:04,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:04,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:43:04,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:04,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 15:43:04,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:04,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:43:04,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:04,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:43:04,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:04,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:43:04,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:04,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 15:43:04,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:04,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:43:04,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:04,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:43:04,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:04,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:43:04,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:04,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 15:43:04,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:04,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:43:04,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:04,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:43:04,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:04,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:43:04,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:04,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 15:43:04,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:04,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-21 15:43:04,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:04,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-21 15:43:04,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:04,791 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2022-07-21 15:43:04,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:43:04,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809852676] [2022-07-21 15:43:04,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809852676] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:43:04,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:43:04,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 15:43:04,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958031358] [2022-07-21 15:43:04,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:43:04,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 15:43:04,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:43:04,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 15:43:04,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 15:43:04,795 INFO L87 Difference]: Start difference. First operand 1563 states and 2005 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2022-07-21 15:43:08,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:43:08,993 INFO L93 Difference]: Finished difference Result 1577 states and 2029 transitions. [2022-07-21 15:43:08,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 15:43:08,993 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 166 [2022-07-21 15:43:08,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:43:09,022 INFO L225 Difference]: With dead ends: 1577 [2022-07-21 15:43:09,022 INFO L226 Difference]: Without dead ends: 1575 [2022-07-21 15:43:09,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-07-21 15:43:09,025 INFO L413 NwaCegarLoop]: 1586 mSDtfsCounter, 1364 mSDsluCounter, 2837 mSDsCounter, 0 mSdLazyCounter, 3153 mSolverCounterSat, 1488 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1364 SdHoareTripleChecker+Valid, 4423 SdHoareTripleChecker+Invalid, 4641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1488 IncrementalHoareTripleChecker+Valid, 3153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-07-21 15:43:09,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1364 Valid, 4423 Invalid, 4641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1488 Valid, 3153 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-07-21 15:43:09,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2022-07-21 15:43:09,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 1561. [2022-07-21 15:43:09,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1561 states, 980 states have (on average 1.1755102040816328) internal successors, (1152), 1019 states have internal predecessors, (1152), 426 states have call successors, (426), 139 states have call predecessors, (426), 138 states have return successors, (424), 420 states have call predecessors, (424), 424 states have call successors, (424) [2022-07-21 15:43:09,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 2002 transitions. [2022-07-21 15:43:09,151 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 2002 transitions. Word has length 166 [2022-07-21 15:43:09,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:43:09,151 INFO L495 AbstractCegarLoop]: Abstraction has 1561 states and 2002 transitions. [2022-07-21 15:43:09,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2022-07-21 15:43:09,151 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 2002 transitions. [2022-07-21 15:43:09,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-21 15:43:09,153 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:43:09,153 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:43:09,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-21 15:43:09,153 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:43:09,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:43:09,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1495386975, now seen corresponding path program 1 times [2022-07-21 15:43:09,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:43:09,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826448474] [2022-07-21 15:43:09,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:43:09,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:43:09,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:09,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:43:09,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:09,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:43:09,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:09,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:43:09,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:09,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:43:09,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:09,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:43:09,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:09,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:43:09,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:09,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 15:43:09,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:09,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:43:09,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:09,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 15:43:09,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:09,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 15:43:09,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:09,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 15:43:09,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:09,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 15:43:09,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:09,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-21 15:43:09,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:09,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 15:43:09,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:09,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-21 15:43:09,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:09,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-21 15:43:09,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:09,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-21 15:43:09,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:09,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 15:43:09,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:09,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-21 15:43:09,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:09,370 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-21 15:43:09,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:43:09,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826448474] [2022-07-21 15:43:09,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826448474] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:43:09,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:43:09,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:43:09,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164208389] [2022-07-21 15:43:09,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:43:09,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:43:09,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:43:09,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:43:09,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:43:09,373 INFO L87 Difference]: Start difference. First operand 1561 states and 2002 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-21 15:43:12,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:43:12,242 INFO L93 Difference]: Finished difference Result 1561 states and 2002 transitions. [2022-07-21 15:43:12,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:43:12,243 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 127 [2022-07-21 15:43:12,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:43:12,249 INFO L225 Difference]: With dead ends: 1561 [2022-07-21 15:43:12,249 INFO L226 Difference]: Without dead ends: 1559 [2022-07-21 15:43:12,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:43:12,250 INFO L413 NwaCegarLoop]: 1592 mSDtfsCounter, 2189 mSDsluCounter, 1660 mSDsCounter, 0 mSdLazyCounter, 1636 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2415 SdHoareTripleChecker+Valid, 3252 SdHoareTripleChecker+Invalid, 2924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 1636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-07-21 15:43:12,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2415 Valid, 3252 Invalid, 2924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 1636 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-07-21 15:43:12,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1559 states. [2022-07-21 15:43:12,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1559 to 1559. [2022-07-21 15:43:12,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1559 states, 979 states have (on average 1.1746680286006128) internal successors, (1150), 1017 states have internal predecessors, (1150), 426 states have call successors, (426), 139 states have call predecessors, (426), 138 states have return successors, (424), 420 states have call predecessors, (424), 424 states have call successors, (424) [2022-07-21 15:43:12,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 2000 transitions. [2022-07-21 15:43:12,319 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 2000 transitions. Word has length 127 [2022-07-21 15:43:12,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:43:12,319 INFO L495 AbstractCegarLoop]: Abstraction has 1559 states and 2000 transitions. [2022-07-21 15:43:12,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-21 15:43:12,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 2000 transitions. [2022-07-21 15:43:12,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-07-21 15:43:12,321 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:43:12,321 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:43:12,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-21 15:43:12,322 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:43:12,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:43:12,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1863471288, now seen corresponding path program 1 times [2022-07-21 15:43:12,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:43:12,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125385624] [2022-07-21 15:43:12,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:43:12,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:43:12,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:12,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:43:12,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:12,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:43:12,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:12,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:43:12,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:12,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:43:12,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:12,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 15:43:12,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:12,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:43:12,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:12,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:43:12,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:12,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:43:12,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:12,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 15:43:12,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:12,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:43:12,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:12,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:43:12,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:12,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:43:12,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:12,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 15:43:12,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:12,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:43:12,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:12,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:43:12,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:12,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:43:12,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:12,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 15:43:12,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:12,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:43:12,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:12,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:43:12,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:12,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:43:12,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:12,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 15:43:12,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:12,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:43:12,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:12,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:43:12,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:12,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:43:12,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:12,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 15:43:12,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:12,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-21 15:43:12,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:12,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-21 15:43:12,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:12,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:43:12,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:12,558 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2022-07-21 15:43:12,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:43:12,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125385624] [2022-07-21 15:43:12,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125385624] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:43:12,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:43:12,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:43:12,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32396057] [2022-07-21 15:43:12,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:43:12,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:43:12,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:43:12,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:43:12,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:43:12,561 INFO L87 Difference]: Start difference. First operand 1559 states and 2000 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-21 15:43:15,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:43:15,232 INFO L93 Difference]: Finished difference Result 3020 states and 3895 transitions. [2022-07-21 15:43:15,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:43:15,232 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 173 [2022-07-21 15:43:15,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:43:15,238 INFO L225 Difference]: With dead ends: 3020 [2022-07-21 15:43:15,239 INFO L226 Difference]: Without dead ends: 1567 [2022-07-21 15:43:15,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:43:15,242 INFO L413 NwaCegarLoop]: 1581 mSDtfsCounter, 2522 mSDsluCounter, 1399 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 1762 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2755 SdHoareTripleChecker+Valid, 2980 SdHoareTripleChecker+Invalid, 2910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1762 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-21 15:43:15,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2755 Valid, 2980 Invalid, 2910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1762 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-07-21 15:43:15,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2022-07-21 15:43:15,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1553. [2022-07-21 15:43:15,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1553 states, 974 states have (on average 1.1714579055441479) internal successors, (1141), 1011 states have internal predecessors, (1141), 426 states have call successors, (426), 139 states have call predecessors, (426), 138 states have return successors, (424), 420 states have call predecessors, (424), 424 states have call successors, (424) [2022-07-21 15:43:15,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1553 states to 1553 states and 1991 transitions. [2022-07-21 15:43:15,382 INFO L78 Accepts]: Start accepts. Automaton has 1553 states and 1991 transitions. Word has length 173 [2022-07-21 15:43:15,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:43:15,382 INFO L495 AbstractCegarLoop]: Abstraction has 1553 states and 1991 transitions. [2022-07-21 15:43:15,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-21 15:43:15,382 INFO L276 IsEmpty]: Start isEmpty. Operand 1553 states and 1991 transitions. [2022-07-21 15:43:15,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-07-21 15:43:15,384 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:43:15,384 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:43:15,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-21 15:43:15,385 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:43:15,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:43:15,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1932909630, now seen corresponding path program 1 times [2022-07-21 15:43:15,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:43:15,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885028940] [2022-07-21 15:43:15,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:43:15,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:43:15,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:15,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:43:15,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:15,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:43:15,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:15,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:43:15,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:15,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:43:15,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:15,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:43:15,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:15,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:43:15,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:15,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 15:43:15,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:15,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:43:15,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:15,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 15:43:15,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:15,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 15:43:15,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:15,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:43:15,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:15,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:43:15,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:15,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:43:15,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:15,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:43:15,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:15,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:43:15,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:15,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-21 15:43:15,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:15,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:43:15,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:15,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:43:15,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:15,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:43:15,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:15,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-21 15:43:15,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:15,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:43:15,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:15,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:43:15,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:15,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:43:15,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:15,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-21 15:43:15,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:15,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-21 15:43:15,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:15,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-21 15:43:15,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:15,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:43:15,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:15,616 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2022-07-21 15:43:15,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:43:15,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885028940] [2022-07-21 15:43:15,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885028940] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:43:15,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:43:15,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 15:43:15,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332435529] [2022-07-21 15:43:15,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:43:15,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 15:43:15,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:43:15,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 15:43:15,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-21 15:43:15,618 INFO L87 Difference]: Start difference. First operand 1553 states and 1991 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (23), 7 states have call predecessors, (23), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-21 15:43:19,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:43:19,831 INFO L93 Difference]: Finished difference Result 1595 states and 2039 transitions. [2022-07-21 15:43:19,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-21 15:43:19,831 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (23), 7 states have call predecessors, (23), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 164 [2022-07-21 15:43:19,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:43:19,839 INFO L225 Difference]: With dead ends: 1595 [2022-07-21 15:43:19,839 INFO L226 Difference]: Without dead ends: 1593 [2022-07-21 15:43:19,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=137, Invalid=283, Unknown=0, NotChecked=0, Total=420 [2022-07-21 15:43:19,841 INFO L413 NwaCegarLoop]: 1585 mSDtfsCounter, 2998 mSDsluCounter, 3316 mSDsCounter, 0 mSdLazyCounter, 3508 mSolverCounterSat, 2265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3217 SdHoareTripleChecker+Valid, 4901 SdHoareTripleChecker+Invalid, 5773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2265 IncrementalHoareTripleChecker+Valid, 3508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-07-21 15:43:19,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3217 Valid, 4901 Invalid, 5773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2265 Valid, 3508 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-07-21 15:43:19,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1593 states. [2022-07-21 15:43:19,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1593 to 1577. [2022-07-21 15:43:19,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1577 states, 992 states have (on average 1.1703629032258065) internal successors, (1161), 1029 states have internal predecessors, (1161), 426 states have call successors, (426), 145 states have call predecessors, (426), 144 states have return successors, (424), 420 states have call predecessors, (424), 424 states have call successors, (424) [2022-07-21 15:43:19,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 2011 transitions. [2022-07-21 15:43:19,914 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 2011 transitions. Word has length 164 [2022-07-21 15:43:19,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:43:19,914 INFO L495 AbstractCegarLoop]: Abstraction has 1577 states and 2011 transitions. [2022-07-21 15:43:19,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (23), 7 states have call predecessors, (23), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-21 15:43:19,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 2011 transitions. [2022-07-21 15:43:19,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-07-21 15:43:19,916 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:43:19,917 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:43:19,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-21 15:43:19,917 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:43:19,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:43:19,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1219574549, now seen corresponding path program 1 times [2022-07-21 15:43:19,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:43:19,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727592584] [2022-07-21 15:43:19,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:43:19,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:43:19,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:20,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:43:20,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:20,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:43:20,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:20,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:43:20,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:20,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:43:20,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:20,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:43:20,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:20,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:43:20,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:20,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 15:43:20,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:20,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:43:20,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:20,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 15:43:20,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:20,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 15:43:20,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:20,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 15:43:20,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:20,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 15:43:20,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:20,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-21 15:43:20,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:20,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 15:43:20,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:20,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-21 15:43:20,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:20,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-21 15:43:20,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:20,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-21 15:43:20,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:20,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 15:43:20,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:20,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-21 15:43:20,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:20,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 15:43:20,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:20,125 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-21 15:43:20,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:43:20,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727592584] [2022-07-21 15:43:20,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727592584] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:43:20,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:43:20,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:43:20,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380223784] [2022-07-21 15:43:20,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:43:20,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:43:20,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:43:20,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:43:20,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:43:20,128 INFO L87 Difference]: Start difference. First operand 1577 states and 2011 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-21 15:43:22,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:43:22,900 INFO L93 Difference]: Finished difference Result 1577 states and 2011 transitions. [2022-07-21 15:43:22,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:43:22,900 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 133 [2022-07-21 15:43:22,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:43:22,920 INFO L225 Difference]: With dead ends: 1577 [2022-07-21 15:43:22,922 INFO L226 Difference]: Without dead ends: 1575 [2022-07-21 15:43:22,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:43:22,923 INFO L413 NwaCegarLoop]: 1585 mSDtfsCounter, 2168 mSDsluCounter, 1660 mSDsCounter, 0 mSdLazyCounter, 1629 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2393 SdHoareTripleChecker+Valid, 3245 SdHoareTripleChecker+Invalid, 2917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 1629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-07-21 15:43:22,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2393 Valid, 3245 Invalid, 2917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 1629 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-07-21 15:43:22,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2022-07-21 15:43:22,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 1575. [2022-07-21 15:43:22,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1575 states, 991 states have (on average 1.1695257315842584) internal successors, (1159), 1027 states have internal predecessors, (1159), 426 states have call successors, (426), 145 states have call predecessors, (426), 144 states have return successors, (424), 420 states have call predecessors, (424), 424 states have call successors, (424) [2022-07-21 15:43:22,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 2009 transitions. [2022-07-21 15:43:22,986 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 2009 transitions. Word has length 133 [2022-07-21 15:43:22,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:43:22,987 INFO L495 AbstractCegarLoop]: Abstraction has 1575 states and 2009 transitions. [2022-07-21 15:43:22,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-21 15:43:22,987 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 2009 transitions. [2022-07-21 15:43:22,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-21 15:43:22,988 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:43:22,988 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:43:22,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-21 15:43:22,989 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:43:22,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:43:22,989 INFO L85 PathProgramCache]: Analyzing trace with hash -462029759, now seen corresponding path program 1 times [2022-07-21 15:43:22,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:43:22,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925609437] [2022-07-21 15:43:22,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:43:22,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:43:23,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:23,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:43:23,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:23,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:43:23,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:23,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:43:23,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:23,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:43:23,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:23,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:43:23,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:23,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:43:23,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:23,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 15:43:23,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:23,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:43:23,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:23,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 15:43:23,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:23,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 15:43:23,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:23,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 15:43:23,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:23,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 15:43:23,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:23,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-21 15:43:23,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:23,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 15:43:23,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:23,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-21 15:43:23,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:23,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-21 15:43:23,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:23,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-21 15:43:23,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:23,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 15:43:23,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:23,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-21 15:43:23,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:23,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 15:43:23,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:23,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-21 15:43:23,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:23,119 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-21 15:43:23,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:43:23,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925609437] [2022-07-21 15:43:23,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925609437] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:43:23,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:43:23,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:43:23,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370753009] [2022-07-21 15:43:23,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:43:23,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:43:23,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:43:23,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:43:23,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:43:23,120 INFO L87 Difference]: Start difference. First operand 1575 states and 2009 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-21 15:43:25,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:43:25,094 INFO L93 Difference]: Finished difference Result 1575 states and 2009 transitions. [2022-07-21 15:43:25,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:43:25,094 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 139 [2022-07-21 15:43:25,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:43:25,109 INFO L225 Difference]: With dead ends: 1575 [2022-07-21 15:43:25,109 INFO L226 Difference]: Without dead ends: 1573 [2022-07-21 15:43:25,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:43:25,111 INFO L413 NwaCegarLoop]: 1583 mSDtfsCounter, 2162 mSDsluCounter, 1660 mSDsCounter, 0 mSdLazyCounter, 1627 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2386 SdHoareTripleChecker+Valid, 3243 SdHoareTripleChecker+Invalid, 2915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 1627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-21 15:43:25,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2386 Valid, 3243 Invalid, 2915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 1627 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-21 15:43:25,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1573 states. [2022-07-21 15:43:25,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1573 to 1573. [2022-07-21 15:43:25,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1573 states, 990 states have (on average 1.1686868686868688) internal successors, (1157), 1025 states have internal predecessors, (1157), 426 states have call successors, (426), 145 states have call predecessors, (426), 144 states have return successors, (424), 420 states have call predecessors, (424), 424 states have call successors, (424) [2022-07-21 15:43:25,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 2007 transitions. [2022-07-21 15:43:25,239 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 2007 transitions. Word has length 139 [2022-07-21 15:43:25,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:43:25,240 INFO L495 AbstractCegarLoop]: Abstraction has 1573 states and 2007 transitions. [2022-07-21 15:43:25,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-21 15:43:25,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 2007 transitions. [2022-07-21 15:43:25,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-07-21 15:43:25,241 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:43:25,241 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:43:25,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-21 15:43:25,242 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_linux_kernel_rcu_srcu_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:43:25,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:43:25,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1035613449, now seen corresponding path program 1 times [2022-07-21 15:43:25,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:43:25,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824037423] [2022-07-21 15:43:25,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:43:25,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:43:25,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:25,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:43:25,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:25,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:43:25,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:25,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:43:25,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:25,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:43:25,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:25,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:43:25,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:25,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:43:25,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:25,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 15:43:25,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:25,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:43:25,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:25,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 15:43:25,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:25,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 15:43:25,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:25,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 15:43:25,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:25,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 15:43:25,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:25,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-21 15:43:25,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:25,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 15:43:25,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:25,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-21 15:43:25,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:25,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-21 15:43:25,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:25,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-21 15:43:25,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:25,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 15:43:25,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:25,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-21 15:43:25,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:25,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 15:43:25,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:25,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-21 15:43:25,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:25,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-21 15:43:25,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:25,404 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-21 15:43:25,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:43:25,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824037423] [2022-07-21 15:43:25,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824037423] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:43:25,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:43:25,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:43:25,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297177501] [2022-07-21 15:43:25,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:43:25,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:43:25,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:43:25,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:43:25,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:43:25,412 INFO L87 Difference]: Start difference. First operand 1573 states and 2007 transitions. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-21 15:43:27,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:43:27,832 INFO L93 Difference]: Finished difference Result 1573 states and 2007 transitions. [2022-07-21 15:43:27,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:43:27,833 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 145 [2022-07-21 15:43:27,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:43:27,837 INFO L225 Difference]: With dead ends: 1573 [2022-07-21 15:43:27,837 INFO L226 Difference]: Without dead ends: 1571 [2022-07-21 15:43:27,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:43:27,838 INFO L413 NwaCegarLoop]: 1581 mSDtfsCounter, 2156 mSDsluCounter, 1660 mSDsCounter, 0 mSdLazyCounter, 1625 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2379 SdHoareTripleChecker+Valid, 3241 SdHoareTripleChecker+Invalid, 2913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 1625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-21 15:43:27,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2379 Valid, 3241 Invalid, 2913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 1625 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-07-21 15:43:27,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1571 states. [2022-07-21 15:43:27,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1571 to 1571. [2022-07-21 15:43:27,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1571 states, 989 states have (on average 1.167846309403438) internal successors, (1155), 1023 states have internal predecessors, (1155), 426 states have call successors, (426), 145 states have call predecessors, (426), 144 states have return successors, (424), 420 states have call predecessors, (424), 424 states have call successors, (424) [2022-07-21 15:43:27,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 2005 transitions. [2022-07-21 15:43:27,928 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 2005 transitions. Word has length 145 [2022-07-21 15:43:27,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:43:27,929 INFO L495 AbstractCegarLoop]: Abstraction has 1571 states and 2005 transitions. [2022-07-21 15:43:27,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-21 15:43:27,929 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 2005 transitions. [2022-07-21 15:43:27,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-07-21 15:43:27,931 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:43:27,931 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:43:27,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-21 15:43:27,931 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_linux_lib_idr_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:43:27,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:43:27,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1583947181, now seen corresponding path program 1 times [2022-07-21 15:43:27,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:43:27,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144855913] [2022-07-21 15:43:27,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:43:27,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:43:27,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:28,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:43:28,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:28,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:43:28,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:28,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:43:28,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:28,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:43:28,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:28,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:43:28,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:28,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:43:28,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:28,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 15:43:28,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:28,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:43:28,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:28,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 15:43:28,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:28,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 15:43:28,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:28,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 15:43:28,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:28,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 15:43:28,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:28,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-21 15:43:28,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:28,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 15:43:28,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:28,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-21 15:43:28,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:28,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-21 15:43:28,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:28,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-21 15:43:28,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:28,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 15:43:28,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:28,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-21 15:43:28,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:28,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 15:43:28,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:28,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-21 15:43:28,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:28,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-21 15:43:28,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:28,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-21 15:43:28,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:28,154 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-21 15:43:28,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:43:28,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144855913] [2022-07-21 15:43:28,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144855913] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:43:28,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:43:28,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:43:28,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601223572] [2022-07-21 15:43:28,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:43:28,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:43:28,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:43:28,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:43:28,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:43:28,157 INFO L87 Difference]: Start difference. First operand 1571 states and 2005 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-21 15:43:31,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:43:31,210 INFO L93 Difference]: Finished difference Result 1571 states and 2005 transitions. [2022-07-21 15:43:31,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:43:31,210 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 151 [2022-07-21 15:43:31,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:43:31,215 INFO L225 Difference]: With dead ends: 1571 [2022-07-21 15:43:31,215 INFO L226 Difference]: Without dead ends: 1569 [2022-07-21 15:43:31,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:43:31,216 INFO L413 NwaCegarLoop]: 1579 mSDtfsCounter, 2150 mSDsluCounter, 1660 mSDsCounter, 0 mSdLazyCounter, 1623 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2372 SdHoareTripleChecker+Valid, 3239 SdHoareTripleChecker+Invalid, 2911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 1623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-07-21 15:43:31,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2372 Valid, 3239 Invalid, 2911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 1623 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-07-21 15:43:31,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2022-07-21 15:43:31,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 1569. [2022-07-21 15:43:31,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1569 states, 988 states have (on average 1.167004048582996) internal successors, (1153), 1021 states have internal predecessors, (1153), 426 states have call successors, (426), 145 states have call predecessors, (426), 144 states have return successors, (424), 420 states have call predecessors, (424), 424 states have call successors, (424) [2022-07-21 15:43:31,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 2003 transitions. [2022-07-21 15:43:31,296 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 2003 transitions. Word has length 151 [2022-07-21 15:43:31,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:43:31,296 INFO L495 AbstractCegarLoop]: Abstraction has 1569 states and 2003 transitions. [2022-07-21 15:43:31,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-21 15:43:31,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 2003 transitions. [2022-07-21 15:43:31,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-07-21 15:43:31,298 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:43:31,298 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:43:31,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-21 15:43:31,299 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:43:31,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:43:31,299 INFO L85 PathProgramCache]: Analyzing trace with hash -836954508, now seen corresponding path program 1 times [2022-07-21 15:43:31,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:43:31,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334721474] [2022-07-21 15:43:31,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:43:31,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:43:31,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:31,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:43:31,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:31,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:43:31,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:31,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:43:31,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:31,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:43:31,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:31,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:43:31,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:31,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:43:31,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:31,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 15:43:31,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:31,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:43:31,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:31,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 15:43:31,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:31,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 15:43:31,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:31,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:43:31,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:31,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:43:31,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:31,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:43:31,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:31,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:43:31,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:31,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:43:31,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:31,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-21 15:43:31,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:31,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:43:31,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:31,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:43:31,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:31,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:43:31,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:31,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-21 15:43:31,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:31,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:43:31,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:31,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:43:31,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:31,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:43:31,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:31,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-21 15:43:31,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:31,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-21 15:43:31,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:31,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-21 15:43:31,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:31,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:43:31,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:31,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-21 15:43:31,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:31,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:43:31,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:31,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:43:31,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:31,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 15:43:31,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:31,583 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2022-07-21 15:43:31,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:43:31,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334721474] [2022-07-21 15:43:31,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334721474] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:43:31,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:43:31,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-21 15:43:31,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384809210] [2022-07-21 15:43:31,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:43:31,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 15:43:31,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:43:31,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 15:43:31,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:43:31,585 INFO L87 Difference]: Start difference. First operand 1569 states and 2003 transitions. Second operand has 10 states, 10 states have (on average 7.1) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (27), 8 states have call predecessors, (27), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-21 15:43:37,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:43:37,606 INFO L93 Difference]: Finished difference Result 1589 states and 2033 transitions. [2022-07-21 15:43:37,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-21 15:43:37,607 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (27), 8 states have call predecessors, (27), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 187 [2022-07-21 15:43:37,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:43:37,612 INFO L225 Difference]: With dead ends: 1589 [2022-07-21 15:43:37,612 INFO L226 Difference]: Without dead ends: 1587 [2022-07-21 15:43:37,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=183, Invalid=417, Unknown=0, NotChecked=0, Total=600 [2022-07-21 15:43:37,613 INFO L413 NwaCegarLoop]: 1574 mSDtfsCounter, 2266 mSDsluCounter, 4492 mSDsCounter, 0 mSdLazyCounter, 4733 mSolverCounterSat, 2514 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2266 SdHoareTripleChecker+Valid, 6066 SdHoareTripleChecker+Invalid, 7247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2514 IncrementalHoareTripleChecker+Valid, 4733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-07-21 15:43:37,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2266 Valid, 6066 Invalid, 7247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2514 Valid, 4733 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2022-07-21 15:43:37,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1587 states. [2022-07-21 15:43:37,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1587 to 1569. [2022-07-21 15:43:37,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1569 states, 988 states have (on average 1.1649797570850202) internal successors, (1151), 1021 states have internal predecessors, (1151), 426 states have call successors, (426), 145 states have call predecessors, (426), 144 states have return successors, (424), 420 states have call predecessors, (424), 424 states have call successors, (424) [2022-07-21 15:43:37,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 2001 transitions. [2022-07-21 15:43:37,686 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 2001 transitions. Word has length 187 [2022-07-21 15:43:37,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:43:37,686 INFO L495 AbstractCegarLoop]: Abstraction has 1569 states and 2001 transitions. [2022-07-21 15:43:37,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (27), 8 states have call predecessors, (27), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-21 15:43:37,686 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 2001 transitions. [2022-07-21 15:43:37,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-21 15:43:37,688 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:43:37,688 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:43:37,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-21 15:43:37,688 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:43:37,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:43:37,689 INFO L85 PathProgramCache]: Analyzing trace with hash 2023750506, now seen corresponding path program 1 times [2022-07-21 15:43:37,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:43:37,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961691694] [2022-07-21 15:43:37,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:43:37,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:43:37,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:37,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:43:37,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:37,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:43:37,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:37,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:43:37,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:37,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:43:37,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:37,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:43:37,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:37,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:43:37,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:37,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 15:43:37,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:37,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:43:37,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:37,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 15:43:37,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:37,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 15:43:37,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:37,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 15:43:37,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:37,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 15:43:37,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:37,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-21 15:43:37,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:37,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 15:43:37,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:37,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-21 15:43:37,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:37,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-21 15:43:37,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:37,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-21 15:43:37,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:37,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 15:43:37,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:37,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-21 15:43:37,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:37,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 15:43:37,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:37,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-21 15:43:37,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:37,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-21 15:43:37,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:37,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-21 15:43:37,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:37,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-21 15:43:37,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:37,856 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-21 15:43:37,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:43:37,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961691694] [2022-07-21 15:43:37,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961691694] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:43:37,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:43:37,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:43:37,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92732239] [2022-07-21 15:43:37,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:43:37,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:43:37,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:43:37,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:43:37,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:43:37,858 INFO L87 Difference]: Start difference. First operand 1569 states and 2001 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-21 15:43:40,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:43:40,359 INFO L93 Difference]: Finished difference Result 1569 states and 2001 transitions. [2022-07-21 15:43:40,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:43:40,359 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 157 [2022-07-21 15:43:40,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:43:40,364 INFO L225 Difference]: With dead ends: 1569 [2022-07-21 15:43:40,364 INFO L226 Difference]: Without dead ends: 1567 [2022-07-21 15:43:40,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:43:40,365 INFO L413 NwaCegarLoop]: 1577 mSDtfsCounter, 2144 mSDsluCounter, 1660 mSDsCounter, 0 mSdLazyCounter, 1621 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2365 SdHoareTripleChecker+Valid, 3237 SdHoareTripleChecker+Invalid, 2909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 1621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-21 15:43:40,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2365 Valid, 3237 Invalid, 2909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 1621 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-07-21 15:43:40,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2022-07-21 15:43:40,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1567. [2022-07-21 15:43:40,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 987 states have (on average 1.1641337386018238) internal successors, (1149), 1019 states have internal predecessors, (1149), 426 states have call successors, (426), 145 states have call predecessors, (426), 144 states have return successors, (424), 420 states have call predecessors, (424), 424 states have call successors, (424) [2022-07-21 15:43:40,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 1999 transitions. [2022-07-21 15:43:40,439 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 1999 transitions. Word has length 157 [2022-07-21 15:43:40,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:43:40,440 INFO L495 AbstractCegarLoop]: Abstraction has 1567 states and 1999 transitions. [2022-07-21 15:43:40,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-21 15:43:40,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 1999 transitions. [2022-07-21 15:43:40,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-07-21 15:43:40,442 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:43:40,442 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:43:40,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-21 15:43:40,442 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_linux_net_rtnetlink_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:43:40,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:43:40,443 INFO L85 PathProgramCache]: Analyzing trace with hash 893411218, now seen corresponding path program 1 times [2022-07-21 15:43:40,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:43:40,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119865951] [2022-07-21 15:43:40,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:43:40,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:43:40,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:40,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:43:40,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:40,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:43:40,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:40,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:43:40,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:40,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:43:40,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:40,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:43:40,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:40,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:43:40,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:40,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 15:43:40,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:40,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:43:40,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:40,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 15:43:40,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:40,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 15:43:40,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:40,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 15:43:40,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:40,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 15:43:40,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:40,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-21 15:43:40,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:40,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 15:43:40,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:40,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-21 15:43:40,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:40,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-21 15:43:40,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:40,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-21 15:43:40,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:40,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 15:43:40,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:40,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-21 15:43:40,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:40,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 15:43:40,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:40,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-21 15:43:40,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:40,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-21 15:43:40,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:40,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-21 15:43:40,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:40,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-21 15:43:40,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:40,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-21 15:43:40,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:40,606 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-21 15:43:40,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:43:40,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119865951] [2022-07-21 15:43:40,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119865951] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:43:40,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:43:40,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:43:40,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073424621] [2022-07-21 15:43:40,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:43:40,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:43:40,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:43:40,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:43:40,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:43:40,608 INFO L87 Difference]: Start difference. First operand 1567 states and 1999 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-21 15:43:43,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:43:43,130 INFO L93 Difference]: Finished difference Result 1567 states and 1999 transitions. [2022-07-21 15:43:43,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:43:43,130 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 163 [2022-07-21 15:43:43,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:43:43,135 INFO L225 Difference]: With dead ends: 1567 [2022-07-21 15:43:43,135 INFO L226 Difference]: Without dead ends: 1565 [2022-07-21 15:43:43,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:43:43,139 INFO L413 NwaCegarLoop]: 1575 mSDtfsCounter, 2138 mSDsluCounter, 1660 mSDsCounter, 0 mSdLazyCounter, 1619 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2358 SdHoareTripleChecker+Valid, 3235 SdHoareTripleChecker+Invalid, 2907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 1619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-21 15:43:43,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2358 Valid, 3235 Invalid, 2907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 1619 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-07-21 15:43:43,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1565 states. [2022-07-21 15:43:43,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1565 to 1565. [2022-07-21 15:43:43,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1565 states, 986 states have (on average 1.1632860040567952) internal successors, (1147), 1017 states have internal predecessors, (1147), 426 states have call successors, (426), 145 states have call predecessors, (426), 144 states have return successors, (424), 420 states have call predecessors, (424), 424 states have call successors, (424) [2022-07-21 15:43:43,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 1997 transitions. [2022-07-21 15:43:43,252 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 1997 transitions. Word has length 163 [2022-07-21 15:43:43,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:43:43,252 INFO L495 AbstractCegarLoop]: Abstraction has 1565 states and 1997 transitions. [2022-07-21 15:43:43,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-21 15:43:43,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 1997 transitions. [2022-07-21 15:43:43,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-07-21 15:43:43,254 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:43:43,254 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:43:43,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-21 15:43:43,254 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_linux_net_sock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:43:43,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:43:43,255 INFO L85 PathProgramCache]: Analyzing trace with hash -992837032, now seen corresponding path program 1 times [2022-07-21 15:43:43,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:43:43,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424074469] [2022-07-21 15:43:43,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:43:43,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:43:43,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:43:43,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:43:43,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:43:43,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:43:43,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:43:43,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:43:43,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 15:43:43,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:43:43,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 15:43:43,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 15:43:43,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 15:43:43,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 15:43:43,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-21 15:43:43,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 15:43:43,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-21 15:43:43,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-21 15:43:43,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-21 15:43:43,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 15:43:43,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-21 15:43:43,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 15:43:43,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-21 15:43:43,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-21 15:43:43,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-21 15:43:43,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-21 15:43:43,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-21 15:43:43,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-21 15:43:43,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,402 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-21 15:43:43,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:43:43,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424074469] [2022-07-21 15:43:43,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424074469] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:43:43,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:43:43,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:43:43,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567633307] [2022-07-21 15:43:43,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:43:43,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:43:43,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:43:43,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:43:43,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:43:43,404 INFO L87 Difference]: Start difference. First operand 1565 states and 1997 transitions. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-21 15:43:46,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:43:46,008 INFO L93 Difference]: Finished difference Result 1565 states and 1997 transitions. [2022-07-21 15:43:46,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:43:46,009 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 169 [2022-07-21 15:43:46,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:43:46,013 INFO L225 Difference]: With dead ends: 1565 [2022-07-21 15:43:46,013 INFO L226 Difference]: Without dead ends: 1563 [2022-07-21 15:43:46,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:43:46,014 INFO L413 NwaCegarLoop]: 1573 mSDtfsCounter, 2132 mSDsluCounter, 1660 mSDsCounter, 0 mSdLazyCounter, 1617 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2351 SdHoareTripleChecker+Valid, 3233 SdHoareTripleChecker+Invalid, 2905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 1617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-21 15:43:46,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2351 Valid, 3233 Invalid, 2905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 1617 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-07-21 15:43:46,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2022-07-21 15:43:46,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 1563. [2022-07-21 15:43:46,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1563 states, 985 states have (on average 1.1624365482233503) internal successors, (1145), 1015 states have internal predecessors, (1145), 426 states have call successors, (426), 145 states have call predecessors, (426), 144 states have return successors, (424), 420 states have call predecessors, (424), 424 states have call successors, (424) [2022-07-21 15:43:46,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 1995 transitions. [2022-07-21 15:43:46,093 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 1995 transitions. Word has length 169 [2022-07-21 15:43:46,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:43:46,093 INFO L495 AbstractCegarLoop]: Abstraction has 1563 states and 1995 transitions. [2022-07-21 15:43:46,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-21 15:43:46,093 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 1995 transitions. [2022-07-21 15:43:46,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-07-21 15:43:46,095 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:43:46,095 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:43:46,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-21 15:43:46,096 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:43:46,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:43:46,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1416811539, now seen corresponding path program 1 times [2022-07-21 15:43:46,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:43:46,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370858652] [2022-07-21 15:43:46,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:43:46,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:43:46,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:46,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:43:46,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:46,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:43:46,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:46,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:43:46,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:46,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:43:46,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:46,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:43:46,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:46,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:43:46,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:46,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 15:43:46,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:46,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:43:46,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:46,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 15:43:46,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:46,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 15:43:46,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:46,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 15:43:46,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:46,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 15:43:46,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:46,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-21 15:43:46,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:46,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 15:43:46,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:46,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-21 15:43:46,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:46,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-21 15:43:46,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:46,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-21 15:43:46,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:46,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 15:43:46,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:46,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-21 15:43:46,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:46,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 15:43:46,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:46,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-21 15:43:46,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:46,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-21 15:43:46,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:46,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-21 15:43:46,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:46,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-21 15:43:46,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:46,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-21 15:43:46,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:46,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-21 15:43:46,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:46,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-21 15:43:46,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:46,273 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-21 15:43:46,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:43:46,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370858652] [2022-07-21 15:43:46,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370858652] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:43:46,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:43:46,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:43:46,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793594343] [2022-07-21 15:43:46,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:43:46,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:43:46,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:43:46,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:43:46,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:43:46,275 INFO L87 Difference]: Start difference. First operand 1563 states and 1995 transitions. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-07-21 15:43:48,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:43:48,921 INFO L93 Difference]: Finished difference Result 1563 states and 1995 transitions. [2022-07-21 15:43:48,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:43:48,921 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 175 [2022-07-21 15:43:48,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:43:48,926 INFO L225 Difference]: With dead ends: 1563 [2022-07-21 15:43:48,926 INFO L226 Difference]: Without dead ends: 1561 [2022-07-21 15:43:48,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:43:48,927 INFO L413 NwaCegarLoop]: 1571 mSDtfsCounter, 2126 mSDsluCounter, 1660 mSDsCounter, 0 mSdLazyCounter, 1615 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2344 SdHoareTripleChecker+Valid, 3231 SdHoareTripleChecker+Invalid, 2903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 1615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-21 15:43:48,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2344 Valid, 3231 Invalid, 2903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 1615 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-07-21 15:43:48,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1561 states. [2022-07-21 15:43:48,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1561 to 1561. [2022-07-21 15:43:48,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1561 states, 984 states have (on average 1.1615853658536586) internal successors, (1143), 1013 states have internal predecessors, (1143), 426 states have call successors, (426), 145 states have call predecessors, (426), 144 states have return successors, (424), 420 states have call predecessors, (424), 424 states have call successors, (424) [2022-07-21 15:43:49,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 1993 transitions. [2022-07-21 15:43:49,003 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 1993 transitions. Word has length 175 [2022-07-21 15:43:49,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:43:49,003 INFO L495 AbstractCegarLoop]: Abstraction has 1561 states and 1993 transitions. [2022-07-21 15:43:49,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-07-21 15:43:49,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 1993 transitions. [2022-07-21 15:43:49,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2022-07-21 15:43:49,005 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:43:49,005 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:43:49,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-21 15:43:49,006 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:43:49,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:43:49,006 INFO L85 PathProgramCache]: Analyzing trace with hash 731543701, now seen corresponding path program 1 times [2022-07-21 15:43:49,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:43:49,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714105463] [2022-07-21 15:43:49,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:43:49,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:43:49,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:49,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:43:49,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:49,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:43:49,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:49,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:43:49,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:49,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:43:49,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:49,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:43:49,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:49,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:43:49,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:49,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 15:43:49,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:49,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:43:49,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:49,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 15:43:49,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:49,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 15:43:49,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:49,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:43:49,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:49,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:43:49,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:49,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:43:49,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:49,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:43:49,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:49,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:43:49,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:49,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-21 15:43:49,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:49,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:43:49,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:49,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:43:49,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:49,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:43:49,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:49,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-21 15:43:49,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:49,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:43:49,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:49,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:43:49,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:49,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:43:49,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:49,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-21 15:43:49,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:49,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-21 15:43:49,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:49,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-21 15:43:49,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:49,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:43:49,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:49,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-21 15:43:49,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:49,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:43:49,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:49,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:43:49,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:49,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 15:43:49,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:49,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-21 15:43:49,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:49,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:43:49,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:49,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:43:49,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:49,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 15:43:49,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:49,373 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2022-07-21 15:43:49,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:43:49,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714105463] [2022-07-21 15:43:49,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714105463] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:43:49,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:43:49,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-21 15:43:49,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652405431] [2022-07-21 15:43:49,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:43:49,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 15:43:49,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:43:49,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 15:43:49,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:43:49,375 INFO L87 Difference]: Start difference. First operand 1561 states and 1993 transitions. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (31), 8 states have call predecessors, (31), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2022-07-21 15:43:55,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:43:55,411 INFO L93 Difference]: Finished difference Result 1595 states and 2032 transitions. [2022-07-21 15:43:55,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-21 15:43:55,412 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (31), 8 states have call predecessors, (31), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 212 [2022-07-21 15:43:55,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:43:55,416 INFO L225 Difference]: With dead ends: 1595 [2022-07-21 15:43:55,417 INFO L226 Difference]: Without dead ends: 1593 [2022-07-21 15:43:55,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=180, Invalid=420, Unknown=0, NotChecked=0, Total=600 [2022-07-21 15:43:55,418 INFO L413 NwaCegarLoop]: 1628 mSDtfsCounter, 2796 mSDsluCounter, 4426 mSDsCounter, 0 mSdLazyCounter, 4964 mSolverCounterSat, 2823 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2814 SdHoareTripleChecker+Valid, 6054 SdHoareTripleChecker+Invalid, 7787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2823 IncrementalHoareTripleChecker+Valid, 4964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-07-21 15:43:55,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2814 Valid, 6054 Invalid, 7787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2823 Valid, 4964 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2022-07-21 15:43:55,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1593 states. [2022-07-21 15:43:55,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1593 to 1565. [2022-07-21 15:43:55,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1565 states, 987 states have (on average 1.1610942249240122) internal successors, (1146), 1016 states have internal predecessors, (1146), 426 states have call successors, (426), 146 states have call predecessors, (426), 145 states have return successors, (424), 420 states have call predecessors, (424), 424 states have call successors, (424) [2022-07-21 15:43:55,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 1996 transitions. [2022-07-21 15:43:55,551 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 1996 transitions. Word has length 212 [2022-07-21 15:43:55,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:43:55,552 INFO L495 AbstractCegarLoop]: Abstraction has 1565 states and 1996 transitions. [2022-07-21 15:43:55,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (31), 8 states have call predecessors, (31), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2022-07-21 15:43:55,552 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 1996 transitions. [2022-07-21 15:43:55,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2022-07-21 15:43:55,554 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:43:55,554 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:43:55,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-21 15:43:55,561 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:43:55,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:43:55,562 INFO L85 PathProgramCache]: Analyzing trace with hash 578281643, now seen corresponding path program 1 times [2022-07-21 15:43:55,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:43:55,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59900409] [2022-07-21 15:43:55,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:43:55,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:43:55,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:55,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:43:55,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:55,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:43:55,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:55,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:43:55,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:55,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:43:55,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:55,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:43:55,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:55,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:43:55,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:55,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 15:43:55,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:55,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:43:55,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:55,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 15:43:55,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:55,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 15:43:55,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:55,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 15:43:55,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:55,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 15:43:55,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:55,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-21 15:43:55,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:55,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 15:43:55,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:55,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-21 15:43:55,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:55,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-21 15:43:55,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:55,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-21 15:43:55,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:55,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 15:43:55,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:55,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-21 15:43:55,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:55,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 15:43:55,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:55,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-21 15:43:55,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:55,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-21 15:43:55,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:55,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-21 15:43:55,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:55,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-21 15:43:55,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:55,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-21 15:43:55,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:55,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-21 15:43:55,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:55,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-21 15:43:55,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:55,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-21 15:43:55,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:55,787 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-21 15:43:55,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:43:55,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59900409] [2022-07-21 15:43:55,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59900409] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:43:55,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:43:55,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:43:55,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071260357] [2022-07-21 15:43:55,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:43:55,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:43:55,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:43:55,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:43:55,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:43:55,789 INFO L87 Difference]: Start difference. First operand 1565 states and 1996 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-21 15:43:58,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:43:58,103 INFO L93 Difference]: Finished difference Result 1565 states and 1996 transitions. [2022-07-21 15:43:58,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:43:58,103 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 181 [2022-07-21 15:43:58,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:43:58,107 INFO L225 Difference]: With dead ends: 1565 [2022-07-21 15:43:58,108 INFO L226 Difference]: Without dead ends: 1563 [2022-07-21 15:43:58,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:43:58,109 INFO L413 NwaCegarLoop]: 1569 mSDtfsCounter, 2120 mSDsluCounter, 1660 mSDsCounter, 0 mSdLazyCounter, 1613 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2337 SdHoareTripleChecker+Valid, 3229 SdHoareTripleChecker+Invalid, 2901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 1613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-21 15:43:58,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2337 Valid, 3229 Invalid, 2901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 1613 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-07-21 15:43:58,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2022-07-21 15:43:58,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 1563. [2022-07-21 15:43:58,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1563 states, 986 states have (on average 1.1602434077079107) internal successors, (1144), 1014 states have internal predecessors, (1144), 426 states have call successors, (426), 146 states have call predecessors, (426), 145 states have return successors, (424), 420 states have call predecessors, (424), 424 states have call successors, (424) [2022-07-21 15:43:58,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 1994 transitions. [2022-07-21 15:43:58,186 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 1994 transitions. Word has length 181 [2022-07-21 15:43:58,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:43:58,187 INFO L495 AbstractCegarLoop]: Abstraction has 1563 states and 1994 transitions. [2022-07-21 15:43:58,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-21 15:43:58,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 1994 transitions. [2022-07-21 15:43:58,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-07-21 15:43:58,189 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:43:58,189 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:43:58,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-21 15:43:58,190 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ldv_linux_usb_urb_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:43:58,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:43:58,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1220089259, now seen corresponding path program 1 times [2022-07-21 15:43:58,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:43:58,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437616026] [2022-07-21 15:43:58,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:43:58,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:43:58,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:58,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:43:58,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:58,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:43:58,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:58,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:43:58,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:58,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:43:58,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:58,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:43:58,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:58,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:43:58,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:58,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 15:43:58,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:58,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:43:58,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:58,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 15:43:58,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:58,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 15:43:58,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:58,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 15:43:58,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:58,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 15:43:58,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:58,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-21 15:43:58,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:58,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 15:43:58,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:58,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-21 15:43:58,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:58,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-21 15:43:58,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:58,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-21 15:43:58,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:58,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 15:43:58,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:58,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-21 15:43:58,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:58,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 15:43:58,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:58,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-21 15:43:58,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:58,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-21 15:43:58,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:58,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-21 15:43:58,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:58,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-21 15:43:58,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:58,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-21 15:43:58,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:58,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-21 15:43:58,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:58,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-21 15:43:58,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:58,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-21 15:43:58,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:58,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-21 15:43:58,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:58,341 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-21 15:43:58,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:43:58,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437616026] [2022-07-21 15:43:58,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437616026] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:43:58,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:43:58,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:43:58,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896160674] [2022-07-21 15:43:58,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:43:58,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:43:58,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:43:58,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:43:58,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:43:58,343 INFO L87 Difference]: Start difference. First operand 1563 states and 1994 transitions. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (30), 4 states have call predecessors, (30), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2022-07-21 15:44:03,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:44:03,672 INFO L93 Difference]: Finished difference Result 2967 states and 3785 transitions. [2022-07-21 15:44:03,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 15:44:03,673 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (30), 4 states have call predecessors, (30), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 187 [2022-07-21 15:44:03,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:44:03,694 INFO L225 Difference]: With dead ends: 2967 [2022-07-21 15:44:03,695 INFO L226 Difference]: Without dead ends: 2812 [2022-07-21 15:44:03,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-21 15:44:03,697 INFO L413 NwaCegarLoop]: 1972 mSDtfsCounter, 2775 mSDsluCounter, 2382 mSDsCounter, 0 mSdLazyCounter, 3595 mSolverCounterSat, 2107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2988 SdHoareTripleChecker+Valid, 4354 SdHoareTripleChecker+Invalid, 5702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2107 IncrementalHoareTripleChecker+Valid, 3595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-07-21 15:44:03,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2988 Valid, 4354 Invalid, 5702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2107 Valid, 3595 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-07-21 15:44:03,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2812 states. [2022-07-21 15:44:03,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2812 to 2798. [2022-07-21 15:44:03,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2798 states, 1767 states have (on average 1.1641199773627617) internal successors, (2057), 1810 states have internal predecessors, (2057), 763 states have call successors, (763), 262 states have call predecessors, (763), 262 states have return successors, (775), 757 states have call predecessors, (775), 761 states have call successors, (775) [2022-07-21 15:44:03,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2798 states to 2798 states and 3595 transitions. [2022-07-21 15:44:03,835 INFO L78 Accepts]: Start accepts. Automaton has 2798 states and 3595 transitions. Word has length 187 [2022-07-21 15:44:03,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:44:03,835 INFO L495 AbstractCegarLoop]: Abstraction has 2798 states and 3595 transitions. [2022-07-21 15:44:03,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (30), 4 states have call predecessors, (30), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2022-07-21 15:44:03,836 INFO L276 IsEmpty]: Start isEmpty. Operand 2798 states and 3595 transitions. [2022-07-21 15:44:03,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2022-07-21 15:44:03,837 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:44:03,837 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:44:03,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-21 15:44:03,838 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:44:03,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:44:03,838 INFO L85 PathProgramCache]: Analyzing trace with hash -732030745, now seen corresponding path program 1 times [2022-07-21 15:44:03,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:44:03,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391804256] [2022-07-21 15:44:03,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:44:03,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:44:03,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:03,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:44:03,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:03,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:44:03,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:03,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:44:03,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:03,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:44:03,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:03,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:44:03,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:03,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:44:03,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:03,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 15:44:03,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:03,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:03,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:03,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 15:44:03,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:03,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 15:44:03,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:03,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:44:03,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:04,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:44:04,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:04,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:04,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:04,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:04,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:04,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:44:04,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:04,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-21 15:44:04,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:04,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:04,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:04,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:04,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:04,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:44:04,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:04,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-21 15:44:04,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:04,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:04,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:04,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:04,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:04,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:44:04,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:04,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-21 15:44:04,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:04,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-21 15:44:04,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:04,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-21 15:44:04,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:04,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:04,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:04,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-21 15:44:04,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:04,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:04,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:04,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:04,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:04,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 15:44:04,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:04,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-21 15:44:04,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:04,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:04,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:04,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:04,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:04,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 15:44:04,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:04,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-07-21 15:44:04,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:04,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-07-21 15:44:04,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:04,082 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2022-07-21 15:44:04,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:44:04,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391804256] [2022-07-21 15:44:04,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391804256] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:44:04,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:44:04,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-21 15:44:04,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114074651] [2022-07-21 15:44:04,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:44:04,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 15:44:04,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:44:04,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 15:44:04,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:44:04,084 INFO L87 Difference]: Start difference. First operand 2798 states and 3595 transitions. Second operand has 10 states, 10 states have (on average 9.2) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (33), 7 states have call predecessors, (33), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2022-07-21 15:44:11,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:44:11,607 INFO L93 Difference]: Finished difference Result 5279 states and 6917 transitions. [2022-07-21 15:44:11,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 15:44:11,607 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (33), 7 states have call predecessors, (33), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) Word has length 223 [2022-07-21 15:44:11,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:44:11,618 INFO L225 Difference]: With dead ends: 5279 [2022-07-21 15:44:11,618 INFO L226 Difference]: Without dead ends: 3536 [2022-07-21 15:44:11,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2022-07-21 15:44:11,624 INFO L413 NwaCegarLoop]: 1704 mSDtfsCounter, 3060 mSDsluCounter, 4488 mSDsCounter, 0 mSdLazyCounter, 5458 mSolverCounterSat, 3604 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3060 SdHoareTripleChecker+Valid, 6192 SdHoareTripleChecker+Invalid, 9062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3604 IncrementalHoareTripleChecker+Valid, 5458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-07-21 15:44:11,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3060 Valid, 6192 Invalid, 9062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3604 Valid, 5458 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2022-07-21 15:44:11,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3536 states. [2022-07-21 15:44:11,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3536 to 2806. [2022-07-21 15:44:11,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2806 states, 1773 states have (on average 1.1635645798082346) internal successors, (2063), 1816 states have internal predecessors, (2063), 765 states have call successors, (765), 262 states have call predecessors, (765), 262 states have return successors, (777), 759 states have call predecessors, (777), 763 states have call successors, (777) [2022-07-21 15:44:11,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2806 states to 2806 states and 3605 transitions. [2022-07-21 15:44:11,797 INFO L78 Accepts]: Start accepts. Automaton has 2806 states and 3605 transitions. Word has length 223 [2022-07-21 15:44:11,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:44:11,797 INFO L495 AbstractCegarLoop]: Abstraction has 2806 states and 3605 transitions. [2022-07-21 15:44:11,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (33), 7 states have call predecessors, (33), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2022-07-21 15:44:11,798 INFO L276 IsEmpty]: Start isEmpty. Operand 2806 states and 3605 transitions. [2022-07-21 15:44:11,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2022-07-21 15:44:11,799 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:44:11,799 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:44:11,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-21 15:44:11,800 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:44:11,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:44:11,800 INFO L85 PathProgramCache]: Analyzing trace with hash 93185672, now seen corresponding path program 1 times [2022-07-21 15:44:11,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:44:11,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254561678] [2022-07-21 15:44:11,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:44:11,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:44:11,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:11,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:44:11,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:11,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:44:11,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:11,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:44:11,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:11,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:44:11,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:11,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:44:11,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:11,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:44:11,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:11,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 15:44:11,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:11,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:11,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:11,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 15:44:11,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:11,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 15:44:11,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:11,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:44:11,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:11,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:44:11,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:11,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:11,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:11,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:11,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:11,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:44:11,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:11,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-21 15:44:11,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:11,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:11,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:11,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:11,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:11,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:44:11,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:11,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-21 15:44:11,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:11,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:11,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:11,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:11,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:11,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:44:11,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:11,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-21 15:44:11,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:11,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-21 15:44:11,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:11,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-21 15:44:11,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:11,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:11,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:11,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-21 15:44:11,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:11,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:11,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:11,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:11,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:11,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 15:44:11,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:11,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-21 15:44:11,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:11,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:11,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:11,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:12,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:12,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 15:44:12,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:12,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-21 15:44:12,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:12,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-21 15:44:12,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:12,011 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2022-07-21 15:44:12,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:44:12,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254561678] [2022-07-21 15:44:12,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254561678] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:44:12,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:44:12,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-21 15:44:12,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299203194] [2022-07-21 15:44:12,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:44:12,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 15:44:12,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:44:12,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 15:44:12,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:44:12,013 INFO L87 Difference]: Start difference. First operand 2806 states and 3605 transitions. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (33), 8 states have call predecessors, (33), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2022-07-21 15:44:18,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:44:18,738 INFO L93 Difference]: Finished difference Result 4330 states and 5557 transitions. [2022-07-21 15:44:18,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-21 15:44:18,739 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (33), 8 states have call predecessors, (33), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 225 [2022-07-21 15:44:18,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:44:18,751 INFO L225 Difference]: With dead ends: 4330 [2022-07-21 15:44:18,751 INFO L226 Difference]: Without dead ends: 4328 [2022-07-21 15:44:18,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=234, Invalid=522, Unknown=0, NotChecked=0, Total=756 [2022-07-21 15:44:18,753 INFO L413 NwaCegarLoop]: 1782 mSDtfsCounter, 4282 mSDsluCounter, 4605 mSDsCounter, 0 mSdLazyCounter, 5341 mSolverCounterSat, 3849 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4490 SdHoareTripleChecker+Valid, 6387 SdHoareTripleChecker+Invalid, 9190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3849 IncrementalHoareTripleChecker+Valid, 5341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-07-21 15:44:18,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4490 Valid, 6387 Invalid, 9190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3849 Valid, 5341 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2022-07-21 15:44:18,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4328 states. [2022-07-21 15:44:19,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4328 to 4272. [2022-07-21 15:44:19,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4272 states, 2709 states have (on average 1.1742340346991509) internal successors, (3181), 2780 states have internal predecessors, (3181), 1141 states have call successors, (1141), 422 states have call predecessors, (1141), 416 states have return successors, (1154), 1119 states have call predecessors, (1154), 1139 states have call successors, (1154) [2022-07-21 15:44:19,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4272 states to 4272 states and 5476 transitions. [2022-07-21 15:44:19,067 INFO L78 Accepts]: Start accepts. Automaton has 4272 states and 5476 transitions. Word has length 225 [2022-07-21 15:44:19,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:44:19,068 INFO L495 AbstractCegarLoop]: Abstraction has 4272 states and 5476 transitions. [2022-07-21 15:44:19,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (33), 8 states have call predecessors, (33), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2022-07-21 15:44:19,068 INFO L276 IsEmpty]: Start isEmpty. Operand 4272 states and 5476 transitions. [2022-07-21 15:44:19,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2022-07-21 15:44:19,070 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:44:19,070 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:44:19,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-21 15:44:19,070 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:44:19,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:44:19,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1014321496, now seen corresponding path program 1 times [2022-07-21 15:44:19,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:44:19,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780244972] [2022-07-21 15:44:19,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:44:19,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:44:19,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:19,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:44:19,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:19,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:44:19,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:19,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:44:19,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:19,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:44:19,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:19,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:44:19,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:19,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:44:19,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:19,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 15:44:19,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:19,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:19,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:19,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 15:44:19,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:19,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 15:44:19,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:19,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:44:19,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:19,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:44:19,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:19,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:19,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:19,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:19,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:19,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:44:19,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:19,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-21 15:44:19,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:19,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:19,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:19,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:19,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:19,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:44:19,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:19,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-21 15:44:19,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:19,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:19,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:19,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:19,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:19,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:44:19,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:19,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-21 15:44:19,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:19,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-21 15:44:19,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:19,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-21 15:44:19,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:19,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:19,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:19,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-21 15:44:19,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:19,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:19,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:19,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:19,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:19,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 15:44:19,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:19,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-21 15:44:19,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:19,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:19,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:19,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:19,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:19,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 15:44:19,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:19,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-21 15:44:19,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:19,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-21 15:44:19,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:19,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-21 15:44:19,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:19,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:19,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:19,388 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2022-07-21 15:44:19,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:44:19,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780244972] [2022-07-21 15:44:19,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780244972] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:44:19,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:44:19,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-21 15:44:19,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19648714] [2022-07-21 15:44:19,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:44:19,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-21 15:44:19,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:44:19,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-21 15:44:19,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-21 15:44:19,390 INFO L87 Difference]: Start difference. First operand 4272 states and 5476 transitions. Second operand has 11 states, 11 states have (on average 9.090909090909092) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (35), 9 states have call predecessors, (35), 2 states have return successors, (33), 2 states have call predecessors, (33), 1 states have call successors, (33) [2022-07-21 15:44:28,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:44:28,286 INFO L93 Difference]: Finished difference Result 4352 states and 5579 transitions. [2022-07-21 15:44:28,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-21 15:44:28,286 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.090909090909092) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (35), 9 states have call predecessors, (35), 2 states have return successors, (33), 2 states have call predecessors, (33), 1 states have call successors, (33) Word has length 238 [2022-07-21 15:44:28,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:44:28,319 INFO L225 Difference]: With dead ends: 4352 [2022-07-21 15:44:28,319 INFO L226 Difference]: Without dead ends: 4350 [2022-07-21 15:44:28,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 81 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=270, Invalid=660, Unknown=0, NotChecked=0, Total=930 [2022-07-21 15:44:28,332 INFO L413 NwaCegarLoop]: 2142 mSDtfsCounter, 3405 mSDsluCounter, 6895 mSDsCounter, 0 mSdLazyCounter, 6957 mSolverCounterSat, 3708 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3526 SdHoareTripleChecker+Valid, 9037 SdHoareTripleChecker+Invalid, 10665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3708 IncrementalHoareTripleChecker+Valid, 6957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2022-07-21 15:44:28,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3526 Valid, 9037 Invalid, 10665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3708 Valid, 6957 Invalid, 0 Unknown, 0 Unchecked, 8.3s Time] [2022-07-21 15:44:28,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4350 states. [2022-07-21 15:44:28,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4350 to 4286. [2022-07-21 15:44:28,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4286 states, 2719 states have (on average 1.17285766826039) internal successors, (3189), 2790 states have internal predecessors, (3189), 1141 states have call successors, (1141), 424 states have call predecessors, (1141), 420 states have return successors, (1154), 1121 states have call predecessors, (1154), 1139 states have call successors, (1154) [2022-07-21 15:44:28,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4286 states to 4286 states and 5484 transitions. [2022-07-21 15:44:28,578 INFO L78 Accepts]: Start accepts. Automaton has 4286 states and 5484 transitions. Word has length 238 [2022-07-21 15:44:28,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:44:28,578 INFO L495 AbstractCegarLoop]: Abstraction has 4286 states and 5484 transitions. [2022-07-21 15:44:28,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.090909090909092) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (35), 9 states have call predecessors, (35), 2 states have return successors, (33), 2 states have call predecessors, (33), 1 states have call successors, (33) [2022-07-21 15:44:28,579 INFO L276 IsEmpty]: Start isEmpty. Operand 4286 states and 5484 transitions. [2022-07-21 15:44:28,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2022-07-21 15:44:28,580 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:44:28,581 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:44:28,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-07-21 15:44:28,581 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:44:28,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:44:28,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1482365617, now seen corresponding path program 1 times [2022-07-21 15:44:28,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:44:28,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818255064] [2022-07-21 15:44:28,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:44:28,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:44:28,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:28,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:44:28,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:28,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:44:28,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:28,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:44:28,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:28,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:44:28,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:28,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 15:44:28,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:28,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:28,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:28,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:28,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:28,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:44:28,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:28,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 15:44:28,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:28,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:28,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:28,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:28,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:28,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:44:28,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:28,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 15:44:28,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:28,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:28,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:28,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:28,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:28,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:44:28,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:28,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 15:44:28,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:28,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:28,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:28,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:28,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:28,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:44:28,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:28,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 15:44:28,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:28,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:28,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:28,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:28,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:28,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:44:28,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:28,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 15:44:28,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:28,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-21 15:44:28,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:28,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-21 15:44:28,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:28,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-21 15:44:28,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:28,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-21 15:44:28,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:28,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:28,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:28,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-21 15:44:28,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:28,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-21 15:44:28,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:28,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-21 15:44:28,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:28,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-07-21 15:44:28,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:28,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-21 15:44:28,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:28,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:28,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:28,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:28,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:28,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:28,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:28,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 15:44:28,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:28,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-21 15:44:28,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:28,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:28,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:28,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:28,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:28,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 15:44:28,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:28,809 INFO L134 CoverageAnalysis]: Checked inductivity of 616 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 614 trivial. 0 not checked. [2022-07-21 15:44:28,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:44:28,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818255064] [2022-07-21 15:44:28,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818255064] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:44:28,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:44:28,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-21 15:44:28,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096891493] [2022-07-21 15:44:28,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:44:28,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 15:44:28,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:44:28,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 15:44:28,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:44:28,811 INFO L87 Difference]: Start difference. First operand 4286 states and 5484 transitions. Second operand has 10 states, 10 states have (on average 8.9) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (34), 8 states have call predecessors, (34), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2022-07-21 15:44:33,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:44:33,893 INFO L93 Difference]: Finished difference Result 4410 states and 5608 transitions. [2022-07-21 15:44:33,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 15:44:33,893 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (34), 8 states have call predecessors, (34), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 257 [2022-07-21 15:44:33,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:44:33,906 INFO L225 Difference]: With dead ends: 4410 [2022-07-21 15:44:33,906 INFO L226 Difference]: Without dead ends: 4408 [2022-07-21 15:44:33,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2022-07-21 15:44:33,909 INFO L413 NwaCegarLoop]: 1564 mSDtfsCounter, 2802 mSDsluCounter, 3851 mSDsCounter, 0 mSdLazyCounter, 4031 mSolverCounterSat, 2272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2992 SdHoareTripleChecker+Valid, 5415 SdHoareTripleChecker+Invalid, 6303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2272 IncrementalHoareTripleChecker+Valid, 4031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-07-21 15:44:33,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2992 Valid, 5415 Invalid, 6303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2272 Valid, 4031 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-07-21 15:44:33,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4408 states. [2022-07-21 15:44:34,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4408 to 4364. [2022-07-21 15:44:34,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4364 states, 2774 states have (on average 1.1665465032444124) internal successors, (3236), 2844 states have internal predecessors, (3236), 1141 states have call successors, (1141), 448 states have call predecessors, (1141), 444 states have return successors, (1154), 1121 states have call predecessors, (1154), 1139 states have call successors, (1154) [2022-07-21 15:44:34,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4364 states to 4364 states and 5531 transitions. [2022-07-21 15:44:34,217 INFO L78 Accepts]: Start accepts. Automaton has 4364 states and 5531 transitions. Word has length 257 [2022-07-21 15:44:34,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:44:34,218 INFO L495 AbstractCegarLoop]: Abstraction has 4364 states and 5531 transitions. [2022-07-21 15:44:34,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (34), 8 states have call predecessors, (34), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2022-07-21 15:44:34,218 INFO L276 IsEmpty]: Start isEmpty. Operand 4364 states and 5531 transitions. [2022-07-21 15:44:34,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2022-07-21 15:44:34,220 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:44:34,220 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:44:34,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-07-21 15:44:34,221 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:44:34,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:44:34,221 INFO L85 PathProgramCache]: Analyzing trace with hash -96816453, now seen corresponding path program 1 times [2022-07-21 15:44:34,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:44:34,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471675979] [2022-07-21 15:44:34,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:44:34,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:44:34,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:44:34,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:44:34,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:44:34,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:44:34,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 15:44:34,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:34,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:34,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:44:34,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 15:44:34,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:34,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:34,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:44:34,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 15:44:34,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:34,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:34,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:44:34,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 15:44:34,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:34,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:34,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:44:34,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 15:44:34,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:34,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:34,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:44:34,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 15:44:34,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-21 15:44:34,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-21 15:44:34,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-21 15:44:34,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-21 15:44:34,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:34,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-21 15:44:34,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-21 15:44:34,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-21 15:44:34,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-07-21 15:44:34,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-21 15:44:34,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:34,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:34,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:44:34,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-21 15:44:34,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:34,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:34,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:34,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 15:44:34,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-21 15:44:34,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:34,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:34,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 15:44:34,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-07-21 15:44:34,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,522 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2022-07-21 15:44:34,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:44:34,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471675979] [2022-07-21 15:44:34,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471675979] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:44:34,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:44:34,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-21 15:44:34,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702153391] [2022-07-21 15:44:34,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:44:34,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 15:44:34,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:44:34,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 15:44:34,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:44:34,524 INFO L87 Difference]: Start difference. First operand 4364 states and 5531 transitions. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (35), 8 states have call predecessors, (35), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2022-07-21 15:44:40,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:44:40,845 INFO L93 Difference]: Finished difference Result 7337 states and 9258 transitions. [2022-07-21 15:44:40,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-21 15:44:40,846 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (35), 8 states have call predecessors, (35), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 283 [2022-07-21 15:44:40,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:44:40,865 INFO L225 Difference]: With dead ends: 7337 [2022-07-21 15:44:40,865 INFO L226 Difference]: Without dead ends: 7335 [2022-07-21 15:44:40,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=175, Invalid=377, Unknown=0, NotChecked=0, Total=552 [2022-07-21 15:44:40,869 INFO L413 NwaCegarLoop]: 1917 mSDtfsCounter, 4590 mSDsluCounter, 4536 mSDsCounter, 0 mSdLazyCounter, 5495 mSolverCounterSat, 3977 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4800 SdHoareTripleChecker+Valid, 6453 SdHoareTripleChecker+Invalid, 9472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3977 IncrementalHoareTripleChecker+Valid, 5495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-07-21 15:44:40,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4800 Valid, 6453 Invalid, 9472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3977 Valid, 5495 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2022-07-21 15:44:40,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7335 states. [2022-07-21 15:44:41,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7335 to 7220. [2022-07-21 15:44:41,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7220 states, 4644 states have (on average 1.173557278208441) internal successors, (5450), 4775 states have internal predecessors, (5450), 1820 states have call successors, (1820), 759 states have call predecessors, (1820), 751 states have return successors, (1837), 1777 states have call predecessors, (1837), 1818 states have call successors, (1837) [2022-07-21 15:44:41,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7220 states to 7220 states and 9107 transitions. [2022-07-21 15:44:41,345 INFO L78 Accepts]: Start accepts. Automaton has 7220 states and 9107 transitions. Word has length 283 [2022-07-21 15:44:41,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:44:41,345 INFO L495 AbstractCegarLoop]: Abstraction has 7220 states and 9107 transitions. [2022-07-21 15:44:41,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (35), 8 states have call predecessors, (35), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2022-07-21 15:44:41,346 INFO L276 IsEmpty]: Start isEmpty. Operand 7220 states and 9107 transitions. [2022-07-21 15:44:41,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2022-07-21 15:44:41,348 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:44:41,349 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:44:41,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-07-21 15:44:41,349 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ldv_linux_usb_urb_usb_free_urbErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:44:41,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:44:41,350 INFO L85 PathProgramCache]: Analyzing trace with hash 42848457, now seen corresponding path program 1 times [2022-07-21 15:44:41,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:44:41,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66917400] [2022-07-21 15:44:41,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:44:41,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:44:41,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:41,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:44:41,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:41,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:44:41,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:41,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:44:41,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:41,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:44:41,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:41,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 15:44:41,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:41,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:41,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:41,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:41,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:41,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:44:41,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:41,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 15:44:41,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:41,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:41,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:41,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:41,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:41,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:44:41,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:41,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 15:44:41,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:41,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:41,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:41,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:41,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:41,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:44:41,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:41,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 15:44:41,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:41,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:41,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:41,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:41,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:41,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:44:41,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:41,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 15:44:41,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:41,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:41,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:41,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:41,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:41,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:44:41,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:41,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 15:44:41,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:41,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-21 15:44:41,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:41,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-21 15:44:41,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:41,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:41,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:41,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:41,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:41,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 15:44:41,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:41,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-21 15:44:41,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:41,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:41,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:41,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-21 15:44:41,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:41,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-21 15:44:41,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:41,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-07-21 15:44:41,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:41,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-07-21 15:44:41,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:41,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-21 15:44:41,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:41,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2022-07-21 15:44:41,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:41,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:41,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:41,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:41,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:41,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 15:44:41,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:41,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2022-07-21 15:44:41,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:41,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2022-07-21 15:44:41,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:41,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:41,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:41,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:41,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:41,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 15:44:41,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:41,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2022-07-21 15:44:41,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:41,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2022-07-21 15:44:41,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:41,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-07-21 15:44:41,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:41,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2022-07-21 15:44:41,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:41,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2022-07-21 15:44:41,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:41,766 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2022-07-21 15:44:41,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:44:41,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66917400] [2022-07-21 15:44:41,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66917400] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:44:41,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:44:41,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-07-21 15:44:41,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21647353] [2022-07-21 15:44:41,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:44:41,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-21 15:44:41,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:44:41,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-21 15:44:41,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2022-07-21 15:44:41,769 INFO L87 Difference]: Start difference. First operand 7220 states and 9107 transitions. Second operand has 16 states, 16 states have (on average 7.3125) internal successors, (117), 8 states have internal predecessors, (117), 3 states have call successors, (42), 9 states have call predecessors, (42), 2 states have return successors, (39), 4 states have call predecessors, (39), 3 states have call successors, (39) [2022-07-21 15:44:51,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:44:51,450 INFO L93 Difference]: Finished difference Result 14425 states and 18195 transitions. [2022-07-21 15:44:51,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-21 15:44:51,450 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.3125) internal successors, (117), 8 states have internal predecessors, (117), 3 states have call successors, (42), 9 states have call predecessors, (42), 2 states have return successors, (39), 4 states have call predecessors, (39), 3 states have call successors, (39) Word has length 301 [2022-07-21 15:44:51,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:44:51,511 INFO L225 Difference]: With dead ends: 14425 [2022-07-21 15:44:51,511 INFO L226 Difference]: Without dead ends: 7335 [2022-07-21 15:44:51,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=216, Invalid=776, Unknown=0, NotChecked=0, Total=992 [2022-07-21 15:44:51,533 INFO L413 NwaCegarLoop]: 1532 mSDtfsCounter, 2391 mSDsluCounter, 7754 mSDsCounter, 0 mSdLazyCounter, 9536 mSolverCounterSat, 2930 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2391 SdHoareTripleChecker+Valid, 9286 SdHoareTripleChecker+Invalid, 12466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2930 IncrementalHoareTripleChecker+Valid, 9536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2022-07-21 15:44:51,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2391 Valid, 9286 Invalid, 12466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2930 Valid, 9536 Invalid, 0 Unknown, 0 Unchecked, 8.8s Time] [2022-07-21 15:44:51,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7335 states. [2022-07-21 15:44:51,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7335 to 7234. [2022-07-21 15:44:51,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7234 states, 4654 states have (on average 1.1731843575418994) internal successors, (5460), 4785 states have internal predecessors, (5460), 1822 states have call successors, (1822), 759 states have call predecessors, (1822), 753 states have return successors, (1842), 1780 states have call predecessors, (1842), 1820 states have call successors, (1842) [2022-07-21 15:44:52,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7234 states to 7234 states and 9124 transitions. [2022-07-21 15:44:52,019 INFO L78 Accepts]: Start accepts. Automaton has 7234 states and 9124 transitions. Word has length 301 [2022-07-21 15:44:52,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:44:52,019 INFO L495 AbstractCegarLoop]: Abstraction has 7234 states and 9124 transitions. [2022-07-21 15:44:52,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.3125) internal successors, (117), 8 states have internal predecessors, (117), 3 states have call successors, (42), 9 states have call predecessors, (42), 2 states have return successors, (39), 4 states have call predecessors, (39), 3 states have call successors, (39) [2022-07-21 15:44:52,020 INFO L276 IsEmpty]: Start isEmpty. Operand 7234 states and 9124 transitions. [2022-07-21 15:44:52,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2022-07-21 15:44:52,022 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:44:52,023 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:44:52,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-07-21 15:44:52,023 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:44:52,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:44:52,023 INFO L85 PathProgramCache]: Analyzing trace with hash -692844118, now seen corresponding path program 1 times [2022-07-21 15:44:52,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:44:52,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867943232] [2022-07-21 15:44:52,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:44:52,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:44:52,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:44:52,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:44:52,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:44:52,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:44:52,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 15:44:52,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:52,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:52,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:44:52,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 15:44:52,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:52,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:52,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:44:52,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 15:44:52,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:52,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:52,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:44:52,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 15:44:52,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:52,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:52,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:44:52,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 15:44:52,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:52,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:52,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:44:52,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 15:44:52,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-21 15:44:52,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-21 15:44:52,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-21 15:44:52,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-21 15:44:52,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:52,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-21 15:44:52,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-21 15:44:52,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-21 15:44:52,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-07-21 15:44:52,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-21 15:44:52,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:52,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:52,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:44:52,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-21 15:44:52,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:52,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:52,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:52,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 15:44:52,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-21 15:44:52,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:52,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:52,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 15:44:52,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-07-21 15:44:52,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2022-07-21 15:44:52,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:52,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 15:44:52,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-21 15:44:52,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 300 [2022-07-21 15:44:52,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,299 INFO L134 CoverageAnalysis]: Checked inductivity of 879 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 877 trivial. 0 not checked. [2022-07-21 15:44:52,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:44:52,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867943232] [2022-07-21 15:44:52,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867943232] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:44:52,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:44:52,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-21 15:44:52,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932407526] [2022-07-21 15:44:52,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:44:52,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-21 15:44:52,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:44:52,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-21 15:44:52,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-21 15:44:52,303 INFO L87 Difference]: Start difference. First operand 7234 states and 9124 transitions. Second operand has 11 states, 11 states have (on average 9.545454545454545) internal successors, (105), 4 states have internal predecessors, (105), 3 states have call successors, (41), 9 states have call predecessors, (41), 2 states have return successors, (38), 2 states have call predecessors, (38), 3 states have call successors, (38) [2022-07-21 15:44:58,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:44:58,154 INFO L93 Difference]: Finished difference Result 7327 states and 9253 transitions. [2022-07-21 15:44:58,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-21 15:44:58,156 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.545454545454545) internal successors, (105), 4 states have internal predecessors, (105), 3 states have call successors, (41), 9 states have call predecessors, (41), 2 states have return successors, (38), 2 states have call predecessors, (38), 3 states have call successors, (38) Word has length 311 [2022-07-21 15:44:58,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:44:58,178 INFO L225 Difference]: With dead ends: 7327 [2022-07-21 15:44:58,178 INFO L226 Difference]: Without dead ends: 7325 [2022-07-21 15:44:58,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 108 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=418, Unknown=0, NotChecked=0, Total=600 [2022-07-21 15:44:58,183 INFO L413 NwaCegarLoop]: 1555 mSDtfsCounter, 2600 mSDsluCounter, 4415 mSDsCounter, 0 mSdLazyCounter, 4705 mSolverCounterSat, 2956 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2612 SdHoareTripleChecker+Valid, 5970 SdHoareTripleChecker+Invalid, 7661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2956 IncrementalHoareTripleChecker+Valid, 4705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-07-21 15:44:58,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2612 Valid, 5970 Invalid, 7661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2956 Valid, 4705 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2022-07-21 15:44:58,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7325 states. [2022-07-21 15:44:58,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7325 to 7232. [2022-07-21 15:44:58,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7232 states, 4653 states have (on average 1.1702127659574468) internal successors, (5445), 4783 states have internal predecessors, (5445), 1822 states have call successors, (1822), 759 states have call predecessors, (1822), 753 states have return successors, (1842), 1780 states have call predecessors, (1842), 1820 states have call successors, (1842) [2022-07-21 15:44:58,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7232 states to 7232 states and 9109 transitions. [2022-07-21 15:44:58,667 INFO L78 Accepts]: Start accepts. Automaton has 7232 states and 9109 transitions. Word has length 311 [2022-07-21 15:44:58,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:44:58,667 INFO L495 AbstractCegarLoop]: Abstraction has 7232 states and 9109 transitions. [2022-07-21 15:44:58,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.545454545454545) internal successors, (105), 4 states have internal predecessors, (105), 3 states have call successors, (41), 9 states have call predecessors, (41), 2 states have return successors, (38), 2 states have call predecessors, (38), 3 states have call successors, (38) [2022-07-21 15:44:58,668 INFO L276 IsEmpty]: Start isEmpty. Operand 7232 states and 9109 transitions. [2022-07-21 15:44:58,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2022-07-21 15:44:58,671 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:44:58,671 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:44:58,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-07-21 15:44:58,671 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ldv_linux_usb_urb_usb_free_urbErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:44:58,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:44:58,672 INFO L85 PathProgramCache]: Analyzing trace with hash -765994228, now seen corresponding path program 1 times [2022-07-21 15:44:58,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:44:58,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454055627] [2022-07-21 15:44:58,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:44:58,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:44:58,727 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 15:44:58,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1435927755] [2022-07-21 15:44:58,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:44:58,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 15:44:58,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 15:44:58,729 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 15:44:58,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-21 15:44:59,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:59,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 2996 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-21 15:44:59,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 15:44:59,639 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2022-07-21 15:44:59,639 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 15:44:59,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:44:59,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454055627] [2022-07-21 15:44:59,640 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-21 15:44:59,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435927755] [2022-07-21 15:44:59,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435927755] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:44:59,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:44:59,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:44:59,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361229469] [2022-07-21 15:44:59,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:44:59,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:44:59,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:44:59,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:44:59,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:44:59,642 INFO L87 Difference]: Start difference. First operand 7232 states and 9109 transitions. Second operand has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 3 states have call successors, (46), 2 states have call predecessors, (46), 3 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2022-07-21 15:45:00,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:45:00,837 INFO L93 Difference]: Finished difference Result 17089 states and 22315 transitions. [2022-07-21 15:45:00,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:45:00,838 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 3 states have call successors, (46), 2 states have call predecessors, (46), 3 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) Word has length 322 [2022-07-21 15:45:00,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:45:00,861 INFO L225 Difference]: With dead ends: 17089 [2022-07-21 15:45:00,861 INFO L226 Difference]: Without dead ends: 9902 [2022-07-21 15:45:00,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-21 15:45:00,880 INFO L413 NwaCegarLoop]: 1827 mSDtfsCounter, 696 mSDsluCounter, 6940 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 318 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 8767 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 318 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 15:45:00,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 8767 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [318 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 15:45:00,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9902 states. [2022-07-21 15:45:01,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9902 to 7200. [2022-07-21 15:45:01,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7200 states, 4636 states have (on average 1.1701898188093183) internal successors, (5425), 4763 states have internal predecessors, (5425), 1810 states have call successors, (1810), 756 states have call predecessors, (1810), 750 states have return successors, (1830), 1769 states have call predecessors, (1830), 1808 states have call successors, (1830) [2022-07-21 15:45:01,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7200 states to 7200 states and 9065 transitions. [2022-07-21 15:45:01,464 INFO L78 Accepts]: Start accepts. Automaton has 7200 states and 9065 transitions. Word has length 322 [2022-07-21 15:45:01,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:45:01,464 INFO L495 AbstractCegarLoop]: Abstraction has 7200 states and 9065 transitions. [2022-07-21 15:45:01,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 3 states have call successors, (46), 2 states have call predecessors, (46), 3 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2022-07-21 15:45:01,464 INFO L276 IsEmpty]: Start isEmpty. Operand 7200 states and 9065 transitions. [2022-07-21 15:45:01,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2022-07-21 15:45:01,469 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:45:01,469 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:45:01,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-21 15:45:01,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-07-21 15:45:01,692 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ldv_linux_usb_urb_usb_free_urbErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:45:01,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:45:01,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1409689970, now seen corresponding path program 1 times [2022-07-21 15:45:01,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:45:01,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225993519] [2022-07-21 15:45:01,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:45:01,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:45:01,797 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 15:45:01,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [931356893] [2022-07-21 15:45:01,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:45:01,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 15:45:01,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 15:45:01,816 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 15:45:01,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-21 15:45:03,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:03,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 2994 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-21 15:45:03,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 15:45:03,312 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 251 proven. 3 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2022-07-21 15:45:03,313 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 15:45:03,656 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 6 proven. 63 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2022-07-21 15:45:03,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:45:03,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225993519] [2022-07-21 15:45:03,657 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-21 15:45:03,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931356893] [2022-07-21 15:45:03,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [931356893] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 15:45:03,657 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 15:45:03,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2022-07-21 15:45:03,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500954190] [2022-07-21 15:45:03,657 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 15:45:03,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-21 15:45:03,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:45:03,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-21 15:45:03,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-07-21 15:45:03,659 INFO L87 Difference]: Start difference. First operand 7200 states and 9065 transitions. Second operand has 14 states, 13 states have (on average 15.76923076923077) internal successors, (205), 12 states have internal predecessors, (205), 5 states have call successors, (89), 2 states have call predecessors, (89), 5 states have return successors, (88), 6 states have call predecessors, (88), 5 states have call successors, (88) [2022-07-21 15:45:04,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:45:04,846 INFO L93 Difference]: Finished difference Result 17065 states and 22289 transitions. [2022-07-21 15:45:04,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 15:45:04,848 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 15.76923076923077) internal successors, (205), 12 states have internal predecessors, (205), 5 states have call successors, (89), 2 states have call predecessors, (89), 5 states have return successors, (88), 6 states have call predecessors, (88), 5 states have call successors, (88) Word has length 322 [2022-07-21 15:45:04,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:45:04,872 INFO L225 Difference]: With dead ends: 17065 [2022-07-21 15:45:04,872 INFO L226 Difference]: Without dead ends: 9907 [2022-07-21 15:45:04,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 644 GetRequests, 630 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2022-07-21 15:45:04,890 INFO L413 NwaCegarLoop]: 2325 mSDtfsCounter, 464 mSDsluCounter, 24027 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 26352 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 15:45:04,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 26352 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 15:45:04,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9907 states. [2022-07-21 15:45:05,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9907 to 7200. [2022-07-21 15:45:05,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7200 states, 4636 states have (on average 1.1699741156169112) internal successors, (5424), 4762 states have internal predecessors, (5424), 1810 states have call successors, (1810), 756 states have call predecessors, (1810), 750 states have return successors, (1830), 1769 states have call predecessors, (1830), 1808 states have call successors, (1830) [2022-07-21 15:45:05,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7200 states to 7200 states and 9064 transitions. [2022-07-21 15:45:05,411 INFO L78 Accepts]: Start accepts. Automaton has 7200 states and 9064 transitions. Word has length 322 [2022-07-21 15:45:05,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:45:05,411 INFO L495 AbstractCegarLoop]: Abstraction has 7200 states and 9064 transitions. [2022-07-21 15:45:05,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 15.76923076923077) internal successors, (205), 12 states have internal predecessors, (205), 5 states have call successors, (89), 2 states have call predecessors, (89), 5 states have return successors, (88), 6 states have call predecessors, (88), 5 states have call successors, (88) [2022-07-21 15:45:05,412 INFO L276 IsEmpty]: Start isEmpty. Operand 7200 states and 9064 transitions. [2022-07-21 15:45:05,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2022-07-21 15:45:05,415 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:45:05,415 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:45:05,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-21 15:45:05,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 15:45:05,632 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ldv_linux_usb_urb_usb_free_urbErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:45:05,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:45:05,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1225714191, now seen corresponding path program 1 times [2022-07-21 15:45:05,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:45:05,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531814323] [2022-07-21 15:45:05,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:45:05,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:45:05,750 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 15:45:05,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [628118020] [2022-07-21 15:45:05,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:45:05,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 15:45:05,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 15:45:05,754 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 15:45:05,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-21 15:45:07,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:07,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 3012 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-21 15:45:07,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 15:45:07,406 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 337 proven. 3 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2022-07-21 15:45:07,406 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 15:45:07,761 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 18 proven. 51 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2022-07-21 15:45:07,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:45:07,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531814323] [2022-07-21 15:45:07,761 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-21 15:45:07,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628118020] [2022-07-21 15:45:07,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628118020] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 15:45:07,761 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 15:45:07,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2022-07-21 15:45:07,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212612780] [2022-07-21 15:45:07,762 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 15:45:07,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-21 15:45:07,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:45:07,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-21 15:45:07,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-07-21 15:45:07,763 INFO L87 Difference]: Start difference. First operand 7200 states and 9064 transitions. Second operand has 14 states, 13 states have (on average 15.923076923076923) internal successors, (207), 12 states have internal predecessors, (207), 5 states have call successors, (89), 2 states have call predecessors, (89), 5 states have return successors, (88), 6 states have call predecessors, (88), 5 states have call successors, (88) [2022-07-21 15:45:09,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:45:09,344 INFO L93 Difference]: Finished difference Result 17060 states and 22280 transitions. [2022-07-21 15:45:09,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 15:45:09,345 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 15.923076923076923) internal successors, (207), 12 states have internal predecessors, (207), 5 states have call successors, (89), 2 states have call predecessors, (89), 5 states have return successors, (88), 6 states have call predecessors, (88), 5 states have call successors, (88) Word has length 326 [2022-07-21 15:45:09,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:45:09,369 INFO L225 Difference]: With dead ends: 17060 [2022-07-21 15:45:09,370 INFO L226 Difference]: Without dead ends: 9907 [2022-07-21 15:45:09,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 652 GetRequests, 638 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2022-07-21 15:45:09,384 INFO L413 NwaCegarLoop]: 2324 mSDtfsCounter, 917 mSDsluCounter, 17804 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1154 SdHoareTripleChecker+Valid, 20128 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-21 15:45:09,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1154 Valid, 20128 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-21 15:45:09,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9907 states. [2022-07-21 15:45:09,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9907 to 7200. [2022-07-21 15:45:09,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7200 states, 4636 states have (on average 1.169758412424504) internal successors, (5423), 4761 states have internal predecessors, (5423), 1810 states have call successors, (1810), 756 states have call predecessors, (1810), 750 states have return successors, (1830), 1769 states have call predecessors, (1830), 1808 states have call successors, (1830) [2022-07-21 15:45:09,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7200 states to 7200 states and 9063 transitions. [2022-07-21 15:45:09,942 INFO L78 Accepts]: Start accepts. Automaton has 7200 states and 9063 transitions. Word has length 326 [2022-07-21 15:45:09,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:45:09,943 INFO L495 AbstractCegarLoop]: Abstraction has 7200 states and 9063 transitions. [2022-07-21 15:45:09,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 15.923076923076923) internal successors, (207), 12 states have internal predecessors, (207), 5 states have call successors, (89), 2 states have call predecessors, (89), 5 states have return successors, (88), 6 states have call predecessors, (88), 5 states have call successors, (88) [2022-07-21 15:45:09,943 INFO L276 IsEmpty]: Start isEmpty. Operand 7200 states and 9063 transitions. [2022-07-21 15:45:09,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2022-07-21 15:45:09,947 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:45:09,948 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:45:09,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-21 15:45:10,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-07-21 15:45:10,172 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ldv_linux_usb_urb_usb_free_urbErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:45:10,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:45:10,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1356949358, now seen corresponding path program 1 times [2022-07-21 15:45:10,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:45:10,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562391201] [2022-07-21 15:45:10,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:45:10,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:45:10,232 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 15:45:10,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [597716565] [2022-07-21 15:45:10,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:45:10,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 15:45:10,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 15:45:10,248 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 15:45:10,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process