./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 6c24879c 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-?-6c24879 [2022-07-12 17:08:30,056 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 17:08:30,057 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 17:08:30,086 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 17:08:30,087 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 17:08:30,088 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 17:08:30,088 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 17:08:30,090 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 17:08:30,091 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 17:08:30,091 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 17:08:30,092 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 17:08:30,093 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 17:08:30,093 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 17:08:30,096 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 17:08:30,097 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 17:08:30,098 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 17:08:30,099 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 17:08:30,103 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 17:08:30,105 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 17:08:30,112 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 17:08:30,120 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 17:08:30,121 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 17:08:30,121 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 17:08:30,122 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 17:08:30,123 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 17:08:30,124 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 17:08:30,126 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 17:08:30,126 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 17:08:30,127 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 17:08:30,127 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 17:08:30,128 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 17:08:30,128 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 17:08:30,129 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 17:08:30,130 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 17:08:30,130 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 17:08:30,131 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 17:08:30,131 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 17:08:30,132 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 17:08:30,132 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 17:08:30,132 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 17:08:30,133 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 17:08:30,135 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 17:08:30,136 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-12 17:08:30,158 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 17:08:30,159 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 17:08:30,159 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 17:08:30,159 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 17:08:30,160 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 17:08:30,160 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 17:08:30,161 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 17:08:30,161 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 17:08:30,161 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 17:08:30,162 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 17:08:30,162 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 17:08:30,162 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 17:08:30,162 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 17:08:30,162 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 17:08:30,162 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 17:08:30,163 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 17:08:30,163 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 17:08:30,163 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 17:08:30,163 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 17:08:30,163 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 17:08:30,163 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 17:08:30,164 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 17:08:30,164 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 17:08:30,164 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 17:08:30,164 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 17:08:30,164 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 17:08:30,164 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 17:08:30,165 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 17:08:30,165 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 17:08:30,165 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 17:08:30,165 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-12 17:08:30,339 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 17:08:30,362 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 17:08:30,364 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 17:08:30,364 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 17:08:30,365 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 17:08:30,366 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-12 17:08:30,413 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8e486b8b/f56436e511d441e2997879eb7c56c358/FLAGe160a76ff [2022-07-12 17:08:31,028 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 17:08:31,029 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-12 17:08:31,073 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8e486b8b/f56436e511d441e2997879eb7c56c358/FLAGe160a76ff [2022-07-12 17:08:31,386 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8e486b8b/f56436e511d441e2997879eb7c56c358 [2022-07-12 17:08:31,388 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 17:08:31,389 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 17:08:31,390 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 17:08:31,390 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 17:08:31,396 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 17:08:31,397 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 05:08:31" (1/1) ... [2022-07-12 17:08:31,398 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d1e351c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:08:31, skipping insertion in model container [2022-07-12 17:08:31,398 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 05:08:31" (1/1) ... [2022-07-12 17:08:31,402 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 17:08:31,481 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 17:08:33,029 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,033 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,034 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,035 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,035 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,036 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,036 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,037 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,037 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,037 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,038 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,038 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,038 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,039 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,039 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,039 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,040 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,040 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,041 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,041 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,041 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,042 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,042 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,042 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,044 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,044 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,044 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,045 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,045 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,046 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,047 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,047 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,047 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,048 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,048 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,049 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,049 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,049 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,050 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,050 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,050 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,050 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,051 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,051 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,051 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,052 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,052 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,053 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,053 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,053 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,053 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,054 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,054 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,054 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,055 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,055 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,055 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,055 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,056 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,056 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,056 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,057 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,057 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,058 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,058 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,058 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,071 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,072 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,072 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,073 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,073 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,073 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,074 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,074 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,074 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,075 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,075 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,075 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,075 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,076 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,076 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,076 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,077 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,077 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,077 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,077 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,078 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,078 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,084 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 17:08:33,106 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 17:08:33,290 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,291 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,291 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,292 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,293 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,296 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,296 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,296 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,297 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,297 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,297 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,298 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,298 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,298 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,298 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,299 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,299 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,300 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,300 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,300 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,300 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,301 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,301 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,302 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,303 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,303 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,303 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,303 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,304 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,307 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,307 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,308 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,308 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,308 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,309 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,309 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,310 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,310 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,310 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,311 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,312 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,312 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,312 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,313 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,313 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,313 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,314 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,314 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,315 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,315 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,316 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,316 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,316 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,317 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,317 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,318 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,318 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,318 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,319 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,319 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,319 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,320 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,321 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,323 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,324 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,324 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,324 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,325 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,329 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,329 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,330 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,330 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,334 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,334 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,335 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,335 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,335 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,335 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,336 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,337 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,337 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,338 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,338 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,338 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,339 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,339 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,339 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,339 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-12 17:08:33,342 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 17:08:33,473 INFO L208 MainTranslator]: Completed translation [2022-07-12 17:08:33,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:08:33 WrapperNode [2022-07-12 17:08:33,474 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 17:08:33,475 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 17:08:33,475 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 17:08:33,475 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 17:08:33,480 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:08:33" (1/1) ... [2022-07-12 17:08:33,548 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:08:33" (1/1) ... [2022-07-12 17:08:33,672 INFO L137 Inliner]: procedures = 592, calls = 1771, calls flagged for inlining = 263, calls inlined = 169, statements flattened = 3189 [2022-07-12 17:08:33,673 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 17:08:33,674 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 17:08:33,674 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 17:08:33,674 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 17:08:33,679 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:08:33" (1/1) ... [2022-07-12 17:08:33,680 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:08:33" (1/1) ... [2022-07-12 17:08:33,699 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:08:33" (1/1) ... [2022-07-12 17:08:33,700 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:08:33" (1/1) ... [2022-07-12 17:08:33,768 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:08:33" (1/1) ... [2022-07-12 17:08:33,781 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:08:33" (1/1) ... [2022-07-12 17:08:33,797 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:08:33" (1/1) ... [2022-07-12 17:08:33,813 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 17:08:33,814 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 17:08:33,814 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 17:08:33,815 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 17:08:33,815 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:08:33" (1/1) ... [2022-07-12 17:08:33,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 17:08:33,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 17:08:33,839 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-12 17:08:33,856 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-12 17:08:33,882 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-07-12 17:08:33,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-07-12 17:08:33,882 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-12 17:08:33,882 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-12 17:08:33,882 INFO L130 BoogieDeclarations]: Found specification of procedure recover_from_urb_loss [2022-07-12 17:08:33,883 INFO L138 BoogieDeclarations]: Found implementation of procedure recover_from_urb_loss [2022-07-12 17:08:33,883 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_control_urb [2022-07-12 17:08:33,883 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_control_urb [2022-07-12 17:08:33,883 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-12 17:08:33,883 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-12 17:08:33,883 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-12 17:08:33,883 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-12 17:08:33,883 INFO L130 BoogieDeclarations]: Found specification of procedure __might_sleep [2022-07-12 17:08:33,884 INFO L138 BoogieDeclarations]: Found implementation of procedure __might_sleep [2022-07-12 17:08:33,884 INFO L130 BoogieDeclarations]: Found specification of procedure usb_autopm_get_interface [2022-07-12 17:08:33,884 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_autopm_get_interface [2022-07-12 17:08:33,884 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-12 17:08:33,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-12 17:08:33,884 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-07-12 17:08:33,884 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-07-12 17:08:33,885 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-07-12 17:08:33,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-07-12 17:08:33,885 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-07-12 17:08:33,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-07-12 17:08:33,885 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_ioctl [2022-07-12 17:08:33,885 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_ioctl [2022-07-12 17:08:33,885 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-12 17:08:33,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-12 17:08:33,886 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_iuspin_of_wdm_device [2022-07-12 17:08:33,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_iuspin_of_wdm_device [2022-07-12 17:08:33,886 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-12 17:08:33,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-12 17:08:33,886 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-07-12 17:08:33,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-07-12 17:08:33,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 17:08:33,886 INFO L130 BoogieDeclarations]: Found specification of procedure cancel_work_sync [2022-07-12 17:08:33,887 INFO L138 BoogieDeclarations]: Found implementation of procedure cancel_work_sync [2022-07-12 17:08:33,887 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2022-07-12 17:08:33,887 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2022-07-12 17:08:33,887 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-07-12 17:08:33,887 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-07-12 17:08:33,887 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-07-12 17:08:33,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-07-12 17:08:33,887 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2022-07-12 17:08:33,888 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2022-07-12 17:08:33,888 INFO L130 BoogieDeclarations]: Found specification of procedure schedule [2022-07-12 17:08:33,888 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule [2022-07-12 17:08:33,888 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2022-07-12 17:08:33,888 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2022-07-12 17:08:33,888 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~TO~int [2022-07-12 17:08:33,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~TO~int [2022-07-12 17:08:33,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-12 17:08:33,889 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2022-07-12 17:08:33,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2022-07-12 17:08:33,889 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-12 17:08:33,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-12 17:08:33,889 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irq_111 [2022-07-12 17:08:33,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irq_111 [2022-07-12 17:08:33,889 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-12 17:08:33,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-12 17:08:33,890 INFO L130 BoogieDeclarations]: Found specification of procedure usb_autopm_put_interface [2022-07-12 17:08:33,890 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_autopm_put_interface [2022-07-12 17:08:33,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 17:08:33,890 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-07-12 17:08:33,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-07-12 17:08:33,890 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2022-07-12 17:08:33,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2022-07-12 17:08:33,891 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-07-12 17:08:33,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-07-12 17:08:33,891 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-07-12 17:08:33,891 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-07-12 17:08:33,891 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_wlock_of_wdm_device [2022-07-12 17:08:33,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_wlock_of_wdm_device [2022-07-12 17:08:33,891 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-07-12 17:08:33,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-07-12 17:08:33,892 INFO L130 BoogieDeclarations]: Found specification of procedure kill_urbs [2022-07-12 17:08:33,892 INFO L138 BoogieDeclarations]: Found implementation of procedure kill_urbs [2022-07-12 17:08:33,892 INFO L130 BoogieDeclarations]: Found specification of procedure prepare_to_wait_event [2022-07-12 17:08:33,892 INFO L138 BoogieDeclarations]: Found implementation of procedure prepare_to_wait_event [2022-07-12 17:08:33,892 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-07-12 17:08:33,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-07-12 17:08:33,892 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2022-07-12 17:08:33,893 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2022-07-12 17:08:33,893 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-12 17:08:33,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-12 17:08:33,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 17:08:33,893 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_iuspin_of_wdm_device [2022-07-12 17:08:33,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_iuspin_of_wdm_device [2022-07-12 17:08:33,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 17:08:33,893 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-12 17:08:33,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-12 17:08:33,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 17:08:33,894 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2022-07-12 17:08:33,894 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2022-07-12 17:08:33,894 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2022-07-12 17:08:33,894 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2022-07-12 17:08:33,894 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_irq_check_alloc_flags [2022-07-12 17:08:33,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_irq_check_alloc_flags [2022-07-12 17:08:33,895 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-07-12 17:08:33,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-07-12 17:08:33,895 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_find_device [2022-07-12 17:08:33,895 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_find_device [2022-07-12 17:08:33,895 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2022-07-12 17:08:33,895 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2022-07-12 17:08:33,895 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2022-07-12 17:08:33,895 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2022-07-12 17:08:33,896 INFO L130 BoogieDeclarations]: Found specification of procedure finish_wait [2022-07-12 17:08:33,896 INFO L138 BoogieDeclarations]: Found implementation of procedure finish_wait [2022-07-12 17:08:33,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 17:08:33,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 17:08:33,896 INFO L130 BoogieDeclarations]: Found specification of procedure usb_translate_errors [2022-07-12 17:08:33,896 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_translate_errors [2022-07-12 17:08:33,896 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-12 17:08:33,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-12 17:08:33,897 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-12 17:08:33,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-12 17:08:33,897 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_create [2022-07-12 17:08:33,897 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_create [2022-07-12 17:08:33,897 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_128 [2022-07-12 17:08:33,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_128 [2022-07-12 17:08:33,897 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-07-12 17:08:33,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-07-12 17:08:33,898 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_free_urb [2022-07-12 17:08:33,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_free_urb [2022-07-12 17:08:33,898 INFO L130 BoogieDeclarations]: Found specification of procedure clear_wdm_read_flag [2022-07-12 17:08:33,898 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_wdm_read_flag [2022-07-12 17:08:33,898 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-07-12 17:08:33,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-07-12 17:08:33,898 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 17:08:33,898 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2022-07-12 17:08:33,899 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2022-07-12 17:08:33,899 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-12 17:08:33,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-12 17:08:33,899 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_disconnect [2022-07-12 17:08:33,899 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_disconnect [2022-07-12 17:08:33,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 17:08:33,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 17:08:33,899 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_wdm_mutex [2022-07-12 17:08:33,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_wdm_mutex [2022-07-12 17:08:33,900 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-07-12 17:08:33,900 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-07-12 17:08:33,900 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2022-07-12 17:08:33,900 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2022-07-12 17:08:33,900 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-12 17:08:33,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-12 17:08:33,900 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_rlock_of_wdm_device [2022-07-12 17:08:33,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_rlock_of_wdm_device [2022-07-12 17:08:33,901 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-12 17:08:33,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-12 17:08:33,901 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-12 17:08:33,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-12 17:08:33,901 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2022-07-12 17:08:33,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2022-07-12 17:08:33,901 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_alloc_urb [2022-07-12 17:08:33,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_alloc_urb [2022-07-12 17:08:33,902 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-12 17:08:33,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-12 17:08:33,902 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-12 17:08:33,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-12 17:08:33,902 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-07-12 17:08:33,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-07-12 17:08:33,902 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2022-07-12 17:08:33,903 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2022-07-12 17:08:33,903 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-12 17:08:33,903 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-12 17:08:33,903 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-07-12 17:08:33,903 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-07-12 17:08:33,903 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_wdm_mutex [2022-07-12 17:08:33,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_wdm_mutex [2022-07-12 17:08:33,903 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-12 17:08:33,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-12 17:08:33,904 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-12 17:08:33,904 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-12 17:08:33,904 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-12 17:08:33,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-12 17:08:33,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 17:08:33,904 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-12 17:08:33,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-12 17:08:33,904 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-12 17:08:33,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-12 17:08:33,905 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_95 [2022-07-12 17:08:33,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_95 [2022-07-12 17:08:33,905 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_resume [2022-07-12 17:08:33,905 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_resume [2022-07-12 17:08:33,905 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-12 17:08:33,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-12 17:08:33,905 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_96 [2022-07-12 17:08:33,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_96 [2022-07-12 17:08:33,906 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_rlock_of_wdm_device [2022-07-12 17:08:33,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_rlock_of_wdm_device [2022-07-12 17:08:33,906 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2022-07-12 17:08:33,906 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2022-07-12 17:08:33,906 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-12 17:08:33,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-12 17:08:33,906 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-12 17:08:33,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-12 17:08:33,906 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2022-07-12 17:08:33,907 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2022-07-12 17:08:33,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 17:08:33,907 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_wlock_of_wdm_device [2022-07-12 17:08:33,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_wlock_of_wdm_device [2022-07-12 17:08:33,907 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_irq_110 [2022-07-12 17:08:33,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_irq_110 [2022-07-12 17:08:34,381 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 17:08:34,383 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 17:08:34,483 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-12 17:08:37,421 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 17:08:37,437 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 17:08:37,438 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-12 17:08:37,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 05:08:37 BoogieIcfgContainer [2022-07-12 17:08:37,440 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 17:08:37,442 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 17:08:37,442 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 17:08:37,444 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 17:08:37,444 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 05:08:31" (1/3) ... [2022-07-12 17:08:37,445 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e95d11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 05:08:37, skipping insertion in model container [2022-07-12 17:08:37,445 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:08:33" (2/3) ... [2022-07-12 17:08:37,445 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e95d11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 05:08:37, skipping insertion in model container [2022-07-12 17:08:37,445 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 05:08:37" (3/3) ... [2022-07-12 17:08:37,446 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i [2022-07-12 17:08:37,456 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 17:08:37,456 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2022-07-12 17:08:37,506 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 17:08:37,517 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@f85a809, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6c77564f [2022-07-12 17:08:37,517 INFO L358 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2022-07-12 17:08:37,524 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-12 17:08:37,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-12 17:08:37,536 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:08:37,536 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-12 17:08:37,537 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-12 17:08:37,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:08:37,541 INFO L85 PathProgramCache]: Analyzing trace with hash 975260104, now seen corresponding path program 1 times [2022-07-12 17:08:37,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:08:37,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929817740] [2022-07-12 17:08:37,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:08:37,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:08:37,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:38,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:08:38,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:38,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:08:38,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:38,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:08:38,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:38,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:08:38,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:38,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:08:38,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:38,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:08:38,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:38,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:08:38,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:38,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:08:38,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:38,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:08:38,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:38,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:08:38,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:38,135 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-12 17:08:38,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:08:38,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929817740] [2022-07-12 17:08:38,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929817740] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:08:38,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:08:38,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:08:38,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808886940] [2022-07-12 17:08:38,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:08:38,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:08:38,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:08:38,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:08:38,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:08:38,167 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-12 17:08:40,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:08:40,802 INFO L93 Difference]: Finished difference Result 2639 states and 3702 transitions. [2022-07-12 17:08:40,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:08:40,804 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-12 17:08:40,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:08:40,819 INFO L225 Difference]: With dead ends: 2639 [2022-07-12 17:08:40,819 INFO L226 Difference]: Without dead ends: 1333 [2022-07-12 17:08:40,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:08:40,830 INFO L413 NwaCegarLoop]: 1643 mSDtfsCounter, 2296 mSDsluCounter, 1708 mSDsCounter, 0 mSdLazyCounter, 1673 mSolverCounterSat, 1298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2533 SdHoareTripleChecker+Valid, 3351 SdHoareTripleChecker+Invalid, 2971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1298 IncrementalHoareTripleChecker+Valid, 1673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-12 17:08:40,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2533 Valid, 3351 Invalid, 2971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1298 Valid, 1673 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-07-12 17:08:40,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1333 states. [2022-07-12 17:08:40,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1333 to 1333. [2022-07-12 17:08:40,961 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-12 17:08:40,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 1760 transitions. [2022-07-12 17:08:40,970 INFO L78 Accepts]: Start accepts. Automaton has 1333 states and 1760 transitions. Word has length 71 [2022-07-12 17:08:40,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:08:40,971 INFO L495 AbstractCegarLoop]: Abstraction has 1333 states and 1760 transitions. [2022-07-12 17:08:40,972 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-12 17:08:40,972 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 1760 transitions. [2022-07-12 17:08:40,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-12 17:08:40,978 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:08:40,978 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-12 17:08:40,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 17:08:40,979 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-12 17:08:40,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:08:40,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1189993464, now seen corresponding path program 1 times [2022-07-12 17:08:40,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:08:40,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364384541] [2022-07-12 17:08:40,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:08:40,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:08:41,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:41,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:08:41,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:41,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:08:41,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:41,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:08:41,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:41,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:08:41,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:41,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:08:41,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:41,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:08:41,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:41,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:08:41,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:41,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:08:41,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:41,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:08:41,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:41,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:08:41,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:41,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:08:41,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:41,173 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-12 17:08:41,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:08:41,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364384541] [2022-07-12 17:08:41,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364384541] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:08:41,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:08:41,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:08:41,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578315459] [2022-07-12 17:08:41,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:08:41,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:08:41,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:08:41,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:08:41,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:08:41,176 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-12 17:08:43,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:08:43,650 INFO L93 Difference]: Finished difference Result 1333 states and 1760 transitions. [2022-07-12 17:08:43,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:08:43,650 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-12 17:08:43,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:08:43,658 INFO L225 Difference]: With dead ends: 1333 [2022-07-12 17:08:43,659 INFO L226 Difference]: Without dead ends: 1331 [2022-07-12 17:08:43,659 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-12 17:08:43,661 INFO L413 NwaCegarLoop]: 1623 mSDtfsCounter, 2262 mSDsluCounter, 1688 mSDsCounter, 0 mSdLazyCounter, 1659 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s 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.3s IncrementalHoareTripleChecker+Time [2022-07-12 17:08:43,662 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.3s Time] [2022-07-12 17:08:43,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2022-07-12 17:08:43,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 1331. [2022-07-12 17:08:43,707 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-12 17:08:43,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 1758 transitions. [2022-07-12 17:08:43,713 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 1758 transitions. Word has length 77 [2022-07-12 17:08:43,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:08:43,715 INFO L495 AbstractCegarLoop]: Abstraction has 1331 states and 1758 transitions. [2022-07-12 17:08:43,715 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-12 17:08:43,715 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 1758 transitions. [2022-07-12 17:08:43,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-12 17:08:43,717 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:08:43,718 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-12 17:08:43,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 17:08:43,718 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-12 17:08:43,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:08:43,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1626433505, now seen corresponding path program 1 times [2022-07-12 17:08:43,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:08:43,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567484988] [2022-07-12 17:08:43,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:08:43,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:08:43,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:43,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:08:43,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:43,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:08:43,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:43,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:08:43,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:43,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:08:43,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:43,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:08:43,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:43,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:08:43,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:43,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:08:43,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:43,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:08:43,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:43,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:08:43,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:43,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:08:43,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:43,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:08:43,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:43,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:08:43,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:43,960 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-12 17:08:43,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:08:43,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567484988] [2022-07-12 17:08:43,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567484988] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:08:43,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:08:43,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:08:43,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216729393] [2022-07-12 17:08:43,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:08:43,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:08:43,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:08:43,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:08:43,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:08:43,963 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-12 17:08:46,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:08:46,549 INFO L93 Difference]: Finished difference Result 1331 states and 1758 transitions. [2022-07-12 17:08:46,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:08:46,550 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-12 17:08:46,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:08:46,557 INFO L225 Difference]: With dead ends: 1331 [2022-07-12 17:08:46,557 INFO L226 Difference]: Without dead ends: 1329 [2022-07-12 17:08:46,558 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-12 17:08:46,558 INFO L413 NwaCegarLoop]: 1621 mSDtfsCounter, 2256 mSDsluCounter, 1688 mSDsCounter, 0 mSdLazyCounter, 1657 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2489 SdHoareTripleChecker+Valid, 3309 SdHoareTripleChecker+Invalid, 2945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 1657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-12 17:08:46,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2489 Valid, 3309 Invalid, 2945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 1657 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-07-12 17:08:46,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2022-07-12 17:08:46,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 1329. [2022-07-12 17:08:46,588 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-12 17:08:46,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1329 states to 1329 states and 1756 transitions. [2022-07-12 17:08:46,593 INFO L78 Accepts]: Start accepts. Automaton has 1329 states and 1756 transitions. Word has length 83 [2022-07-12 17:08:46,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:08:46,594 INFO L495 AbstractCegarLoop]: Abstraction has 1329 states and 1756 transitions. [2022-07-12 17:08:46,594 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-12 17:08:46,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1329 states and 1756 transitions. [2022-07-12 17:08:46,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-12 17:08:46,595 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:08:46,595 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-12 17:08:46,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 17:08:46,595 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-12 17:08:46,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:08:46,596 INFO L85 PathProgramCache]: Analyzing trace with hash -586799079, now seen corresponding path program 1 times [2022-07-12 17:08:46,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:08:46,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433390166] [2022-07-12 17:08:46,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:08:46,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:08:46,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:46,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:08:46,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:46,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:08:46,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:46,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:08:46,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:46,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:08:46,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:46,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:08:46,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:46,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:08:46,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:46,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:08:46,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:46,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:08:46,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:46,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:08:46,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:46,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:08:46,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:46,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:08:46,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:46,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:08:46,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:46,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:08:46,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:46,773 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-12 17:08:46,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:08:46,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433390166] [2022-07-12 17:08:46,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433390166] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:08:46,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:08:46,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:08:46,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314701095] [2022-07-12 17:08:46,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:08:46,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:08:46,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:08:46,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:08:46,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:08:46,775 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-12 17:08:49,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:08:49,069 INFO L93 Difference]: Finished difference Result 1329 states and 1756 transitions. [2022-07-12 17:08:49,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:08:49,069 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-12 17:08:49,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:08:49,075 INFO L225 Difference]: With dead ends: 1329 [2022-07-12 17:08:49,075 INFO L226 Difference]: Without dead ends: 1327 [2022-07-12 17:08:49,077 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-12 17:08:49,079 INFO L413 NwaCegarLoop]: 1619 mSDtfsCounter, 2250 mSDsluCounter, 1688 mSDsCounter, 0 mSdLazyCounter, 1655 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2482 SdHoareTripleChecker+Valid, 3307 SdHoareTripleChecker+Invalid, 2943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 1655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-12 17:08:49,080 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.2s Time] [2022-07-12 17:08:49,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1327 states. [2022-07-12 17:08:49,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1327 to 1327. [2022-07-12 17:08:49,115 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-12 17:08:49,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1327 states to 1327 states and 1754 transitions. [2022-07-12 17:08:49,120 INFO L78 Accepts]: Start accepts. Automaton has 1327 states and 1754 transitions. Word has length 89 [2022-07-12 17:08:49,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:08:49,121 INFO L495 AbstractCegarLoop]: Abstraction has 1327 states and 1754 transitions. [2022-07-12 17:08:49,121 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-12 17:08:49,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1327 states and 1754 transitions. [2022-07-12 17:08:49,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-12 17:08:49,125 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:08:49,125 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-12 17:08:49,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 17:08:49,126 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-12 17:08:49,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:08:49,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1454441485, now seen corresponding path program 1 times [2022-07-12 17:08:49,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:08:49,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25338293] [2022-07-12 17:08:49,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:08:49,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:08:49,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:49,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:08:49,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:49,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:08:49,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:49,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:08:49,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:49,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:08:49,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:49,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:08:49,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:49,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:08:49,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:49,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:08:49,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:49,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:08:49,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:49,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:08:49,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:49,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:08:49,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:49,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:08:49,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:49,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:08:49,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:49,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:08:49,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:49,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 17:08:49,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:49,302 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-12 17:08:49,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:08:49,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25338293] [2022-07-12 17:08:49,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25338293] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:08:49,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:08:49,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:08:49,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053948606] [2022-07-12 17:08:49,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:08:49,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:08:49,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:08:49,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:08:49,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:08:49,304 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-12 17:08:51,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:08:51,707 INFO L93 Difference]: Finished difference Result 1327 states and 1754 transitions. [2022-07-12 17:08:51,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:08:51,708 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-12 17:08:51,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:08:51,724 INFO L225 Difference]: With dead ends: 1327 [2022-07-12 17:08:51,725 INFO L226 Difference]: Without dead ends: 1325 [2022-07-12 17:08:51,725 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-12 17:08:51,726 INFO L413 NwaCegarLoop]: 1617 mSDtfsCounter, 2244 mSDsluCounter, 1688 mSDsCounter, 0 mSdLazyCounter, 1653 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2475 SdHoareTripleChecker+Valid, 3305 SdHoareTripleChecker+Invalid, 2941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 1653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-12 17:08:51,726 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.3s Time] [2022-07-12 17:08:51,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1325 states. [2022-07-12 17:08:51,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1325 to 1325. [2022-07-12 17:08:51,758 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-12 17:08:51,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 1752 transitions. [2022-07-12 17:08:51,762 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 1752 transitions. Word has length 95 [2022-07-12 17:08:51,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:08:51,763 INFO L495 AbstractCegarLoop]: Abstraction has 1325 states and 1752 transitions. [2022-07-12 17:08:51,764 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-12 17:08:51,764 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 1752 transitions. [2022-07-12 17:08:51,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-12 17:08:51,765 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:08:51,765 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-12 17:08:51,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 17:08:51,765 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-12 17:08:51,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:08:51,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1693669281, now seen corresponding path program 1 times [2022-07-12 17:08:51,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:08:51,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331634479] [2022-07-12 17:08:51,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:08:51,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:08:51,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:51,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:08:51,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:51,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:08:51,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:51,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:08:51,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:51,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:08:51,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:51,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:08:51,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:51,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:08:51,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:51,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:08:51,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:51,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:08:51,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:51,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:08:51,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:51,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:08:51,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:51,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:08:51,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:51,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:08:51,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:51,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:08:51,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:51,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 17:08:51,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:51,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 17:08:51,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:51,929 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-12 17:08:51,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:08:51,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331634479] [2022-07-12 17:08:51,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331634479] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:08:51,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:08:51,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:08:51,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756470140] [2022-07-12 17:08:51,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:08:51,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:08:51,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:08:51,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:08:51,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:08:51,931 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-12 17:08:54,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:08:54,356 INFO L93 Difference]: Finished difference Result 1325 states and 1752 transitions. [2022-07-12 17:08:54,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:08:54,357 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-12 17:08:54,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:08:54,364 INFO L225 Difference]: With dead ends: 1325 [2022-07-12 17:08:54,364 INFO L226 Difference]: Without dead ends: 1323 [2022-07-12 17:08:54,365 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-12 17:08:54,365 INFO L413 NwaCegarLoop]: 1615 mSDtfsCounter, 2238 mSDsluCounter, 1688 mSDsCounter, 0 mSdLazyCounter, 1651 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2468 SdHoareTripleChecker+Valid, 3303 SdHoareTripleChecker+Invalid, 2939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 1651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-12 17:08:54,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2468 Valid, 3303 Invalid, 2939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 1651 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-07-12 17:08:54,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2022-07-12 17:08:54,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 1323. [2022-07-12 17:08:54,433 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-12 17:08:54,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1323 states to 1323 states and 1750 transitions. [2022-07-12 17:08:54,438 INFO L78 Accepts]: Start accepts. Automaton has 1323 states and 1750 transitions. Word has length 101 [2022-07-12 17:08:54,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:08:54,438 INFO L495 AbstractCegarLoop]: Abstraction has 1323 states and 1750 transitions. [2022-07-12 17:08:54,438 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-12 17:08:54,438 INFO L276 IsEmpty]: Start isEmpty. Operand 1323 states and 1750 transitions. [2022-07-12 17:08:54,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-12 17:08:54,439 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:08:54,439 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-12 17:08:54,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 17:08:54,439 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-12 17:08:54,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:08:54,439 INFO L85 PathProgramCache]: Analyzing trace with hash 203341486, now seen corresponding path program 1 times [2022-07-12 17:08:54,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:08:54,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89242382] [2022-07-12 17:08:54,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:08:54,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:08:54,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:54,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:08:54,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:54,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:08:54,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:54,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:08:54,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:54,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:08:54,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:54,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:08:54,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:54,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:08:54,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:54,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:08:54,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:54,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:08:54,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:54,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:08:54,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:54,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:08:54,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:54,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:08:54,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:54,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:08:54,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:54,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:08:54,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:54,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 17:08:54,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:54,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 17:08:54,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:54,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 17:08:54,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:54,640 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-12 17:08:54,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:08:54,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89242382] [2022-07-12 17:08:54,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89242382] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:08:54,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:08:54,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:08:54,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166462090] [2022-07-12 17:08:54,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:08:54,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:08:54,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:08:54,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:08:54,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:08:54,643 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-12 17:08:56,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:08:56,950 INFO L93 Difference]: Finished difference Result 1323 states and 1750 transitions. [2022-07-12 17:08:56,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:08:56,950 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-12 17:08:56,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:08:56,955 INFO L225 Difference]: With dead ends: 1323 [2022-07-12 17:08:56,955 INFO L226 Difference]: Without dead ends: 1321 [2022-07-12 17:08:56,956 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-12 17:08:56,957 INFO L413 NwaCegarLoop]: 1613 mSDtfsCounter, 2232 mSDsluCounter, 1688 mSDsCounter, 0 mSdLazyCounter, 1649 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s 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.2s IncrementalHoareTripleChecker+Time [2022-07-12 17:08:56,957 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.2s Time] [2022-07-12 17:08:56,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2022-07-12 17:08:56,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 1321. [2022-07-12 17:08:56,999 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-12 17:08:57,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1748 transitions. [2022-07-12 17:08:57,004 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1748 transitions. Word has length 107 [2022-07-12 17:08:57,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:08:57,004 INFO L495 AbstractCegarLoop]: Abstraction has 1321 states and 1748 transitions. [2022-07-12 17:08:57,005 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-12 17:08:57,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1748 transitions. [2022-07-12 17:08:57,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-07-12 17:08:57,006 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:08:57,006 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-12 17:08:57,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 17:08:57,006 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-12 17:08:57,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:08:57,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1038477238, now seen corresponding path program 1 times [2022-07-12 17:08:57,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:08:57,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683387648] [2022-07-12 17:08:57,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:08:57,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:08:57,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:57,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:08:57,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:57,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:08:57,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:57,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:08:57,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:57,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:08:57,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:57,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:08:57,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:57,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:08:57,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:57,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:08:57,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:57,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:08:57,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:57,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:08:57,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:57,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:08:57,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:57,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:08:57,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:57,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:08:57,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:57,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:08:57,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:57,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 17:08:57,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:57,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 17:08:57,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:57,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 17:08:57,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:57,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 17:08:57,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:57,162 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-12 17:08:57,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:08:57,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683387648] [2022-07-12 17:08:57,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683387648] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:08:57,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:08:57,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:08:57,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994040312] [2022-07-12 17:08:57,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:08:57,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:08:57,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:08:57,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:08:57,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:08:57,164 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-12 17:08:59,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:08:59,247 INFO L93 Difference]: Finished difference Result 1321 states and 1748 transitions. [2022-07-12 17:08:59,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:08:59,247 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-12 17:08:59,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:08:59,252 INFO L225 Difference]: With dead ends: 1321 [2022-07-12 17:08:59,252 INFO L226 Difference]: Without dead ends: 1319 [2022-07-12 17:08:59,253 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-12 17:08:59,253 INFO L413 NwaCegarLoop]: 1611 mSDtfsCounter, 2230 mSDsluCounter, 1688 mSDsCounter, 0 mSdLazyCounter, 1643 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s 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.0s IncrementalHoareTripleChecker+Time [2022-07-12 17:08:59,253 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.0s Time] [2022-07-12 17:08:59,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2022-07-12 17:08:59,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1319. [2022-07-12 17:08:59,291 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-12 17:08:59,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1319 states and 1746 transitions. [2022-07-12 17:08:59,295 INFO L78 Accepts]: Start accepts. Automaton has 1319 states and 1746 transitions. Word has length 113 [2022-07-12 17:08:59,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:08:59,296 INFO L495 AbstractCegarLoop]: Abstraction has 1319 states and 1746 transitions. [2022-07-12 17:08:59,296 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-12 17:08:59,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 1746 transitions. [2022-07-12 17:08:59,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-07-12 17:08:59,297 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:08:59,297 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-12 17:08:59,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 17:08:59,298 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-12 17:08:59,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:08:59,298 INFO L85 PathProgramCache]: Analyzing trace with hash 470652601, now seen corresponding path program 1 times [2022-07-12 17:08:59,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:08:59,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35827533] [2022-07-12 17:08:59,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:08:59,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:08:59,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:59,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:08:59,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:59,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:08:59,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:59,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:08:59,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:59,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:08:59,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:59,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 17:08:59,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:59,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:08:59,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:59,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:08:59,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:59,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:08:59,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:59,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:08:59,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:59,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:08:59,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:59,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:08:59,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:59,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:08:59,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:59,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 17:08:59,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:59,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:08:59,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:59,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:08:59,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:59,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:08:59,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:59,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 17:08:59,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:59,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:08:59,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:59,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:08:59,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:59,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:08:59,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:59,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:08:59,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:59,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:08:59,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:59,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:08:59,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:59,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:08:59,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:59,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 17:08:59,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:59,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:08:59,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:59,523 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-12 17:08:59,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:08:59,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35827533] [2022-07-12 17:08:59,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35827533] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:08:59,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:08:59,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:08:59,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109460964] [2022-07-12 17:08:59,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:08:59,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:08:59,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:08:59,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:08:59,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:08:59,525 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-12 17:09:02,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:09:02,054 INFO L93 Difference]: Finished difference Result 2452 states and 3227 transitions. [2022-07-12 17:09:02,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 17:09:02,054 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-12 17:09:02,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:09:02,060 INFO L225 Difference]: With dead ends: 2452 [2022-07-12 17:09:02,061 INFO L226 Difference]: Without dead ends: 1329 [2022-07-12 17:09:02,063 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-12 17:09:02,064 INFO L413 NwaCegarLoop]: 1355 mSDtfsCounter, 2602 mSDsluCounter, 1411 mSDsCounter, 0 mSdLazyCounter, 1392 mSolverCounterSat, 1773 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2842 SdHoareTripleChecker+Valid, 2766 SdHoareTripleChecker+Invalid, 3165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1773 IncrementalHoareTripleChecker+Valid, 1392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-12 17:09:02,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2842 Valid, 2766 Invalid, 3165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1773 Valid, 1392 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-07-12 17:09:02,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2022-07-12 17:09:02,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 1315. [2022-07-12 17:09:02,102 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-12 17:09:02,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1315 states to 1315 states and 1741 transitions. [2022-07-12 17:09:02,106 INFO L78 Accepts]: Start accepts. Automaton has 1315 states and 1741 transitions. Word has length 155 [2022-07-12 17:09:02,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:09:02,106 INFO L495 AbstractCegarLoop]: Abstraction has 1315 states and 1741 transitions. [2022-07-12 17:09:02,107 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-12 17:09:02,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1315 states and 1741 transitions. [2022-07-12 17:09:02,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-12 17:09:02,108 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:09:02,108 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-12 17:09:02,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 17:09:02,108 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-12 17:09:02,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:09:02,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1544345977, now seen corresponding path program 1 times [2022-07-12 17:09:02,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:09:02,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627341945] [2022-07-12 17:09:02,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:09:02,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:09:02,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:02,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:09:02,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:02,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:09:02,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:02,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:09:02,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:02,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:09:02,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:02,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:09:02,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:02,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:09:02,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:02,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:09:02,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:02,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:09:02,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:02,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:09:02,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:02,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:09:02,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:02,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:09:02,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:02,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:09:02,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:02,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:09:02,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:02,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 17:09:02,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:02,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 17:09:02,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:02,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 17:09:02,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:02,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 17:09:02,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:02,240 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-12 17:09:02,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:09:02,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627341945] [2022-07-12 17:09:02,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627341945] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:09:02,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:09:02,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:09:02,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270031206] [2022-07-12 17:09:02,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:09:02,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:09:02,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:09:02,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:09:02,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:09:02,242 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-12 17:09:04,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:09:04,662 INFO L93 Difference]: Finished difference Result 1315 states and 1741 transitions. [2022-07-12 17:09:04,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:09:04,663 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-12 17:09:04,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:09:04,668 INFO L225 Difference]: With dead ends: 1315 [2022-07-12 17:09:04,668 INFO L226 Difference]: Without dead ends: 1313 [2022-07-12 17:09:04,668 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-12 17:09:04,669 INFO L413 NwaCegarLoop]: 1604 mSDtfsCounter, 2213 mSDsluCounter, 1674 mSDsCounter, 0 mSdLazyCounter, 1644 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2441 SdHoareTripleChecker+Valid, 3278 SdHoareTripleChecker+Invalid, 2932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 1644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-12 17:09:04,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2441 Valid, 3278 Invalid, 2932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 1644 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-07-12 17:09:04,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1313 states. [2022-07-12 17:09:04,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1313 to 1313. [2022-07-12 17:09:04,716 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-12 17:09:04,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1313 states to 1313 states and 1739 transitions. [2022-07-12 17:09:04,720 INFO L78 Accepts]: Start accepts. Automaton has 1313 states and 1739 transitions. Word has length 115 [2022-07-12 17:09:04,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:09:04,722 INFO L495 AbstractCegarLoop]: Abstraction has 1313 states and 1739 transitions. [2022-07-12 17:09:04,722 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-12 17:09:04,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1313 states and 1739 transitions. [2022-07-12 17:09:04,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-07-12 17:09:04,724 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:09:04,724 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-12 17:09:04,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 17:09:04,724 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-12 17:09:04,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:09:04,725 INFO L85 PathProgramCache]: Analyzing trace with hash 800072008, now seen corresponding path program 1 times [2022-07-12 17:09:04,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:09:04,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404140090] [2022-07-12 17:09:04,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:09:04,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:09:04,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:04,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:09:04,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:04,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:09:04,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:04,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:09:04,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:04,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:09:04,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:04,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 17:09:04,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:04,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:09:04,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:04,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:09:04,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:04,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:09:04,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:04,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:09:04,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:04,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:09:04,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:04,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:09:04,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:04,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:09:04,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:04,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 17:09:04,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:04,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:09:04,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:04,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:09:04,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:04,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:09:04,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:04,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 17:09:04,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:04,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:09:04,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:04,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:09:04,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:04,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:09:04,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:04,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:09:04,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:04,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:09:04,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:04,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:09:04,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:04,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:09:04,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:04,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 17:09:04,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:04,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:09:04,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:04,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-12 17:09:04,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:04,943 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-12 17:09:04,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:09:04,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404140090] [2022-07-12 17:09:04,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404140090] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 17:09:04,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424589481] [2022-07-12 17:09:04,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:09:04,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:09:04,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 17:09:04,946 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-12 17:09:04,947 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-12 17:09:05,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:05,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 2056 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 17:09:05,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:09:05,603 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-12 17:09:05,604 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:09:05,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424589481] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:09:05,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 17:09:05,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2022-07-12 17:09:05,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991162464] [2022-07-12 17:09:05,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:09:05,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 17:09:05,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:09:05,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 17:09:05,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:09:05,606 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-12 17:09:05,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:09:05,691 INFO L93 Difference]: Finished difference Result 2479 states and 3255 transitions. [2022-07-12 17:09:05,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 17:09:05,692 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-12 17:09:05,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:09:05,698 INFO L225 Difference]: With dead ends: 2479 [2022-07-12 17:09:05,699 INFO L226 Difference]: Without dead ends: 1365 [2022-07-12 17:09:05,701 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-12 17:09:05,702 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-12 17:09:05,702 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-12 17:09:05,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2022-07-12 17:09:05,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 1362. [2022-07-12 17:09:05,777 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-12 17:09:05,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 1799 transitions. [2022-07-12 17:09:05,783 INFO L78 Accepts]: Start accepts. Automaton has 1362 states and 1799 transitions. Word has length 161 [2022-07-12 17:09:05,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:09:05,786 INFO L495 AbstractCegarLoop]: Abstraction has 1362 states and 1799 transitions. [2022-07-12 17:09:05,787 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-12 17:09:05,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 1799 transitions. [2022-07-12 17:09:05,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-12 17:09:05,789 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:09:05,789 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-12 17:09:05,818 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-12 17:09:06,011 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-12 17:09:06,012 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-12 17:09:06,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:09:06,012 INFO L85 PathProgramCache]: Analyzing trace with hash 2087551557, now seen corresponding path program 1 times [2022-07-12 17:09:06,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:09:06,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254965924] [2022-07-12 17:09:06,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:09:06,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:09:06,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:06,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:09:06,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:06,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:09:06,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:06,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:09:06,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:06,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:09:06,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:06,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:09:06,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:06,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:09:06,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:06,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:09:06,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:06,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:09:06,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:06,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:09:06,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:06,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:09:06,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:06,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:09:06,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:06,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:09:06,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:06,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:09:06,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:06,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 17:09:06,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:06,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 17:09:06,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:06,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 17:09:06,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:06,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 17:09:06,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:06,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 17:09:06,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:06,203 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-12 17:09:06,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:09:06,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254965924] [2022-07-12 17:09:06,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254965924] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:09:06,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:09:06,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:09:06,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648898695] [2022-07-12 17:09:06,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:09:06,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:09:06,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:09:06,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:09:06,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:09:06,205 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-12 17:09:08,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:09:08,567 INFO L93 Difference]: Finished difference Result 1362 states and 1799 transitions. [2022-07-12 17:09:08,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:09:08,567 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-12 17:09:08,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:09:08,572 INFO L225 Difference]: With dead ends: 1362 [2022-07-12 17:09:08,572 INFO L226 Difference]: Without dead ends: 1360 [2022-07-12 17:09:08,573 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-12 17:09:08,573 INFO L413 NwaCegarLoop]: 1597 mSDtfsCounter, 2204 mSDsluCounter, 1660 mSDsCounter, 0 mSdLazyCounter, 1641 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s 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.2s IncrementalHoareTripleChecker+Time [2022-07-12 17:09:08,573 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.2s Time] [2022-07-12 17:09:08,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2022-07-12 17:09:08,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 1360. [2022-07-12 17:09:08,623 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-12 17:09:08,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 1797 transitions. [2022-07-12 17:09:08,626 INFO L78 Accepts]: Start accepts. Automaton has 1360 states and 1797 transitions. Word has length 121 [2022-07-12 17:09:08,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:09:08,627 INFO L495 AbstractCegarLoop]: Abstraction has 1360 states and 1797 transitions. [2022-07-12 17:09:08,627 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-12 17:09:08,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 1797 transitions. [2022-07-12 17:09:08,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-07-12 17:09:08,628 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:09:08,628 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-12 17:09:08,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 17:09:08,628 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-12 17:09:08,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:09:08,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1837786247, now seen corresponding path program 1 times [2022-07-12 17:09:08,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:09:08,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871170733] [2022-07-12 17:09:08,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:09:08,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:09:08,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:08,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:09:08,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:08,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:09:08,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:08,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:09:08,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:08,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:09:08,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:08,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:09:08,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:08,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:09:08,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:08,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:09:08,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:08,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:09:08,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:08,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:09:08,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:08,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:09:08,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:08,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:09:08,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:08,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:09:08,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:08,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:09:08,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:08,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:09:08,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:08,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:09:08,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:08,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-12 17:09:08,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:08,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:09:08,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:08,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:09:08,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:08,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:09:08,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:08,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 17:09:08,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:08,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:09:08,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:08,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:09:08,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:08,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:09:08,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:08,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 17:09:08,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:08,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-12 17:09:08,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:08,877 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-12 17:09:08,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:09:08,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871170733] [2022-07-12 17:09:08,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871170733] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:09:08,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:09:08,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 17:09:08,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41995880] [2022-07-12 17:09:08,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:09:08,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 17:09:08,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:09:08,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 17:09:08,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 17:09:08,879 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-12 17:09:12,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:09:12,886 INFO L93 Difference]: Finished difference Result 1593 states and 2040 transitions. [2022-07-12 17:09:12,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 17:09:12,886 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-12 17:09:12,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:09:12,892 INFO L225 Difference]: With dead ends: 1593 [2022-07-12 17:09:12,892 INFO L226 Difference]: Without dead ends: 1591 [2022-07-12 17:09:12,893 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-12 17:09:12,893 INFO L413 NwaCegarLoop]: 1663 mSDtfsCounter, 2718 mSDsluCounter, 2908 mSDsCounter, 0 mSdLazyCounter, 3744 mSolverCounterSat, 1881 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2922 SdHoareTripleChecker+Valid, 4571 SdHoareTripleChecker+Invalid, 5625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1881 IncrementalHoareTripleChecker+Valid, 3744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-07-12 17:09:12,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2922 Valid, 4571 Invalid, 5625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1881 Valid, 3744 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-07-12 17:09:12,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2022-07-12 17:09:12,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 1563. [2022-07-12 17:09:12,949 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-12 17:09:12,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 2007 transitions. [2022-07-12 17:09:12,954 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 2007 transitions. Word has length 153 [2022-07-12 17:09:12,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:09:12,955 INFO L495 AbstractCegarLoop]: Abstraction has 1563 states and 2007 transitions. [2022-07-12 17:09:12,955 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-12 17:09:12,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 2007 transitions. [2022-07-12 17:09:12,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-07-12 17:09:12,957 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:09:12,957 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-12 17:09:12,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 17:09:12,957 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-12 17:09:12,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:09:12,958 INFO L85 PathProgramCache]: Analyzing trace with hash -2107684610, now seen corresponding path program 1 times [2022-07-12 17:09:12,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:09:12,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099958113] [2022-07-12 17:09:12,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:09:12,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:09:13,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:13,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:09:13,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:13,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:09:13,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:13,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:09:13,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:13,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:09:13,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:13,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 17:09:13,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:13,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:09:13,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:13,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:09:13,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:13,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:09:13,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:13,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:09:13,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:13,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:09:13,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:13,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:09:13,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:13,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:09:13,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:13,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 17:09:13,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:13,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:09:13,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:13,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:09:13,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:13,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:09:13,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:13,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 17:09:13,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:13,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:09:13,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:13,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:09:13,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:13,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:09:13,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:13,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:09:13,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:13,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:09:13,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:13,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:09:13,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:13,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:09:13,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:13,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 17:09:13,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:13,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:09:13,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:13,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-12 17:09:13,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:13,240 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-12 17:09:13,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:09:13,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099958113] [2022-07-12 17:09:13,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099958113] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:09:13,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:09:13,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 17:09:13,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438043118] [2022-07-12 17:09:13,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:09:13,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 17:09:13,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:09:13,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 17:09:13,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-12 17:09:13,242 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-12 17:09:17,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:09:17,616 INFO L93 Difference]: Finished difference Result 3034 states and 3916 transitions. [2022-07-12 17:09:17,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 17:09:17,617 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-12 17:09:17,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:09:17,624 INFO L225 Difference]: With dead ends: 3034 [2022-07-12 17:09:17,624 INFO L226 Difference]: Without dead ends: 1577 [2022-07-12 17:09:17,628 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-12 17:09:17,628 INFO L413 NwaCegarLoop]: 1587 mSDtfsCounter, 2561 mSDsluCounter, 3309 mSDsCounter, 0 mSdLazyCounter, 4426 mSolverCounterSat, 1770 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2795 SdHoareTripleChecker+Valid, 4896 SdHoareTripleChecker+Invalid, 6196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1770 IncrementalHoareTripleChecker+Valid, 4426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-12 17:09:17,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2795 Valid, 4896 Invalid, 6196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1770 Valid, 4426 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-07-12 17:09:17,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1577 states. [2022-07-12 17:09:17,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1577 to 1563. [2022-07-12 17:09:17,695 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-12 17:09:17,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 2005 transitions. [2022-07-12 17:09:17,699 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 2005 transitions. Word has length 166 [2022-07-12 17:09:17,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:09:17,700 INFO L495 AbstractCegarLoop]: Abstraction has 1563 states and 2005 transitions. [2022-07-12 17:09:17,700 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-12 17:09:17,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 2005 transitions. [2022-07-12 17:09:17,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-07-12 17:09:17,701 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:09:17,701 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-12 17:09:17,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 17:09:17,702 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-12 17:09:17,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:09:17,702 INFO L85 PathProgramCache]: Analyzing trace with hash -2107625028, now seen corresponding path program 1 times [2022-07-12 17:09:17,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:09:17,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796298121] [2022-07-12 17:09:17,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:09:17,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:09:17,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:17,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:09:17,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:17,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:09:17,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:17,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:09:17,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:17,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:09:17,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:17,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 17:09:17,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:17,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:09:17,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:17,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:09:17,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:17,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:09:17,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:17,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:09:17,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:17,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:09:17,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:17,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:09:17,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:17,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:09:17,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:17,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 17:09:17,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:17,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:09:17,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:17,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:09:17,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:17,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:09:17,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:17,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 17:09:17,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:17,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:09:17,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:17,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:09:17,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:17,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:09:17,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:17,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:09:17,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:17,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:09:17,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:17,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:09:17,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:17,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:09:17,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:17,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 17:09:17,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:17,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:09:17,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:17,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-12 17:09:17,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:17,898 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-12 17:09:17,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:09:17,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796298121] [2022-07-12 17:09:17,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796298121] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:09:17,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:09:17,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 17:09:17,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79739427] [2022-07-12 17:09:17,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:09:17,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 17:09:17,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:09:17,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 17:09:17,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 17:09:17,902 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-12 17:09:21,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:09:21,500 INFO L93 Difference]: Finished difference Result 1577 states and 2029 transitions. [2022-07-12 17:09:21,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 17:09:21,500 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-12 17:09:21,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:09:21,505 INFO L225 Difference]: With dead ends: 1577 [2022-07-12 17:09:21,505 INFO L226 Difference]: Without dead ends: 1575 [2022-07-12 17:09:21,506 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-12 17:09:21,506 INFO L413 NwaCegarLoop]: 1587 mSDtfsCounter, 1364 mSDsluCounter, 2837 mSDsCounter, 0 mSdLazyCounter, 3162 mSolverCounterSat, 1486 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1364 SdHoareTripleChecker+Valid, 4424 SdHoareTripleChecker+Invalid, 4648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1486 IncrementalHoareTripleChecker+Valid, 3162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-07-12 17:09:21,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1364 Valid, 4424 Invalid, 4648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1486 Valid, 3162 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-07-12 17:09:21,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2022-07-12 17:09:21,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 1561. [2022-07-12 17:09:21,562 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-12 17:09:21,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 2002 transitions. [2022-07-12 17:09:21,566 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 2002 transitions. Word has length 166 [2022-07-12 17:09:21,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:09:21,566 INFO L495 AbstractCegarLoop]: Abstraction has 1561 states and 2002 transitions. [2022-07-12 17:09:21,567 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-12 17:09:21,567 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 2002 transitions. [2022-07-12 17:09:21,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-12 17:09:21,568 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:09:21,568 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-12 17:09:21,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 17:09:21,568 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-12 17:09:21,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:09:21,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1495386975, now seen corresponding path program 1 times [2022-07-12 17:09:21,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:09:21,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288835049] [2022-07-12 17:09:21,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:09:21,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:09:21,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:21,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:09:21,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:21,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:09:21,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:21,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:09:21,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:21,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:09:21,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:21,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:09:21,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:21,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:09:21,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:21,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:09:21,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:21,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:09:21,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:21,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:09:21,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:21,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:09:21,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:21,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:09:21,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:21,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:09:21,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:21,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:09:21,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:21,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 17:09:21,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:21,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 17:09:21,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:21,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 17:09:21,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:21,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 17:09:21,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:21,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 17:09:21,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:21,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 17:09:21,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:21,732 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-12 17:09:21,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:09:21,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288835049] [2022-07-12 17:09:21,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288835049] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:09:21,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:09:21,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:09:21,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500134933] [2022-07-12 17:09:21,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:09:21,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:09:21,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:09:21,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:09:21,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:09:21,735 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-12 17:09:24,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:09:24,114 INFO L93 Difference]: Finished difference Result 1561 states and 2002 transitions. [2022-07-12 17:09:24,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:09:24,115 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-12 17:09:24,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:09:24,120 INFO L225 Difference]: With dead ends: 1561 [2022-07-12 17:09:24,120 INFO L226 Difference]: Without dead ends: 1559 [2022-07-12 17:09:24,121 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-12 17:09:24,121 INFO L413 NwaCegarLoop]: 1592 mSDtfsCounter, 2189 mSDsluCounter, 1660 mSDsCounter, 0 mSdLazyCounter, 1636 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2415 SdHoareTripleChecker+Valid, 3252 SdHoareTripleChecker+Invalid, 2924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 1636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-12 17:09:24,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2415 Valid, 3252 Invalid, 2924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 1636 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-07-12 17:09:24,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1559 states. [2022-07-12 17:09:24,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1559 to 1559. [2022-07-12 17:09:24,183 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-12 17:09:24,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 2000 transitions. [2022-07-12 17:09:24,187 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 2000 transitions. Word has length 127 [2022-07-12 17:09:24,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:09:24,187 INFO L495 AbstractCegarLoop]: Abstraction has 1559 states and 2000 transitions. [2022-07-12 17:09:24,187 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-12 17:09:24,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 2000 transitions. [2022-07-12 17:09:24,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-07-12 17:09:24,189 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:09:24,189 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-12 17:09:24,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 17:09:24,189 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-12 17:09:24,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:09:24,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1863471288, now seen corresponding path program 1 times [2022-07-12 17:09:24,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:09:24,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633050356] [2022-07-12 17:09:24,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:09:24,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:09:24,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:24,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:09:24,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:24,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:09:24,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:24,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:09:24,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:24,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:09:24,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:24,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 17:09:24,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:24,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:09:24,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:24,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:09:24,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:24,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:09:24,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:24,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:09:24,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:24,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:09:24,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:24,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:09:24,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:24,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:09:24,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:24,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 17:09:24,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:24,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:09:24,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:24,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:09:24,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:24,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:09:24,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:24,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 17:09:24,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:24,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:09:24,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:24,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:09:24,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:24,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:09:24,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:24,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:09:24,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:24,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:09:24,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:24,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:09:24,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:24,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:09:24,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:24,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 17:09:24,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:24,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:09:24,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:24,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-12 17:09:24,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:24,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:09:24,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:24,387 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-12 17:09:24,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:09:24,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633050356] [2022-07-12 17:09:24,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633050356] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:09:24,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:09:24,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:09:24,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143028773] [2022-07-12 17:09:24,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:09:24,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:09:24,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:09:24,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:09:24,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:09:24,389 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-12 17:09:26,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:09:26,823 INFO L93 Difference]: Finished difference Result 3020 states and 3895 transitions. [2022-07-12 17:09:26,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:09:26,824 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-12 17:09:26,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:09:26,830 INFO L225 Difference]: With dead ends: 3020 [2022-07-12 17:09:26,831 INFO L226 Difference]: Without dead ends: 1567 [2022-07-12 17:09:26,834 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-12 17:09:26,834 INFO L413 NwaCegarLoop]: 1581 mSDtfsCounter, 2522 mSDsluCounter, 1399 mSDsCounter, 0 mSdLazyCounter, 1144 mSolverCounterSat, 1768 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2755 SdHoareTripleChecker+Valid, 2980 SdHoareTripleChecker+Invalid, 2912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1768 IncrementalHoareTripleChecker+Valid, 1144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-12 17:09:26,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2755 Valid, 2980 Invalid, 2912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1768 Valid, 1144 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-07-12 17:09:26,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2022-07-12 17:09:26,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1553. [2022-07-12 17:09:26,890 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-12 17:09:26,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1553 states to 1553 states and 1991 transitions. [2022-07-12 17:09:26,894 INFO L78 Accepts]: Start accepts. Automaton has 1553 states and 1991 transitions. Word has length 173 [2022-07-12 17:09:26,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:09:26,894 INFO L495 AbstractCegarLoop]: Abstraction has 1553 states and 1991 transitions. [2022-07-12 17:09:26,894 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-12 17:09:26,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1553 states and 1991 transitions. [2022-07-12 17:09:26,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-07-12 17:09:26,896 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:09:26,896 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-12 17:09:26,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-12 17:09:26,896 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-12 17:09:26,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:09:26,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1932909630, now seen corresponding path program 1 times [2022-07-12 17:09:26,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:09:26,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065549736] [2022-07-12 17:09:26,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:09:26,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:09:26,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:26,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:09:26,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:26,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:09:26,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:26,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:09:26,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:26,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:09:26,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:27,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:09:27,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:27,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:09:27,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:27,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:09:27,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:27,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:09:27,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:27,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:09:27,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:27,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:09:27,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:27,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:09:27,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:27,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:09:27,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:27,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:09:27,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:27,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:09:27,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:27,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:09:27,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:27,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-12 17:09:27,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:27,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:09:27,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:27,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:09:27,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:27,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:09:27,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:27,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 17:09:27,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:27,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:09:27,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:27,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:09:27,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:27,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:09:27,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:27,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 17:09:27,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:27,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-12 17:09:27,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:27,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-12 17:09:27,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:27,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:09:27,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:27,110 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-12 17:09:27,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:09:27,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065549736] [2022-07-12 17:09:27,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065549736] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:09:27,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:09:27,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 17:09:27,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105248372] [2022-07-12 17:09:27,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:09:27,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 17:09:27,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:09:27,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 17:09:27,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-12 17:09:27,113 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-12 17:09:31,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:09:31,166 INFO L93 Difference]: Finished difference Result 1595 states and 2039 transitions. [2022-07-12 17:09:31,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 17:09:31,166 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-12 17:09:31,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:09:31,173 INFO L225 Difference]: With dead ends: 1595 [2022-07-12 17:09:31,173 INFO L226 Difference]: Without dead ends: 1593 [2022-07-12 17:09:31,174 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-12 17:09:31,174 INFO L413 NwaCegarLoop]: 1585 mSDtfsCounter, 2998 mSDsluCounter, 3316 mSDsCounter, 0 mSdLazyCounter, 3504 mSolverCounterSat, 2269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3217 SdHoareTripleChecker+Valid, 4901 SdHoareTripleChecker+Invalid, 5773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2269 IncrementalHoareTripleChecker+Valid, 3504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-07-12 17:09:31,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3217 Valid, 4901 Invalid, 5773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2269 Valid, 3504 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-07-12 17:09:31,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1593 states. [2022-07-12 17:09:31,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1593 to 1577. [2022-07-12 17:09:31,240 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-12 17:09:31,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 2011 transitions. [2022-07-12 17:09:31,243 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 2011 transitions. Word has length 164 [2022-07-12 17:09:31,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:09:31,244 INFO L495 AbstractCegarLoop]: Abstraction has 1577 states and 2011 transitions. [2022-07-12 17:09:31,244 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-12 17:09:31,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 2011 transitions. [2022-07-12 17:09:31,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-07-12 17:09:31,245 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:09:31,245 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-12 17:09:31,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-12 17:09:31,246 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-12 17:09:31,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:09:31,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1219574549, now seen corresponding path program 1 times [2022-07-12 17:09:31,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:09:31,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144444481] [2022-07-12 17:09:31,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:09:31,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:09:31,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:31,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:09:31,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:31,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:09:31,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:31,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:09:31,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:31,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:09:31,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:31,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:09:31,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:31,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:09:31,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:31,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:09:31,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:31,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:09:31,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:31,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:09:31,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:31,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:09:31,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:31,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:09:31,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:31,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:09:31,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:31,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:09:31,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:31,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 17:09:31,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:31,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 17:09:31,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:31,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 17:09:31,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:31,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 17:09:31,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:31,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 17:09:31,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:31,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 17:09:31,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:31,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 17:09:31,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:31,406 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-12 17:09:31,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:09:31,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144444481] [2022-07-12 17:09:31,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144444481] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:09:31,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:09:31,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:09:31,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187162740] [2022-07-12 17:09:31,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:09:31,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:09:31,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:09:31,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:09:31,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:09:31,409 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-12 17:09:33,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:09:33,619 INFO L93 Difference]: Finished difference Result 1577 states and 2011 transitions. [2022-07-12 17:09:33,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:09:33,620 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-12 17:09:33,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:09:33,626 INFO L225 Difference]: With dead ends: 1577 [2022-07-12 17:09:33,626 INFO L226 Difference]: Without dead ends: 1575 [2022-07-12 17:09:33,627 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-12 17:09:33,627 INFO L413 NwaCegarLoop]: 1585 mSDtfsCounter, 2168 mSDsluCounter, 1660 mSDsCounter, 0 mSdLazyCounter, 1629 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s 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.1s IncrementalHoareTripleChecker+Time [2022-07-12 17:09:33,627 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.1s Time] [2022-07-12 17:09:33,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2022-07-12 17:09:33,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 1575. [2022-07-12 17:09:33,686 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-12 17:09:33,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 2009 transitions. [2022-07-12 17:09:33,689 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 2009 transitions. Word has length 133 [2022-07-12 17:09:33,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:09:33,690 INFO L495 AbstractCegarLoop]: Abstraction has 1575 states and 2009 transitions. [2022-07-12 17:09:33,690 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-12 17:09:33,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 2009 transitions. [2022-07-12 17:09:33,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-12 17:09:33,691 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:09:33,692 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-12 17:09:33,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-12 17:09:33,692 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-12 17:09:33,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:09:33,692 INFO L85 PathProgramCache]: Analyzing trace with hash -462029759, now seen corresponding path program 1 times [2022-07-12 17:09:33,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:09:33,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551810929] [2022-07-12 17:09:33,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:09:33,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:09:33,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:33,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:09:33,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:33,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:09:33,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:33,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:09:33,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:33,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:09:33,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:33,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:09:33,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:33,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:09:33,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:33,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:09:33,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:33,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:09:33,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:33,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:09:33,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:33,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:09:33,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:33,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:09:33,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:33,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:09:33,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:33,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:09:33,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:33,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 17:09:33,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:33,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 17:09:33,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:33,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 17:09:33,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:33,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 17:09:33,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:33,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 17:09:33,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:33,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 17:09:33,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:33,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 17:09:33,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:33,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 17:09:33,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:33,825 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-12 17:09:33,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:09:33,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551810929] [2022-07-12 17:09:33,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551810929] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:09:33,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:09:33,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:09:33,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939518368] [2022-07-12 17:09:33,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:09:33,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:09:33,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:09:33,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:09:33,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:09:33,827 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-12 17:09:36,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:09:36,185 INFO L93 Difference]: Finished difference Result 1575 states and 2009 transitions. [2022-07-12 17:09:36,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:09:36,185 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-12 17:09:36,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:09:36,191 INFO L225 Difference]: With dead ends: 1575 [2022-07-12 17:09:36,191 INFO L226 Difference]: Without dead ends: 1573 [2022-07-12 17:09:36,191 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-12 17:09:36,192 INFO L413 NwaCegarLoop]: 1583 mSDtfsCounter, 2162 mSDsluCounter, 1660 mSDsCounter, 0 mSdLazyCounter, 1627 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s 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.2s IncrementalHoareTripleChecker+Time [2022-07-12 17:09:36,195 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.2s Time] [2022-07-12 17:09:36,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1573 states. [2022-07-12 17:09:36,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1573 to 1573. [2022-07-12 17:09:36,268 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-12 17:09:36,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 2007 transitions. [2022-07-12 17:09:36,271 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 2007 transitions. Word has length 139 [2022-07-12 17:09:36,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:09:36,272 INFO L495 AbstractCegarLoop]: Abstraction has 1573 states and 2007 transitions. [2022-07-12 17:09:36,272 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-12 17:09:36,272 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 2007 transitions. [2022-07-12 17:09:36,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-07-12 17:09:36,273 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:09:36,274 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-12 17:09:36,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-12 17:09:36,274 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-12 17:09:36,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:09:36,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1035613449, now seen corresponding path program 1 times [2022-07-12 17:09:36,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:09:36,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796369832] [2022-07-12 17:09:36,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:09:36,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:09:36,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:36,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:09:36,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:36,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:09:36,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:36,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:09:36,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:36,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:09:36,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:36,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:09:36,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:36,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:09:36,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:36,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:09:36,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:36,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:09:36,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:36,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:09:36,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:36,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:09:36,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:36,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:09:36,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:36,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:09:36,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:36,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:09:36,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:36,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 17:09:36,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:36,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 17:09:36,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:36,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 17:09:36,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:36,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 17:09:36,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:36,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 17:09:36,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:36,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 17:09:36,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:36,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 17:09:36,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:36,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 17:09:36,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:36,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 17:09:36,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:36,425 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-12 17:09:36,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:09:36,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796369832] [2022-07-12 17:09:36,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796369832] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:09:36,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:09:36,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:09:36,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298458815] [2022-07-12 17:09:36,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:09:36,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:09:36,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:09:36,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:09:36,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:09:36,429 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-12 17:09:38,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:09:38,640 INFO L93 Difference]: Finished difference Result 1573 states and 2007 transitions. [2022-07-12 17:09:38,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:09:38,640 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-12 17:09:38,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:09:38,646 INFO L225 Difference]: With dead ends: 1573 [2022-07-12 17:09:38,646 INFO L226 Difference]: Without dead ends: 1571 [2022-07-12 17:09:38,647 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-12 17:09:38,647 INFO L413 NwaCegarLoop]: 1581 mSDtfsCounter, 2156 mSDsluCounter, 1660 mSDsCounter, 0 mSdLazyCounter, 1625 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s 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.1s IncrementalHoareTripleChecker+Time [2022-07-12 17:09:38,647 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.1s Time] [2022-07-12 17:09:38,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1571 states. [2022-07-12 17:09:38,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1571 to 1571. [2022-07-12 17:09:38,729 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-12 17:09:38,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 2005 transitions. [2022-07-12 17:09:38,735 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 2005 transitions. Word has length 145 [2022-07-12 17:09:38,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:09:38,735 INFO L495 AbstractCegarLoop]: Abstraction has 1571 states and 2005 transitions. [2022-07-12 17:09:38,736 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-12 17:09:38,736 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 2005 transitions. [2022-07-12 17:09:38,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-07-12 17:09:38,738 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:09:38,738 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-12 17:09:38,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-12 17:09:38,738 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-12 17:09:38,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:09:38,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1583947181, now seen corresponding path program 1 times [2022-07-12 17:09:38,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:09:38,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623089923] [2022-07-12 17:09:38,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:09:38,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:09:38,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:38,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:09:38,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:38,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:09:38,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:38,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:09:38,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:38,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:09:38,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:38,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:09:38,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:38,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:09:38,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:38,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:09:38,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:38,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:09:38,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:38,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:09:38,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:38,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:09:38,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:38,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:09:38,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:38,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:09:38,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:38,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:09:38,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:38,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 17:09:38,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:38,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 17:09:38,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:38,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 17:09:38,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:38,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 17:09:38,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:38,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 17:09:38,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:38,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 17:09:38,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:38,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 17:09:38,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:38,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 17:09:38,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:38,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 17:09:38,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:38,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:09:38,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:38,953 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-12 17:09:38,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:09:38,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623089923] [2022-07-12 17:09:38,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623089923] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:09:38,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:09:38,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:09:38,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072429976] [2022-07-12 17:09:38,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:09:38,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:09:38,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:09:38,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:09:38,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:09:38,956 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-12 17:09:41,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:09:41,404 INFO L93 Difference]: Finished difference Result 1571 states and 2005 transitions. [2022-07-12 17:09:41,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:09:41,404 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-12 17:09:41,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:09:41,409 INFO L225 Difference]: With dead ends: 1571 [2022-07-12 17:09:41,409 INFO L226 Difference]: Without dead ends: 1569 [2022-07-12 17:09:41,410 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-12 17:09:41,410 INFO L413 NwaCegarLoop]: 1579 mSDtfsCounter, 2150 mSDsluCounter, 1660 mSDsCounter, 0 mSdLazyCounter, 1623 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s 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.3s IncrementalHoareTripleChecker+Time [2022-07-12 17:09:41,410 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.3s Time] [2022-07-12 17:09:41,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2022-07-12 17:09:41,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 1569. [2022-07-12 17:09:41,473 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-12 17:09:41,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 2003 transitions. [2022-07-12 17:09:41,476 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 2003 transitions. Word has length 151 [2022-07-12 17:09:41,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:09:41,477 INFO L495 AbstractCegarLoop]: Abstraction has 1569 states and 2003 transitions. [2022-07-12 17:09:41,477 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-12 17:09:41,477 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 2003 transitions. [2022-07-12 17:09:41,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-07-12 17:09:41,479 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:09:41,479 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-12 17:09:41,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-12 17:09:41,479 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-12 17:09:41,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:09:41,480 INFO L85 PathProgramCache]: Analyzing trace with hash -836954508, now seen corresponding path program 1 times [2022-07-12 17:09:41,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:09:41,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451601008] [2022-07-12 17:09:41,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:09:41,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:09:41,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:41,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:09:41,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:41,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:09:41,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:41,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:09:41,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:41,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:09:41,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:41,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:09:41,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:41,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:09:41,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:41,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:09:41,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:41,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:09:41,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:41,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:09:41,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:41,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:09:41,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:41,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:09:41,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:41,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:09:41,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:41,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:09:41,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:41,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:09:41,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:41,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:09:41,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:41,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-12 17:09:41,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:41,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:09:41,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:41,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:09:41,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:41,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:09:41,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:41,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 17:09:41,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:41,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:09:41,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:41,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:09:41,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:41,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:09:41,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:41,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 17:09:41,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:41,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-12 17:09:41,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:41,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-12 17:09:41,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:41,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:09:41,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:41,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-12 17:09:41,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:41,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:09:41,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:41,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:09:41,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:41,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 17:09:41,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:41,699 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-12 17:09:41,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:09:41,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451601008] [2022-07-12 17:09:41,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451601008] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:09:41,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:09:41,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 17:09:41,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120265245] [2022-07-12 17:09:41,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:09:41,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 17:09:41,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:09:41,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 17:09:41,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:09:41,702 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-12 17:09:46,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:09:46,860 INFO L93 Difference]: Finished difference Result 1589 states and 2033 transitions. [2022-07-12 17:09:46,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-12 17:09:46,860 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-12 17:09:46,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:09:46,866 INFO L225 Difference]: With dead ends: 1589 [2022-07-12 17:09:46,866 INFO L226 Difference]: Without dead ends: 1587 [2022-07-12 17:09:46,866 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-12 17:09:46,867 INFO L413 NwaCegarLoop]: 1574 mSDtfsCounter, 2266 mSDsluCounter, 4492 mSDsCounter, 0 mSdLazyCounter, 4733 mSolverCounterSat, 2514 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2266 SdHoareTripleChecker+Valid, 6066 SdHoareTripleChecker+Invalid, 7247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2514 IncrementalHoareTripleChecker+Valid, 4733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-07-12 17:09:46,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2266 Valid, 6066 Invalid, 7247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2514 Valid, 4733 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-07-12 17:09:46,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1587 states. [2022-07-12 17:09:46,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1587 to 1569. [2022-07-12 17:09:46,947 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-12 17:09:46,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 2001 transitions. [2022-07-12 17:09:46,951 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 2001 transitions. Word has length 187 [2022-07-12 17:09:46,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:09:46,952 INFO L495 AbstractCegarLoop]: Abstraction has 1569 states and 2001 transitions. [2022-07-12 17:09:46,952 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-12 17:09:46,952 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 2001 transitions. [2022-07-12 17:09:46,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-12 17:09:46,953 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:09:46,953 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-12 17:09:46,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-12 17:09:46,953 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-12 17:09:46,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:09:46,954 INFO L85 PathProgramCache]: Analyzing trace with hash 2023750506, now seen corresponding path program 1 times [2022-07-12 17:09:46,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:09:46,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483497376] [2022-07-12 17:09:46,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:09:46,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:09:46,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:47,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:09:47,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:47,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:09:47,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:47,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:09:47,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:47,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:09:47,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:47,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:09:47,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:47,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:09:47,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:47,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:09:47,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:47,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:09:47,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:47,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:09:47,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:47,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:09:47,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:47,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:09:47,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:47,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:09:47,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:47,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:09:47,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:47,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 17:09:47,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:47,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 17:09:47,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:47,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 17:09:47,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:47,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 17:09:47,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:47,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 17:09:47,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:47,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 17:09:47,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:47,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 17:09:47,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:47,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 17:09:47,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:47,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 17:09:47,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:47,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:09:47,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:47,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-12 17:09:47,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:47,104 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-12 17:09:47,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:09:47,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483497376] [2022-07-12 17:09:47,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483497376] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:09:47,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:09:47,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:09:47,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227082297] [2022-07-12 17:09:47,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:09:47,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:09:47,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:09:47,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:09:47,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:09:47,106 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-12 17:09:49,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:09:49,440 INFO L93 Difference]: Finished difference Result 1569 states and 2001 transitions. [2022-07-12 17:09:49,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:09:49,447 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-12 17:09:49,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:09:49,451 INFO L225 Difference]: With dead ends: 1569 [2022-07-12 17:09:49,451 INFO L226 Difference]: Without dead ends: 1567 [2022-07-12 17:09:49,452 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-12 17:09:49,452 INFO L413 NwaCegarLoop]: 1577 mSDtfsCounter, 2144 mSDsluCounter, 1660 mSDsCounter, 0 mSdLazyCounter, 1621 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s 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.2s IncrementalHoareTripleChecker+Time [2022-07-12 17:09:49,452 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.2s Time] [2022-07-12 17:09:49,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2022-07-12 17:09:49,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1567. [2022-07-12 17:09:49,522 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-12 17:09:49,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 1999 transitions. [2022-07-12 17:09:49,525 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 1999 transitions. Word has length 157 [2022-07-12 17:09:49,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:09:49,525 INFO L495 AbstractCegarLoop]: Abstraction has 1567 states and 1999 transitions. [2022-07-12 17:09:49,525 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-12 17:09:49,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 1999 transitions. [2022-07-12 17:09:49,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-07-12 17:09:49,527 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:09:49,527 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-12 17:09:49,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-12 17:09:49,527 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-12 17:09:49,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:09:49,528 INFO L85 PathProgramCache]: Analyzing trace with hash 893411218, now seen corresponding path program 1 times [2022-07-12 17:09:49,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:09:49,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063565948] [2022-07-12 17:09:49,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:09:49,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:09:49,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:49,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:09:49,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:49,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:09:49,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:49,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:09:49,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:49,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:09:49,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:49,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:09:49,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:49,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:09:49,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:49,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:09:49,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:49,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:09:49,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:49,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:09:49,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:49,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:09:49,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:49,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:09:49,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:49,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:09:49,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:49,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:09:49,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:49,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 17:09:49,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:49,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 17:09:49,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:49,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 17:09:49,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:49,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 17:09:49,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:49,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 17:09:49,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:49,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 17:09:49,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:49,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 17:09:49,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:49,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 17:09:49,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:49,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 17:09:49,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:49,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:09:49,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:49,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-12 17:09:49,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:49,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-12 17:09:49,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:49,686 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-12 17:09:49,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:09:49,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063565948] [2022-07-12 17:09:49,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063565948] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:09:49,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:09:49,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:09:49,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698902188] [2022-07-12 17:09:49,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:09:49,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:09:49,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:09:49,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:09:49,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:09:49,688 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-12 17:09:51,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:09:51,876 INFO L93 Difference]: Finished difference Result 1567 states and 1999 transitions. [2022-07-12 17:09:51,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:09:51,876 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-12 17:09:51,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:09:51,879 INFO L225 Difference]: With dead ends: 1567 [2022-07-12 17:09:51,880 INFO L226 Difference]: Without dead ends: 1565 [2022-07-12 17:09:51,880 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-12 17:09:51,880 INFO L413 NwaCegarLoop]: 1575 mSDtfsCounter, 2138 mSDsluCounter, 1660 mSDsCounter, 0 mSdLazyCounter, 1619 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s 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.0s IncrementalHoareTripleChecker+Time [2022-07-12 17:09:51,881 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.0s Time] [2022-07-12 17:09:51,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1565 states. [2022-07-12 17:09:51,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1565 to 1565. [2022-07-12 17:09:51,978 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-12 17:09:51,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 1997 transitions. [2022-07-12 17:09:51,982 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 1997 transitions. Word has length 163 [2022-07-12 17:09:51,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:09:51,982 INFO L495 AbstractCegarLoop]: Abstraction has 1565 states and 1997 transitions. [2022-07-12 17:09:51,982 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-12 17:09:51,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 1997 transitions. [2022-07-12 17:09:51,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-07-12 17:09:51,984 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:09:51,984 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-12 17:09:51,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-12 17:09:51,985 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-12 17:09:51,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:09:51,985 INFO L85 PathProgramCache]: Analyzing trace with hash -992837032, now seen corresponding path program 1 times [2022-07-12 17:09:51,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:09:51,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929558882] [2022-07-12 17:09:51,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:09:51,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:09:52,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:52,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:09:52,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:52,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:09:52,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:52,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:09:52,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:52,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:09:52,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:52,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:09:52,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:52,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:09:52,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:52,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:09:52,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:52,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:09:52,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:52,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:09:52,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:52,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:09:52,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:52,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:09:52,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:52,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:09:52,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:52,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:09:52,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:52,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 17:09:52,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:52,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 17:09:52,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:52,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 17:09:52,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:52,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 17:09:52,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:52,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 17:09:52,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:52,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 17:09:52,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:52,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 17:09:52,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:52,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 17:09:52,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:52,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 17:09:52,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:52,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:09:52,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:52,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-12 17:09:52,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:52,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-12 17:09:52,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:52,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-12 17:09:52,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:52,144 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-12 17:09:52,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:09:52,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929558882] [2022-07-12 17:09:52,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929558882] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:09:52,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:09:52,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:09:52,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780006134] [2022-07-12 17:09:52,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:09:52,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:09:52,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:09:52,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:09:52,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:09:52,147 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-12 17:09:54,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:09:54,522 INFO L93 Difference]: Finished difference Result 1565 states and 1997 transitions. [2022-07-12 17:09:54,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:09:54,523 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-12 17:09:54,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:09:54,528 INFO L225 Difference]: With dead ends: 1565 [2022-07-12 17:09:54,528 INFO L226 Difference]: Without dead ends: 1563 [2022-07-12 17:09:54,529 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-12 17:09:54,529 INFO L413 NwaCegarLoop]: 1573 mSDtfsCounter, 2132 mSDsluCounter, 1660 mSDsCounter, 0 mSdLazyCounter, 1617 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s 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.2s IncrementalHoareTripleChecker+Time [2022-07-12 17:09:54,529 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.2s Time] [2022-07-12 17:09:54,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2022-07-12 17:09:54,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 1563. [2022-07-12 17:09:54,597 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-12 17:09:54,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 1995 transitions. [2022-07-12 17:09:54,601 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 1995 transitions. Word has length 169 [2022-07-12 17:09:54,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:09:54,601 INFO L495 AbstractCegarLoop]: Abstraction has 1563 states and 1995 transitions. [2022-07-12 17:09:54,601 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-12 17:09:54,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 1995 transitions. [2022-07-12 17:09:54,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-07-12 17:09:54,603 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:09:54,603 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-12 17:09:54,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-12 17:09:54,603 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-12 17:09:54,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:09:54,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1416811539, now seen corresponding path program 1 times [2022-07-12 17:09:54,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:09:54,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989382598] [2022-07-12 17:09:54,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:09:54,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:09:54,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:54,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:09:54,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:54,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:09:54,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:54,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:09:54,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:54,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:09:54,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:54,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:09:54,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:54,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:09:54,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:54,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:09:54,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:54,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:09:54,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:54,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:09:54,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:54,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:09:54,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:54,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:09:54,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:54,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:09:54,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:54,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:09:54,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:54,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 17:09:54,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:54,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 17:09:54,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:54,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 17:09:54,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:54,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 17:09:54,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:54,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 17:09:54,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:54,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 17:09:54,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:54,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 17:09:54,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:54,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 17:09:54,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:54,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 17:09:54,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:54,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:09:54,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:54,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-12 17:09:54,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:54,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-12 17:09:54,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:54,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-12 17:09:54,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:54,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-12 17:09:54,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:54,751 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-12 17:09:54,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:09:54,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989382598] [2022-07-12 17:09:54,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989382598] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:09:54,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:09:54,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:09:54,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928835501] [2022-07-12 17:09:54,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:09:54,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:09:54,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:09:54,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:09:54,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:09:54,753 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-12 17:09:57,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:09:57,011 INFO L93 Difference]: Finished difference Result 1563 states and 1995 transitions. [2022-07-12 17:09:57,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:09:57,011 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-12 17:09:57,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:09:57,015 INFO L225 Difference]: With dead ends: 1563 [2022-07-12 17:09:57,015 INFO L226 Difference]: Without dead ends: 1561 [2022-07-12 17:09:57,016 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-12 17:09:57,016 INFO L413 NwaCegarLoop]: 1571 mSDtfsCounter, 2126 mSDsluCounter, 1660 mSDsCounter, 0 mSdLazyCounter, 1615 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s 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.1s IncrementalHoareTripleChecker+Time [2022-07-12 17:09:57,016 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.1s Time] [2022-07-12 17:09:57,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1561 states. [2022-07-12 17:09:57,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1561 to 1561. [2022-07-12 17:09:57,104 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-12 17:09:57,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 1993 transitions. [2022-07-12 17:09:57,107 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 1993 transitions. Word has length 175 [2022-07-12 17:09:57,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:09:57,108 INFO L495 AbstractCegarLoop]: Abstraction has 1561 states and 1993 transitions. [2022-07-12 17:09:57,108 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-12 17:09:57,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 1993 transitions. [2022-07-12 17:09:57,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2022-07-12 17:09:57,110 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:09:57,110 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-12 17:09:57,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-12 17:09:57,110 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-12 17:09:57,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:09:57,111 INFO L85 PathProgramCache]: Analyzing trace with hash 731543701, now seen corresponding path program 1 times [2022-07-12 17:09:57,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:09:57,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651410291] [2022-07-12 17:09:57,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:09:57,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:09:57,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:57,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:09:57,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:57,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:09:57,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:57,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:09:57,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:57,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:09:57,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:57,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:09:57,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:57,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:09:57,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:57,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:09:57,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:57,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:09:57,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:57,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:09:57,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:57,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:09:57,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:57,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:09:57,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:57,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:09:57,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:57,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:09:57,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:57,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:09:57,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:57,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:09:57,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:57,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-12 17:09:57,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:57,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:09:57,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:57,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:09:57,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:57,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:09:57,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:57,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 17:09:57,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:57,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:09:57,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:57,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:09:57,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:57,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:09:57,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:57,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 17:09:57,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:57,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-12 17:09:57,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:57,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-12 17:09:57,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:57,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:09:57,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:57,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-12 17:09:57,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:57,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:09:57,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:57,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:09:57,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:57,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 17:09:57,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:57,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-12 17:09:57,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:57,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:09:57,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:57,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:09:57,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:57,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 17:09:57,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:09:57,382 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-12 17:09:57,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:09:57,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651410291] [2022-07-12 17:09:57,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651410291] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:09:57,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:09:57,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 17:09:57,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787444832] [2022-07-12 17:09:57,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:09:57,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 17:09:57,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:09:57,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 17:09:57,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:09:57,385 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-12 17:10:02,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:10:02,850 INFO L93 Difference]: Finished difference Result 1595 states and 2032 transitions. [2022-07-12 17:10:02,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-12 17:10:02,850 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-12 17:10:02,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:10:02,855 INFO L225 Difference]: With dead ends: 1595 [2022-07-12 17:10:02,855 INFO L226 Difference]: Without dead ends: 1593 [2022-07-12 17:10:02,855 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-12 17:10:02,855 INFO L413 NwaCegarLoop]: 1629 mSDtfsCounter, 2796 mSDsluCounter, 4426 mSDsCounter, 0 mSdLazyCounter, 4967 mSolverCounterSat, 2827 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2814 SdHoareTripleChecker+Valid, 6055 SdHoareTripleChecker+Invalid, 7794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2827 IncrementalHoareTripleChecker+Valid, 4967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-07-12 17:10:02,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2814 Valid, 6055 Invalid, 7794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2827 Valid, 4967 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-07-12 17:10:02,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1593 states. [2022-07-12 17:10:02,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1593 to 1565. [2022-07-12 17:10:02,950 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-12 17:10:02,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 1996 transitions. [2022-07-12 17:10:02,953 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 1996 transitions. Word has length 212 [2022-07-12 17:10:02,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:10:02,954 INFO L495 AbstractCegarLoop]: Abstraction has 1565 states and 1996 transitions. [2022-07-12 17:10:02,954 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-12 17:10:02,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 1996 transitions. [2022-07-12 17:10:02,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2022-07-12 17:10:02,956 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:10:02,956 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-12 17:10:02,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-12 17:10:02,956 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-12 17:10:02,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:10:02,957 INFO L85 PathProgramCache]: Analyzing trace with hash 578281643, now seen corresponding path program 1 times [2022-07-12 17:10:02,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:10:02,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659351505] [2022-07-12 17:10:02,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:10:02,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:10:02,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:03,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:10:03,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:03,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:10:03,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:03,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:10:03,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:03,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:10:03,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:03,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:10:03,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:03,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:10:03,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:03,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:10:03,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:03,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:10:03,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:03,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:10:03,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:03,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:10:03,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:03,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:10:03,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:03,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:10:03,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:03,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:10:03,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:03,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 17:10:03,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:03,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 17:10:03,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:03,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 17:10:03,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:03,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 17:10:03,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:03,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 17:10:03,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:03,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 17:10:03,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:03,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 17:10:03,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:03,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 17:10:03,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:03,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 17:10:03,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:03,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:10:03,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:03,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-12 17:10:03,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:03,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-12 17:10:03,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:03,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-12 17:10:03,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:03,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-12 17:10:03,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:03,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-12 17:10:03,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:03,103 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-12 17:10:03,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:10:03,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659351505] [2022-07-12 17:10:03,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659351505] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:10:03,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:10:03,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:10:03,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043251226] [2022-07-12 17:10:03,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:10:03,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:10:03,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:10:03,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:10:03,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:10:03,105 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-12 17:10:05,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:10:05,397 INFO L93 Difference]: Finished difference Result 1565 states and 1996 transitions. [2022-07-12 17:10:05,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:10:05,397 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-12 17:10:05,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:10:05,402 INFO L225 Difference]: With dead ends: 1565 [2022-07-12 17:10:05,402 INFO L226 Difference]: Without dead ends: 1563 [2022-07-12 17:10:05,417 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-12 17:10:05,419 INFO L413 NwaCegarLoop]: 1569 mSDtfsCounter, 2120 mSDsluCounter, 1660 mSDsCounter, 0 mSdLazyCounter, 1613 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s 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.1s IncrementalHoareTripleChecker+Time [2022-07-12 17:10:05,419 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.1s Time] [2022-07-12 17:10:05,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2022-07-12 17:10:05,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 1563. [2022-07-12 17:10:05,490 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-12 17:10:05,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 1994 transitions. [2022-07-12 17:10:05,495 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 1994 transitions. Word has length 181 [2022-07-12 17:10:05,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:10:05,495 INFO L495 AbstractCegarLoop]: Abstraction has 1563 states and 1994 transitions. [2022-07-12 17:10:05,495 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-12 17:10:05,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 1994 transitions. [2022-07-12 17:10:05,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-07-12 17:10:05,500 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:10:05,500 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-12 17:10:05,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-12 17:10:05,501 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-12 17:10:05,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:10:05,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1220089259, now seen corresponding path program 1 times [2022-07-12 17:10:05,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:10:05,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822161097] [2022-07-12 17:10:05,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:10:05,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:10:05,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:05,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:10:05,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:05,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:10:05,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:05,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:10:05,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:05,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:10:05,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:05,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:10:05,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:05,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:10:05,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:05,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:10:05,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:05,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:10:05,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:05,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:10:05,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:05,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:10:05,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:05,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:10:05,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:05,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:10:05,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:05,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:10:05,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:05,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 17:10:05,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:05,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 17:10:05,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:05,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 17:10:05,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:05,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 17:10:05,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:05,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 17:10:05,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:05,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 17:10:05,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:05,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 17:10:05,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:05,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 17:10:05,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:05,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 17:10:05,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:05,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:10:05,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:05,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-12 17:10:05,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:05,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-12 17:10:05,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:05,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-12 17:10:05,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:05,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-12 17:10:05,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:05,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-12 17:10:05,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:05,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-12 17:10:05,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:05,649 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-12 17:10:05,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:10:05,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822161097] [2022-07-12 17:10:05,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822161097] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:10:05,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:10:05,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:10:05,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43402196] [2022-07-12 17:10:05,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:10:05,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:10:05,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:10:05,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:10:05,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:10:05,651 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-12 17:10:10,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:10:10,214 INFO L93 Difference]: Finished difference Result 2967 states and 3785 transitions. [2022-07-12 17:10:10,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 17:10:10,215 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-12 17:10:10,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:10:10,227 INFO L225 Difference]: With dead ends: 2967 [2022-07-12 17:10:10,228 INFO L226 Difference]: Without dead ends: 2812 [2022-07-12 17:10:10,231 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-12 17:10:10,232 INFO L413 NwaCegarLoop]: 1972 mSDtfsCounter, 2775 mSDsluCounter, 2382 mSDsCounter, 0 mSdLazyCounter, 3595 mSolverCounterSat, 2107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s 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, 4.2s IncrementalHoareTripleChecker+Time [2022-07-12 17:10:10,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2988 Valid, 4354 Invalid, 5702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2107 Valid, 3595 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-07-12 17:10:10,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2812 states. [2022-07-12 17:10:10,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2812 to 2798. [2022-07-12 17:10:10,462 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-12 17:10:10,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2798 states to 2798 states and 3595 transitions. [2022-07-12 17:10:10,468 INFO L78 Accepts]: Start accepts. Automaton has 2798 states and 3595 transitions. Word has length 187 [2022-07-12 17:10:10,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:10:10,469 INFO L495 AbstractCegarLoop]: Abstraction has 2798 states and 3595 transitions. [2022-07-12 17:10:10,469 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-12 17:10:10,469 INFO L276 IsEmpty]: Start isEmpty. Operand 2798 states and 3595 transitions. [2022-07-12 17:10:10,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2022-07-12 17:10:10,471 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:10:10,471 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-12 17:10:10,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-12 17:10:10,472 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-12 17:10:10,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:10:10,473 INFO L85 PathProgramCache]: Analyzing trace with hash -732030745, now seen corresponding path program 1 times [2022-07-12 17:10:10,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:10:10,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121070861] [2022-07-12 17:10:10,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:10:10,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:10:10,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:10,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:10:10,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:10,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:10:10,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:10,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:10:10,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:10,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:10:10,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:10,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:10:10,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:10,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:10:10,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:10,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:10:10,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:10,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:10:10,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:10,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:10:10,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:10,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:10:10,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:10,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:10:10,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:10,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:10:10,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:10,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:10:10,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:10,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:10:10,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:10,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:10:10,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:10,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-12 17:10:10,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:10,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:10:10,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:10,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:10:10,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:10,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:10:10,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:10,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 17:10:10,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:10,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:10:10,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:10,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:10:10,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:10,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:10:10,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:10,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 17:10:10,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:10,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-12 17:10:10,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:10,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-12 17:10:10,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:10,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:10:10,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:10,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-12 17:10:10,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:10,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:10:10,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:10,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:10:10,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:10,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 17:10:10,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:10,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-12 17:10:10,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:10,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:10:10,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:10,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:10:10,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:10,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 17:10:10,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:10,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-07-12 17:10:10,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:10,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-07-12 17:10:10,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:10,719 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-12 17:10:10,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:10:10,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121070861] [2022-07-12 17:10:10,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121070861] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:10:10,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:10:10,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 17:10:10,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638237075] [2022-07-12 17:10:10,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:10:10,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 17:10:10,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:10:10,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 17:10:10,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:10:10,722 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-12 17:10:17,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:10:17,031 INFO L93 Difference]: Finished difference Result 5279 states and 6917 transitions. [2022-07-12 17:10:17,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 17:10:17,032 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-12 17:10:17,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:10:17,043 INFO L225 Difference]: With dead ends: 5279 [2022-07-12 17:10:17,043 INFO L226 Difference]: Without dead ends: 3536 [2022-07-12 17:10:17,047 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-12 17:10:17,048 INFO L413 NwaCegarLoop]: 1704 mSDtfsCounter, 3060 mSDsluCounter, 4488 mSDsCounter, 0 mSdLazyCounter, 5458 mSolverCounterSat, 3604 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s 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, 5.9s IncrementalHoareTripleChecker+Time [2022-07-12 17:10:17,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3060 Valid, 6192 Invalid, 9062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3604 Valid, 5458 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2022-07-12 17:10:17,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3536 states. [2022-07-12 17:10:17,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3536 to 2806. [2022-07-12 17:10:17,240 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-12 17:10:17,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2806 states to 2806 states and 3605 transitions. [2022-07-12 17:10:17,247 INFO L78 Accepts]: Start accepts. Automaton has 2806 states and 3605 transitions. Word has length 223 [2022-07-12 17:10:17,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:10:17,248 INFO L495 AbstractCegarLoop]: Abstraction has 2806 states and 3605 transitions. [2022-07-12 17:10:17,248 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-12 17:10:17,248 INFO L276 IsEmpty]: Start isEmpty. Operand 2806 states and 3605 transitions. [2022-07-12 17:10:17,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2022-07-12 17:10:17,250 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:10:17,250 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-12 17:10:17,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-12 17:10:17,250 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-12 17:10:17,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:10:17,251 INFO L85 PathProgramCache]: Analyzing trace with hash 93185672, now seen corresponding path program 1 times [2022-07-12 17:10:17,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:10:17,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782463510] [2022-07-12 17:10:17,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:10:17,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:10:17,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:17,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:10:17,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:17,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:10:17,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:17,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:10:17,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:17,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:10:17,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:17,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:10:17,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:17,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:10:17,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:17,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:10:17,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:17,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:10:17,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:17,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:10:17,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:17,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:10:17,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:17,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:10:17,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:17,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:10:17,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:17,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:10:17,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:17,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:10:17,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:17,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:10:17,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:17,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-12 17:10:17,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:17,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:10:17,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:17,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:10:17,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:17,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:10:17,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:17,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 17:10:17,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:17,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:10:17,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:17,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:10:17,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:17,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:10:17,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:17,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 17:10:17,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:17,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-12 17:10:17,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:17,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-12 17:10:17,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:17,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:10:17,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:17,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-12 17:10:17,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:17,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:10:17,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:17,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:10:17,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:17,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 17:10:17,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:17,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-12 17:10:17,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:17,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:10:17,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:17,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:10:17,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:17,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 17:10:17,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:17,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-12 17:10:17,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:17,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-12 17:10:17,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:17,489 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-12 17:10:17,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:10:17,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782463510] [2022-07-12 17:10:17,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782463510] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:10:17,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:10:17,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 17:10:17,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895918311] [2022-07-12 17:10:17,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:10:17,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 17:10:17,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:10:17,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 17:10:17,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:10:17,491 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-12 17:10:23,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:10:23,981 INFO L93 Difference]: Finished difference Result 4330 states and 5557 transitions. [2022-07-12 17:10:23,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-12 17:10:23,982 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-12 17:10:23,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:10:23,991 INFO L225 Difference]: With dead ends: 4330 [2022-07-12 17:10:23,992 INFO L226 Difference]: Without dead ends: 4328 [2022-07-12 17:10:23,993 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-12 17:10:23,993 INFO L413 NwaCegarLoop]: 1783 mSDtfsCounter, 4282 mSDsluCounter, 4605 mSDsCounter, 0 mSdLazyCounter, 5348 mSolverCounterSat, 3849 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4489 SdHoareTripleChecker+Valid, 6388 SdHoareTripleChecker+Invalid, 9197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3849 IncrementalHoareTripleChecker+Valid, 5348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-07-12 17:10:23,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4489 Valid, 6388 Invalid, 9197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3849 Valid, 5348 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2022-07-12 17:10:23,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4328 states. [2022-07-12 17:10:24,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4328 to 4272. [2022-07-12 17:10:24,263 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-12 17:10:24,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4272 states to 4272 states and 5476 transitions. [2022-07-12 17:10:24,272 INFO L78 Accepts]: Start accepts. Automaton has 4272 states and 5476 transitions. Word has length 225 [2022-07-12 17:10:24,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:10:24,272 INFO L495 AbstractCegarLoop]: Abstraction has 4272 states and 5476 transitions. [2022-07-12 17:10:24,272 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-12 17:10:24,272 INFO L276 IsEmpty]: Start isEmpty. Operand 4272 states and 5476 transitions. [2022-07-12 17:10:24,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2022-07-12 17:10:24,274 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:10:24,274 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-12 17:10:24,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-12 17:10:24,275 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-12 17:10:24,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:10:24,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1014321496, now seen corresponding path program 1 times [2022-07-12 17:10:24,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:10:24,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694052631] [2022-07-12 17:10:24,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:10:24,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:10:24,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:24,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:10:24,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:24,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:10:24,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:24,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:10:24,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:24,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:10:24,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:24,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:10:24,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:24,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:10:24,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:24,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:10:24,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:24,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:10:24,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:24,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:10:24,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:24,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:10:24,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:24,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:10:24,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:24,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:10:24,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:24,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:10:24,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:24,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:10:24,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:24,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:10:24,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:24,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-12 17:10:24,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:24,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:10:24,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:24,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:10:24,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:24,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:10:24,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:24,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 17:10:24,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:24,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:10:24,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:24,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:10:24,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:24,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:10:24,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:24,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 17:10:24,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:24,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-12 17:10:24,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:24,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-12 17:10:24,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:24,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:10:24,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:24,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-12 17:10:24,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:24,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:10:24,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:24,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:10:24,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:24,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 17:10:24,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:24,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-12 17:10:24,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:24,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:10:24,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:24,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:10:24,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:24,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 17:10:24,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:24,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-12 17:10:24,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:24,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-12 17:10:24,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:24,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-12 17:10:24,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:24,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:10:24,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:24,598 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-12 17:10:24,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:10:24,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694052631] [2022-07-12 17:10:24,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694052631] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:10:24,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:10:24,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 17:10:24,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361523338] [2022-07-12 17:10:24,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:10:24,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 17:10:24,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:10:24,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 17:10:24,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-12 17:10:24,600 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-12 17:10:32,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:10:32,105 INFO L93 Difference]: Finished difference Result 4352 states and 5579 transitions. [2022-07-12 17:10:32,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-12 17:10:32,106 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-12 17:10:32,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:10:32,115 INFO L225 Difference]: With dead ends: 4352 [2022-07-12 17:10:32,115 INFO L226 Difference]: Without dead ends: 4350 [2022-07-12 17:10:32,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 81 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=270, Invalid=660, Unknown=0, NotChecked=0, Total=930 [2022-07-12 17:10:32,117 INFO L413 NwaCegarLoop]: 2141 mSDtfsCounter, 3405 mSDsluCounter, 6895 mSDsCounter, 0 mSdLazyCounter, 6943 mSolverCounterSat, 3713 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3526 SdHoareTripleChecker+Valid, 9036 SdHoareTripleChecker+Invalid, 10656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3713 IncrementalHoareTripleChecker+Valid, 6943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-07-12 17:10:32,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3526 Valid, 9036 Invalid, 10656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3713 Valid, 6943 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2022-07-12 17:10:32,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4350 states. [2022-07-12 17:10:32,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4350 to 4286. [2022-07-12 17:10:32,390 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-12 17:10:32,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4286 states to 4286 states and 5484 transitions. [2022-07-12 17:10:32,401 INFO L78 Accepts]: Start accepts. Automaton has 4286 states and 5484 transitions. Word has length 238 [2022-07-12 17:10:32,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:10:32,402 INFO L495 AbstractCegarLoop]: Abstraction has 4286 states and 5484 transitions. [2022-07-12 17:10:32,402 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-12 17:10:32,402 INFO L276 IsEmpty]: Start isEmpty. Operand 4286 states and 5484 transitions. [2022-07-12 17:10:32,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2022-07-12 17:10:32,405 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:10:32,405 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-12 17:10:32,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-07-12 17:10:32,405 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-12 17:10:32,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:10:32,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1482365617, now seen corresponding path program 1 times [2022-07-12 17:10:32,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:10:32,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653658480] [2022-07-12 17:10:32,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:10:32,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:10:32,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:32,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:10:32,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:32,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:10:32,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:32,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:10:32,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:32,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:10:32,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:32,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 17:10:32,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:32,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:10:32,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:32,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:10:32,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:32,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:10:32,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:32,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:10:32,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:32,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:10:32,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:32,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:10:32,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:32,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:10:32,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:32,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 17:10:32,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:32,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:10:32,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:32,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:10:32,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:32,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:10:32,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:32,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 17:10:32,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:32,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:10:32,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:32,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:10:32,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:32,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:10:32,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:32,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:10:32,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:32,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:10:32,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:32,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:10:32,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:32,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:10:32,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:32,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 17:10:32,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:32,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:10:32,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:32,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-12 17:10:32,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:32,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-12 17:10:32,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:32,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-12 17:10:32,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:32,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:10:32,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:32,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-12 17:10:32,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:32,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-12 17:10:32,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:32,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-12 17:10:32,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:32,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-07-12 17:10:32,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:32,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-12 17:10:32,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:32,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:10:32,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:32,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:10:32,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:32,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:10:32,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:32,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 17:10:32,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:32,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 17:10:32,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:32,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:10:32,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:32,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:10:32,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:32,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 17:10:32,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:32,650 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-12 17:10:32,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:10:32,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653658480] [2022-07-12 17:10:32,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653658480] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:10:32,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:10:32,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 17:10:32,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081910708] [2022-07-12 17:10:32,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:10:32,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 17:10:32,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:10:32,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 17:10:32,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:10:32,652 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-12 17:10:37,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:10:37,838 INFO L93 Difference]: Finished difference Result 4410 states and 5608 transitions. [2022-07-12 17:10:37,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 17:10:37,839 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-12 17:10:37,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:10:37,851 INFO L225 Difference]: With dead ends: 4410 [2022-07-12 17:10:37,852 INFO L226 Difference]: Without dead ends: 4408 [2022-07-12 17:10:37,853 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-12 17:10:37,853 INFO L413 NwaCegarLoop]: 1565 mSDtfsCounter, 2802 mSDsluCounter, 3851 mSDsCounter, 0 mSdLazyCounter, 4038 mSolverCounterSat, 2272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2991 SdHoareTripleChecker+Valid, 5416 SdHoareTripleChecker+Invalid, 6310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2272 IncrementalHoareTripleChecker+Valid, 4038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-07-12 17:10:37,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2991 Valid, 5416 Invalid, 6310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2272 Valid, 4038 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-07-12 17:10:37,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4408 states. [2022-07-12 17:10:38,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4408 to 4364. [2022-07-12 17:10:38,165 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-12 17:10:38,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4364 states to 4364 states and 5531 transitions. [2022-07-12 17:10:38,178 INFO L78 Accepts]: Start accepts. Automaton has 4364 states and 5531 transitions. Word has length 257 [2022-07-12 17:10:38,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:10:38,178 INFO L495 AbstractCegarLoop]: Abstraction has 4364 states and 5531 transitions. [2022-07-12 17:10:38,179 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-12 17:10:38,179 INFO L276 IsEmpty]: Start isEmpty. Operand 4364 states and 5531 transitions. [2022-07-12 17:10:38,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2022-07-12 17:10:38,182 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:10:38,182 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-12 17:10:38,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-07-12 17:10:38,182 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-12 17:10:38,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:10:38,183 INFO L85 PathProgramCache]: Analyzing trace with hash -96816453, now seen corresponding path program 1 times [2022-07-12 17:10:38,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:10:38,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965919996] [2022-07-12 17:10:38,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:10:38,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:10:38,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:38,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:10:38,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:38,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:10:38,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:38,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:10:38,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:38,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:10:38,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:38,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 17:10:38,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:38,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:10:38,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:38,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:10:38,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:38,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:10:38,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:38,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:10:38,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:38,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:10:38,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:38,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:10:38,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:38,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:10:38,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:38,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 17:10:38,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:38,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:10:38,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:38,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:10:38,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:38,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:10:38,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:38,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 17:10:38,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:38,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:10:38,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:38,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:10:38,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:38,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:10:38,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:38,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:10:38,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:38,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:10:38,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:38,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:10:38,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:38,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:10:38,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:38,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 17:10:38,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:38,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:10:38,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:38,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-12 17:10:38,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:38,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-12 17:10:38,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:38,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-12 17:10:38,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:38,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:10:38,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:38,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-12 17:10:38,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:38,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-12 17:10:38,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:38,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-12 17:10:38,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:38,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-07-12 17:10:38,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:38,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-12 17:10:38,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:38,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:10:38,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:38,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:10:38,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:38,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:10:38,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:38,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-12 17:10:38,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:38,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:10:38,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:38,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:10:38,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:38,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:10:38,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:38,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 17:10:38,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:38,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 17:10:38,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:38,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:10:38,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:38,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:10:38,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:38,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 17:10:38,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:38,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-07-12 17:10:38,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:38,507 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-12 17:10:38,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:10:38,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965919996] [2022-07-12 17:10:38,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965919996] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:10:38,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:10:38,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 17:10:38,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411050954] [2022-07-12 17:10:38,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:10:38,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 17:10:38,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:10:38,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 17:10:38,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:10:38,509 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-12 17:10:44,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:10:44,540 INFO L93 Difference]: Finished difference Result 7337 states and 9258 transitions. [2022-07-12 17:10:44,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 17:10:44,541 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-12 17:10:44,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:10:44,560 INFO L225 Difference]: With dead ends: 7337 [2022-07-12 17:10:44,560 INFO L226 Difference]: Without dead ends: 7335 [2022-07-12 17:10:44,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=175, Invalid=377, Unknown=0, NotChecked=0, Total=552 [2022-07-12 17:10:44,564 INFO L413 NwaCegarLoop]: 1917 mSDtfsCounter, 4590 mSDsluCounter, 4536 mSDsCounter, 0 mSdLazyCounter, 5495 mSolverCounterSat, 3977 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4800 SdHoareTripleChecker+Valid, 6453 SdHoareTripleChecker+Invalid, 9472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3977 IncrementalHoareTripleChecker+Valid, 5495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-07-12 17:10:44,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4800 Valid, 6453 Invalid, 9472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3977 Valid, 5495 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2022-07-12 17:10:44,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7335 states. [2022-07-12 17:10:45,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7335 to 7220. [2022-07-12 17:10:45,022 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-12 17:10:45,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7220 states to 7220 states and 9107 transitions. [2022-07-12 17:10:45,040 INFO L78 Accepts]: Start accepts. Automaton has 7220 states and 9107 transitions. Word has length 283 [2022-07-12 17:10:45,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:10:45,040 INFO L495 AbstractCegarLoop]: Abstraction has 7220 states and 9107 transitions. [2022-07-12 17:10:45,041 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-12 17:10:45,041 INFO L276 IsEmpty]: Start isEmpty. Operand 7220 states and 9107 transitions. [2022-07-12 17:10:45,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2022-07-12 17:10:45,044 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:10:45,044 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-12 17:10:45,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-07-12 17:10:45,044 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-12 17:10:45,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:10:45,045 INFO L85 PathProgramCache]: Analyzing trace with hash 42848457, now seen corresponding path program 1 times [2022-07-12 17:10:45,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:10:45,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205083857] [2022-07-12 17:10:45,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:10:45,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:10:45,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:45,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:10:45,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:45,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:10:45,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:45,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:10:45,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:45,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:10:45,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:45,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 17:10:45,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:45,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:10:45,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:45,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:10:45,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:45,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:10:45,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:45,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:10:45,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:45,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:10:45,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:45,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:10:45,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:45,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:10:45,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:45,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 17:10:45,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:45,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:10:45,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:45,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:10:45,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:45,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:10:45,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:45,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 17:10:45,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:45,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:10:45,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:45,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:10:45,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:45,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:10:45,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:45,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:10:45,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:45,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:10:45,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:45,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:10:45,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:45,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:10:45,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:45,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 17:10:45,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:45,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:10:45,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:45,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-12 17:10:45,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:45,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:10:45,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:45,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:10:45,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:45,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 17:10:45,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:45,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-12 17:10:45,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:45,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:10:45,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:45,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-12 17:10:45,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:45,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-12 17:10:45,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:45,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-07-12 17:10:45,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:45,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-07-12 17:10:45,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:45,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-12 17:10:45,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:45,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2022-07-12 17:10:45,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:45,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:10:45,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:45,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:10:45,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:45,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 17:10:45,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:45,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2022-07-12 17:10:45,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:45,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2022-07-12 17:10:45,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:45,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:10:45,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:45,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:10:45,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:45,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 17:10:45,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:45,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2022-07-12 17:10:45,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:45,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2022-07-12 17:10:45,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:45,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-07-12 17:10:45,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:45,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2022-07-12 17:10:45,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:45,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2022-07-12 17:10:45,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:45,448 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-12 17:10:45,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:10:45,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205083857] [2022-07-12 17:10:45,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205083857] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:10:45,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:10:45,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-07-12 17:10:45,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543287954] [2022-07-12 17:10:45,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:10:45,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-12 17:10:45,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:10:45,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-12 17:10:45,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2022-07-12 17:10:45,451 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-12 17:10:54,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:10:54,548 INFO L93 Difference]: Finished difference Result 14425 states and 18195 transitions. [2022-07-12 17:10:54,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-12 17:10:54,548 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-12 17:10:54,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:10:54,565 INFO L225 Difference]: With dead ends: 14425 [2022-07-12 17:10:54,565 INFO L226 Difference]: Without dead ends: 7335 [2022-07-12 17:10:54,578 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-12 17:10:54,578 INFO L413 NwaCegarLoop]: 1532 mSDtfsCounter, 2391 mSDsluCounter, 7754 mSDsCounter, 0 mSdLazyCounter, 9536 mSolverCounterSat, 2930 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2391 SdHoareTripleChecker+Valid, 9286 SdHoareTripleChecker+Invalid, 12466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2930 IncrementalHoareTripleChecker+Valid, 9536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2022-07-12 17:10:54,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2391 Valid, 9286 Invalid, 12466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2930 Valid, 9536 Invalid, 0 Unknown, 0 Unchecked, 8.2s Time] [2022-07-12 17:10:54,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7335 states. [2022-07-12 17:10:55,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7335 to 7234. [2022-07-12 17:10:55,059 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-12 17:10:55,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7234 states to 7234 states and 9124 transitions. [2022-07-12 17:10:55,074 INFO L78 Accepts]: Start accepts. Automaton has 7234 states and 9124 transitions. Word has length 301 [2022-07-12 17:10:55,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:10:55,074 INFO L495 AbstractCegarLoop]: Abstraction has 7234 states and 9124 transitions. [2022-07-12 17:10:55,074 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-12 17:10:55,074 INFO L276 IsEmpty]: Start isEmpty. Operand 7234 states and 9124 transitions. [2022-07-12 17:10:55,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2022-07-12 17:10:55,077 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:10:55,077 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-12 17:10:55,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-07-12 17:10:55,078 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-12 17:10:55,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:10:55,078 INFO L85 PathProgramCache]: Analyzing trace with hash -692844118, now seen corresponding path program 1 times [2022-07-12 17:10:55,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:10:55,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179313588] [2022-07-12 17:10:55,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:10:55,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:10:55,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:55,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:10:55,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:55,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:10:55,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:55,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:10:55,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:55,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:10:55,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:55,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 17:10:55,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:55,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:10:55,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:55,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:10:55,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:55,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:10:55,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:55,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:10:55,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:55,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:10:55,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:55,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:10:55,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:55,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:10:55,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:55,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 17:10:55,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:55,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:10:55,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:55,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:10:55,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:55,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:10:55,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:55,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 17:10:55,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:55,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:10:55,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:55,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:10:55,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:55,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:10:55,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:55,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:10:55,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:55,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:10:55,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:55,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:10:55,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:55,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:10:55,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:55,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 17:10:55,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:55,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:10:55,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:55,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-12 17:10:55,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:55,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-12 17:10:55,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:55,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-12 17:10:55,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:55,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:10:55,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:55,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-12 17:10:55,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:55,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-12 17:10:55,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:55,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-12 17:10:55,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:55,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-07-12 17:10:55,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:55,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-12 17:10:55,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:55,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:10:55,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:55,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:10:55,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:55,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:10:55,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:55,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-12 17:10:55,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:55,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:10:55,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:55,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:10:55,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:55,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:10:55,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:55,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 17:10:55,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:55,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 17:10:55,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:55,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:10:55,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:55,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:10:55,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:55,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 17:10:55,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:55,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-07-12 17:10:55,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:55,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2022-07-12 17:10:55,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:55,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:10:55,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:55,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 17:10:55,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:55,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-12 17:10:55,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:55,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 300 [2022-07-12 17:10:55,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:55,330 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-12 17:10:55,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:10:55,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179313588] [2022-07-12 17:10:55,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179313588] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:10:55,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:10:55,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 17:10:55,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955292390] [2022-07-12 17:10:55,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:10:55,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 17:10:55,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:10:55,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 17:10:55,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-12 17:10:55,334 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-12 17:11:00,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:11:00,671 INFO L93 Difference]: Finished difference Result 7327 states and 9253 transitions. [2022-07-12 17:11:00,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 17:11:00,672 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-12 17:11:00,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:11:00,687 INFO L225 Difference]: With dead ends: 7327 [2022-07-12 17:11:00,687 INFO L226 Difference]: Without dead ends: 7325 [2022-07-12 17:11:00,690 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-12 17:11:00,690 INFO L413 NwaCegarLoop]: 1555 mSDtfsCounter, 2600 mSDsluCounter, 4415 mSDsCounter, 0 mSdLazyCounter, 4710 mSolverCounterSat, 2952 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s 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, 4.6s IncrementalHoareTripleChecker+Time [2022-07-12 17:11:00,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2612 Valid, 5970 Invalid, 7662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2952 Valid, 4710 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-07-12 17:11:00,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7325 states. [2022-07-12 17:11:01,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7325 to 7232. [2022-07-12 17:11:01,144 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-12 17:11:01,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7232 states to 7232 states and 9109 transitions. [2022-07-12 17:11:01,158 INFO L78 Accepts]: Start accepts. Automaton has 7232 states and 9109 transitions. Word has length 311 [2022-07-12 17:11:01,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:11:01,158 INFO L495 AbstractCegarLoop]: Abstraction has 7232 states and 9109 transitions. [2022-07-12 17:11:01,159 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-12 17:11:01,159 INFO L276 IsEmpty]: Start isEmpty. Operand 7232 states and 9109 transitions. [2022-07-12 17:11:01,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2022-07-12 17:11:01,162 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:11:01,162 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-12 17:11:01,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-07-12 17:11:01,162 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-12 17:11:01,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:11:01,163 INFO L85 PathProgramCache]: Analyzing trace with hash -765994228, now seen corresponding path program 1 times [2022-07-12 17:11:01,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:11:01,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156164623] [2022-07-12 17:11:01,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:11:01,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:11:01,216 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 17:11:01,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [294960406] [2022-07-12 17:11:01,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:11:01,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:11:01,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 17:11:01,218 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-12 17:11:01,219 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-12 17:11:02,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:02,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 2996 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 17:11:02,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:11:02,094 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-12 17:11:02,095 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:11:02,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:11:02,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156164623] [2022-07-12 17:11:02,095 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 17:11:02,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294960406] [2022-07-12 17:11:02,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294960406] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:11:02,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:11:02,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:11:02,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167247048] [2022-07-12 17:11:02,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:11:02,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:11:02,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:11:02,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:11:02,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:11:02,097 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-12 17:11:03,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:11:03,246 INFO L93 Difference]: Finished difference Result 17089 states and 22315 transitions. [2022-07-12 17:11:03,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:11:03,246 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-12 17:11:03,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:11:03,265 INFO L225 Difference]: With dead ends: 17089 [2022-07-12 17:11:03,265 INFO L226 Difference]: Without dead ends: 9902 [2022-07-12 17:11:03,277 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-12 17:11:03,278 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-12 17:11:03,278 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-12 17:11:03,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9902 states. [2022-07-12 17:11:03,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9902 to 7200. [2022-07-12 17:11:03,808 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-12 17:11:03,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7200 states to 7200 states and 9065 transitions. [2022-07-12 17:11:03,823 INFO L78 Accepts]: Start accepts. Automaton has 7200 states and 9065 transitions. Word has length 322 [2022-07-12 17:11:03,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:11:03,823 INFO L495 AbstractCegarLoop]: Abstraction has 7200 states and 9065 transitions. [2022-07-12 17:11:03,823 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-12 17:11:03,823 INFO L276 IsEmpty]: Start isEmpty. Operand 7200 states and 9065 transitions. [2022-07-12 17:11:03,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2022-07-12 17:11:03,826 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:11:03,826 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-12 17:11:03,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 17:11:04,043 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-12 17:11:04,043 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-12 17:11:04,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:11:04,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1409689970, now seen corresponding path program 1 times [2022-07-12 17:11:04,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:11:04,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160152531] [2022-07-12 17:11:04,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:11:04,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:11:04,106 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 17:11:04,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [852587656] [2022-07-12 17:11:04,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:11:04,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:11:04,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 17:11:04,108 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-12 17:11:04,109 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-12 17:11:05,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:05,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 2994 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-12 17:11:05,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:11:05,320 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-12 17:11:05,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 17:11:05,668 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-12 17:11:05,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:11:05,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160152531] [2022-07-12 17:11:05,669 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 17:11:05,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852587656] [2022-07-12 17:11:05,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852587656] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 17:11:05,669 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 17:11:05,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2022-07-12 17:11:05,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693336150] [2022-07-12 17:11:05,669 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 17:11:05,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 17:11:05,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:11:05,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 17:11:05,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-07-12 17:11:05,670 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-12 17:11:06,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:11:06,844 INFO L93 Difference]: Finished difference Result 17065 states and 22289 transitions. [2022-07-12 17:11:06,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 17:11:06,845 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-12 17:11:06,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:11:06,867 INFO L225 Difference]: With dead ends: 17065 [2022-07-12 17:11:06,867 INFO L226 Difference]: Without dead ends: 9907 [2022-07-12 17:11:06,881 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-12 17:11:06,882 INFO L413 NwaCegarLoop]: 2325 mSDtfsCounter, 464 mSDsluCounter, 24027 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 26352 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 17:11:06,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 26352 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 17:11:06,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9907 states. [2022-07-12 17:11:07,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9907 to 7200. [2022-07-12 17:11:07,520 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-12 17:11:07,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7200 states to 7200 states and 9064 transitions. [2022-07-12 17:11:07,536 INFO L78 Accepts]: Start accepts. Automaton has 7200 states and 9064 transitions. Word has length 322 [2022-07-12 17:11:07,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:11:07,536 INFO L495 AbstractCegarLoop]: Abstraction has 7200 states and 9064 transitions. [2022-07-12 17:11:07,536 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-12 17:11:07,536 INFO L276 IsEmpty]: Start isEmpty. Operand 7200 states and 9064 transitions. [2022-07-12 17:11:07,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2022-07-12 17:11:07,540 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:11:07,540 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-12 17:11:07,567 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-12 17:11:07,755 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-12 17:11:07,755 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-12 17:11:07,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:11:07,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1225714191, now seen corresponding path program 1 times [2022-07-12 17:11:07,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:11:07,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617821862] [2022-07-12 17:11:07,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:11:07,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:11:07,812 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 17:11:07,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2135919566] [2022-07-12 17:11:07,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:11:07,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:11:07,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 17:11:07,814 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-12 17:11:07,815 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-12 17:11:09,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:09,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 3012 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-12 17:11:09,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:11:09,252 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-12 17:11:09,252 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 17:11:09,597 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-12 17:11:09,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:11:09,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617821862] [2022-07-12 17:11:09,597 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 17:11:09,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135919566] [2022-07-12 17:11:09,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2135919566] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 17:11:09,599 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 17:11:09,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2022-07-12 17:11:09,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059701433] [2022-07-12 17:11:09,599 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 17:11:09,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 17:11:09,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:11:09,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 17:11:09,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-07-12 17:11:09,600 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-12 17:11:10,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:11:10,988 INFO L93 Difference]: Finished difference Result 17060 states and 22280 transitions. [2022-07-12 17:11:10,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 17:11:10,989 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-12 17:11:10,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:11:11,008 INFO L225 Difference]: With dead ends: 17060 [2022-07-12 17:11:11,009 INFO L226 Difference]: Without dead ends: 9907 [2022-07-12 17:11:11,021 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-12 17:11:11,021 INFO L413 NwaCegarLoop]: 2324 mSDtfsCounter, 917 mSDsluCounter, 17804 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-07-12 17:11:11,021 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.5s Time] [2022-07-12 17:11:11,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9907 states. [2022-07-12 17:11:11,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9907 to 7200. [2022-07-12 17:11:11,585 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-12 17:11:11,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7200 states to 7200 states and 9063 transitions. [2022-07-12 17:11:11,600 INFO L78 Accepts]: Start accepts. Automaton has 7200 states and 9063 transitions. Word has length 326 [2022-07-12 17:11:11,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:11:11,600 INFO L495 AbstractCegarLoop]: Abstraction has 7200 states and 9063 transitions. [2022-07-12 17:11:11,600 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-12 17:11:11,600 INFO L276 IsEmpty]: Start isEmpty. Operand 7200 states and 9063 transitions. [2022-07-12 17:11:11,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2022-07-12 17:11:11,603 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:11:11,603 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-12 17:11:11,635 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-12 17:11:11,819 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-12 17:11:11,819 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-12 17:11:11,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:11:11,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1356949358, now seen corresponding path program 1 times [2022-07-12 17:11:11,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:11:11,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944081764] [2022-07-12 17:11:11,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:11:11,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:11:11,874 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 17:11:11,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1043339486] [2022-07-12 17:11:11,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:11:11,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:11:11,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 17:11:11,875 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-12 17:11:11,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process