./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 eb692b52 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-?-eb692b5 [2022-07-20 04:11:08,596 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 04:11:08,597 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 04:11:08,639 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 04:11:08,639 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 04:11:08,640 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 04:11:08,642 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 04:11:08,644 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 04:11:08,646 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 04:11:08,649 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 04:11:08,650 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 04:11:08,652 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 04:11:08,653 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 04:11:08,654 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 04:11:08,655 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 04:11:08,658 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 04:11:08,659 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 04:11:08,660 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 04:11:08,661 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 04:11:08,662 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 04:11:08,664 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 04:11:08,664 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 04:11:08,665 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 04:11:08,666 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 04:11:08,667 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 04:11:08,670 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 04:11:08,673 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 04:11:08,673 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 04:11:08,674 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 04:11:08,675 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 04:11:08,676 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 04:11:08,676 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 04:11:08,677 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 04:11:08,678 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 04:11:08,679 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 04:11:08,680 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 04:11:08,680 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 04:11:08,681 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 04:11:08,681 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 04:11:08,681 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 04:11:08,682 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 04:11:08,684 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 04:11:08,685 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-20 04:11:08,711 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 04:11:08,712 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 04:11:08,712 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 04:11:08,713 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 04:11:08,714 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 04:11:08,714 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 04:11:08,714 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 04:11:08,715 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 04:11:08,715 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 04:11:08,716 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 04:11:08,716 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 04:11:08,716 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 04:11:08,716 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-20 04:11:08,716 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 04:11:08,716 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-20 04:11:08,717 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-20 04:11:08,717 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 04:11:08,717 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-20 04:11:08,717 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 04:11:08,718 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 04:11:08,719 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 04:11:08,719 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 04:11:08,719 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 04:11:08,719 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 04:11:08,719 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-20 04:11:08,720 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 04:11:08,720 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 04:11:08,720 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-20 04:11:08,720 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-20 04:11:08,720 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-20 04:11:08,721 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-20 04:11:08,956 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 04:11:08,981 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 04:11:08,983 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 04:11:08,984 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 04:11:08,985 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 04:11:08,986 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-20 04:11:09,047 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c91364f2/52527c193516412e9d14579710f02b76/FLAGbb8ddd3bc [2022-07-20 04:11:09,805 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 04:11:09,806 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-20 04:11:09,851 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c91364f2/52527c193516412e9d14579710f02b76/FLAGbb8ddd3bc [2022-07-20 04:11:09,876 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c91364f2/52527c193516412e9d14579710f02b76 [2022-07-20 04:11:09,878 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 04:11:09,880 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 04:11:09,883 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 04:11:09,884 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 04:11:09,887 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 04:11:09,887 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 04:11:09" (1/1) ... [2022-07-20 04:11:09,889 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23b1a1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:11:09, skipping insertion in model container [2022-07-20 04:11:09,889 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 04:11:09" (1/1) ... [2022-07-20 04:11:09,895 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 04:11:10,031 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 04:11:12,604 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-20 04:11:12,609 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-20 04:11:12,610 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-20 04:11:12,610 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-20 04:11:12,611 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-20 04:11:12,612 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-20 04:11:12,612 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-20 04:11:12,612 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-20 04:11:12,613 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-20 04:11:12,613 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-20 04:11:12,614 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-20 04:11:12,615 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-20 04:11:12,615 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-20 04:11:12,616 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-20 04:11:12,616 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-20 04:11:12,616 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-20 04:11:12,617 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-20 04:11:12,617 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-20 04:11:12,618 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-20 04:11:12,619 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-20 04:11:12,619 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-20 04:11:12,619 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-20 04:11:12,620 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-20 04:11:12,621 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-20 04:11:12,623 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-20 04:11:12,623 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-20 04:11:12,624 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-20 04:11:12,624 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-20 04:11:12,624 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-20 04:11:12,625 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-20 04:11:12,626 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-20 04:11:12,627 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-20 04:11:12,627 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-20 04:11:12,628 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-20 04:11:12,629 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-20 04:11:12,629 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-20 04:11:12,630 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-20 04:11:12,630 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-20 04:11:12,630 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-20 04:11:12,631 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-20 04:11:12,631 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-20 04:11:12,631 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-20 04:11:12,632 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-20 04:11:12,632 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-20 04:11:12,632 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-20 04:11:12,633 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-20 04:11:12,633 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-20 04:11:12,634 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-20 04:11:12,635 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-20 04:11:12,635 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-20 04:11:12,636 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-20 04:11:12,636 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-20 04:11:12,636 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-20 04:11:12,637 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-20 04:11:12,637 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-20 04:11:12,638 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-20 04:11:12,638 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-20 04:11:12,639 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-20 04:11:12,639 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-20 04:11:12,639 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-20 04:11:12,640 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-20 04:11:12,641 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-20 04:11:12,641 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-20 04:11:12,641 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-20 04:11:12,642 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-20 04:11:12,642 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-20 04:11:12,643 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-20 04:11:12,643 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-20 04:11:12,643 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-20 04:11:12,644 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-20 04:11:12,644 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-20 04:11:12,645 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-20 04:11:12,645 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-20 04:11:12,646 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-20 04:11:12,646 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-20 04:11:12,647 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-20 04:11:12,647 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-20 04:11:12,647 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-20 04:11:12,648 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-20 04:11:12,648 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-20 04:11:12,649 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-20 04:11:12,649 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-20 04:11:12,649 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-20 04:11:12,650 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-20 04:11:12,650 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-20 04:11:12,651 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-20 04:11:12,651 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-20 04:11:12,651 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-20 04:11:12,662 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 04:11:12,693 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 04:11:12,958 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-20 04:11:12,960 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-20 04:11:12,960 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-20 04:11:12,960 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-20 04:11:12,962 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-20 04:11:12,965 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-20 04:11:12,966 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-20 04:11:12,966 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-20 04:11:12,967 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-20 04:11:12,967 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-20 04:11:12,968 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-20 04:11:12,968 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-20 04:11:12,968 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-20 04:11:12,969 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-20 04:11:12,969 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-20 04:11:12,969 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-20 04:11:12,970 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-20 04:11:12,970 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-20 04:11:12,970 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-20 04:11:12,971 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-20 04:11:12,971 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-20 04:11:12,971 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-20 04:11:12,972 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-20 04:11:12,973 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-20 04:11:12,974 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-20 04:11:12,974 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-20 04:11:12,975 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-20 04:11:12,975 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-20 04:11:12,975 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-20 04:11:12,976 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-20 04:11:12,976 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-20 04:11:12,976 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-20 04:11:12,976 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-20 04:11:12,977 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-20 04:11:12,978 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-20 04:11:12,978 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-20 04:11:12,978 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-20 04:11:12,982 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-20 04:11:12,982 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-20 04:11:12,983 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-20 04:11:12,984 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-20 04:11:12,985 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-20 04:11:12,985 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-20 04:11:12,985 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-20 04:11:12,986 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-20 04:11:12,986 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-20 04:11:12,986 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-20 04:11:12,986 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-20 04:11:12,991 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-20 04:11:12,992 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-20 04:11:12,993 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-20 04:11:12,993 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-20 04:11:12,993 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-20 04:11:12,994 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-20 04:11:12,995 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-20 04:11:12,995 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-20 04:11:12,995 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-20 04:11:12,996 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-20 04:11:12,996 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-20 04:11:12,996 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-20 04:11:12,997 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-20 04:11:12,998 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-20 04:11:12,999 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-20 04:11:13,001 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-20 04:11:13,001 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-20 04:11:13,002 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-20 04:11:13,002 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-20 04:11:13,003 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-20 04:11:13,007 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-20 04:11:13,008 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-20 04:11:13,012 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-20 04:11:13,012 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-20 04:11:13,018 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-20 04:11:13,019 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-20 04:11:13,019 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-20 04:11:13,020 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-20 04:11:13,020 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-20 04:11:13,020 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-20 04:11:13,021 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-20 04:11:13,022 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-20 04:11:13,023 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-20 04:11:13,024 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-20 04:11:13,025 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-20 04:11:13,025 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-20 04:11:13,025 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-20 04:11:13,026 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-20 04:11:13,026 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-20 04:11:13,026 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-20 04:11:13,029 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 04:11:13,191 INFO L208 MainTranslator]: Completed translation [2022-07-20 04:11:13,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:11:13 WrapperNode [2022-07-20 04:11:13,192 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 04:11:13,193 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 04:11:13,193 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 04:11:13,193 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 04:11:13,200 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:11:13" (1/1) ... [2022-07-20 04:11:13,289 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:11:13" (1/1) ... [2022-07-20 04:11:13,443 INFO L137 Inliner]: procedures = 592, calls = 1771, calls flagged for inlining = 263, calls inlined = 169, statements flattened = 3189 [2022-07-20 04:11:13,444 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 04:11:13,445 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 04:11:13,445 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 04:11:13,445 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 04:11:13,452 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:11:13" (1/1) ... [2022-07-20 04:11:13,452 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:11:13" (1/1) ... [2022-07-20 04:11:13,465 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:11:13" (1/1) ... [2022-07-20 04:11:13,466 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:11:13" (1/1) ... [2022-07-20 04:11:13,524 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:11:13" (1/1) ... [2022-07-20 04:11:13,534 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:11:13" (1/1) ... [2022-07-20 04:11:13,555 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:11:13" (1/1) ... [2022-07-20 04:11:13,596 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 04:11:13,602 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 04:11:13,603 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 04:11:13,603 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 04:11:13,604 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:11:13" (1/1) ... [2022-07-20 04:11:13,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 04:11:13,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 04:11:13,641 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-20 04:11:13,665 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-20 04:11:13,686 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-07-20 04:11:13,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-07-20 04:11:13,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-20 04:11:13,686 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-20 04:11:13,687 INFO L130 BoogieDeclarations]: Found specification of procedure recover_from_urb_loss [2022-07-20 04:11:13,687 INFO L138 BoogieDeclarations]: Found implementation of procedure recover_from_urb_loss [2022-07-20 04:11:13,687 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_control_urb [2022-07-20 04:11:13,687 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_control_urb [2022-07-20 04:11:13,687 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-20 04:11:13,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-20 04:11:13,687 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-20 04:11:13,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-20 04:11:13,688 INFO L130 BoogieDeclarations]: Found specification of procedure __might_sleep [2022-07-20 04:11:13,688 INFO L138 BoogieDeclarations]: Found implementation of procedure __might_sleep [2022-07-20 04:11:13,688 INFO L130 BoogieDeclarations]: Found specification of procedure usb_autopm_get_interface [2022-07-20 04:11:13,688 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_autopm_get_interface [2022-07-20 04:11:13,688 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-20 04:11:13,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-20 04:11:13,688 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-07-20 04:11:13,688 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-07-20 04:11:13,689 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-07-20 04:11:13,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-07-20 04:11:13,689 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-07-20 04:11:13,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-07-20 04:11:13,689 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_ioctl [2022-07-20 04:11:13,689 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_ioctl [2022-07-20 04:11:13,689 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-20 04:11:13,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-20 04:11:13,690 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_iuspin_of_wdm_device [2022-07-20 04:11:13,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_iuspin_of_wdm_device [2022-07-20 04:11:13,690 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-20 04:11:13,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-20 04:11:13,690 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-07-20 04:11:13,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-07-20 04:11:13,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 04:11:13,690 INFO L130 BoogieDeclarations]: Found specification of procedure cancel_work_sync [2022-07-20 04:11:13,691 INFO L138 BoogieDeclarations]: Found implementation of procedure cancel_work_sync [2022-07-20 04:11:13,691 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2022-07-20 04:11:13,691 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2022-07-20 04:11:13,691 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-07-20 04:11:13,691 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-07-20 04:11:13,691 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-07-20 04:11:13,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-07-20 04:11:13,691 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2022-07-20 04:11:13,692 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2022-07-20 04:11:13,692 INFO L130 BoogieDeclarations]: Found specification of procedure schedule [2022-07-20 04:11:13,692 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule [2022-07-20 04:11:13,692 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2022-07-20 04:11:13,692 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2022-07-20 04:11:13,692 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~TO~int [2022-07-20 04:11:13,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~TO~int [2022-07-20 04:11:13,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-20 04:11:13,693 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2022-07-20 04:11:13,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2022-07-20 04:11:13,693 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-20 04:11:13,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-20 04:11:13,694 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irq_111 [2022-07-20 04:11:13,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irq_111 [2022-07-20 04:11:13,694 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-20 04:11:13,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-20 04:11:13,694 INFO L130 BoogieDeclarations]: Found specification of procedure usb_autopm_put_interface [2022-07-20 04:11:13,694 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_autopm_put_interface [2022-07-20 04:11:13,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-20 04:11:13,694 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-07-20 04:11:13,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-07-20 04:11:13,695 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2022-07-20 04:11:13,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2022-07-20 04:11:13,695 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-07-20 04:11:13,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-07-20 04:11:13,695 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-07-20 04:11:13,695 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-07-20 04:11:13,696 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_wlock_of_wdm_device [2022-07-20 04:11:13,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_wlock_of_wdm_device [2022-07-20 04:11:13,700 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-07-20 04:11:13,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-07-20 04:11:13,700 INFO L130 BoogieDeclarations]: Found specification of procedure kill_urbs [2022-07-20 04:11:13,700 INFO L138 BoogieDeclarations]: Found implementation of procedure kill_urbs [2022-07-20 04:11:13,700 INFO L130 BoogieDeclarations]: Found specification of procedure prepare_to_wait_event [2022-07-20 04:11:13,701 INFO L138 BoogieDeclarations]: Found implementation of procedure prepare_to_wait_event [2022-07-20 04:11:13,701 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-07-20 04:11:13,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-07-20 04:11:13,702 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2022-07-20 04:11:13,702 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2022-07-20 04:11:13,702 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-20 04:11:13,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-20 04:11:13,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 04:11:13,702 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_iuspin_of_wdm_device [2022-07-20 04:11:13,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_iuspin_of_wdm_device [2022-07-20 04:11:13,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 04:11:13,703 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-20 04:11:13,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-20 04:11:13,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 04:11:13,703 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2022-07-20 04:11:13,703 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2022-07-20 04:11:13,703 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2022-07-20 04:11:13,703 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2022-07-20 04:11:13,703 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_irq_check_alloc_flags [2022-07-20 04:11:13,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_irq_check_alloc_flags [2022-07-20 04:11:13,704 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-07-20 04:11:13,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-07-20 04:11:13,704 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_find_device [2022-07-20 04:11:13,704 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_find_device [2022-07-20 04:11:13,704 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2022-07-20 04:11:13,704 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2022-07-20 04:11:13,704 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2022-07-20 04:11:13,705 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2022-07-20 04:11:13,705 INFO L130 BoogieDeclarations]: Found specification of procedure finish_wait [2022-07-20 04:11:13,705 INFO L138 BoogieDeclarations]: Found implementation of procedure finish_wait [2022-07-20 04:11:13,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 04:11:13,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 04:11:13,705 INFO L130 BoogieDeclarations]: Found specification of procedure usb_translate_errors [2022-07-20 04:11:13,705 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_translate_errors [2022-07-20 04:11:13,705 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-20 04:11:13,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-20 04:11:13,706 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-20 04:11:13,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-20 04:11:13,706 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_create [2022-07-20 04:11:13,706 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_create [2022-07-20 04:11:13,706 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_128 [2022-07-20 04:11:13,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_128 [2022-07-20 04:11:13,707 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-07-20 04:11:13,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-07-20 04:11:13,707 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_free_urb [2022-07-20 04:11:13,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_free_urb [2022-07-20 04:11:13,708 INFO L130 BoogieDeclarations]: Found specification of procedure clear_wdm_read_flag [2022-07-20 04:11:13,708 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_wdm_read_flag [2022-07-20 04:11:13,708 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-07-20 04:11:13,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-07-20 04:11:13,708 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-20 04:11:13,708 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2022-07-20 04:11:13,708 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2022-07-20 04:11:13,708 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-20 04:11:13,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-20 04:11:13,709 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_disconnect [2022-07-20 04:11:13,709 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_disconnect [2022-07-20 04:11:13,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 04:11:13,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-20 04:11:13,709 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_wdm_mutex [2022-07-20 04:11:13,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_wdm_mutex [2022-07-20 04:11:13,709 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-07-20 04:11:13,710 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-07-20 04:11:13,710 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2022-07-20 04:11:13,710 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2022-07-20 04:11:13,710 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-20 04:11:13,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-20 04:11:13,710 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_rlock_of_wdm_device [2022-07-20 04:11:13,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_rlock_of_wdm_device [2022-07-20 04:11:13,710 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-20 04:11:13,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-20 04:11:13,711 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-20 04:11:13,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-20 04:11:13,711 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2022-07-20 04:11:13,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2022-07-20 04:11:13,711 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_alloc_urb [2022-07-20 04:11:13,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_alloc_urb [2022-07-20 04:11:13,711 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-20 04:11:13,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-20 04:11:13,712 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-20 04:11:13,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-20 04:11:13,712 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-07-20 04:11:13,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-07-20 04:11:13,712 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2022-07-20 04:11:13,712 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2022-07-20 04:11:13,712 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-20 04:11:13,712 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-20 04:11:13,713 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-07-20 04:11:13,713 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-07-20 04:11:13,713 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_wdm_mutex [2022-07-20 04:11:13,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_wdm_mutex [2022-07-20 04:11:13,713 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-20 04:11:13,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-20 04:11:13,713 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-20 04:11:13,713 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-20 04:11:13,713 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-20 04:11:13,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-20 04:11:13,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-20 04:11:13,714 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-20 04:11:13,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-20 04:11:13,714 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-20 04:11:13,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-20 04:11:13,714 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_95 [2022-07-20 04:11:13,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_95 [2022-07-20 04:11:13,715 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_resume [2022-07-20 04:11:13,715 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_resume [2022-07-20 04:11:13,715 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-20 04:11:13,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-20 04:11:13,715 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_96 [2022-07-20 04:11:13,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_96 [2022-07-20 04:11:13,715 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_rlock_of_wdm_device [2022-07-20 04:11:13,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_rlock_of_wdm_device [2022-07-20 04:11:13,716 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2022-07-20 04:11:13,716 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2022-07-20 04:11:13,716 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-20 04:11:13,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-20 04:11:13,716 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-20 04:11:13,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-20 04:11:13,717 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2022-07-20 04:11:13,717 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2022-07-20 04:11:13,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 04:11:13,717 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_wlock_of_wdm_device [2022-07-20 04:11:13,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_wlock_of_wdm_device [2022-07-20 04:11:13,717 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_irq_110 [2022-07-20 04:11:13,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_irq_110 [2022-07-20 04:11:14,352 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 04:11:14,355 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 04:11:14,510 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-20 04:11:17,983 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 04:11:17,997 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 04:11:17,997 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-20 04:11:18,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 04:11:18 BoogieIcfgContainer [2022-07-20 04:11:18,001 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 04:11:18,002 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 04:11:18,003 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 04:11:18,006 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 04:11:18,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 04:11:09" (1/3) ... [2022-07-20 04:11:18,007 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@363648c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 04:11:18, skipping insertion in model container [2022-07-20 04:11:18,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:11:13" (2/3) ... [2022-07-20 04:11:18,007 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@363648c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 04:11:18, skipping insertion in model container [2022-07-20 04:11:18,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 04:11:18" (3/3) ... [2022-07-20 04:11:18,008 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i [2022-07-20 04:11:18,022 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 04:11:18,022 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2022-07-20 04:11:18,110 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 04:11:18,120 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@2fd744d5, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@29895279 [2022-07-20 04:11:18,120 INFO L358 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2022-07-20 04:11:18,131 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-20 04:11:18,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-20 04:11:18,144 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:11:18,145 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-20 04:11:18,146 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-20 04:11:18,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:11:18,153 INFO L85 PathProgramCache]: Analyzing trace with hash 975260104, now seen corresponding path program 1 times [2022-07-20 04:11:18,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:11:18,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724841955] [2022-07-20 04:11:18,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:11:18,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:11:18,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:18,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:11:18,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:18,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:11:18,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:18,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:11:18,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:18,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:11:18,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:18,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:11:18,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:18,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:11:18,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:18,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:11:18,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:18,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:11:18,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:18,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:11:18,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:18,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:11:18,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:18,890 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-20 04:11:18,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:11:18,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724841955] [2022-07-20 04:11:18,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724841955] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:11:18,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:11:18,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:11:18,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731079193] [2022-07-20 04:11:18,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:11:18,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:11:18,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:11:18,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:11:18,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:11:18,935 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-20 04:11:22,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:11:22,480 INFO L93 Difference]: Finished difference Result 2639 states and 3702 transitions. [2022-07-20 04:11:22,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:11:22,482 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-20 04:11:22,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:11:22,502 INFO L225 Difference]: With dead ends: 2639 [2022-07-20 04:11:22,502 INFO L226 Difference]: Without dead ends: 1333 [2022-07-20 04:11:22,513 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-20 04:11:22,516 INFO L413 NwaCegarLoop]: 1643 mSDtfsCounter, 2296 mSDsluCounter, 1708 mSDsCounter, 0 mSdLazyCounter, 1673 mSolverCounterSat, 1298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2533 SdHoareTripleChecker+Valid, 3351 SdHoareTripleChecker+Invalid, 2971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1298 IncrementalHoareTripleChecker+Valid, 1673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-07-20 04:11:22,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2533 Valid, 3351 Invalid, 2971 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1298 Valid, 1673 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-07-20 04:11:22,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1333 states. [2022-07-20 04:11:22,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1333 to 1333. [2022-07-20 04:11:22,657 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-20 04:11:22,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 1760 transitions. [2022-07-20 04:11:22,672 INFO L78 Accepts]: Start accepts. Automaton has 1333 states and 1760 transitions. Word has length 71 [2022-07-20 04:11:22,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:11:22,674 INFO L495 AbstractCegarLoop]: Abstraction has 1333 states and 1760 transitions. [2022-07-20 04:11:22,674 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-20 04:11:22,674 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 1760 transitions. [2022-07-20 04:11:22,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-20 04:11:22,683 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:11:22,683 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-20 04:11:22,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 04:11:22,684 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-20 04:11:22,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:11:22,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1189993464, now seen corresponding path program 1 times [2022-07-20 04:11:22,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:11:22,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724807633] [2022-07-20 04:11:22,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:11:22,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:11:22,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:22,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:11:22,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:22,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:11:22,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:22,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:11:22,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:22,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:11:22,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:22,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:11:22,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:22,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:11:22,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:22,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:11:22,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:23,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:11:23,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:23,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:11:23,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:23,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:11:23,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:23,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 04:11:23,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:23,042 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-20 04:11:23,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:11:23,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724807633] [2022-07-20 04:11:23,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724807633] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:11:23,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:11:23,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:11:23,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329113145] [2022-07-20 04:11:23,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:11:23,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:11:23,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:11:23,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:11:23,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:11:23,047 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-20 04:11:25,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:11:25,966 INFO L93 Difference]: Finished difference Result 1333 states and 1760 transitions. [2022-07-20 04:11:25,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:11:25,966 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-20 04:11:25,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:11:25,974 INFO L225 Difference]: With dead ends: 1333 [2022-07-20 04:11:25,975 INFO L226 Difference]: Without dead ends: 1331 [2022-07-20 04:11:25,976 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-20 04:11:25,977 INFO L413 NwaCegarLoop]: 1623 mSDtfsCounter, 2262 mSDsluCounter, 1688 mSDsCounter, 0 mSdLazyCounter, 1659 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s 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.7s IncrementalHoareTripleChecker+Time [2022-07-20 04:11:25,977 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.7s Time] [2022-07-20 04:11:25,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2022-07-20 04:11:26,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 1331. [2022-07-20 04:11:26,031 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-20 04:11:26,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 1758 transitions. [2022-07-20 04:11:26,041 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 1758 transitions. Word has length 77 [2022-07-20 04:11:26,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:11:26,042 INFO L495 AbstractCegarLoop]: Abstraction has 1331 states and 1758 transitions. [2022-07-20 04:11:26,043 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-20 04:11:26,043 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 1758 transitions. [2022-07-20 04:11:26,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-20 04:11:26,044 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:11:26,044 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-20 04:11:26,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 04:11:26,045 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-20 04:11:26,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:11:26,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1626433505, now seen corresponding path program 1 times [2022-07-20 04:11:26,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:11:26,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817478789] [2022-07-20 04:11:26,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:11:26,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:11:26,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:26,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:11:26,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:26,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:11:26,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:26,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:11:26,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:26,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:11:26,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:26,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:11:26,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:26,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:11:26,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:26,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:11:26,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:26,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:11:26,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:26,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:11:26,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:26,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:11:26,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:26,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 04:11:26,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:26,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 04:11:26,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:26,363 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-20 04:11:26,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:11:26,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817478789] [2022-07-20 04:11:26,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817478789] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:11:26,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:11:26,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:11:26,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46850603] [2022-07-20 04:11:26,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:11:26,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:11:26,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:11:26,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:11:26,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:11:26,367 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-20 04:11:29,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:11:29,722 INFO L93 Difference]: Finished difference Result 1331 states and 1758 transitions. [2022-07-20 04:11:29,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:11:29,722 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-20 04:11:29,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:11:29,730 INFO L225 Difference]: With dead ends: 1331 [2022-07-20 04:11:29,731 INFO L226 Difference]: Without dead ends: 1329 [2022-07-20 04:11:29,732 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-20 04:11:29,733 INFO L413 NwaCegarLoop]: 1621 mSDtfsCounter, 2256 mSDsluCounter, 1688 mSDsCounter, 0 mSdLazyCounter, 1657 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s 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, 3.2s IncrementalHoareTripleChecker+Time [2022-07-20 04:11:29,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2489 Valid, 3309 Invalid, 2945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 1657 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-07-20 04:11:29,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2022-07-20 04:11:29,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 1329. [2022-07-20 04:11:29,789 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-20 04:11:29,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1329 states to 1329 states and 1756 transitions. [2022-07-20 04:11:29,799 INFO L78 Accepts]: Start accepts. Automaton has 1329 states and 1756 transitions. Word has length 83 [2022-07-20 04:11:29,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:11:29,800 INFO L495 AbstractCegarLoop]: Abstraction has 1329 states and 1756 transitions. [2022-07-20 04:11:29,800 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-20 04:11:29,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1329 states and 1756 transitions. [2022-07-20 04:11:29,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-20 04:11:29,802 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:11:29,802 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-20 04:11:29,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 04:11:29,803 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-20 04:11:29,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:11:29,803 INFO L85 PathProgramCache]: Analyzing trace with hash -586799079, now seen corresponding path program 1 times [2022-07-20 04:11:29,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:11:29,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089885819] [2022-07-20 04:11:29,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:11:29,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:11:29,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:29,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:11:29,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:29,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:11:29,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:29,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:11:29,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:29,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:11:29,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:29,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:11:30,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:30,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:11:30,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:30,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:11:30,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:30,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:11:30,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:30,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:11:30,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:30,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:11:30,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:30,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 04:11:30,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:30,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 04:11:30,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:30,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 04:11:30,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:30,078 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-20 04:11:30,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:11:30,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089885819] [2022-07-20 04:11:30,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089885819] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:11:30,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:11:30,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:11:30,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132918725] [2022-07-20 04:11:30,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:11:30,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:11:30,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:11:30,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:11:30,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:11:30,082 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-20 04:11:33,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:11:33,063 INFO L93 Difference]: Finished difference Result 1329 states and 1756 transitions. [2022-07-20 04:11:33,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:11:33,064 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-20 04:11:33,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:11:33,071 INFO L225 Difference]: With dead ends: 1329 [2022-07-20 04:11:33,071 INFO L226 Difference]: Without dead ends: 1327 [2022-07-20 04:11:33,072 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-20 04:11:33,073 INFO L413 NwaCegarLoop]: 1619 mSDtfsCounter, 2250 mSDsluCounter, 1688 mSDsCounter, 0 mSdLazyCounter, 1655 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s 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.8s IncrementalHoareTripleChecker+Time [2022-07-20 04:11:33,073 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.8s Time] [2022-07-20 04:11:33,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1327 states. [2022-07-20 04:11:33,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1327 to 1327. [2022-07-20 04:11:33,116 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-20 04:11:33,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1327 states to 1327 states and 1754 transitions. [2022-07-20 04:11:33,124 INFO L78 Accepts]: Start accepts. Automaton has 1327 states and 1754 transitions. Word has length 89 [2022-07-20 04:11:33,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:11:33,124 INFO L495 AbstractCegarLoop]: Abstraction has 1327 states and 1754 transitions. [2022-07-20 04:11:33,125 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-20 04:11:33,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1327 states and 1754 transitions. [2022-07-20 04:11:33,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-20 04:11:33,126 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:11:33,126 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-20 04:11:33,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-20 04:11:33,127 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-20 04:11:33,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:11:33,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1454441485, now seen corresponding path program 1 times [2022-07-20 04:11:33,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:11:33,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364155018] [2022-07-20 04:11:33,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:11:33,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:11:33,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:33,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:11:33,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:33,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:11:33,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:33,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:11:33,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:33,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:11:33,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:33,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:11:33,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:33,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:11:33,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:33,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:11:33,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:33,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:11:33,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:33,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:11:33,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:33,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:11:33,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:33,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 04:11:33,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:33,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 04:11:33,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:33,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 04:11:33,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:33,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 04:11:33,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:33,358 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-20 04:11:33,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:11:33,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364155018] [2022-07-20 04:11:33,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364155018] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:11:33,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:11:33,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:11:33,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985088785] [2022-07-20 04:11:33,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:11:33,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:11:33,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:11:33,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:11:33,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:11:33,361 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-20 04:11:36,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:11:36,158 INFO L93 Difference]: Finished difference Result 1327 states and 1754 transitions. [2022-07-20 04:11:36,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:11:36,159 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-20 04:11:36,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:11:36,167 INFO L225 Difference]: With dead ends: 1327 [2022-07-20 04:11:36,167 INFO L226 Difference]: Without dead ends: 1325 [2022-07-20 04:11:36,169 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-20 04:11:36,171 INFO L413 NwaCegarLoop]: 1617 mSDtfsCounter, 2244 mSDsluCounter, 1688 mSDsCounter, 0 mSdLazyCounter, 1653 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s 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.7s IncrementalHoareTripleChecker+Time [2022-07-20 04:11:36,171 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.7s Time] [2022-07-20 04:11:36,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1325 states. [2022-07-20 04:11:36,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1325 to 1325. [2022-07-20 04:11:36,254 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-20 04:11:36,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 1752 transitions. [2022-07-20 04:11:36,261 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 1752 transitions. Word has length 95 [2022-07-20 04:11:36,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:11:36,263 INFO L495 AbstractCegarLoop]: Abstraction has 1325 states and 1752 transitions. [2022-07-20 04:11:36,263 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-20 04:11:36,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 1752 transitions. [2022-07-20 04:11:36,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-20 04:11:36,264 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:11:36,265 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-20 04:11:36,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-20 04:11:36,265 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-20 04:11:36,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:11:36,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1693669281, now seen corresponding path program 1 times [2022-07-20 04:11:36,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:11:36,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127279464] [2022-07-20 04:11:36,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:11:36,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:11:36,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:36,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:11:36,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:36,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:11:36,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:36,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:11:36,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:36,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:11:36,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:36,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:11:36,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:36,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:11:36,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:36,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:11:36,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:36,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:11:36,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:36,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:11:36,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:36,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:11:36,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:36,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 04:11:36,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:36,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 04:11:36,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:36,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 04:11:36,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:36,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 04:11:36,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:36,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-20 04:11:36,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:36,522 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-20 04:11:36,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:11:36,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127279464] [2022-07-20 04:11:36,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127279464] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:11:36,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:11:36,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:11:36,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800787996] [2022-07-20 04:11:36,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:11:36,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:11:36,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:11:36,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:11:36,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:11:36,526 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-20 04:11:39,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:11:39,699 INFO L93 Difference]: Finished difference Result 1325 states and 1752 transitions. [2022-07-20 04:11:39,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:11:39,700 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-20 04:11:39,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:11:39,707 INFO L225 Difference]: With dead ends: 1325 [2022-07-20 04:11:39,707 INFO L226 Difference]: Without dead ends: 1323 [2022-07-20 04:11:39,708 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-20 04:11:39,709 INFO L413 NwaCegarLoop]: 1615 mSDtfsCounter, 2238 mSDsluCounter, 1688 mSDsCounter, 0 mSdLazyCounter, 1651 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s 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, 3.0s IncrementalHoareTripleChecker+Time [2022-07-20 04:11:39,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2468 Valid, 3303 Invalid, 2939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 1651 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-07-20 04:11:39,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2022-07-20 04:11:39,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 1323. [2022-07-20 04:11:39,761 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-20 04:11:39,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1323 states to 1323 states and 1750 transitions. [2022-07-20 04:11:39,768 INFO L78 Accepts]: Start accepts. Automaton has 1323 states and 1750 transitions. Word has length 101 [2022-07-20 04:11:39,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:11:39,769 INFO L495 AbstractCegarLoop]: Abstraction has 1323 states and 1750 transitions. [2022-07-20 04:11:39,769 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-20 04:11:39,769 INFO L276 IsEmpty]: Start isEmpty. Operand 1323 states and 1750 transitions. [2022-07-20 04:11:39,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-20 04:11:39,772 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:11:39,772 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-20 04:11:39,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-20 04:11:39,773 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-20 04:11:39,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:11:39,774 INFO L85 PathProgramCache]: Analyzing trace with hash 203341486, now seen corresponding path program 1 times [2022-07-20 04:11:39,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:11:39,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918273451] [2022-07-20 04:11:39,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:11:39,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:11:39,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:39,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:11:39,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:39,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:11:39,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:39,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:11:39,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:39,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:11:39,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:39,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:11:39,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:40,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:11:40,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:40,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:11:40,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:40,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:11:40,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:40,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:11:40,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:40,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:11:40,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:40,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 04:11:40,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:40,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 04:11:40,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:40,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 04:11:40,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:40,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 04:11:40,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:40,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-20 04:11:40,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:40,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-20 04:11:40,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:40,084 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-20 04:11:40,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:11:40,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918273451] [2022-07-20 04:11:40,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918273451] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:11:40,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:11:40,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:11:40,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310812932] [2022-07-20 04:11:40,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:11:40,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:11:40,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:11:40,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:11:40,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:11:40,086 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-20 04:11:42,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:11:42,854 INFO L93 Difference]: Finished difference Result 1323 states and 1750 transitions. [2022-07-20 04:11:42,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:11:42,854 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-20 04:11:42,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:11:42,861 INFO L225 Difference]: With dead ends: 1323 [2022-07-20 04:11:42,862 INFO L226 Difference]: Without dead ends: 1321 [2022-07-20 04:11:42,863 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-20 04:11:42,863 INFO L413 NwaCegarLoop]: 1613 mSDtfsCounter, 2232 mSDsluCounter, 1688 mSDsCounter, 0 mSdLazyCounter, 1649 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s 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.6s IncrementalHoareTripleChecker+Time [2022-07-20 04:11:42,864 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.6s Time] [2022-07-20 04:11:42,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2022-07-20 04:11:42,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 1321. [2022-07-20 04:11:42,915 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-20 04:11:42,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1748 transitions. [2022-07-20 04:11:42,922 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1748 transitions. Word has length 107 [2022-07-20 04:11:42,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:11:42,923 INFO L495 AbstractCegarLoop]: Abstraction has 1321 states and 1748 transitions. [2022-07-20 04:11:42,923 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-20 04:11:42,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1748 transitions. [2022-07-20 04:11:42,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-07-20 04:11:42,924 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:11:42,925 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-20 04:11:42,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-20 04:11:42,925 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-20 04:11:42,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:11:42,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1038477238, now seen corresponding path program 1 times [2022-07-20 04:11:42,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:11:42,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103122951] [2022-07-20 04:11:42,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:11:42,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:11:42,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:43,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:11:43,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:43,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:11:43,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:43,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:11:43,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:43,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:11:43,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:43,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:11:43,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:43,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:11:43,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:43,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:11:43,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:43,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:11:43,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:43,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:11:43,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:43,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:11:43,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:43,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 04:11:43,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:43,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 04:11:43,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:43,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 04:11:43,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:43,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 04:11:43,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:43,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-20 04:11:43,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:43,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-20 04:11:43,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:43,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-20 04:11:43,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:43,225 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-20 04:11:43,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:11:43,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103122951] [2022-07-20 04:11:43,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103122951] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:11:43,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:11:43,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:11:43,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418892276] [2022-07-20 04:11:43,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:11:43,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:11:43,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:11:43,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:11:43,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:11:43,228 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-20 04:11:45,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:11:45,668 INFO L93 Difference]: Finished difference Result 1321 states and 1748 transitions. [2022-07-20 04:11:45,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:11:45,671 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-20 04:11:45,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:11:45,679 INFO L225 Difference]: With dead ends: 1321 [2022-07-20 04:11:45,680 INFO L226 Difference]: Without dead ends: 1319 [2022-07-20 04:11:45,681 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-20 04:11:45,681 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-20 04:11:45,682 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-20 04:11:45,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2022-07-20 04:11:45,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1319. [2022-07-20 04:11:45,734 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-20 04:11:45,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1319 states and 1746 transitions. [2022-07-20 04:11:45,740 INFO L78 Accepts]: Start accepts. Automaton has 1319 states and 1746 transitions. Word has length 113 [2022-07-20 04:11:45,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:11:45,740 INFO L495 AbstractCegarLoop]: Abstraction has 1319 states and 1746 transitions. [2022-07-20 04:11:45,740 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-20 04:11:45,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 1746 transitions. [2022-07-20 04:11:45,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-07-20 04:11:45,743 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:11:45,744 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-20 04:11:45,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-20 04:11:45,744 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-20 04:11:45,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:11:45,745 INFO L85 PathProgramCache]: Analyzing trace with hash 470652601, now seen corresponding path program 1 times [2022-07-20 04:11:45,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:11:45,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550116398] [2022-07-20 04:11:45,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:11:45,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:11:45,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:45,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:11:45,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:45,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:11:45,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:45,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:11:45,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:45,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:11:45,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:45,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-20 04:11:45,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:45,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:11:45,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:45,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:11:45,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:45,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:11:45,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:45,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-20 04:11:45,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:45,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:11:45,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:45,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:11:45,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:45,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:11:45,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:45,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 04:11:45,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:46,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:11:46,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:46,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:11:46,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:46,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:11:46,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:46,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 04:11:46,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:46,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:11:46,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:46,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:11:46,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:46,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:11:46,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:46,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:11:46,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:46,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:11:46,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:46,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:11:46,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:46,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:11:46,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:46,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 04:11:46,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:46,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-20 04:11:46,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:46,078 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-20 04:11:46,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:11:46,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550116398] [2022-07-20 04:11:46,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550116398] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:11:46,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:11:46,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:11:46,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499528965] [2022-07-20 04:11:46,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:11:46,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:11:46,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:11:46,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:11:46,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:11:46,082 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-20 04:11:49,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:11:49,167 INFO L93 Difference]: Finished difference Result 2452 states and 3227 transitions. [2022-07-20 04:11:49,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 04:11:49,167 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-20 04:11:49,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:11:49,176 INFO L225 Difference]: With dead ends: 2452 [2022-07-20 04:11:49,177 INFO L226 Difference]: Without dead ends: 1329 [2022-07-20 04:11:49,181 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-20 04:11:49,182 INFO L413 NwaCegarLoop]: 1355 mSDtfsCounter, 2602 mSDsluCounter, 1411 mSDsCounter, 0 mSdLazyCounter, 1394 mSolverCounterSat, 1770 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s 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.9s IncrementalHoareTripleChecker+Time [2022-07-20 04:11:49,182 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.9s Time] [2022-07-20 04:11:49,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2022-07-20 04:11:49,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 1315. [2022-07-20 04:11:49,242 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-20 04:11:49,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1315 states to 1315 states and 1741 transitions. [2022-07-20 04:11:49,248 INFO L78 Accepts]: Start accepts. Automaton has 1315 states and 1741 transitions. Word has length 155 [2022-07-20 04:11:49,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:11:49,249 INFO L495 AbstractCegarLoop]: Abstraction has 1315 states and 1741 transitions. [2022-07-20 04:11:49,249 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-20 04:11:49,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1315 states and 1741 transitions. [2022-07-20 04:11:49,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-20 04:11:49,251 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:11:49,251 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-20 04:11:49,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-20 04:11:49,251 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-20 04:11:49,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:11:49,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1544345977, now seen corresponding path program 1 times [2022-07-20 04:11:49,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:11:49,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457942270] [2022-07-20 04:11:49,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:11:49,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:11:49,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:49,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:11:49,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:49,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:11:49,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:49,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:11:49,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:49,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:11:49,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:49,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:11:49,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:49,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:11:49,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:49,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:11:49,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:49,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:11:49,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:49,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:11:49,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:49,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:11:49,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:49,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 04:11:49,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:49,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 04:11:49,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:49,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 04:11:49,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:49,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 04:11:49,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:49,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-20 04:11:49,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:49,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-20 04:11:49,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:49,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-20 04:11:49,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:49,469 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-20 04:11:49,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:11:49,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457942270] [2022-07-20 04:11:49,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457942270] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:11:49,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:11:49,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:11:49,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730975068] [2022-07-20 04:11:49,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:11:49,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:11:49,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:11:49,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:11:49,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:11:49,472 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-20 04:11:52,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:11:52,721 INFO L93 Difference]: Finished difference Result 1315 states and 1741 transitions. [2022-07-20 04:11:52,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:11:52,723 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-20 04:11:52,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:11:52,728 INFO L225 Difference]: With dead ends: 1315 [2022-07-20 04:11:52,728 INFO L226 Difference]: Without dead ends: 1313 [2022-07-20 04:11:52,729 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-20 04:11:52,729 INFO L413 NwaCegarLoop]: 1604 mSDtfsCounter, 2213 mSDsluCounter, 1674 mSDsCounter, 0 mSdLazyCounter, 1644 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s 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, 3.1s IncrementalHoareTripleChecker+Time [2022-07-20 04:11:52,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2441 Valid, 3278 Invalid, 2932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 1644 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-07-20 04:11:52,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1313 states. [2022-07-20 04:11:52,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1313 to 1313. [2022-07-20 04:11:52,787 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-20 04:11:52,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1313 states to 1313 states and 1739 transitions. [2022-07-20 04:11:52,792 INFO L78 Accepts]: Start accepts. Automaton has 1313 states and 1739 transitions. Word has length 115 [2022-07-20 04:11:52,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:11:52,793 INFO L495 AbstractCegarLoop]: Abstraction has 1313 states and 1739 transitions. [2022-07-20 04:11:52,793 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-20 04:11:52,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1313 states and 1739 transitions. [2022-07-20 04:11:52,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-07-20 04:11:52,795 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:11:52,796 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-20 04:11:52,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-20 04:11:52,796 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-20 04:11:52,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:11:52,797 INFO L85 PathProgramCache]: Analyzing trace with hash 800072008, now seen corresponding path program 1 times [2022-07-20 04:11:52,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:11:52,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851884966] [2022-07-20 04:11:52,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:11:52,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:11:52,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:52,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:11:52,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:52,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:11:52,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:52,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:11:52,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:52,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:11:52,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:52,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-20 04:11:52,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:52,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:11:52,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:52,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:11:52,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:52,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:11:52,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:52,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-20 04:11:52,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:52,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:11:52,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:52,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:11:53,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:53,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:11:53,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:53,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 04:11:53,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:53,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:11:53,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:53,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:11:53,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:53,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:11:53,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:53,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 04:11:53,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:53,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:11:53,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:53,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:11:53,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:53,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:11:53,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:53,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:11:53,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:53,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:11:53,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:53,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:11:53,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:53,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:11:53,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:53,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 04:11:53,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:53,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-20 04:11:53,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:53,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-20 04:11:53,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:53,092 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-20 04:11:53,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:11:53,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851884966] [2022-07-20 04:11:53,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851884966] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 04:11:53,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252829508] [2022-07-20 04:11:53,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:11:53,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 04:11:53,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 04:11:53,099 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-20 04:11:53,149 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-20 04:11:53,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:53,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 2056 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-20 04:11:53,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 04:11:53,956 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-20 04:11:53,957 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 04:11:53,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252829508] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:11:53,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 04:11:53,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2022-07-20 04:11:53,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219938707] [2022-07-20 04:11:53,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:11:53,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 04:11:53,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:11:53,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 04:11:53,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:11:53,959 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-20 04:11:54,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:11:54,054 INFO L93 Difference]: Finished difference Result 2479 states and 3255 transitions. [2022-07-20 04:11:54,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 04:11:54,055 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-20 04:11:54,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:11:54,063 INFO L225 Difference]: With dead ends: 2479 [2022-07-20 04:11:54,063 INFO L226 Difference]: Without dead ends: 1365 [2022-07-20 04:11:54,067 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-20 04:11:54,068 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-20 04:11:54,069 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-20 04:11:54,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2022-07-20 04:11:54,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 1362. [2022-07-20 04:11:54,147 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-20 04:11:54,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 1799 transitions. [2022-07-20 04:11:54,153 INFO L78 Accepts]: Start accepts. Automaton has 1362 states and 1799 transitions. Word has length 161 [2022-07-20 04:11:54,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:11:54,155 INFO L495 AbstractCegarLoop]: Abstraction has 1362 states and 1799 transitions. [2022-07-20 04:11:54,155 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-20 04:11:54,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 1799 transitions. [2022-07-20 04:11:54,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-20 04:11:54,157 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:11:54,157 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-20 04:11:54,190 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-20 04:11:54,375 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-20 04:11:54,375 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-20 04:11:54,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:11:54,376 INFO L85 PathProgramCache]: Analyzing trace with hash 2087551557, now seen corresponding path program 1 times [2022-07-20 04:11:54,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:11:54,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005007236] [2022-07-20 04:11:54,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:11:54,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:11:54,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:54,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:11:54,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:54,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:11:54,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:54,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:11:54,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:54,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:11:54,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:54,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:11:54,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:54,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:11:54,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:54,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:11:54,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:54,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:11:54,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:54,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:11:54,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:54,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:11:54,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:54,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 04:11:54,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:54,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 04:11:54,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:54,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 04:11:54,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:54,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 04:11:54,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:54,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-20 04:11:54,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:54,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-20 04:11:54,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:54,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-20 04:11:54,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:54,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 04:11:54,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:54,641 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-20 04:11:54,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:11:54,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005007236] [2022-07-20 04:11:54,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005007236] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:11:54,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:11:54,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:11:54,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296547911] [2022-07-20 04:11:54,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:11:54,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:11:54,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:11:54,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:11:54,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:11:54,644 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-20 04:11:57,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:11:57,565 INFO L93 Difference]: Finished difference Result 1362 states and 1799 transitions. [2022-07-20 04:11:57,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:11:57,570 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-20 04:11:57,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:11:57,578 INFO L225 Difference]: With dead ends: 1362 [2022-07-20 04:11:57,579 INFO L226 Difference]: Without dead ends: 1360 [2022-07-20 04:11:57,580 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-20 04:11:57,581 INFO L413 NwaCegarLoop]: 1597 mSDtfsCounter, 2204 mSDsluCounter, 1660 mSDsCounter, 0 mSdLazyCounter, 1641 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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.8s IncrementalHoareTripleChecker+Time [2022-07-20 04:11:57,581 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.8s Time] [2022-07-20 04:11:57,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2022-07-20 04:11:57,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 1360. [2022-07-20 04:11:57,664 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-20 04:11:57,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 1797 transitions. [2022-07-20 04:11:57,670 INFO L78 Accepts]: Start accepts. Automaton has 1360 states and 1797 transitions. Word has length 121 [2022-07-20 04:11:57,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:11:57,671 INFO L495 AbstractCegarLoop]: Abstraction has 1360 states and 1797 transitions. [2022-07-20 04:11:57,672 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-20 04:11:57,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 1797 transitions. [2022-07-20 04:11:57,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-07-20 04:11:57,674 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:11:57,674 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-20 04:11:57,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-20 04:11:57,675 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-20 04:11:57,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:11:57,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1837786247, now seen corresponding path program 1 times [2022-07-20 04:11:57,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:11:57,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982901907] [2022-07-20 04:11:57,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:11:57,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:11:57,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:57,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:11:57,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:57,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:11:57,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:57,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:11:57,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:57,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:11:57,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:57,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:11:57,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:57,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:11:57,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:57,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:11:57,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:57,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:11:57,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:57,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:11:57,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:57,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:11:57,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:57,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 04:11:57,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:57,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:11:57,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:57,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:11:57,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:57,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:11:57,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:57,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:11:57,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:57,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-20 04:11:57,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:57,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:11:57,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:57,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:11:57,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:57,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:11:57,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:57,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-20 04:11:57,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:57,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:11:57,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:57,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:11:57,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:57,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:11:57,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:57,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-20 04:11:57,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:57,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-20 04:11:57,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:58,003 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-20 04:11:58,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:11:58,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982901907] [2022-07-20 04:11:58,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982901907] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:11:58,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:11:58,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 04:11:58,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983603793] [2022-07-20 04:11:58,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:11:58,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 04:11:58,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:11:58,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 04:11:58,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-20 04:11:58,005 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-20 04:12:02,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:12:02,693 INFO L93 Difference]: Finished difference Result 1593 states and 2040 transitions. [2022-07-20 04:12:02,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-20 04:12:02,693 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-20 04:12:02,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:12:02,702 INFO L225 Difference]: With dead ends: 1593 [2022-07-20 04:12:02,702 INFO L226 Difference]: Without dead ends: 1591 [2022-07-20 04:12:02,703 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-20 04:12:02,704 INFO L413 NwaCegarLoop]: 1662 mSDtfsCounter, 2718 mSDsluCounter, 2908 mSDsCounter, 0 mSdLazyCounter, 3731 mSolverCounterSat, 1887 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2923 SdHoareTripleChecker+Valid, 4570 SdHoareTripleChecker+Invalid, 5618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1887 IncrementalHoareTripleChecker+Valid, 3731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-07-20 04:12:02,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2923 Valid, 4570 Invalid, 5618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1887 Valid, 3731 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-07-20 04:12:02,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2022-07-20 04:12:02,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 1563. [2022-07-20 04:12:02,795 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-20 04:12:02,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 2007 transitions. [2022-07-20 04:12:02,802 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 2007 transitions. Word has length 153 [2022-07-20 04:12:02,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:12:02,803 INFO L495 AbstractCegarLoop]: Abstraction has 1563 states and 2007 transitions. [2022-07-20 04:12:02,803 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-20 04:12:02,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 2007 transitions. [2022-07-20 04:12:02,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-07-20 04:12:02,811 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:12:02,811 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-20 04:12:02,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-20 04:12:02,811 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-20 04:12:02,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:12:02,813 INFO L85 PathProgramCache]: Analyzing trace with hash -2107684610, now seen corresponding path program 1 times [2022-07-20 04:12:02,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:12:02,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000616731] [2022-07-20 04:12:02,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:12:02,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:12:02,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:02,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:12:02,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:02,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:12:02,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:03,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:12:03,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:03,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:12:03,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:03,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-20 04:12:03,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:03,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:12:03,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:03,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:12:03,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:03,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:12:03,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:03,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-20 04:12:03,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:03,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:12:03,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:03,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:12:03,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:03,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:12:03,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:03,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 04:12:03,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:03,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:12:03,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:03,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:12:03,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:03,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:12:03,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:03,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 04:12:03,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:03,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:12:03,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:03,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:12:03,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:03,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:12:03,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:03,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:12:03,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:03,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:12:03,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:03,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:12:03,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:03,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:12:03,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:03,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 04:12:03,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:03,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-20 04:12:03,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:03,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-20 04:12:03,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:03,241 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-20 04:12:03,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:12:03,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000616731] [2022-07-20 04:12:03,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000616731] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:12:03,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:12:03,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 04:12:03,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100861100] [2022-07-20 04:12:03,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:12:03,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 04:12:03,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:12:03,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 04:12:03,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-20 04:12:03,244 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-20 04:12:08,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:12:08,219 INFO L93 Difference]: Finished difference Result 3034 states and 3916 transitions. [2022-07-20 04:12:08,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 04:12:08,219 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-20 04:12:08,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:12:08,227 INFO L225 Difference]: With dead ends: 3034 [2022-07-20 04:12:08,228 INFO L226 Difference]: Without dead ends: 1577 [2022-07-20 04:12:08,233 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-20 04:12:08,233 INFO L413 NwaCegarLoop]: 1588 mSDtfsCounter, 2561 mSDsluCounter, 3309 mSDsCounter, 0 mSdLazyCounter, 4437 mSolverCounterSat, 1767 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2794 SdHoareTripleChecker+Valid, 4897 SdHoareTripleChecker+Invalid, 6204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1767 IncrementalHoareTripleChecker+Valid, 4437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-07-20 04:12:08,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2794 Valid, 4897 Invalid, 6204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1767 Valid, 4437 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-07-20 04:12:08,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1577 states. [2022-07-20 04:12:08,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1577 to 1563. [2022-07-20 04:12:08,378 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-20 04:12:08,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 2005 transitions. [2022-07-20 04:12:08,383 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 2005 transitions. Word has length 166 [2022-07-20 04:12:08,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:12:08,385 INFO L495 AbstractCegarLoop]: Abstraction has 1563 states and 2005 transitions. [2022-07-20 04:12:08,385 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-20 04:12:08,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 2005 transitions. [2022-07-20 04:12:08,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-07-20 04:12:08,388 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:12:08,388 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-20 04:12:08,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-20 04:12:08,389 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-20 04:12:08,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:12:08,390 INFO L85 PathProgramCache]: Analyzing trace with hash -2107625028, now seen corresponding path program 1 times [2022-07-20 04:12:08,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:12:08,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991262317] [2022-07-20 04:12:08,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:12:08,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:12:08,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:08,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:12:08,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:08,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:12:08,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:08,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:12:08,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:08,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:12:08,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:08,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-20 04:12:08,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:08,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:12:08,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:08,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:12:08,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:08,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:12:08,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:08,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-20 04:12:08,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:08,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:12:08,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:08,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:12:08,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:08,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:12:08,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:08,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 04:12:08,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:08,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:12:08,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:08,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:12:08,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:08,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:12:08,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:08,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 04:12:08,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:08,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:12:08,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:08,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:12:08,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:08,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:12:08,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:08,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:12:08,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:08,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:12:08,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:08,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:12:08,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:08,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:12:08,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:08,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 04:12:08,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:08,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-20 04:12:08,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:08,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-20 04:12:08,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:08,663 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-20 04:12:08,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:12:08,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991262317] [2022-07-20 04:12:08,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991262317] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:12:08,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:12:08,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 04:12:08,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612045937] [2022-07-20 04:12:08,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:12:08,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 04:12:08,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:12:08,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 04:12:08,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-20 04:12:08,667 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-20 04:12:12,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:12:12,887 INFO L93 Difference]: Finished difference Result 1577 states and 2029 transitions. [2022-07-20 04:12:12,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 04:12:12,888 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-20 04:12:12,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:12:12,895 INFO L225 Difference]: With dead ends: 1577 [2022-07-20 04:12:12,896 INFO L226 Difference]: Without dead ends: 1575 [2022-07-20 04:12:12,897 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-20 04:12:12,897 INFO L413 NwaCegarLoop]: 1587 mSDtfsCounter, 1364 mSDsluCounter, 2837 mSDsCounter, 0 mSdLazyCounter, 3170 mSolverCounterSat, 1482 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1364 SdHoareTripleChecker+Valid, 4424 SdHoareTripleChecker+Invalid, 4652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1482 IncrementalHoareTripleChecker+Valid, 3170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-07-20 04:12:12,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1364 Valid, 4424 Invalid, 4652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1482 Valid, 3170 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-07-20 04:12:12,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2022-07-20 04:12:13,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 1561. [2022-07-20 04:12:13,052 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-20 04:12:13,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 2002 transitions. [2022-07-20 04:12:13,059 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 2002 transitions. Word has length 166 [2022-07-20 04:12:13,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:12:13,059 INFO L495 AbstractCegarLoop]: Abstraction has 1561 states and 2002 transitions. [2022-07-20 04:12:13,059 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-20 04:12:13,060 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 2002 transitions. [2022-07-20 04:12:13,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-20 04:12:13,062 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:12:13,062 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-20 04:12:13,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-20 04:12:13,062 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-20 04:12:13,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:12:13,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1495386975, now seen corresponding path program 1 times [2022-07-20 04:12:13,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:12:13,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249060958] [2022-07-20 04:12:13,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:12:13,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:12:13,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:13,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:12:13,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:13,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:12:13,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:13,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:12:13,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:13,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:12:13,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:13,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:12:13,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:13,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:12:13,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:13,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:12:13,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:13,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:12:13,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:13,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:12:13,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:13,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:12:13,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:13,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 04:12:13,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:13,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 04:12:13,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:13,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 04:12:13,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:13,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 04:12:13,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:13,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-20 04:12:13,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:13,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-20 04:12:13,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:13,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-20 04:12:13,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:13,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 04:12:13,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:13,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-20 04:12:13,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:13,287 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-20 04:12:13,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:12:13,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249060958] [2022-07-20 04:12:13,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249060958] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:12:13,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:12:13,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:12:13,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359539431] [2022-07-20 04:12:13,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:12:13,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:12:13,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:12:13,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:12:13,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:12:13,291 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-20 04:12:16,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:12:16,412 INFO L93 Difference]: Finished difference Result 1561 states and 2002 transitions. [2022-07-20 04:12:16,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:12:16,412 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-20 04:12:16,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:12:16,419 INFO L225 Difference]: With dead ends: 1561 [2022-07-20 04:12:16,419 INFO L226 Difference]: Without dead ends: 1559 [2022-07-20 04:12:16,420 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-20 04:12:16,420 INFO L413 NwaCegarLoop]: 1592 mSDtfsCounter, 2189 mSDsluCounter, 1660 mSDsCounter, 0 mSdLazyCounter, 1636 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s 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, 3.0s IncrementalHoareTripleChecker+Time [2022-07-20 04:12:16,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2415 Valid, 3252 Invalid, 2924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 1636 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-07-20 04:12:16,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1559 states. [2022-07-20 04:12:16,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1559 to 1559. [2022-07-20 04:12:16,506 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-20 04:12:16,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 2000 transitions. [2022-07-20 04:12:16,511 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 2000 transitions. Word has length 127 [2022-07-20 04:12:16,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:12:16,512 INFO L495 AbstractCegarLoop]: Abstraction has 1559 states and 2000 transitions. [2022-07-20 04:12:16,512 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-20 04:12:16,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 2000 transitions. [2022-07-20 04:12:16,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-07-20 04:12:16,515 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:12:16,515 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-20 04:12:16,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-20 04:12:16,515 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-20 04:12:16,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:12:16,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1863471288, now seen corresponding path program 1 times [2022-07-20 04:12:16,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:12:16,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880043780] [2022-07-20 04:12:16,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:12:16,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:12:16,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:16,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:12:16,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:16,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:12:16,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:16,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:12:16,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:16,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:12:16,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:16,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-20 04:12:16,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:16,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:12:16,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:16,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:12:16,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:16,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:12:16,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:16,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-20 04:12:16,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:16,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:12:16,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:16,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:12:16,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:16,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:12:16,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:16,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 04:12:16,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:16,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:12:16,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:16,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:12:16,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:16,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:12:16,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:16,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 04:12:16,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:16,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:12:16,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:16,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:12:16,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:16,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:12:16,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:16,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:12:16,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:16,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:12:16,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:16,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:12:16,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:16,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:12:16,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:16,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 04:12:16,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:16,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-20 04:12:16,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:16,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-20 04:12:16,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:16,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:12:16,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:16,807 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-20 04:12:16,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:12:16,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880043780] [2022-07-20 04:12:16,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880043780] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:12:16,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:12:16,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:12:16,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615641313] [2022-07-20 04:12:16,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:12:16,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:12:16,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:12:16,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:12:16,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:12:16,810 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-20 04:12:19,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:12:19,719 INFO L93 Difference]: Finished difference Result 3020 states and 3895 transitions. [2022-07-20 04:12:19,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:12:19,720 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-20 04:12:19,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:12:19,727 INFO L225 Difference]: With dead ends: 3020 [2022-07-20 04:12:19,727 INFO L226 Difference]: Without dead ends: 1567 [2022-07-20 04:12:19,734 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-20 04:12:19,734 INFO L413 NwaCegarLoop]: 1580 mSDtfsCounter, 2522 mSDsluCounter, 1399 mSDsCounter, 0 mSdLazyCounter, 1143 mSolverCounterSat, 1765 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2756 SdHoareTripleChecker+Valid, 2979 SdHoareTripleChecker+Invalid, 2908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1765 IncrementalHoareTripleChecker+Valid, 1143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-07-20 04:12:19,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2756 Valid, 2979 Invalid, 2908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1765 Valid, 1143 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-07-20 04:12:19,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2022-07-20 04:12:19,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1553. [2022-07-20 04:12:19,821 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-20 04:12:19,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1553 states to 1553 states and 1991 transitions. [2022-07-20 04:12:19,826 INFO L78 Accepts]: Start accepts. Automaton has 1553 states and 1991 transitions. Word has length 173 [2022-07-20 04:12:19,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:12:19,827 INFO L495 AbstractCegarLoop]: Abstraction has 1553 states and 1991 transitions. [2022-07-20 04:12:19,827 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-20 04:12:19,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1553 states and 1991 transitions. [2022-07-20 04:12:19,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-07-20 04:12:19,829 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:12:19,830 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-20 04:12:19,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-20 04:12:19,830 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-20 04:12:19,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:12:19,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1932909630, now seen corresponding path program 1 times [2022-07-20 04:12:19,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:12:19,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920099272] [2022-07-20 04:12:19,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:12:19,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:12:19,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:19,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:12:19,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:19,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:12:19,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:19,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:12:19,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:19,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:12:19,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:19,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:12:19,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:19,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:12:19,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:19,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:12:19,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:19,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:12:19,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:19,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:12:19,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:20,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:12:20,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:20,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 04:12:20,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:20,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:12:20,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:20,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:12:20,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:20,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:12:20,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:20,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:12:20,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:20,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-20 04:12:20,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:20,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:12:20,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:20,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:12:20,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:20,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:12:20,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:20,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-20 04:12:20,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:20,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:12:20,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:20,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:12:20,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:20,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:12:20,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:20,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-20 04:12:20,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:20,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-20 04:12:20,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:20,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-20 04:12:20,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:20,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:12:20,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:20,096 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-20 04:12:20,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:12:20,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920099272] [2022-07-20 04:12:20,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920099272] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:12:20,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:12:20,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 04:12:20,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034464411] [2022-07-20 04:12:20,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:12:20,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 04:12:20,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:12:20,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 04:12:20,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-20 04:12:20,099 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-20 04:12:24,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:12:24,814 INFO L93 Difference]: Finished difference Result 1595 states and 2039 transitions. [2022-07-20 04:12:24,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-20 04:12:24,815 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-20 04:12:24,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:12:24,822 INFO L225 Difference]: With dead ends: 1595 [2022-07-20 04:12:24,823 INFO L226 Difference]: Without dead ends: 1593 [2022-07-20 04:12:24,824 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-20 04:12:24,825 INFO L413 NwaCegarLoop]: 1585 mSDtfsCounter, 2998 mSDsluCounter, 3316 mSDsCounter, 0 mSdLazyCounter, 3508 mSolverCounterSat, 2265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s 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.4s IncrementalHoareTripleChecker+Time [2022-07-20 04:12:24,825 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.4s Time] [2022-07-20 04:12:24,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1593 states. [2022-07-20 04:12:24,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1593 to 1577. [2022-07-20 04:12:24,916 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-20 04:12:24,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 2011 transitions. [2022-07-20 04:12:24,922 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 2011 transitions. Word has length 164 [2022-07-20 04:12:24,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:12:24,923 INFO L495 AbstractCegarLoop]: Abstraction has 1577 states and 2011 transitions. [2022-07-20 04:12:24,923 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-20 04:12:24,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 2011 transitions. [2022-07-20 04:12:24,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-07-20 04:12:24,925 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:12:24,925 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-20 04:12:24,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-20 04:12:24,927 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-20 04:12:24,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:12:24,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1219574549, now seen corresponding path program 1 times [2022-07-20 04:12:24,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:12:24,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377796629] [2022-07-20 04:12:24,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:12:24,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:12:24,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:25,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:12:25,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:25,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:12:25,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:25,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:12:25,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:25,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:12:25,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:25,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:12:25,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:25,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:12:25,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:25,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:12:25,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:25,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:12:25,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:25,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:12:25,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:25,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:12:25,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:25,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 04:12:25,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:25,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 04:12:25,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:25,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 04:12:25,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:25,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 04:12:25,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:25,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-20 04:12:25,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:25,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-20 04:12:25,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:25,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-20 04:12:25,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:25,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 04:12:25,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:25,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-20 04:12:25,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:25,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 04:12:25,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:25,182 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-20 04:12:25,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:12:25,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377796629] [2022-07-20 04:12:25,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377796629] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:12:25,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:12:25,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:12:25,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917320871] [2022-07-20 04:12:25,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:12:25,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:12:25,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:12:25,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:12:25,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:12:25,186 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-20 04:12:28,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:12:28,069 INFO L93 Difference]: Finished difference Result 1577 states and 2011 transitions. [2022-07-20 04:12:28,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:12:28,069 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-20 04:12:28,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:12:28,076 INFO L225 Difference]: With dead ends: 1577 [2022-07-20 04:12:28,077 INFO L226 Difference]: Without dead ends: 1575 [2022-07-20 04:12:28,078 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-20 04:12:28,079 INFO L413 NwaCegarLoop]: 1585 mSDtfsCounter, 2168 mSDsluCounter, 1660 mSDsCounter, 0 mSdLazyCounter, 1629 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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.7s IncrementalHoareTripleChecker+Time [2022-07-20 04:12:28,079 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.7s Time] [2022-07-20 04:12:28,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2022-07-20 04:12:28,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 1575. [2022-07-20 04:12:28,171 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-20 04:12:28,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 2009 transitions. [2022-07-20 04:12:28,178 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 2009 transitions. Word has length 133 [2022-07-20 04:12:28,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:12:28,178 INFO L495 AbstractCegarLoop]: Abstraction has 1575 states and 2009 transitions. [2022-07-20 04:12:28,179 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-20 04:12:28,179 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 2009 transitions. [2022-07-20 04:12:28,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-20 04:12:28,181 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:12:28,181 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-20 04:12:28,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-20 04:12:28,182 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-20 04:12:28,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:12:28,182 INFO L85 PathProgramCache]: Analyzing trace with hash -462029759, now seen corresponding path program 1 times [2022-07-20 04:12:28,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:12:28,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056919458] [2022-07-20 04:12:28,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:12:28,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:12:28,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:28,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:12:28,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:28,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:12:28,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:28,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:12:28,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:28,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:12:28,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:28,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:12:28,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:28,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:12:28,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:28,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:12:28,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:28,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:12:28,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:28,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:12:28,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:28,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:12:28,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:28,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 04:12:28,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:28,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 04:12:28,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:28,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 04:12:28,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:28,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 04:12:28,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:28,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-20 04:12:28,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:28,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-20 04:12:28,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:28,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-20 04:12:28,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:28,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 04:12:28,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:28,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-20 04:12:28,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:28,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 04:12:28,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:28,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-20 04:12:28,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:28,474 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-20 04:12:28,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:12:28,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056919458] [2022-07-20 04:12:28,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056919458] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:12:28,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:12:28,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:12:28,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284344511] [2022-07-20 04:12:28,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:12:28,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:12:28,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:12:28,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:12:28,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:12:28,477 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-20 04:12:31,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:12:31,266 INFO L93 Difference]: Finished difference Result 1575 states and 2009 transitions. [2022-07-20 04:12:31,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:12:31,267 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-20 04:12:31,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:12:31,274 INFO L225 Difference]: With dead ends: 1575 [2022-07-20 04:12:31,274 INFO L226 Difference]: Without dead ends: 1573 [2022-07-20 04:12:31,275 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-20 04:12:31,276 INFO L413 NwaCegarLoop]: 1583 mSDtfsCounter, 2162 mSDsluCounter, 1660 mSDsCounter, 0 mSdLazyCounter, 1627 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s 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, 2.6s IncrementalHoareTripleChecker+Time [2022-07-20 04:12:31,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2386 Valid, 3243 Invalid, 2915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 1627 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-07-20 04:12:31,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1573 states. [2022-07-20 04:12:31,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1573 to 1573. [2022-07-20 04:12:31,393 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-20 04:12:31,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 2007 transitions. [2022-07-20 04:12:31,398 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 2007 transitions. Word has length 139 [2022-07-20 04:12:31,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:12:31,398 INFO L495 AbstractCegarLoop]: Abstraction has 1573 states and 2007 transitions. [2022-07-20 04:12:31,398 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-20 04:12:31,399 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 2007 transitions. [2022-07-20 04:12:31,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-07-20 04:12:31,400 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:12:31,400 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-20 04:12:31,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-20 04:12:31,401 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-20 04:12:31,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:12:31,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1035613449, now seen corresponding path program 1 times [2022-07-20 04:12:31,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:12:31,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549078442] [2022-07-20 04:12:31,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:12:31,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:12:31,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:31,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:12:31,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:31,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:12:31,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:31,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:12:31,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:31,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:12:31,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:31,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:12:31,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:31,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:12:31,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:31,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:12:31,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:31,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:12:31,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:31,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:12:31,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:31,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:12:31,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:31,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 04:12:31,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:31,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 04:12:31,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:31,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 04:12:31,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:31,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 04:12:31,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:31,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-20 04:12:31,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:31,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-20 04:12:31,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:31,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-20 04:12:31,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:31,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 04:12:31,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:31,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-20 04:12:31,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:31,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 04:12:31,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:31,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-20 04:12:31,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:31,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-20 04:12:31,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:31,630 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-20 04:12:31,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:12:31,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549078442] [2022-07-20 04:12:31,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549078442] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:12:31,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:12:31,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:12:31,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533654643] [2022-07-20 04:12:31,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:12:31,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:12:31,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:12:31,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:12:31,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:12:31,634 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-20 04:12:34,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:12:34,330 INFO L93 Difference]: Finished difference Result 1573 states and 2007 transitions. [2022-07-20 04:12:34,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:12:34,330 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-20 04:12:34,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:12:34,337 INFO L225 Difference]: With dead ends: 1573 [2022-07-20 04:12:34,337 INFO L226 Difference]: Without dead ends: 1571 [2022-07-20 04:12:34,338 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-20 04:12:34,339 INFO L413 NwaCegarLoop]: 1581 mSDtfsCounter, 2156 mSDsluCounter, 1660 mSDsCounter, 0 mSdLazyCounter, 1625 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s 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.6s IncrementalHoareTripleChecker+Time [2022-07-20 04:12:34,339 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.6s Time] [2022-07-20 04:12:34,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1571 states. [2022-07-20 04:12:34,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1571 to 1571. [2022-07-20 04:12:34,432 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-20 04:12:34,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 2005 transitions. [2022-07-20 04:12:34,437 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 2005 transitions. Word has length 145 [2022-07-20 04:12:34,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:12:34,438 INFO L495 AbstractCegarLoop]: Abstraction has 1571 states and 2005 transitions. [2022-07-20 04:12:34,438 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-20 04:12:34,438 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 2005 transitions. [2022-07-20 04:12:34,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-07-20 04:12:34,440 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:12:34,440 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-20 04:12:34,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-20 04:12:34,441 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-20 04:12:34,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:12:34,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1583947181, now seen corresponding path program 1 times [2022-07-20 04:12:34,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:12:34,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349789179] [2022-07-20 04:12:34,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:12:34,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:12:34,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:34,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:12:34,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:34,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:12:34,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:34,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:12:34,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:34,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:12:34,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:34,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:12:34,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:34,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:12:34,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:34,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:12:34,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:34,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:12:34,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:34,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:12:34,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:34,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:12:34,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:34,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 04:12:34,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:34,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 04:12:34,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:34,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 04:12:34,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:34,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 04:12:34,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:34,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-20 04:12:34,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:34,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-20 04:12:34,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:34,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-20 04:12:34,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:34,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 04:12:34,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:34,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-20 04:12:34,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:34,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 04:12:34,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:34,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-20 04:12:34,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:34,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-20 04:12:34,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:34,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-20 04:12:34,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:34,692 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-20 04:12:34,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:12:34,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349789179] [2022-07-20 04:12:34,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349789179] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:12:34,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:12:34,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:12:34,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020159708] [2022-07-20 04:12:34,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:12:34,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:12:34,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:12:34,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:12:34,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:12:34,696 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-20 04:12:37,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:12:37,383 INFO L93 Difference]: Finished difference Result 1571 states and 2005 transitions. [2022-07-20 04:12:37,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:12:37,385 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-20 04:12:37,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:12:37,392 INFO L225 Difference]: With dead ends: 1571 [2022-07-20 04:12:37,393 INFO L226 Difference]: Without dead ends: 1569 [2022-07-20 04:12:37,394 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-20 04:12:37,394 INFO L413 NwaCegarLoop]: 1579 mSDtfsCounter, 2150 mSDsluCounter, 1660 mSDsCounter, 0 mSdLazyCounter, 1623 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s 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.5s IncrementalHoareTripleChecker+Time [2022-07-20 04:12:37,394 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.5s Time] [2022-07-20 04:12:37,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2022-07-20 04:12:37,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 1569. [2022-07-20 04:12:37,494 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-20 04:12:37,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 2003 transitions. [2022-07-20 04:12:37,499 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 2003 transitions. Word has length 151 [2022-07-20 04:12:37,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:12:37,500 INFO L495 AbstractCegarLoop]: Abstraction has 1569 states and 2003 transitions. [2022-07-20 04:12:37,500 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-20 04:12:37,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 2003 transitions. [2022-07-20 04:12:37,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-07-20 04:12:37,502 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:12:37,503 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-20 04:12:37,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-20 04:12:37,503 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-20 04:12:37,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:12:37,504 INFO L85 PathProgramCache]: Analyzing trace with hash -836954508, now seen corresponding path program 1 times [2022-07-20 04:12:37,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:12:37,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562395948] [2022-07-20 04:12:37,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:12:37,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:12:37,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:37,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:12:37,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:37,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:12:37,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:37,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:12:37,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:37,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:12:37,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:37,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:12:37,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:37,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:12:37,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:37,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:12:37,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:37,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:12:37,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:37,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:12:37,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:37,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:12:37,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:37,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 04:12:37,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:37,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:12:37,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:37,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:12:37,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:37,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:12:37,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:37,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:12:37,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:37,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-20 04:12:37,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:37,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:12:37,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:37,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:12:37,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:37,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:12:37,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:37,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-20 04:12:37,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:37,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:12:37,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:37,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:12:37,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:37,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:12:37,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:37,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-20 04:12:37,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:37,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-20 04:12:37,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:37,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-20 04:12:37,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:37,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:12:37,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:37,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-20 04:12:37,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:37,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:12:37,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:37,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:12:37,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:37,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-20 04:12:37,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:37,782 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-20 04:12:37,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:12:37,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562395948] [2022-07-20 04:12:37,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562395948] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:12:37,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:12:37,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-20 04:12:37,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084421421] [2022-07-20 04:12:37,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:12:37,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 04:12:37,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:12:37,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 04:12:37,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:12:37,785 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-20 04:12:43,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:12:43,833 INFO L93 Difference]: Finished difference Result 1589 states and 2033 transitions. [2022-07-20 04:12:43,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-20 04:12:43,834 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-20 04:12:43,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:12:43,839 INFO L225 Difference]: With dead ends: 1589 [2022-07-20 04:12:43,839 INFO L226 Difference]: Without dead ends: 1587 [2022-07-20 04:12:43,840 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-20 04:12:43,840 INFO L413 NwaCegarLoop]: 1575 mSDtfsCounter, 2266 mSDsluCounter, 4492 mSDsCounter, 0 mSdLazyCounter, 4741 mSolverCounterSat, 2514 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2266 SdHoareTripleChecker+Valid, 6067 SdHoareTripleChecker+Invalid, 7255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2514 IncrementalHoareTripleChecker+Valid, 4741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-07-20 04:12:43,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2266 Valid, 6067 Invalid, 7255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2514 Valid, 4741 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2022-07-20 04:12:43,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1587 states. [2022-07-20 04:12:43,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1587 to 1569. [2022-07-20 04:12:43,941 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-20 04:12:43,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 2001 transitions. [2022-07-20 04:12:43,947 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 2001 transitions. Word has length 187 [2022-07-20 04:12:43,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:12:43,948 INFO L495 AbstractCegarLoop]: Abstraction has 1569 states and 2001 transitions. [2022-07-20 04:12:43,948 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-20 04:12:43,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 2001 transitions. [2022-07-20 04:12:43,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-20 04:12:43,950 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:12:43,950 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-20 04:12:43,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-20 04:12:43,951 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-20 04:12:43,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:12:43,951 INFO L85 PathProgramCache]: Analyzing trace with hash 2023750506, now seen corresponding path program 1 times [2022-07-20 04:12:43,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:12:43,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835129161] [2022-07-20 04:12:43,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:12:43,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:12:44,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:44,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:12:44,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:44,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:12:44,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:44,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:12:44,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:44,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:12:44,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:44,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:12:44,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:44,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:12:44,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:44,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:12:44,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:44,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:12:44,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:44,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:12:44,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:44,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:12:44,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:44,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 04:12:44,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:44,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 04:12:44,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:44,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 04:12:44,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:44,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 04:12:44,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:44,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-20 04:12:44,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:44,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-20 04:12:44,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:44,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-20 04:12:44,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:44,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 04:12:44,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:44,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-20 04:12:44,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:44,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 04:12:44,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:44,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-20 04:12:44,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:44,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-20 04:12:44,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:44,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-20 04:12:44,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:44,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-20 04:12:44,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:44,192 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-20 04:12:44,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:12:44,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835129161] [2022-07-20 04:12:44,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835129161] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:12:44,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:12:44,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:12:44,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362854253] [2022-07-20 04:12:44,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:12:44,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:12:44,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:12:44,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:12:44,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:12:44,194 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-20 04:12:47,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:12:47,123 INFO L93 Difference]: Finished difference Result 1569 states and 2001 transitions. [2022-07-20 04:12:47,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:12:47,123 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-20 04:12:47,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:12:47,129 INFO L225 Difference]: With dead ends: 1569 [2022-07-20 04:12:47,129 INFO L226 Difference]: Without dead ends: 1567 [2022-07-20 04:12:47,130 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-20 04:12:47,130 INFO L413 NwaCegarLoop]: 1577 mSDtfsCounter, 2144 mSDsluCounter, 1660 mSDsCounter, 0 mSdLazyCounter, 1621 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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.8s IncrementalHoareTripleChecker+Time [2022-07-20 04:12:47,131 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.8s Time] [2022-07-20 04:12:47,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2022-07-20 04:12:47,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1567. [2022-07-20 04:12:47,230 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-20 04:12:47,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 1999 transitions. [2022-07-20 04:12:47,235 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 1999 transitions. Word has length 157 [2022-07-20 04:12:47,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:12:47,235 INFO L495 AbstractCegarLoop]: Abstraction has 1567 states and 1999 transitions. [2022-07-20 04:12:47,235 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-20 04:12:47,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 1999 transitions. [2022-07-20 04:12:47,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-07-20 04:12:47,237 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:12:47,237 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-20 04:12:47,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-20 04:12:47,238 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-20 04:12:47,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:12:47,238 INFO L85 PathProgramCache]: Analyzing trace with hash 893411218, now seen corresponding path program 1 times [2022-07-20 04:12:47,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:12:47,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838311298] [2022-07-20 04:12:47,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:12:47,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:12:47,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:47,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:12:47,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:47,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:12:47,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:47,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:12:47,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:47,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:12:47,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:47,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:12:47,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:47,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:12:47,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:47,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:12:47,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:47,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:12:47,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:47,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:12:47,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:47,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:12:47,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:47,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 04:12:47,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:47,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 04:12:47,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:47,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 04:12:47,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:47,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 04:12:47,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:47,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-20 04:12:47,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:47,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-20 04:12:47,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:47,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-20 04:12:47,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:47,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 04:12:47,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:47,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-20 04:12:47,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:47,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 04:12:47,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:47,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-20 04:12:47,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:47,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-20 04:12:47,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:47,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-20 04:12:47,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:47,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-20 04:12:47,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:47,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-20 04:12:47,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:47,428 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-20 04:12:47,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:12:47,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838311298] [2022-07-20 04:12:47,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838311298] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:12:47,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:12:47,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:12:47,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508691619] [2022-07-20 04:12:47,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:12:47,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:12:47,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:12:47,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:12:47,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:12:47,430 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-20 04:12:50,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:12:50,277 INFO L93 Difference]: Finished difference Result 1567 states and 1999 transitions. [2022-07-20 04:12:50,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:12:50,278 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-20 04:12:50,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:12:50,282 INFO L225 Difference]: With dead ends: 1567 [2022-07-20 04:12:50,282 INFO L226 Difference]: Without dead ends: 1565 [2022-07-20 04:12:50,282 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-20 04:12:50,283 INFO L413 NwaCegarLoop]: 1575 mSDtfsCounter, 2138 mSDsluCounter, 1660 mSDsCounter, 0 mSdLazyCounter, 1619 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s 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.7s IncrementalHoareTripleChecker+Time [2022-07-20 04:12:50,283 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.7s Time] [2022-07-20 04:12:50,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1565 states. [2022-07-20 04:12:50,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1565 to 1565. [2022-07-20 04:12:50,383 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-20 04:12:50,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 1997 transitions. [2022-07-20 04:12:50,389 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 1997 transitions. Word has length 163 [2022-07-20 04:12:50,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:12:50,389 INFO L495 AbstractCegarLoop]: Abstraction has 1565 states and 1997 transitions. [2022-07-20 04:12:50,389 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-20 04:12:50,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 1997 transitions. [2022-07-20 04:12:50,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-07-20 04:12:50,392 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:12:50,392 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-20 04:12:50,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-20 04:12:50,392 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-20 04:12:50,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:12:50,393 INFO L85 PathProgramCache]: Analyzing trace with hash -992837032, now seen corresponding path program 1 times [2022-07-20 04:12:50,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:12:50,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363900929] [2022-07-20 04:12:50,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:12:50,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:12:50,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:50,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:12:50,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:50,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:12:50,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:50,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:12:50,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:50,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:12:50,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:50,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:12:50,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:50,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:12:50,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:50,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:12:50,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:50,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:12:50,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:50,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:12:50,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:50,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:12:50,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:50,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 04:12:50,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:50,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 04:12:50,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:50,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 04:12:50,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:50,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 04:12:50,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:50,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-20 04:12:50,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:50,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-20 04:12:50,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:50,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-20 04:12:50,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:50,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 04:12:50,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:50,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-20 04:12:50,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:50,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 04:12:50,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:50,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-20 04:12:50,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:50,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-20 04:12:50,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:50,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-20 04:12:50,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:50,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-20 04:12:50,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:50,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-20 04:12:50,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:50,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-20 04:12:50,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:50,635 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-20 04:12:50,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:12:50,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363900929] [2022-07-20 04:12:50,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363900929] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:12:50,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:12:50,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:12:50,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236936598] [2022-07-20 04:12:50,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:12:50,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:12:50,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:12:50,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:12:50,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:12:50,638 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-20 04:12:53,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:12:53,518 INFO L93 Difference]: Finished difference Result 1565 states and 1997 transitions. [2022-07-20 04:12:53,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:12:53,519 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-20 04:12:53,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:12:53,525 INFO L225 Difference]: With dead ends: 1565 [2022-07-20 04:12:53,525 INFO L226 Difference]: Without dead ends: 1563 [2022-07-20 04:12:53,526 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-20 04:12:53,527 INFO L413 NwaCegarLoop]: 1573 mSDtfsCounter, 2132 mSDsluCounter, 1660 mSDsCounter, 0 mSdLazyCounter, 1617 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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.7s IncrementalHoareTripleChecker+Time [2022-07-20 04:12:53,527 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.7s Time] [2022-07-20 04:12:53,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2022-07-20 04:12:53,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 1563. [2022-07-20 04:12:53,653 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-20 04:12:53,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 1995 transitions. [2022-07-20 04:12:53,658 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 1995 transitions. Word has length 169 [2022-07-20 04:12:53,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:12:53,659 INFO L495 AbstractCegarLoop]: Abstraction has 1563 states and 1995 transitions. [2022-07-20 04:12:53,659 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-20 04:12:53,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 1995 transitions. [2022-07-20 04:12:53,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-07-20 04:12:53,661 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:12:53,661 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-20 04:12:53,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-20 04:12:53,662 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-20 04:12:53,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:12:53,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1416811539, now seen corresponding path program 1 times [2022-07-20 04:12:53,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:12:53,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098770767] [2022-07-20 04:12:53,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:12:53,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:12:53,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:53,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:12:53,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:53,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:12:53,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:53,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:12:53,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:53,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:12:53,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:53,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:12:53,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:53,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:12:53,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:53,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:12:53,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:53,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:12:53,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:53,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:12:53,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:53,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:12:53,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:53,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 04:12:53,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:53,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 04:12:53,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:53,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 04:12:53,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:53,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 04:12:53,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:53,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-20 04:12:53,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:53,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-20 04:12:53,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:53,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-20 04:12:53,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:53,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 04:12:53,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:53,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-20 04:12:53,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:53,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 04:12:53,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:53,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-20 04:12:53,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:53,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-20 04:12:53,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:53,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-20 04:12:53,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:53,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-20 04:12:53,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:53,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-20 04:12:53,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:53,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-20 04:12:53,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:53,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-20 04:12:53,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:53,885 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-20 04:12:53,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:12:53,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098770767] [2022-07-20 04:12:53,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098770767] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:12:53,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:12:53,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:12:53,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299702857] [2022-07-20 04:12:53,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:12:53,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:12:53,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:12:53,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:12:53,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:12:53,888 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-20 04:12:56,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:12:56,715 INFO L93 Difference]: Finished difference Result 1563 states and 1995 transitions. [2022-07-20 04:12:56,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:12:56,715 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-20 04:12:56,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:12:56,720 INFO L225 Difference]: With dead ends: 1563 [2022-07-20 04:12:56,720 INFO L226 Difference]: Without dead ends: 1561 [2022-07-20 04:12:56,721 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-20 04:12:56,721 INFO L413 NwaCegarLoop]: 1571 mSDtfsCounter, 2126 mSDsluCounter, 1660 mSDsCounter, 0 mSdLazyCounter, 1615 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s 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.7s IncrementalHoareTripleChecker+Time [2022-07-20 04:12:56,721 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.7s Time] [2022-07-20 04:12:56,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1561 states. [2022-07-20 04:12:56,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1561 to 1561. [2022-07-20 04:12:56,824 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-20 04:12:56,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 1993 transitions. [2022-07-20 04:12:56,827 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 1993 transitions. Word has length 175 [2022-07-20 04:12:56,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:12:56,828 INFO L495 AbstractCegarLoop]: Abstraction has 1561 states and 1993 transitions. [2022-07-20 04:12:56,828 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-20 04:12:56,828 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 1993 transitions. [2022-07-20 04:12:56,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2022-07-20 04:12:56,830 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:12:56,831 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-20 04:12:56,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-20 04:12:56,831 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-20 04:12:56,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:12:56,832 INFO L85 PathProgramCache]: Analyzing trace with hash 731543701, now seen corresponding path program 1 times [2022-07-20 04:12:56,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:12:56,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542658623] [2022-07-20 04:12:56,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:12:56,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:12:56,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:57,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:12:57,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:57,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:12:57,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:57,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:12:57,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:57,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:12:57,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:57,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:12:57,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:57,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:12:57,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:57,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:12:57,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:57,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:12:57,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:57,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:12:57,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:57,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:12:57,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:57,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 04:12:57,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:57,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:12:57,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:57,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:12:57,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:57,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:12:57,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:57,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:12:57,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:57,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-20 04:12:57,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:57,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:12:57,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:57,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:12:57,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:57,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:12:57,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:57,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-20 04:12:57,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:57,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:12:57,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:57,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:12:57,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:57,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:12:57,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:57,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-20 04:12:57,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:57,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-20 04:12:57,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:57,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-20 04:12:57,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:57,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:12:57,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:57,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-20 04:12:57,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:57,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:12:57,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:57,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:12:57,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:57,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-20 04:12:57,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:57,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-20 04:12:57,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:57,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:12:57,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:57,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:12:57,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:57,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-20 04:12:57,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:57,222 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-20 04:12:57,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:12:57,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542658623] [2022-07-20 04:12:57,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542658623] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:12:57,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:12:57,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-20 04:12:57,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848543544] [2022-07-20 04:12:57,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:12:57,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 04:12:57,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:12:57,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 04:12:57,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:12:57,225 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-20 04:13:03,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:13:03,738 INFO L93 Difference]: Finished difference Result 1595 states and 2032 transitions. [2022-07-20 04:13:03,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-20 04:13:03,739 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-20 04:13:03,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:13:03,743 INFO L225 Difference]: With dead ends: 1595 [2022-07-20 04:13:03,743 INFO L226 Difference]: Without dead ends: 1593 [2022-07-20 04:13:03,743 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-20 04:13:03,744 INFO L413 NwaCegarLoop]: 1629 mSDtfsCounter, 2796 mSDsluCounter, 4426 mSDsCounter, 0 mSdLazyCounter, 4977 mSolverCounterSat, 2819 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2814 SdHoareTripleChecker+Valid, 6055 SdHoareTripleChecker+Invalid, 7796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2819 IncrementalHoareTripleChecker+Valid, 4977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-07-20 04:13:03,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2814 Valid, 6055 Invalid, 7796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2819 Valid, 4977 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2022-07-20 04:13:03,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1593 states. [2022-07-20 04:13:03,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1593 to 1565. [2022-07-20 04:13:03,827 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-20 04:13:03,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 1996 transitions. [2022-07-20 04:13:03,833 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 1996 transitions. Word has length 212 [2022-07-20 04:13:03,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:13:03,833 INFO L495 AbstractCegarLoop]: Abstraction has 1565 states and 1996 transitions. [2022-07-20 04:13:03,833 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-20 04:13:03,834 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 1996 transitions. [2022-07-20 04:13:03,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2022-07-20 04:13:03,836 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:13:03,837 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-20 04:13:03,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-20 04:13:03,837 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-20 04:13:03,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:13:03,837 INFO L85 PathProgramCache]: Analyzing trace with hash 578281643, now seen corresponding path program 1 times [2022-07-20 04:13:03,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:13:03,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845055968] [2022-07-20 04:13:03,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:13:03,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:13:03,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:03,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:13:03,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:03,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:13:03,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:03,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:13:03,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:03,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:13:03,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:03,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:13:03,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:03,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:13:03,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:03,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:13:03,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:03,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:03,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:03,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:13:03,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:03,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:13:03,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:03,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 04:13:03,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:03,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 04:13:03,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:03,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 04:13:03,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:03,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 04:13:03,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:03,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-20 04:13:03,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:04,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-20 04:13:04,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:04,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-20 04:13:04,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:04,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 04:13:04,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:04,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-20 04:13:04,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:04,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 04:13:04,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:04,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-20 04:13:04,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:04,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-20 04:13:04,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:04,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-20 04:13:04,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:04,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-20 04:13:04,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:04,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-20 04:13:04,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:04,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-20 04:13:04,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:04,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-20 04:13:04,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:04,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-20 04:13:04,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:04,053 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-20 04:13:04,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:13:04,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845055968] [2022-07-20 04:13:04,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845055968] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:13:04,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:13:04,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:13:04,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825920801] [2022-07-20 04:13:04,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:13:04,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:13:04,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:13:04,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:13:04,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:13:04,056 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-20 04:13:07,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:13:07,018 INFO L93 Difference]: Finished difference Result 1565 states and 1996 transitions. [2022-07-20 04:13:07,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:13:07,019 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-20 04:13:07,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:13:07,023 INFO L225 Difference]: With dead ends: 1565 [2022-07-20 04:13:07,023 INFO L226 Difference]: Without dead ends: 1563 [2022-07-20 04:13:07,024 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-20 04:13:07,025 INFO L413 NwaCegarLoop]: 1569 mSDtfsCounter, 2120 mSDsluCounter, 1660 mSDsCounter, 0 mSdLazyCounter, 1613 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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.8s IncrementalHoareTripleChecker+Time [2022-07-20 04:13:07,025 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.8s Time] [2022-07-20 04:13:07,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2022-07-20 04:13:07,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 1563. [2022-07-20 04:13:07,142 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-20 04:13:07,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 1994 transitions. [2022-07-20 04:13:07,147 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 1994 transitions. Word has length 181 [2022-07-20 04:13:07,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:13:07,148 INFO L495 AbstractCegarLoop]: Abstraction has 1563 states and 1994 transitions. [2022-07-20 04:13:07,148 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-20 04:13:07,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 1994 transitions. [2022-07-20 04:13:07,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-07-20 04:13:07,151 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:13:07,151 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-20 04:13:07,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-20 04:13:07,152 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-20 04:13:07,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:13:07,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1220089259, now seen corresponding path program 1 times [2022-07-20 04:13:07,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:13:07,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868007361] [2022-07-20 04:13:07,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:13:07,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:13:07,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:07,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:13:07,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:07,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:13:07,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:07,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:13:07,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:07,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:13:07,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:07,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:13:07,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:07,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:13:07,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:07,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:13:07,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:07,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:07,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:07,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:13:07,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:07,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:13:07,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:07,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 04:13:07,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:07,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 04:13:07,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:07,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 04:13:07,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:07,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 04:13:07,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:07,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-20 04:13:07,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:07,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-20 04:13:07,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:07,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-20 04:13:07,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:07,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 04:13:07,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:07,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-20 04:13:07,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:07,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 04:13:07,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:07,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-20 04:13:07,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:07,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-20 04:13:07,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:07,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-20 04:13:07,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:07,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-20 04:13:07,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:07,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-20 04:13:07,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:07,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-20 04:13:07,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:07,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-20 04:13:07,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:07,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-20 04:13:07,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:07,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-20 04:13:07,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:07,383 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-20 04:13:07,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:13:07,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868007361] [2022-07-20 04:13:07,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868007361] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:13:07,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:13:07,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:13:07,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767307216] [2022-07-20 04:13:07,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:13:07,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:13:07,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:13:07,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:13:07,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:13:07,385 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-20 04:13:12,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:13:12,766 INFO L93 Difference]: Finished difference Result 2967 states and 3785 transitions. [2022-07-20 04:13:12,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 04:13:12,766 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-20 04:13:12,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:13:12,776 INFO L225 Difference]: With dead ends: 2967 [2022-07-20 04:13:12,777 INFO L226 Difference]: Without dead ends: 2812 [2022-07-20 04:13:12,780 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-20 04:13:12,781 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-20 04:13:12,781 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-20 04:13:12,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2812 states. [2022-07-20 04:13:12,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2812 to 2798. [2022-07-20 04:13:12,990 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-20 04:13:12,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2798 states to 2798 states and 3595 transitions. [2022-07-20 04:13:12,999 INFO L78 Accepts]: Start accepts. Automaton has 2798 states and 3595 transitions. Word has length 187 [2022-07-20 04:13:12,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:13:12,999 INFO L495 AbstractCegarLoop]: Abstraction has 2798 states and 3595 transitions. [2022-07-20 04:13:13,000 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-20 04:13:13,000 INFO L276 IsEmpty]: Start isEmpty. Operand 2798 states and 3595 transitions. [2022-07-20 04:13:13,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2022-07-20 04:13:13,002 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:13:13,002 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-20 04:13:13,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-20 04:13:13,003 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-20 04:13:13,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:13:13,003 INFO L85 PathProgramCache]: Analyzing trace with hash -732030745, now seen corresponding path program 1 times [2022-07-20 04:13:13,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:13:13,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992270005] [2022-07-20 04:13:13,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:13:13,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:13:13,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:13:13,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:13:13,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:13:13,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:13:13,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:13:13,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:13:13,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:13:13,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:13,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:13:13,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:13:13,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 04:13:13,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:13:13,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:13,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:13,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:13,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-20 04:13:13,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:13,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:13,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:13,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-20 04:13:13,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:13,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:13,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:13,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-20 04:13:13,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-20 04:13:13,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-20 04:13:13,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:13,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-20 04:13:13,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:13,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:13,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-20 04:13:13,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-20 04:13:13,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:13,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:13,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-20 04:13:13,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-07-20 04:13:13,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-07-20 04:13:13,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,354 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-20 04:13:13,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:13:13,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992270005] [2022-07-20 04:13:13,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992270005] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:13:13,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:13:13,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-20 04:13:13,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499992179] [2022-07-20 04:13:13,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:13:13,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 04:13:13,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:13:13,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 04:13:13,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:13:13,356 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-20 04:13:20,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:13:20,941 INFO L93 Difference]: Finished difference Result 5279 states and 6917 transitions. [2022-07-20 04:13:20,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-20 04:13:20,941 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-20 04:13:20,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:13:20,958 INFO L225 Difference]: With dead ends: 5279 [2022-07-20 04:13:20,959 INFO L226 Difference]: Without dead ends: 3536 [2022-07-20 04:13:20,967 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-20 04:13:20,968 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-20 04:13:20,968 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-20 04:13:20,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3536 states. [2022-07-20 04:13:21,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3536 to 2806. [2022-07-20 04:13:21,249 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-20 04:13:21,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2806 states to 2806 states and 3605 transitions. [2022-07-20 04:13:21,261 INFO L78 Accepts]: Start accepts. Automaton has 2806 states and 3605 transitions. Word has length 223 [2022-07-20 04:13:21,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:13:21,262 INFO L495 AbstractCegarLoop]: Abstraction has 2806 states and 3605 transitions. [2022-07-20 04:13:21,262 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-20 04:13:21,262 INFO L276 IsEmpty]: Start isEmpty. Operand 2806 states and 3605 transitions. [2022-07-20 04:13:21,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2022-07-20 04:13:21,265 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:13:21,265 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-20 04:13:21,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-20 04:13:21,266 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-20 04:13:21,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:13:21,266 INFO L85 PathProgramCache]: Analyzing trace with hash 93185672, now seen corresponding path program 1 times [2022-07-20 04:13:21,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:13:21,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818829926] [2022-07-20 04:13:21,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:13:21,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:13:21,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:21,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:13:21,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:21,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:13:21,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:21,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:13:21,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:21,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:13:21,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:21,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:13:21,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:21,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:13:21,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:21,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:13:21,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:21,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:21,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:21,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:13:21,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:21,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:13:21,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:21,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 04:13:21,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:21,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:13:21,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:21,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:21,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:21,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:21,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:21,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:21,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:21,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-20 04:13:21,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:21,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:21,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:21,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:21,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:21,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:21,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:21,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-20 04:13:21,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:21,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:21,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:21,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:21,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:21,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:21,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:21,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-20 04:13:21,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:21,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-20 04:13:21,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:21,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-20 04:13:21,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:21,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:21,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:21,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-20 04:13:21,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:21,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:21,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:21,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:21,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:21,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-20 04:13:21,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:21,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-20 04:13:21,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:21,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:21,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:21,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:21,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:21,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-20 04:13:21,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:21,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-20 04:13:21,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:21,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-20 04:13:21,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:21,610 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-20 04:13:21,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:13:21,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818829926] [2022-07-20 04:13:21,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818829926] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:13:21,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:13:21,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-20 04:13:21,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973511000] [2022-07-20 04:13:21,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:13:21,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 04:13:21,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:13:21,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 04:13:21,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:13:21,612 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-20 04:13:28,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:13:28,987 INFO L93 Difference]: Finished difference Result 4330 states and 5557 transitions. [2022-07-20 04:13:28,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-20 04:13:28,987 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-20 04:13:28,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:13:29,002 INFO L225 Difference]: With dead ends: 4330 [2022-07-20 04:13:29,002 INFO L226 Difference]: Without dead ends: 4328 [2022-07-20 04:13:29,006 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-20 04:13:29,006 INFO L413 NwaCegarLoop]: 1782 mSDtfsCounter, 4282 mSDsluCounter, 4605 mSDsCounter, 0 mSdLazyCounter, 5345 mSolverCounterSat, 3844 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4490 SdHoareTripleChecker+Valid, 6387 SdHoareTripleChecker+Invalid, 9189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3844 IncrementalHoareTripleChecker+Valid, 5345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-07-20 04:13:29,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4490 Valid, 6387 Invalid, 9189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3844 Valid, 5345 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2022-07-20 04:13:29,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4328 states. [2022-07-20 04:13:29,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4328 to 4272. [2022-07-20 04:13:29,395 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-20 04:13:29,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4272 states to 4272 states and 5476 transitions. [2022-07-20 04:13:29,408 INFO L78 Accepts]: Start accepts. Automaton has 4272 states and 5476 transitions. Word has length 225 [2022-07-20 04:13:29,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:13:29,409 INFO L495 AbstractCegarLoop]: Abstraction has 4272 states and 5476 transitions. [2022-07-20 04:13:29,409 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-20 04:13:29,409 INFO L276 IsEmpty]: Start isEmpty. Operand 4272 states and 5476 transitions. [2022-07-20 04:13:29,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2022-07-20 04:13:29,411 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:13:29,411 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-20 04:13:29,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-20 04:13:29,412 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-20 04:13:29,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:13:29,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1014321496, now seen corresponding path program 1 times [2022-07-20 04:13:29,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:13:29,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28830394] [2022-07-20 04:13:29,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:13:29,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:13:29,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:29,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:13:29,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:29,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:13:29,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:29,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:13:29,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:29,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:13:29,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:29,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:13:29,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:29,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:13:29,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:29,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:13:29,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:29,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:29,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:29,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:13:29,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:29,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:13:29,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:29,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 04:13:29,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:29,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:13:29,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:29,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:29,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:29,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:29,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:29,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:29,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:29,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-20 04:13:29,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:29,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:29,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:29,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:29,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:29,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:29,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:29,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-20 04:13:29,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:29,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:29,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:29,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:29,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:29,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:29,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:29,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-20 04:13:29,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:29,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-20 04:13:29,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:29,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-20 04:13:29,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:29,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:29,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:29,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-20 04:13:29,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:29,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:29,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:29,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:29,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:29,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-20 04:13:29,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:29,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-20 04:13:29,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:29,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:29,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:29,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:29,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:29,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-20 04:13:29,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:29,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-20 04:13:29,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:29,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-20 04:13:29,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:29,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-20 04:13:29,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:29,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:29,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:29,874 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-20 04:13:29,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:13:29,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28830394] [2022-07-20 04:13:29,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28830394] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:13:29,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:13:29,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-20 04:13:29,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141621068] [2022-07-20 04:13:29,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:13:29,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 04:13:29,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:13:29,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 04:13:29,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-20 04:13:29,877 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-20 04:13:38,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:13:38,539 INFO L93 Difference]: Finished difference Result 4352 states and 5579 transitions. [2022-07-20 04:13:38,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-20 04:13:38,540 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-20 04:13:38,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:13:38,552 INFO L225 Difference]: With dead ends: 4352 [2022-07-20 04:13:38,552 INFO L226 Difference]: Without dead ends: 4350 [2022-07-20 04:13:38,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 81 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=270, Invalid=660, Unknown=0, NotChecked=0, Total=930 [2022-07-20 04:13:38,555 INFO L413 NwaCegarLoop]: 2142 mSDtfsCounter, 3405 mSDsluCounter, 6895 mSDsCounter, 0 mSdLazyCounter, 6952 mSolverCounterSat, 3713 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3526 SdHoareTripleChecker+Valid, 9037 SdHoareTripleChecker+Invalid, 10665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3713 IncrementalHoareTripleChecker+Valid, 6952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2022-07-20 04:13:38,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3526 Valid, 9037 Invalid, 10665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3713 Valid, 6952 Invalid, 0 Unknown, 0 Unchecked, 8.0s Time] [2022-07-20 04:13:38,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4350 states. [2022-07-20 04:13:38,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4350 to 4286. [2022-07-20 04:13:38,873 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-20 04:13:38,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4286 states to 4286 states and 5484 transitions. [2022-07-20 04:13:38,887 INFO L78 Accepts]: Start accepts. Automaton has 4286 states and 5484 transitions. Word has length 238 [2022-07-20 04:13:38,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:13:38,888 INFO L495 AbstractCegarLoop]: Abstraction has 4286 states and 5484 transitions. [2022-07-20 04:13:38,888 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-20 04:13:38,888 INFO L276 IsEmpty]: Start isEmpty. Operand 4286 states and 5484 transitions. [2022-07-20 04:13:38,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2022-07-20 04:13:38,891 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:13:38,891 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-20 04:13:38,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-07-20 04:13:38,891 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-20 04:13:38,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:13:38,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1482365617, now seen corresponding path program 1 times [2022-07-20 04:13:38,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:13:38,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410599709] [2022-07-20 04:13:38,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:13:38,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:13:38,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:39,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:13:39,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:39,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:13:39,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:39,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:13:39,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:39,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:13:39,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:39,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-20 04:13:39,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:39,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:39,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:39,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:39,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:39,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:39,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:39,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-20 04:13:39,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:39,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:39,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:39,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:39,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:39,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:39,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:39,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 04:13:39,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:39,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:39,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:39,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:39,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:39,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:39,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:39,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 04:13:39,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:39,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:39,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:39,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:39,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:39,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:39,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:39,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:13:39,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:39,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:39,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:39,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:39,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:39,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:39,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:39,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 04:13:39,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:39,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-20 04:13:39,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:39,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-20 04:13:39,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:39,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-20 04:13:39,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:39,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-20 04:13:39,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:39,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:39,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:39,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-20 04:13:39,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:39,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-20 04:13:39,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:39,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-20 04:13:39,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:39,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-07-20 04:13:39,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:39,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-20 04:13:39,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:39,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:39,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:39,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:39,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:39,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:39,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:39,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-20 04:13:39,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:39,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-20 04:13:39,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:39,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:39,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:39,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:39,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:39,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-20 04:13:39,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:39,250 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-20 04:13:39,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:13:39,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410599709] [2022-07-20 04:13:39,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410599709] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:13:39,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:13:39,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-20 04:13:39,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686342177] [2022-07-20 04:13:39,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:13:39,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 04:13:39,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:13:39,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 04:13:39,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:13:39,253 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-20 04:13:45,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:13:45,257 INFO L93 Difference]: Finished difference Result 4410 states and 5608 transitions. [2022-07-20 04:13:45,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-20 04:13:45,257 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-20 04:13:45,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:13:45,275 INFO L225 Difference]: With dead ends: 4410 [2022-07-20 04:13:45,276 INFO L226 Difference]: Without dead ends: 4408 [2022-07-20 04:13:45,279 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-20 04:13:45,279 INFO L413 NwaCegarLoop]: 1564 mSDtfsCounter, 2802 mSDsluCounter, 3851 mSDsCounter, 0 mSdLazyCounter, 4036 mSolverCounterSat, 2268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2992 SdHoareTripleChecker+Valid, 5415 SdHoareTripleChecker+Invalid, 6304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2268 IncrementalHoareTripleChecker+Valid, 4036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-07-20 04:13:45,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2992 Valid, 5415 Invalid, 6304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2268 Valid, 4036 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2022-07-20 04:13:45,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4408 states. [2022-07-20 04:13:45,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4408 to 4364. [2022-07-20 04:13:45,664 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-20 04:13:45,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4364 states to 4364 states and 5531 transitions. [2022-07-20 04:13:45,675 INFO L78 Accepts]: Start accepts. Automaton has 4364 states and 5531 transitions. Word has length 257 [2022-07-20 04:13:45,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:13:45,675 INFO L495 AbstractCegarLoop]: Abstraction has 4364 states and 5531 transitions. [2022-07-20 04:13:45,675 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-20 04:13:45,675 INFO L276 IsEmpty]: Start isEmpty. Operand 4364 states and 5531 transitions. [2022-07-20 04:13:45,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2022-07-20 04:13:45,678 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:13:45,678 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-20 04:13:45,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-07-20 04:13:45,679 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-20 04:13:45,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:13:45,679 INFO L85 PathProgramCache]: Analyzing trace with hash -96816453, now seen corresponding path program 1 times [2022-07-20 04:13:45,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:13:45,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719002488] [2022-07-20 04:13:45,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:13:45,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:13:45,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:45,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:13:45,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:45,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:13:45,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:45,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:13:45,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:45,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:13:45,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:45,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-20 04:13:45,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:45,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:45,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:45,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:45,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:45,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:45,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:45,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-20 04:13:45,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:45,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:45,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:45,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:45,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:45,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:45,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:45,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 04:13:45,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:45,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:45,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:45,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:45,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:45,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:45,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:45,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 04:13:45,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:45,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:45,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:45,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:45,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:45,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:45,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:45,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:13:45,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:45,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:45,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:45,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:45,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:45,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:45,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:45,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 04:13:45,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:45,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-20 04:13:45,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:45,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-20 04:13:45,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:45,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-20 04:13:45,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:45,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-20 04:13:45,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:46,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:46,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:46,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-20 04:13:46,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:46,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-20 04:13:46,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:46,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-20 04:13:46,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:46,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-07-20 04:13:46,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:46,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-20 04:13:46,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:46,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:46,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:46,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:46,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:46,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:46,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:46,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-20 04:13:46,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:46,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:46,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:46,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:46,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:46,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:46,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:46,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-20 04:13:46,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:46,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-20 04:13:46,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:46,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:46,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:46,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:46,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:46,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-20 04:13:46,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:46,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-07-20 04:13:46,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:46,113 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-20 04:13:46,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:13:46,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719002488] [2022-07-20 04:13:46,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719002488] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:13:46,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:13:46,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-20 04:13:46,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166730147] [2022-07-20 04:13:46,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:13:46,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 04:13:46,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:13:46,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 04:13:46,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:13:46,115 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-20 04:13:53,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:13:53,755 INFO L93 Difference]: Finished difference Result 7337 states and 9258 transitions. [2022-07-20 04:13:53,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-20 04:13:53,756 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-20 04:13:53,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:13:53,772 INFO L225 Difference]: With dead ends: 7337 [2022-07-20 04:13:53,772 INFO L226 Difference]: Without dead ends: 7335 [2022-07-20 04:13:53,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=175, Invalid=377, Unknown=0, NotChecked=0, Total=552 [2022-07-20 04:13:53,776 INFO L413 NwaCegarLoop]: 1918 mSDtfsCounter, 4590 mSDsluCounter, 4536 mSDsCounter, 0 mSdLazyCounter, 5505 mSolverCounterSat, 3973 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4799 SdHoareTripleChecker+Valid, 6454 SdHoareTripleChecker+Invalid, 9478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3973 IncrementalHoareTripleChecker+Valid, 5505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-07-20 04:13:53,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4799 Valid, 6454 Invalid, 9478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3973 Valid, 5505 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2022-07-20 04:13:53,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7335 states. [2022-07-20 04:13:54,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7335 to 7220. [2022-07-20 04:13:54,297 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-20 04:13:54,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7220 states to 7220 states and 9107 transitions. [2022-07-20 04:13:54,319 INFO L78 Accepts]: Start accepts. Automaton has 7220 states and 9107 transitions. Word has length 283 [2022-07-20 04:13:54,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:13:54,320 INFO L495 AbstractCegarLoop]: Abstraction has 7220 states and 9107 transitions. [2022-07-20 04:13:54,320 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-20 04:13:54,320 INFO L276 IsEmpty]: Start isEmpty. Operand 7220 states and 9107 transitions. [2022-07-20 04:13:54,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2022-07-20 04:13:54,324 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:13:54,324 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-20 04:13:54,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-07-20 04:13:54,324 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-20 04:13:54,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:13:54,325 INFO L85 PathProgramCache]: Analyzing trace with hash 42848457, now seen corresponding path program 1 times [2022-07-20 04:13:54,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:13:54,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229509770] [2022-07-20 04:13:54,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:13:54,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:13:54,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:13:54,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:13:54,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:13:54,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:13:54,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-20 04:13:54,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:54,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:54,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:54,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-20 04:13:54,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:54,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:54,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:54,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 04:13:54,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:54,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:54,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:54,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 04:13:54,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:54,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:54,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:54,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:13:54,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:54,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:54,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:54,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 04:13:54,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-20 04:13:54,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-20 04:13:54,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:54,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:54,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 04:13:54,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-20 04:13:54,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:54,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-20 04:13:54,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-20 04:13:54,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-07-20 04:13:54,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-07-20 04:13:54,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-20 04:13:54,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2022-07-20 04:13:54,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:54,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:54,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-20 04:13:54,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2022-07-20 04:13:54,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2022-07-20 04:13:54,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:54,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:54,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-20 04:13:54,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2022-07-20 04:13:54,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2022-07-20 04:13:54,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-07-20 04:13:54,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2022-07-20 04:13:54,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2022-07-20 04:13:54,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,840 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-20 04:13:54,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:13:54,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229509770] [2022-07-20 04:13:54,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229509770] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:13:54,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:13:54,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-07-20 04:13:54,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410500514] [2022-07-20 04:13:54,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:13:54,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-20 04:13:54,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:13:54,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-20 04:13:54,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2022-07-20 04:13:54,843 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-20 04:14:05,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:14:05,458 INFO L93 Difference]: Finished difference Result 14425 states and 18195 transitions. [2022-07-20 04:14:05,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-20 04:14:05,458 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-20 04:14:05,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:14:05,479 INFO L225 Difference]: With dead ends: 14425 [2022-07-20 04:14:05,479 INFO L226 Difference]: Without dead ends: 7335 [2022-07-20 04:14:05,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=216, Invalid=776, Unknown=0, NotChecked=0, Total=992 [2022-07-20 04:14:05,495 INFO L413 NwaCegarLoop]: 1532 mSDtfsCounter, 2391 mSDsluCounter, 7754 mSDsCounter, 0 mSdLazyCounter, 9536 mSolverCounterSat, 2930 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s 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, 9.7s IncrementalHoareTripleChecker+Time [2022-07-20 04:14:05,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2391 Valid, 9286 Invalid, 12466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2930 Valid, 9536 Invalid, 0 Unknown, 0 Unchecked, 9.7s Time] [2022-07-20 04:14:05,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7335 states. [2022-07-20 04:14:06,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7335 to 7234. [2022-07-20 04:14:06,044 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-20 04:14:06,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7234 states to 7234 states and 9124 transitions. [2022-07-20 04:14:06,063 INFO L78 Accepts]: Start accepts. Automaton has 7234 states and 9124 transitions. Word has length 301 [2022-07-20 04:14:06,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:14:06,063 INFO L495 AbstractCegarLoop]: Abstraction has 7234 states and 9124 transitions. [2022-07-20 04:14:06,063 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-20 04:14:06,064 INFO L276 IsEmpty]: Start isEmpty. Operand 7234 states and 9124 transitions. [2022-07-20 04:14:06,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2022-07-20 04:14:06,067 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:14:06,067 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-20 04:14:06,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-07-20 04:14:06,068 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-20 04:14:06,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:14:06,068 INFO L85 PathProgramCache]: Analyzing trace with hash -692844118, now seen corresponding path program 1 times [2022-07-20 04:14:06,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:14:06,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735981969] [2022-07-20 04:14:06,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:14:06,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:14:06,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:14:06,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:14:06,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:14:06,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:14:06,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-20 04:14:06,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:06,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:14:06,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:14:06,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-20 04:14:06,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:06,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:14:06,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:14:06,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 04:14:06,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:06,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:14:06,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:14:06,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 04:14:06,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:06,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:14:06,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:14:06,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:14:06,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:06,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:14:06,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:14:06,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 04:14:06,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-20 04:14:06,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-20 04:14:06,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-20 04:14:06,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-20 04:14:06,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:06,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-20 04:14:06,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-20 04:14:06,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-20 04:14:06,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-07-20 04:14:06,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-20 04:14:06,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:06,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:14:06,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:14:06,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-20 04:14:06,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:06,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:06,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:14:06,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-20 04:14:06,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-20 04:14:06,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:06,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:14:06,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-20 04:14:06,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-07-20 04:14:06,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2022-07-20 04:14:06,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:06,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-20 04:14:06,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-20 04:14:06,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 300 [2022-07-20 04:14:06,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,513 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-20 04:14:06,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:14:06,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735981969] [2022-07-20 04:14:06,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735981969] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:14:06,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:14:06,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-20 04:14:06,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357504250] [2022-07-20 04:14:06,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:14:06,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 04:14:06,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:14:06,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 04:14:06,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-20 04:14:06,515 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-20 04:14:12,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:14:12,784 INFO L93 Difference]: Finished difference Result 7327 states and 9253 transitions. [2022-07-20 04:14:12,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-20 04:14:12,784 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-20 04:14:12,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:14:12,803 INFO L225 Difference]: With dead ends: 7327 [2022-07-20 04:14:12,803 INFO L226 Difference]: Without dead ends: 7325 [2022-07-20 04:14:12,806 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-20 04:14:12,806 INFO L413 NwaCegarLoop]: 1555 mSDtfsCounter, 2600 mSDsluCounter, 4415 mSDsCounter, 0 mSdLazyCounter, 4710 mSolverCounterSat, 2952 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2612 SdHoareTripleChecker+Valid, 5970 SdHoareTripleChecker+Invalid, 7662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2952 IncrementalHoareTripleChecker+Valid, 4710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-07-20 04:14:12,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2612 Valid, 5970 Invalid, 7662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2952 Valid, 4710 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2022-07-20 04:14:12,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7325 states. [2022-07-20 04:14:13,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7325 to 7232. [2022-07-20 04:14:13,346 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-20 04:14:13,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7232 states to 7232 states and 9109 transitions. [2022-07-20 04:14:13,364 INFO L78 Accepts]: Start accepts. Automaton has 7232 states and 9109 transitions. Word has length 311 [2022-07-20 04:14:13,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:14:13,365 INFO L495 AbstractCegarLoop]: Abstraction has 7232 states and 9109 transitions. [2022-07-20 04:14:13,365 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-20 04:14:13,365 INFO L276 IsEmpty]: Start isEmpty. Operand 7232 states and 9109 transitions. [2022-07-20 04:14:13,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2022-07-20 04:14:13,369 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:14:13,369 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-20 04:14:13,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-07-20 04:14:13,370 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-20 04:14:13,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:14:13,370 INFO L85 PathProgramCache]: Analyzing trace with hash -765994228, now seen corresponding path program 1 times [2022-07-20 04:14:13,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:14:13,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036878580] [2022-07-20 04:14:13,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:14:13,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:14:13,461 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-20 04:14:13,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1248312608] [2022-07-20 04:14:13,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:14:13,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 04:14:13,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 04:14:13,464 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-20 04:14:13,465 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-20 04:14:14,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:14,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 2996 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 04:14:14,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 04:14:14,452 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-20 04:14:14,452 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 04:14:14,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:14:14,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036878580] [2022-07-20 04:14:14,453 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-20 04:14:14,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248312608] [2022-07-20 04:14:14,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248312608] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:14:14,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:14:14,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:14:14,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093604891] [2022-07-20 04:14:14,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:14:14,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:14:14,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:14:14,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:14:14,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:14:14,455 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-20 04:14:15,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:14:15,690 INFO L93 Difference]: Finished difference Result 17089 states and 22315 transitions. [2022-07-20 04:14:15,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:14:15,691 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-20 04:14:15,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:14:15,718 INFO L225 Difference]: With dead ends: 17089 [2022-07-20 04:14:15,718 INFO L226 Difference]: Without dead ends: 9902 [2022-07-20 04:14:15,736 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-20 04:14:15,737 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-20 04:14:15,737 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-20 04:14:15,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9902 states. [2022-07-20 04:14:16,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9902 to 7200. [2022-07-20 04:14:16,365 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-20 04:14:16,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7200 states to 7200 states and 9065 transitions. [2022-07-20 04:14:16,385 INFO L78 Accepts]: Start accepts. Automaton has 7200 states and 9065 transitions. Word has length 322 [2022-07-20 04:14:16,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:14:16,385 INFO L495 AbstractCegarLoop]: Abstraction has 7200 states and 9065 transitions. [2022-07-20 04:14:16,386 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-20 04:14:16,386 INFO L276 IsEmpty]: Start isEmpty. Operand 7200 states and 9065 transitions. [2022-07-20 04:14:16,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2022-07-20 04:14:16,390 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:14:16,390 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-20 04:14:16,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-20 04:14:16,603 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-20 04:14:16,604 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-20 04:14:16,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:14:16,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1409689970, now seen corresponding path program 1 times [2022-07-20 04:14:16,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:14:16,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410962264] [2022-07-20 04:14:16,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:14:16,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:14:16,707 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-20 04:14:16,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1385953632] [2022-07-20 04:14:16,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:14:16,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 04:14:16,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 04:14:16,710 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-20 04:14:16,711 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-20 04:14:17,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:17,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 2994 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-20 04:14:17,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 04:14:18,068 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-20 04:14:18,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 04:14:18,564 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-20 04:14:18,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:14:18,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410962264] [2022-07-20 04:14:18,567 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-20 04:14:18,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385953632] [2022-07-20 04:14:18,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1385953632] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 04:14:18,567 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 04:14:18,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2022-07-20 04:14:18,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102064961] [2022-07-20 04:14:18,568 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 04:14:18,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-20 04:14:18,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:14:18,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-20 04:14:18,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-07-20 04:14:18,570 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-20 04:14:20,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:14:20,377 INFO L93 Difference]: Finished difference Result 17065 states and 22289 transitions. [2022-07-20 04:14:20,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 04:14:20,378 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-20 04:14:20,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:14:20,404 INFO L225 Difference]: With dead ends: 17065 [2022-07-20 04:14:20,404 INFO L226 Difference]: Without dead ends: 9907 [2022-07-20 04:14:20,419 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-20 04:14:20,419 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.4s IncrementalHoareTripleChecker+Time [2022-07-20 04:14:20,419 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.4s Time] [2022-07-20 04:14:20,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9907 states. [2022-07-20 04:14:20,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9907 to 7200. [2022-07-20 04:14:20,991 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-20 04:14:21,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7200 states to 7200 states and 9064 transitions. [2022-07-20 04:14:21,010 INFO L78 Accepts]: Start accepts. Automaton has 7200 states and 9064 transitions. Word has length 322 [2022-07-20 04:14:21,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:14:21,011 INFO L495 AbstractCegarLoop]: Abstraction has 7200 states and 9064 transitions. [2022-07-20 04:14:21,011 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-20 04:14:21,011 INFO L276 IsEmpty]: Start isEmpty. Operand 7200 states and 9064 transitions. [2022-07-20 04:14:21,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2022-07-20 04:14:21,014 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:14:21,014 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-20 04:14:21,041 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-20 04:14:21,215 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-20 04:14:21,215 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-20 04:14:21,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:14:21,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1225714191, now seen corresponding path program 1 times [2022-07-20 04:14:21,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:14:21,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820084969] [2022-07-20 04:14:21,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:14:21,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:14:21,292 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-20 04:14:21,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [332677181] [2022-07-20 04:14:21,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:14:21,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 04:14:21,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 04:14:21,294 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-20 04:14:21,304 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-20 04:14:23,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:23,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 3012 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-20 04:14:23,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 04:14:23,175 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-20 04:14:23,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 04:14:23,576 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-20 04:14:23,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:14:23,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820084969] [2022-07-20 04:14:23,576 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-20 04:14:23,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332677181] [2022-07-20 04:14:23,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332677181] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 04:14:23,577 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 04:14:23,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2022-07-20 04:14:23,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785959926] [2022-07-20 04:14:23,577 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 04:14:23,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-20 04:14:23,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:14:23,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-20 04:14:23,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-07-20 04:14:23,579 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-20 04:14:25,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:14:25,236 INFO L93 Difference]: Finished difference Result 17060 states and 22280 transitions. [2022-07-20 04:14:25,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 04:14:25,237 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-20 04:14:25,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:14:25,278 INFO L225 Difference]: With dead ends: 17060 [2022-07-20 04:14:25,278 INFO L226 Difference]: Without dead ends: 9907 [2022-07-20 04:14:25,302 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-20 04:14:25,302 INFO L413 NwaCegarLoop]: 2324 mSDtfsCounter, 917 mSDsluCounter, 17804 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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-20 04:14:25,302 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-20 04:14:25,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9907 states. [2022-07-20 04:14:25,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9907 to 7200. [2022-07-20 04:14:25,999 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-20 04:14:26,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7200 states to 7200 states and 9063 transitions. [2022-07-20 04:14:26,015 INFO L78 Accepts]: Start accepts. Automaton has 7200 states and 9063 transitions. Word has length 326 [2022-07-20 04:14:26,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:14:26,015 INFO L495 AbstractCegarLoop]: Abstraction has 7200 states and 9063 transitions. [2022-07-20 04:14:26,016 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-20 04:14:26,016 INFO L276 IsEmpty]: Start isEmpty. Operand 7200 states and 9063 transitions. [2022-07-20 04:14:26,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2022-07-20 04:14:26,019 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:14:26,019 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-20 04:14:26,058 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-20 04:14:26,247 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-20 04:14:26,247 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-20 04:14:26,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:14:26,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1356949358, now seen corresponding path program 1 times [2022-07-20 04:14:26,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:14:26,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644325371] [2022-07-20 04:14:26,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:14:26,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:14:26,332 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-20 04:14:26,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [334799934] [2022-07-20 04:14:26,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:14:26,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 04:14:26,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 04:14:26,334 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-20 04:14:26,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process