./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--net--usb--kaweth.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ae007674 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--net--usb--kaweth.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 f0d35ad3183ac446cae7457c51fa9452f8942f4b349e6e40633392db1dd8aa97 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-28 05:22:40,986 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-28 05:22:40,988 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-28 05:22:41,017 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-28 05:22:41,018 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-28 05:22:41,019 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-28 05:22:41,021 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-28 05:22:41,023 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-28 05:22:41,025 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-28 05:22:41,025 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-28 05:22:41,026 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-28 05:22:41,027 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-28 05:22:41,027 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-28 05:22:41,028 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-28 05:22:41,029 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-28 05:22:41,030 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-28 05:22:41,030 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-28 05:22:41,031 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-28 05:22:41,032 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-28 05:22:41,033 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-28 05:22:41,034 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-28 05:22:41,035 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-28 05:22:41,036 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-28 05:22:41,037 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-28 05:22:41,039 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-28 05:22:41,039 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-28 05:22:41,039 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-28 05:22:41,040 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-28 05:22:41,040 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-28 05:22:41,041 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-28 05:22:41,041 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-28 05:22:41,042 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-28 05:22:41,043 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-28 05:22:41,049 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-28 05:22:41,050 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-28 05:22:41,050 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-28 05:22:41,051 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-28 05:22:41,051 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-28 05:22:41,051 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-28 05:22:41,051 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-28 05:22:41,053 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-28 05:22:41,054 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-12-28 05:22:41,075 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-28 05:22:41,075 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-28 05:22:41,076 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-28 05:22:41,076 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-28 05:22:41,077 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-28 05:22:41,077 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-28 05:22:41,077 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-28 05:22:41,077 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-28 05:22:41,077 INFO L138 SettingsManager]: * Use SBE=true [2021-12-28 05:22:41,078 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-28 05:22:41,078 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-28 05:22:41,078 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-28 05:22:41,078 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-28 05:22:41,078 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-28 05:22:41,078 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-28 05:22:41,079 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-28 05:22:41,079 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-28 05:22:41,079 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-28 05:22:41,079 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-28 05:22:41,079 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-28 05:22:41,079 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-28 05:22:41,080 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 05:22:41,080 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-28 05:22:41,080 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-28 05:22:41,080 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-28 05:22:41,080 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-28 05:22:41,080 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-28 05:22:41,081 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-28 05:22:41,081 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-28 05:22:41,081 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-28 05:22:41,081 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 -> f0d35ad3183ac446cae7457c51fa9452f8942f4b349e6e40633392db1dd8aa97 [2021-12-28 05:22:41,356 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-28 05:22:41,377 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-28 05:22:41,379 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-28 05:22:41,380 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-28 05:22:41,381 INFO L275 PluginConnector]: CDTParser initialized [2021-12-28 05:22:41,383 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--net--usb--kaweth.ko.cil.i [2021-12-28 05:22:41,434 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/438d3abe6/8b98edee5b1643549819710ddd5cf95a/FLAGfd083969c [2021-12-28 05:22:42,114 INFO L306 CDTParser]: Found 1 translation units. [2021-12-28 05:22:42,115 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i [2021-12-28 05:22:42,166 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/438d3abe6/8b98edee5b1643549819710ddd5cf95a/FLAGfd083969c [2021-12-28 05:22:42,214 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/438d3abe6/8b98edee5b1643549819710ddd5cf95a [2021-12-28 05:22:42,216 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-28 05:22:42,217 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-28 05:22:42,219 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-28 05:22:42,220 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-28 05:22:42,222 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-28 05:22:42,222 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 05:22:42" (1/1) ... [2021-12-28 05:22:42,223 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78568b6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:22:42, skipping insertion in model container [2021-12-28 05:22:42,223 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 05:22:42" (1/1) ... [2021-12-28 05:22:42,228 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-28 05:22:42,416 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 05:22:44,754 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[385539,385552] [2021-12-28 05:22:44,756 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[385684,385697] [2021-12-28 05:22:44,757 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[385830,385843] [2021-12-28 05:22:44,757 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[385995,386008] [2021-12-28 05:22:44,757 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[386153,386166] [2021-12-28 05:22:44,758 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[386311,386324] [2021-12-28 05:22:44,759 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[386469,386482] [2021-12-28 05:22:44,759 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[386629,386642] [2021-12-28 05:22:44,759 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[386788,386801] [2021-12-28 05:22:44,759 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[386927,386940] [2021-12-28 05:22:44,760 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[387069,387082] [2021-12-28 05:22:44,760 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[387218,387231] [2021-12-28 05:22:44,761 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[387357,387370] [2021-12-28 05:22:44,761 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[387512,387525] [2021-12-28 05:22:44,762 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[387672,387685] [2021-12-28 05:22:44,762 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[387823,387836] [2021-12-28 05:22:44,762 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[387974,387987] [2021-12-28 05:22:44,763 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[388126,388139] [2021-12-28 05:22:44,764 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[388275,388288] [2021-12-28 05:22:44,764 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[388423,388436] [2021-12-28 05:22:44,764 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[388580,388593] [2021-12-28 05:22:44,765 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[388729,388742] [2021-12-28 05:22:44,765 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[388885,388898] [2021-12-28 05:22:44,765 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389038,389051] [2021-12-28 05:22:44,767 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389184,389197] [2021-12-28 05:22:44,767 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389327,389340] [2021-12-28 05:22:44,767 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389479,389492] [2021-12-28 05:22:44,768 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389625,389638] [2021-12-28 05:22:44,768 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389770,389783] [2021-12-28 05:22:44,769 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389924,389937] [2021-12-28 05:22:44,770 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[390075,390088] [2021-12-28 05:22:44,770 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[390230,390243] [2021-12-28 05:22:44,771 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[390382,390395] [2021-12-28 05:22:44,771 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[390537,390550] [2021-12-28 05:22:44,771 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[390701,390714] [2021-12-28 05:22:44,772 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[390857,390870] [2021-12-28 05:22:44,772 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[391021,391034] [2021-12-28 05:22:44,775 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[391163,391176] [2021-12-28 05:22:44,775 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[391321,391334] [2021-12-28 05:22:44,775 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[391488,391501] [2021-12-28 05:22:44,776 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[391647,391660] [2021-12-28 05:22:44,776 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[391806,391819] [2021-12-28 05:22:44,776 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[391955,391968] [2021-12-28 05:22:44,777 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[392102,392115] [2021-12-28 05:22:44,777 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[392241,392254] [2021-12-28 05:22:44,777 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[392404,392417] [2021-12-28 05:22:44,778 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[392570,392583] [2021-12-28 05:22:44,779 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[392734,392747] [2021-12-28 05:22:44,779 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[392899,392912] [2021-12-28 05:22:44,779 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[393064,393077] [2021-12-28 05:22:44,780 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[393230,393243] [2021-12-28 05:22:44,780 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[393395,393408] [2021-12-28 05:22:44,780 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[393562,393575] [2021-12-28 05:22:44,781 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[393722,393735] [2021-12-28 05:22:44,782 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[393884,393897] [2021-12-28 05:22:44,782 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[394043,394056] [2021-12-28 05:22:44,782 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[394189,394202] [2021-12-28 05:22:44,783 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[394332,394345] [2021-12-28 05:22:44,783 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[394476,394489] [2021-12-28 05:22:44,783 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[394619,394632] [2021-12-28 05:22:44,784 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[394763,394776] [2021-12-28 05:22:44,784 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[394904,394917] [2021-12-28 05:22:44,784 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[395042,395055] [2021-12-28 05:22:44,785 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[395200,395213] [2021-12-28 05:22:44,785 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[395359,395372] [2021-12-28 05:22:44,785 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[395515,395528] [2021-12-28 05:22:44,786 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[395664,395677] [2021-12-28 05:22:44,786 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[395816,395829] [2021-12-28 05:22:44,786 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[395967,395980] [2021-12-28 05:22:44,787 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[396116,396129] [2021-12-28 05:22:44,787 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[396268,396281] [2021-12-28 05:22:44,787 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[396416,396429] [2021-12-28 05:22:44,787 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[396569,396582] [2021-12-28 05:22:44,788 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[396720,396733] [2021-12-28 05:22:44,788 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[396870,396883] [2021-12-28 05:22:44,788 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[397017,397030] [2021-12-28 05:22:44,789 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[397168,397181] [2021-12-28 05:22:44,789 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[397319,397332] [2021-12-28 05:22:44,789 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[397467,397480] [2021-12-28 05:22:44,790 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[397633,397646] [2021-12-28 05:22:44,790 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[397802,397815] [2021-12-28 05:22:44,791 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[397969,397982] [2021-12-28 05:22:44,791 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[398137,398150] [2021-12-28 05:22:44,791 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[398287,398300] [2021-12-28 05:22:44,791 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[398434,398447] [2021-12-28 05:22:44,792 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[398595,398608] [2021-12-28 05:22:44,792 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[398765,398778] [2021-12-28 05:22:44,792 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[398927,398940] [2021-12-28 05:22:44,806 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 05:22:44,850 INFO L203 MainTranslator]: Completed pre-run [2021-12-28 05:22:45,108 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[385539,385552] [2021-12-28 05:22:45,109 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[385684,385697] [2021-12-28 05:22:45,112 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[385830,385843] [2021-12-28 05:22:45,112 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[385995,386008] [2021-12-28 05:22:45,113 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[386153,386166] [2021-12-28 05:22:45,113 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[386311,386324] [2021-12-28 05:22:45,114 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[386469,386482] [2021-12-28 05:22:45,114 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[386629,386642] [2021-12-28 05:22:45,115 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[386788,386801] [2021-12-28 05:22:45,115 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[386927,386940] [2021-12-28 05:22:45,116 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[387069,387082] [2021-12-28 05:22:45,116 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[387218,387231] [2021-12-28 05:22:45,116 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[387357,387370] [2021-12-28 05:22:45,116 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[387512,387525] [2021-12-28 05:22:45,117 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[387672,387685] [2021-12-28 05:22:45,117 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[387823,387836] [2021-12-28 05:22:45,117 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[387974,387987] [2021-12-28 05:22:45,117 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[388126,388139] [2021-12-28 05:22:45,118 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[388275,388288] [2021-12-28 05:22:45,118 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[388423,388436] [2021-12-28 05:22:45,118 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[388580,388593] [2021-12-28 05:22:45,119 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[388729,388742] [2021-12-28 05:22:45,119 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[388885,388898] [2021-12-28 05:22:45,119 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389038,389051] [2021-12-28 05:22:45,120 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389184,389197] [2021-12-28 05:22:45,120 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389327,389340] [2021-12-28 05:22:45,120 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389479,389492] [2021-12-28 05:22:45,121 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389625,389638] [2021-12-28 05:22:45,121 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389770,389783] [2021-12-28 05:22:45,121 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389924,389937] [2021-12-28 05:22:45,122 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[390075,390088] [2021-12-28 05:22:45,122 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[390230,390243] [2021-12-28 05:22:45,122 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[390382,390395] [2021-12-28 05:22:45,122 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[390537,390550] [2021-12-28 05:22:45,123 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[390701,390714] [2021-12-28 05:22:45,123 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[390857,390870] [2021-12-28 05:22:45,124 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[391021,391034] [2021-12-28 05:22:45,124 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[391163,391176] [2021-12-28 05:22:45,124 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[391321,391334] [2021-12-28 05:22:45,125 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[391488,391501] [2021-12-28 05:22:45,126 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[391647,391660] [2021-12-28 05:22:45,126 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[391806,391819] [2021-12-28 05:22:45,126 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[391955,391968] [2021-12-28 05:22:45,126 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[392102,392115] [2021-12-28 05:22:45,127 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[392241,392254] [2021-12-28 05:22:45,127 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[392404,392417] [2021-12-28 05:22:45,127 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[392570,392583] [2021-12-28 05:22:45,128 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[392734,392747] [2021-12-28 05:22:45,128 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[392899,392912] [2021-12-28 05:22:45,128 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[393064,393077] [2021-12-28 05:22:45,129 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[393230,393243] [2021-12-28 05:22:45,129 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[393395,393408] [2021-12-28 05:22:45,129 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[393562,393575] [2021-12-28 05:22:45,129 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[393722,393735] [2021-12-28 05:22:45,129 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[393884,393897] [2021-12-28 05:22:45,131 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[394043,394056] [2021-12-28 05:22:45,131 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[394189,394202] [2021-12-28 05:22:45,131 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[394332,394345] [2021-12-28 05:22:45,131 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[394476,394489] [2021-12-28 05:22:45,132 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[394619,394632] [2021-12-28 05:22:45,132 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[394763,394776] [2021-12-28 05:22:45,132 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[394904,394917] [2021-12-28 05:22:45,134 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[395042,395055] [2021-12-28 05:22:45,134 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[395200,395213] [2021-12-28 05:22:45,136 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[395359,395372] [2021-12-28 05:22:45,139 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[395515,395528] [2021-12-28 05:22:45,140 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[395664,395677] [2021-12-28 05:22:45,140 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[395816,395829] [2021-12-28 05:22:45,141 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[395967,395980] [2021-12-28 05:22:45,141 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[396116,396129] [2021-12-28 05:22:45,142 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[396268,396281] [2021-12-28 05:22:45,142 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[396416,396429] [2021-12-28 05:22:45,143 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[396569,396582] [2021-12-28 05:22:45,147 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[396720,396733] [2021-12-28 05:22:45,148 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[396870,396883] [2021-12-28 05:22:45,148 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[397017,397030] [2021-12-28 05:22:45,148 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[397168,397181] [2021-12-28 05:22:45,149 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[397319,397332] [2021-12-28 05:22:45,150 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[397467,397480] [2021-12-28 05:22:45,150 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[397633,397646] [2021-12-28 05:22:45,150 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[397802,397815] [2021-12-28 05:22:45,151 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[397969,397982] [2021-12-28 05:22:45,151 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[398137,398150] [2021-12-28 05:22:45,152 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[398287,398300] [2021-12-28 05:22:45,152 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[398434,398447] [2021-12-28 05:22:45,152 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[398595,398608] [2021-12-28 05:22:45,152 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[398765,398778] [2021-12-28 05:22:45,153 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[398927,398940] [2021-12-28 05:22:45,157 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 05:22:45,348 INFO L208 MainTranslator]: Completed translation [2021-12-28 05:22:45,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:22:45 WrapperNode [2021-12-28 05:22:45,349 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-28 05:22:45,350 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-28 05:22:45,350 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-28 05:22:45,350 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-28 05:22:45,356 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:22:45" (1/1) ... [2021-12-28 05:22:45,469 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:22:45" (1/1) ... [2021-12-28 05:22:45,630 INFO L137 Inliner]: procedures = 616, calls = 2803, calls flagged for inlining = 287, calls inlined = 187, statements flattened = 4770 [2021-12-28 05:22:45,631 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-28 05:22:45,632 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-28 05:22:45,632 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-28 05:22:45,632 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-28 05:22:45,638 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:22:45" (1/1) ... [2021-12-28 05:22:45,638 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:22:45" (1/1) ... [2021-12-28 05:22:45,674 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:22:45" (1/1) ... [2021-12-28 05:22:45,675 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:22:45" (1/1) ... [2021-12-28 05:22:45,792 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:22:45" (1/1) ... [2021-12-28 05:22:45,804 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:22:45" (1/1) ... [2021-12-28 05:22:45,820 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:22:45" (1/1) ... [2021-12-28 05:22:45,839 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-28 05:22:45,841 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-28 05:22:45,841 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-28 05:22:45,841 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-28 05:22:45,841 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:22:45" (1/1) ... [2021-12-28 05:22:45,846 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 05:22:45,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:22:45,866 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) [2021-12-28 05:22:45,871 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 [2021-12-28 05:22:45,901 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2021-12-28 05:22:45,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2021-12-28 05:22:45,902 INFO L130 BoogieDeclarations]: Found specification of procedure netif_wake_queue [2021-12-28 05:22:45,902 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_wake_queue [2021-12-28 05:22:45,902 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-12-28 05:22:45,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-12-28 05:22:45,902 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_device_lock_of_kaweth_device [2021-12-28 05:22:45,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_device_lock_of_kaweth_device [2021-12-28 05:22:45,902 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2021-12-28 05:22:45,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2021-12-28 05:22:45,903 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_usb_alloc_coherent [2021-12-28 05:22:45,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_usb_alloc_coherent [2021-12-28 05:22:45,903 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2021-12-28 05:22:45,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2021-12-28 05:22:45,903 INFO L130 BoogieDeclarations]: Found specification of procedure kaweth_open [2021-12-28 05:22:45,903 INFO L138 BoogieDeclarations]: Found implementation of procedure kaweth_open [2021-12-28 05:22:45,903 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2021-12-28 05:22:45,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2021-12-28 05:22:45,903 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2021-12-28 05:22:45,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2021-12-28 05:22:45,904 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-12-28 05:22:45,904 INFO L130 BoogieDeclarations]: Found specification of procedure kaweth_resume [2021-12-28 05:22:45,904 INFO L138 BoogieDeclarations]: Found implementation of procedure kaweth_resume [2021-12-28 05:22:45,904 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2021-12-28 05:22:45,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2021-12-28 05:22:45,904 INFO L130 BoogieDeclarations]: Found specification of procedure eth_validate_addr [2021-12-28 05:22:45,904 INFO L138 BoogieDeclarations]: Found implementation of procedure eth_validate_addr [2021-12-28 05:22:45,904 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2021-12-28 05:22:45,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2021-12-28 05:22:45,905 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2021-12-28 05:22:45,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2021-12-28 05:22:45,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-28 05:22:45,905 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2021-12-28 05:22:45,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2021-12-28 05:22:45,905 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2021-12-28 05:22:45,905 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2021-12-28 05:22:45,905 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-12-28 05:22:45,905 INFO L130 BoogieDeclarations]: Found specification of procedure kaweth_resubmit_rx_urb [2021-12-28 05:22:45,905 INFO L138 BoogieDeclarations]: Found implementation of procedure kaweth_resubmit_rx_urb [2021-12-28 05:22:45,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-12-28 05:22:45,906 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2021-12-28 05:22:45,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2021-12-28 05:22:45,906 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2021-12-28 05:22:45,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2021-12-28 05:22:45,906 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2021-12-28 05:22:45,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2021-12-28 05:22:45,906 INFO L130 BoogieDeclarations]: Found specification of procedure usb_autopm_put_interface [2021-12-28 05:22:45,906 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_autopm_put_interface [2021-12-28 05:22:45,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-28 05:22:45,907 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2021-12-28 05:22:45,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2021-12-28 05:22:45,907 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2021-12-28 05:22:45,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2021-12-28 05:22:45,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2021-12-28 05:22:45,907 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2021-12-28 05:22:45,907 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2021-12-28 05:22:45,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2021-12-28 05:22:45,907 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2021-12-28 05:22:45,908 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2021-12-28 05:22:45,908 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2021-12-28 05:22:45,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2021-12-28 05:22:45,908 INFO L130 BoogieDeclarations]: Found specification of procedure kaweth_close [2021-12-28 05:22:45,908 INFO L138 BoogieDeclarations]: Found implementation of procedure kaweth_close [2021-12-28 05:22:45,908 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2021-12-28 05:22:45,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2021-12-28 05:22:45,909 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irq_129 [2021-12-28 05:22:45,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irq_129 [2021-12-28 05:22:45,909 INFO L130 BoogieDeclarations]: Found specification of procedure kaweth_download_firmware [2021-12-28 05:22:45,909 INFO L138 BoogieDeclarations]: Found implementation of procedure kaweth_download_firmware [2021-12-28 05:22:45,909 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2021-12-28 05:22:45,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2021-12-28 05:22:45,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-28 05:22:45,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-28 05:22:45,912 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2021-12-28 05:22:45,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2021-12-28 05:22:45,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-28 05:22:45,912 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2021-12-28 05:22:45,913 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2021-12-28 05:22:45,913 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2021-12-28 05:22:45,913 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_irq_check_alloc_flags [2021-12-28 05:22:45,913 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_irq_check_alloc_flags [2021-12-28 05:22:45,913 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2021-12-28 05:22:45,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2021-12-28 05:22:45,914 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_netdev [2021-12-28 05:22:45,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_netdev [2021-12-28 05:22:45,914 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_delayed_work [2021-12-28 05:22:45,914 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_delayed_work [2021-12-28 05:22:45,914 INFO L130 BoogieDeclarations]: Found specification of procedure __init_waitqueue_head [2021-12-28 05:22:45,914 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_waitqueue_head [2021-12-28 05:22:45,914 INFO L130 BoogieDeclarations]: Found specification of procedure kaweth_tx_timeout [2021-12-28 05:22:45,915 INFO L138 BoogieDeclarations]: Found implementation of procedure kaweth_tx_timeout [2021-12-28 05:22:45,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-28 05:22:45,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-28 05:22:45,915 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_intfdata [2021-12-28 05:22:45,915 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_intfdata [2021-12-28 05:22:45,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-12-28 05:22:45,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-12-28 05:22:45,915 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2021-12-28 05:22:45,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2021-12-28 05:22:45,916 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2021-12-28 05:22:45,916 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2021-12-28 05:22:45,916 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_133 [2021-12-28 05:22:45,916 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_133 [2021-12-28 05:22:45,916 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_bulk_urb [2021-12-28 05:22:45,916 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_bulk_urb [2021-12-28 05:22:45,916 INFO L130 BoogieDeclarations]: Found specification of procedure kaweth_async_set_rx_mode [2021-12-28 05:22:45,916 INFO L138 BoogieDeclarations]: Found implementation of procedure kaweth_async_set_rx_mode [2021-12-28 05:22:45,916 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_device_lock_of_kaweth_device [2021-12-28 05:22:45,916 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_device_lock_of_kaweth_device [2021-12-28 05:22:45,917 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2021-12-28 05:22:45,917 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2021-12-28 05:22:45,917 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2021-12-28 05:22:45,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2021-12-28 05:22:45,917 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_free_urb [2021-12-28 05:22:45,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_free_urb [2021-12-28 05:22:45,917 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2021-12-28 05:22:45,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2021-12-28 05:22:45,917 INFO L130 BoogieDeclarations]: Found specification of procedure netif_start_queue [2021-12-28 05:22:45,917 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_start_queue [2021-12-28 05:22:45,918 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-28 05:22:45,918 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2021-12-28 05:22:45,918 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2021-12-28 05:22:45,918 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2021-12-28 05:22:45,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2021-12-28 05:22:45,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-28 05:22:45,919 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_usb_free_coherent [2021-12-28 05:22:45,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_usb_free_coherent [2021-12-28 05:22:45,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-28 05:22:45,919 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2021-12-28 05:22:45,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2021-12-28 05:22:45,919 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2021-12-28 05:22:45,919 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2021-12-28 05:22:45,919 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2021-12-28 05:22:45,919 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2021-12-28 05:22:45,919 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2021-12-28 05:22:45,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2021-12-28 05:22:45,920 INFO L130 BoogieDeclarations]: Found specification of procedure release_firmware [2021-12-28 05:22:45,920 INFO L138 BoogieDeclarations]: Found implementation of procedure release_firmware [2021-12-28 05:22:45,920 INFO L130 BoogieDeclarations]: Found specification of procedure dev_kfree_skb_irq [2021-12-28 05:22:45,920 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_kfree_skb_irq [2021-12-28 05:22:45,920 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2021-12-28 05:22:45,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2021-12-28 05:22:45,920 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_alloc_urb [2021-12-28 05:22:45,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_alloc_urb [2021-12-28 05:22:45,920 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2021-12-28 05:22:45,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2021-12-28 05:22:45,921 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2021-12-28 05:22:45,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2021-12-28 05:22:45,921 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2021-12-28 05:22:45,921 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2021-12-28 05:22:45,921 INFO L130 BoogieDeclarations]: Found specification of procedure kaweth_set_rx_mode [2021-12-28 05:22:45,921 INFO L138 BoogieDeclarations]: Found implementation of procedure kaweth_set_rx_mode [2021-12-28 05:22:45,921 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2021-12-28 05:22:45,921 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2021-12-28 05:22:45,921 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2021-12-28 05:22:45,921 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2021-12-28 05:22:45,922 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2021-12-28 05:22:45,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2021-12-28 05:22:45,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-28 05:22:45,922 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2021-12-28 05:22:45,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2021-12-28 05:22:45,922 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2021-12-28 05:22:45,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2021-12-28 05:22:45,922 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2021-12-28 05:22:45,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2021-12-28 05:22:45,922 INFO L130 BoogieDeclarations]: Found specification of procedure kaweth_resubmit_int_urb [2021-12-28 05:22:45,922 INFO L138 BoogieDeclarations]: Found implementation of procedure kaweth_resubmit_int_urb [2021-12-28 05:22:45,923 INFO L130 BoogieDeclarations]: Found specification of procedure kaweth_control [2021-12-28 05:22:45,923 INFO L138 BoogieDeclarations]: Found implementation of procedure kaweth_control [2021-12-28 05:22:45,923 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2021-12-28 05:22:45,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2021-12-28 05:22:45,923 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2021-12-28 05:22:45,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2021-12-28 05:22:45,923 INFO L130 BoogieDeclarations]: Found specification of procedure delayed_work_timer_fn [2021-12-28 05:22:45,923 INFO L130 BoogieDeclarations]: Found specification of procedure kaweth_kill_urbs [2021-12-28 05:22:45,923 INFO L138 BoogieDeclarations]: Found implementation of procedure kaweth_kill_urbs [2021-12-28 05:22:45,923 INFO L130 BoogieDeclarations]: Found specification of procedure kaweth_disconnect [2021-12-28 05:22:45,924 INFO L138 BoogieDeclarations]: Found implementation of procedure kaweth_disconnect [2021-12-28 05:22:45,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-28 05:22:45,924 INFO L130 BoogieDeclarations]: Found specification of procedure preempt_count [2021-12-28 05:22:45,924 INFO L138 BoogieDeclarations]: Found implementation of procedure preempt_count [2021-12-28 05:22:46,424 INFO L234 CfgBuilder]: Building ICFG [2021-12-28 05:22:46,426 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-28 05:22:46,533 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2021-12-28 05:22:51,247 INFO L275 CfgBuilder]: Performing block encoding [2021-12-28 05:22:51,258 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-28 05:22:51,258 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-28 05:22:51,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 05:22:51 BoogieIcfgContainer [2021-12-28 05:22:51,261 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-28 05:22:51,262 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-28 05:22:51,262 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-28 05:22:51,264 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-28 05:22:51,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 05:22:42" (1/3) ... [2021-12-28 05:22:51,265 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@794537cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 05:22:51, skipping insertion in model container [2021-12-28 05:22:51,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:22:45" (2/3) ... [2021-12-28 05:22:51,265 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@794537cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 05:22:51, skipping insertion in model container [2021-12-28 05:22:51,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 05:22:51" (3/3) ... [2021-12-28 05:22:51,266 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i [2021-12-28 05:22:51,270 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-28 05:22:51,270 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 29 error locations. [2021-12-28 05:22:51,304 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-28 05:22:51,308 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-28 05:22:51,308 INFO L340 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2021-12-28 05:22:51,333 INFO L276 IsEmpty]: Start isEmpty. Operand has 1202 states, 791 states have (on average 1.2414664981036663) internal successors, (982), 831 states have internal predecessors, (982), 301 states have call successors, (301), 81 states have call predecessors, (301), 80 states have return successors, (297), 296 states have call predecessors, (297), 297 states have call successors, (297) [2021-12-28 05:22:51,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-12-28 05:22:51,339 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:22:51,340 INFO L514 BasicCegarLoop]: 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] [2021-12-28 05:22:51,340 INFO L402 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 27 more)] === [2021-12-28 05:22:51,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:22:51,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1445783568, now seen corresponding path program 1 times [2021-12-28 05:22:51,349 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:22:51,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263799682] [2021-12-28 05:22:51,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:22:51,350 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:22:51,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:22:51,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:22:52,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:22:52,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:22:52,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:22:52,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 05:22:52,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:22:52,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 05:22:52,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:22:52,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 05:22:52,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:22:52,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-28 05:22:52,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:22:52,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 05:22:52,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:22:52,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:22:52,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:22:52,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-28 05:22:52,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:22:52,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-28 05:22:52,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:22:52,145 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-28 05:22:52,146 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:22:52,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263799682] [2021-12-28 05:22:52,148 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263799682] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:22:52,148 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:22:52,148 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:22:52,149 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999780638] [2021-12-28 05:22:52,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:22:52,153 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:22:52,154 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:22:52,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:22:52,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:22:52,179 INFO L87 Difference]: Start difference. First operand has 1202 states, 791 states have (on average 1.2414664981036663) internal successors, (982), 831 states have internal predecessors, (982), 301 states have call successors, (301), 81 states have call predecessors, (301), 80 states have return successors, (297), 296 states have call predecessors, (297), 297 states have call successors, (297) 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) [2021-12-28 05:22:55,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:22:55,289 INFO L93 Difference]: Finished difference Result 2297 states and 3120 transitions. [2021-12-28 05:22:55,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:22:55,291 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 [2021-12-28 05:22:55,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:22:55,307 INFO L225 Difference]: With dead ends: 2297 [2021-12-28 05:22:55,307 INFO L226 Difference]: Without dead ends: 1183 [2021-12-28 05:22:55,331 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-28 05:22:55,333 INFO L933 BasicCegarLoop]: 1432 mSDtfsCounter, 2179 mSDsluCounter, 1414 mSDsCounter, 0 mSdLazyCounter, 1434 mSolverCounterSat, 1024 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2361 SdHoareTripleChecker+Valid, 2846 SdHoareTripleChecker+Invalid, 2458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1024 IncrementalHoareTripleChecker+Valid, 1434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2021-12-28 05:22:55,334 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2361 Valid, 2846 Invalid, 2458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1024 Valid, 1434 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2021-12-28 05:22:55,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2021-12-28 05:22:55,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1183. [2021-12-28 05:22:55,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 779 states have (on average 1.196405648267009) internal successors, (932), 815 states have internal predecessors, (932), 297 states have call successors, (297), 80 states have call predecessors, (297), 79 states have return successors, (295), 294 states have call predecessors, (295), 295 states have call successors, (295) [2021-12-28 05:22:55,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1524 transitions. [2021-12-28 05:22:55,424 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1524 transitions. Word has length 71 [2021-12-28 05:22:55,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:22:55,425 INFO L470 AbstractCegarLoop]: Abstraction has 1183 states and 1524 transitions. [2021-12-28 05:22:55,425 INFO L471 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) [2021-12-28 05:22:55,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1524 transitions. [2021-12-28 05:22:55,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-12-28 05:22:55,427 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:22:55,428 INFO L514 BasicCegarLoop]: 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] [2021-12-28 05:22:55,428 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-28 05:22:55,428 INFO L402 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 27 more)] === [2021-12-28 05:22:55,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:22:55,429 INFO L85 PathProgramCache]: Analyzing trace with hash -559581025, now seen corresponding path program 1 times [2021-12-28 05:22:55,429 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:22:55,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740368654] [2021-12-28 05:22:55,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:22:55,429 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:22:55,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:22:55,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:22:55,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:22:55,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:22:55,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:22:55,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 05:22:55,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:22:55,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 05:22:55,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:22:55,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 05:22:55,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:22:55,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-28 05:22:55,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:22:55,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 05:22:55,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:22:55,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:22:55,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:22:55,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-28 05:22:55,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:22:55,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-28 05:22:55,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:22:55,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-28 05:22:55,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:22:55,785 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-28 05:22:55,786 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:22:55,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740368654] [2021-12-28 05:22:55,786 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740368654] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:22:55,786 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:22:55,786 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:22:55,787 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573465017] [2021-12-28 05:22:55,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:22:55,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:22:55,788 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:22:55,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:22:55,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:22:55,788 INFO L87 Difference]: Start difference. First operand 1183 states and 1524 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) [2021-12-28 05:22:58,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:22:58,299 INFO L93 Difference]: Finished difference Result 1183 states and 1524 transitions. [2021-12-28 05:22:58,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:22:58,299 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 [2021-12-28 05:22:58,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:22:58,305 INFO L225 Difference]: With dead ends: 1183 [2021-12-28 05:22:58,306 INFO L226 Difference]: Without dead ends: 1181 [2021-12-28 05:22:58,307 INFO L932 BasicCegarLoop]: 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 [2021-12-28 05:22:58,307 INFO L933 BasicCegarLoop]: 1414 mSDtfsCounter, 2147 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 1420 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2326 SdHoareTripleChecker+Valid, 2812 SdHoareTripleChecker+Invalid, 2436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 1420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-12-28 05:22:58,308 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2326 Valid, 2812 Invalid, 2436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 1420 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2021-12-28 05:22:58,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2021-12-28 05:22:58,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 1181. [2021-12-28 05:22:58,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1181 states, 778 states have (on average 1.1953727506426735) internal successors, (930), 813 states have internal predecessors, (930), 297 states have call successors, (297), 80 states have call predecessors, (297), 79 states have return successors, (295), 294 states have call predecessors, (295), 295 states have call successors, (295) [2021-12-28 05:22:58,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 1181 states and 1522 transitions. [2021-12-28 05:22:58,382 INFO L78 Accepts]: Start accepts. Automaton has 1181 states and 1522 transitions. Word has length 77 [2021-12-28 05:22:58,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:22:58,384 INFO L470 AbstractCegarLoop]: Abstraction has 1181 states and 1522 transitions. [2021-12-28 05:22:58,384 INFO L471 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) [2021-12-28 05:22:58,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1181 states and 1522 transitions. [2021-12-28 05:22:58,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-12-28 05:22:58,389 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:22:58,390 INFO L514 BasicCegarLoop]: 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] [2021-12-28 05:22:58,390 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-28 05:22:58,390 INFO L402 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 27 more)] === [2021-12-28 05:22:58,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:22:58,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1865614216, now seen corresponding path program 1 times [2021-12-28 05:22:58,391 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:22:58,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791814128] [2021-12-28 05:22:58,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:22:58,391 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:22:58,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:22:58,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:22:58,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:22:58,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:22:58,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:22:58,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 05:22:58,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:22:58,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 05:22:58,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:22:58,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 05:22:58,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:22:58,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-28 05:22:58,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:22:58,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 05:22:58,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:22:58,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:22:58,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:22:58,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-28 05:22:58,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:22:58,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-28 05:22:58,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:22:58,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-28 05:22:58,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:22:58,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-28 05:22:58,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:22:58,796 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-28 05:22:58,796 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:22:58,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791814128] [2021-12-28 05:22:58,797 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791814128] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:22:58,797 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:22:58,797 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:22:58,797 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718475286] [2021-12-28 05:22:58,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:22:58,798 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:22:58,798 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:22:58,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:22:58,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:22:58,799 INFO L87 Difference]: Start difference. First operand 1181 states and 1522 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) [2021-12-28 05:23:01,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:23:01,122 INFO L93 Difference]: Finished difference Result 1181 states and 1522 transitions. [2021-12-28 05:23:01,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:23:01,123 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 [2021-12-28 05:23:01,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:23:01,130 INFO L225 Difference]: With dead ends: 1181 [2021-12-28 05:23:01,130 INFO L226 Difference]: Without dead ends: 1179 [2021-12-28 05:23:01,131 INFO L932 BasicCegarLoop]: 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 [2021-12-28 05:23:01,133 INFO L933 BasicCegarLoop]: 1412 mSDtfsCounter, 2141 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 1418 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2319 SdHoareTripleChecker+Valid, 2810 SdHoareTripleChecker+Invalid, 2434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 1418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:23:01,134 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2319 Valid, 2810 Invalid, 2434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 1418 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2021-12-28 05:23:01,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2021-12-28 05:23:01,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 1179. [2021-12-28 05:23:01,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1179 states, 777 states have (on average 1.1943371943371943) internal successors, (928), 811 states have internal predecessors, (928), 297 states have call successors, (297), 80 states have call predecessors, (297), 79 states have return successors, (295), 294 states have call predecessors, (295), 295 states have call successors, (295) [2021-12-28 05:23:01,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1179 states to 1179 states and 1520 transitions. [2021-12-28 05:23:01,171 INFO L78 Accepts]: Start accepts. Automaton has 1179 states and 1520 transitions. Word has length 83 [2021-12-28 05:23:01,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:23:01,171 INFO L470 AbstractCegarLoop]: Abstraction has 1179 states and 1520 transitions. [2021-12-28 05:23:01,171 INFO L471 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) [2021-12-28 05:23:01,171 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1520 transitions. [2021-12-28 05:23:01,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-12-28 05:23:01,172 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:23:01,173 INFO L514 BasicCegarLoop]: 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] [2021-12-28 05:23:01,173 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-28 05:23:01,173 INFO L402 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 27 more)] === [2021-12-28 05:23:01,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:23:01,173 INFO L85 PathProgramCache]: Analyzing trace with hash -2110063066, now seen corresponding path program 1 times [2021-12-28 05:23:01,174 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:23:01,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481923215] [2021-12-28 05:23:01,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:23:01,174 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:23:01,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:01,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:23:01,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:01,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:23:01,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:01,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 05:23:01,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:01,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 05:23:01,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:01,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 05:23:01,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:01,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-28 05:23:01,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:01,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 05:23:01,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:01,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:23:01,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:01,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-28 05:23:01,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:01,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-28 05:23:01,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:01,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-28 05:23:01,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:01,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-28 05:23:01,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:01,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-28 05:23:01,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:01,515 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-28 05:23:01,515 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:23:01,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481923215] [2021-12-28 05:23:01,515 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481923215] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:23:01,515 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:23:01,516 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:23:01,516 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039961299] [2021-12-28 05:23:01,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:23:01,517 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:23:01,517 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:23:01,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:23:01,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:23:01,518 INFO L87 Difference]: Start difference. First operand 1179 states and 1520 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) [2021-12-28 05:23:03,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:23:03,955 INFO L93 Difference]: Finished difference Result 1179 states and 1520 transitions. [2021-12-28 05:23:03,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:23:03,955 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 [2021-12-28 05:23:03,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:23:03,960 INFO L225 Difference]: With dead ends: 1179 [2021-12-28 05:23:03,960 INFO L226 Difference]: Without dead ends: 1177 [2021-12-28 05:23:03,961 INFO L932 BasicCegarLoop]: 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 [2021-12-28 05:23:03,961 INFO L933 BasicCegarLoop]: 1410 mSDtfsCounter, 2135 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 1416 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2312 SdHoareTripleChecker+Valid, 2808 SdHoareTripleChecker+Invalid, 2432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 1416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-12-28 05:23:03,961 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2312 Valid, 2808 Invalid, 2432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 1416 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2021-12-28 05:23:03,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2021-12-28 05:23:03,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 1177. [2021-12-28 05:23:03,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1177 states, 776 states have (on average 1.193298969072165) internal successors, (926), 809 states have internal predecessors, (926), 297 states have call successors, (297), 80 states have call predecessors, (297), 79 states have return successors, (295), 294 states have call predecessors, (295), 295 states have call successors, (295) [2021-12-28 05:23:03,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1518 transitions. [2021-12-28 05:23:04,000 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1518 transitions. Word has length 89 [2021-12-28 05:23:04,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:23:04,002 INFO L470 AbstractCegarLoop]: Abstraction has 1177 states and 1518 transitions. [2021-12-28 05:23:04,002 INFO L471 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) [2021-12-28 05:23:04,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1518 transitions. [2021-12-28 05:23:04,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-12-28 05:23:04,006 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:23:04,006 INFO L514 BasicCegarLoop]: 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] [2021-12-28 05:23:04,006 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-28 05:23:04,007 INFO L402 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 27 more)] === [2021-12-28 05:23:04,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:23:04,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1926875297, now seen corresponding path program 1 times [2021-12-28 05:23:04,008 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:23:04,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204357492] [2021-12-28 05:23:04,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:23:04,008 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:23:04,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:04,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:23:04,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:04,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:23:04,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:04,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 05:23:04,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:04,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 05:23:04,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:04,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 05:23:04,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:04,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-28 05:23:04,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:04,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 05:23:04,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:04,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:23:04,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:04,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-28 05:23:04,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:04,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-28 05:23:04,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:04,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-28 05:23:04,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:04,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-28 05:23:04,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:04,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-28 05:23:04,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:04,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-28 05:23:04,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:04,343 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-28 05:23:04,343 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:23:04,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204357492] [2021-12-28 05:23:04,343 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204357492] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:23:04,343 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:23:04,343 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:23:04,344 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646595995] [2021-12-28 05:23:04,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:23:04,344 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:23:04,344 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:23:04,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:23:04,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:23:04,345 INFO L87 Difference]: Start difference. First operand 1177 states and 1518 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) [2021-12-28 05:23:06,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:23:06,693 INFO L93 Difference]: Finished difference Result 1177 states and 1518 transitions. [2021-12-28 05:23:06,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:23:06,693 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 [2021-12-28 05:23:06,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:23:06,698 INFO L225 Difference]: With dead ends: 1177 [2021-12-28 05:23:06,698 INFO L226 Difference]: Without dead ends: 1175 [2021-12-28 05:23:06,699 INFO L932 BasicCegarLoop]: 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 [2021-12-28 05:23:06,700 INFO L933 BasicCegarLoop]: 1408 mSDtfsCounter, 2129 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 1414 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2305 SdHoareTripleChecker+Valid, 2806 SdHoareTripleChecker+Invalid, 2430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 1414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:23:06,700 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2305 Valid, 2806 Invalid, 2430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 1414 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2021-12-28 05:23:06,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2021-12-28 05:23:06,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 1175. [2021-12-28 05:23:06,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1175 states, 775 states have (on average 1.192258064516129) internal successors, (924), 807 states have internal predecessors, (924), 297 states have call successors, (297), 80 states have call predecessors, (297), 79 states have return successors, (295), 294 states have call predecessors, (295), 295 states have call successors, (295) [2021-12-28 05:23:06,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1175 states to 1175 states and 1516 transitions. [2021-12-28 05:23:06,740 INFO L78 Accepts]: Start accepts. Automaton has 1175 states and 1516 transitions. Word has length 95 [2021-12-28 05:23:06,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:23:06,741 INFO L470 AbstractCegarLoop]: Abstraction has 1175 states and 1516 transitions. [2021-12-28 05:23:06,741 INFO L471 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) [2021-12-28 05:23:06,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1516 transitions. [2021-12-28 05:23:06,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-12-28 05:23:06,742 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:23:06,742 INFO L514 BasicCegarLoop]: 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] [2021-12-28 05:23:06,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-28 05:23:06,743 INFO L402 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 27 more)] === [2021-12-28 05:23:06,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:23:06,743 INFO L85 PathProgramCache]: Analyzing trace with hash -2113908543, now seen corresponding path program 1 times [2021-12-28 05:23:06,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:23:06,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711803930] [2021-12-28 05:23:06,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:23:06,744 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:23:06,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:06,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:23:06,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:06,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:23:06,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:06,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 05:23:06,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:06,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 05:23:06,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:06,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 05:23:06,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:06,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-28 05:23:06,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:07,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 05:23:07,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:07,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:23:07,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:07,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-28 05:23:07,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:07,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-28 05:23:07,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:07,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-28 05:23:07,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:07,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-28 05:23:07,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:07,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-28 05:23:07,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:07,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-28 05:23:07,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:07,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-28 05:23:07,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:07,063 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-28 05:23:07,063 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:23:07,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711803930] [2021-12-28 05:23:07,063 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711803930] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:23:07,063 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:23:07,063 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:23:07,064 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770847047] [2021-12-28 05:23:07,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:23:07,064 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:23:07,065 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:23:07,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:23:07,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:23:07,065 INFO L87 Difference]: Start difference. First operand 1175 states and 1516 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) [2021-12-28 05:23:09,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:23:09,335 INFO L93 Difference]: Finished difference Result 1175 states and 1516 transitions. [2021-12-28 05:23:09,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:23:09,335 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 [2021-12-28 05:23:09,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:23:09,340 INFO L225 Difference]: With dead ends: 1175 [2021-12-28 05:23:09,340 INFO L226 Difference]: Without dead ends: 1173 [2021-12-28 05:23:09,341 INFO L932 BasicCegarLoop]: 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 [2021-12-28 05:23:09,342 INFO L933 BasicCegarLoop]: 1406 mSDtfsCounter, 2123 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 1412 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2298 SdHoareTripleChecker+Valid, 2804 SdHoareTripleChecker+Invalid, 2428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 1412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:23:09,342 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2298 Valid, 2804 Invalid, 2428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 1412 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2021-12-28 05:23:09,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2021-12-28 05:23:09,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 1173. [2021-12-28 05:23:09,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1173 states, 774 states have (on average 1.1912144702842378) internal successors, (922), 805 states have internal predecessors, (922), 297 states have call successors, (297), 80 states have call predecessors, (297), 79 states have return successors, (295), 294 states have call predecessors, (295), 295 states have call successors, (295) [2021-12-28 05:23:09,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1514 transitions. [2021-12-28 05:23:09,424 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 1514 transitions. Word has length 101 [2021-12-28 05:23:09,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:23:09,425 INFO L470 AbstractCegarLoop]: Abstraction has 1173 states and 1514 transitions. [2021-12-28 05:23:09,425 INFO L471 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) [2021-12-28 05:23:09,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1514 transitions. [2021-12-28 05:23:09,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-12-28 05:23:09,426 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:23:09,426 INFO L514 BasicCegarLoop]: 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] [2021-12-28 05:23:09,426 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-28 05:23:09,426 INFO L402 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 27 more)] === [2021-12-28 05:23:09,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:23:09,427 INFO L85 PathProgramCache]: Analyzing trace with hash -792552921, now seen corresponding path program 1 times [2021-12-28 05:23:09,427 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:23:09,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828754829] [2021-12-28 05:23:09,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:23:09,427 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:23:09,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:09,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:23:09,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:09,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:23:09,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:09,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 05:23:09,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:09,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 05:23:09,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:09,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 05:23:09,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:09,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-28 05:23:09,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:09,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 05:23:09,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:09,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:23:09,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:09,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-28 05:23:09,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:09,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-28 05:23:09,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:09,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-28 05:23:09,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:09,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-28 05:23:09,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:09,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-28 05:23:09,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:09,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-28 05:23:09,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:09,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-28 05:23:09,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:09,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-28 05:23:09,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:09,682 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-28 05:23:09,682 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:23:09,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828754829] [2021-12-28 05:23:09,683 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828754829] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:23:09,683 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:23:09,683 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:23:09,683 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857394266] [2021-12-28 05:23:09,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:23:09,683 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:23:09,683 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:23:09,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:23:09,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:23:09,684 INFO L87 Difference]: Start difference. First operand 1173 states and 1514 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) [2021-12-28 05:23:12,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:23:12,014 INFO L93 Difference]: Finished difference Result 1173 states and 1514 transitions. [2021-12-28 05:23:12,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:23:12,014 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 [2021-12-28 05:23:12,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:23:12,020 INFO L225 Difference]: With dead ends: 1173 [2021-12-28 05:23:12,020 INFO L226 Difference]: Without dead ends: 1171 [2021-12-28 05:23:12,021 INFO L932 BasicCegarLoop]: 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 [2021-12-28 05:23:12,021 INFO L933 BasicCegarLoop]: 1404 mSDtfsCounter, 2117 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 1410 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2291 SdHoareTripleChecker+Valid, 2802 SdHoareTripleChecker+Invalid, 2426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 1410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:23:12,021 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2291 Valid, 2802 Invalid, 2426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 1410 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2021-12-28 05:23:12,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2021-12-28 05:23:12,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 1171. [2021-12-28 05:23:12,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1171 states, 773 states have (on average 1.1901681759379044) internal successors, (920), 803 states have internal predecessors, (920), 297 states have call successors, (297), 80 states have call predecessors, (297), 79 states have return successors, (295), 294 states have call predecessors, (295), 295 states have call successors, (295) [2021-12-28 05:23:12,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1171 states to 1171 states and 1512 transitions. [2021-12-28 05:23:12,057 INFO L78 Accepts]: Start accepts. Automaton has 1171 states and 1512 transitions. Word has length 107 [2021-12-28 05:23:12,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:23:12,058 INFO L470 AbstractCegarLoop]: Abstraction has 1171 states and 1512 transitions. [2021-12-28 05:23:12,058 INFO L471 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) [2021-12-28 05:23:12,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 1512 transitions. [2021-12-28 05:23:12,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-12-28 05:23:12,059 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:23:12,059 INFO L514 BasicCegarLoop]: 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] [2021-12-28 05:23:12,060 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-28 05:23:12,060 INFO L402 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 27 more)] === [2021-12-28 05:23:12,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:23:12,060 INFO L85 PathProgramCache]: Analyzing trace with hash 254667010, now seen corresponding path program 1 times [2021-12-28 05:23:12,060 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:23:12,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167669660] [2021-12-28 05:23:12,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:23:12,061 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:23:12,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:12,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:23:12,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:12,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:23:12,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:12,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 05:23:12,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:12,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 05:23:12,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:12,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 05:23:12,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:12,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-28 05:23:12,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:12,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 05:23:12,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:12,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:23:12,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:12,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-28 05:23:12,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:12,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-28 05:23:12,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:12,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-28 05:23:12,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:12,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-28 05:23:12,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:12,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-28 05:23:12,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:12,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-28 05:23:12,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:12,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-28 05:23:12,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:12,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-28 05:23:12,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:12,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-28 05:23:12,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:12,423 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-28 05:23:12,423 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:23:12,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167669660] [2021-12-28 05:23:12,424 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167669660] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:23:12,424 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:23:12,424 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:23:12,424 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891697277] [2021-12-28 05:23:12,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:23:12,425 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:23:12,425 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:23:12,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:23:12,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:23:12,425 INFO L87 Difference]: Start difference. First operand 1171 states and 1512 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) [2021-12-28 05:23:14,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:23:14,360 INFO L93 Difference]: Finished difference Result 1171 states and 1512 transitions. [2021-12-28 05:23:14,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:23:14,362 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 [2021-12-28 05:23:14,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:23:14,367 INFO L225 Difference]: With dead ends: 1171 [2021-12-28 05:23:14,367 INFO L226 Difference]: Without dead ends: 1169 [2021-12-28 05:23:14,367 INFO L932 BasicCegarLoop]: 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 [2021-12-28 05:23:14,368 INFO L933 BasicCegarLoop]: 1402 mSDtfsCounter, 2115 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 1404 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2288 SdHoareTripleChecker+Valid, 2800 SdHoareTripleChecker+Invalid, 2420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 1404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-12-28 05:23:14,368 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2288 Valid, 2800 Invalid, 2420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 1404 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2021-12-28 05:23:14,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2021-12-28 05:23:14,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 1169. [2021-12-28 05:23:14,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1169 states, 772 states have (on average 1.189119170984456) internal successors, (918), 801 states have internal predecessors, (918), 297 states have call successors, (297), 80 states have call predecessors, (297), 79 states have return successors, (295), 294 states have call predecessors, (295), 295 states have call successors, (295) [2021-12-28 05:23:14,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1169 states to 1169 states and 1510 transitions. [2021-12-28 05:23:14,406 INFO L78 Accepts]: Start accepts. Automaton has 1169 states and 1510 transitions. Word has length 113 [2021-12-28 05:23:14,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:23:14,406 INFO L470 AbstractCegarLoop]: Abstraction has 1169 states and 1510 transitions. [2021-12-28 05:23:14,407 INFO L471 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) [2021-12-28 05:23:14,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 1510 transitions. [2021-12-28 05:23:14,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-12-28 05:23:14,408 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:23:14,408 INFO L514 BasicCegarLoop]: 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] [2021-12-28 05:23:14,409 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-28 05:23:14,409 INFO L402 AbstractCegarLoop]: === Iteration 9 === 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 27 more)] === [2021-12-28 05:23:14,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:23:14,409 INFO L85 PathProgramCache]: Analyzing trace with hash -78006587, now seen corresponding path program 1 times [2021-12-28 05:23:14,409 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:23:14,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471325176] [2021-12-28 05:23:14,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:23:14,410 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:23:14,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:14,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:23:14,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:14,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:23:14,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:14,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 05:23:14,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:14,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 05:23:14,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:14,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 05:23:14,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:14,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-28 05:23:14,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:14,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 05:23:14,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:14,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:23:14,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:14,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-28 05:23:14,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:14,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-28 05:23:14,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:14,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-28 05:23:14,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:14,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-28 05:23:14,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:14,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-28 05:23:14,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:14,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-28 05:23:14,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:14,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-28 05:23:14,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:14,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-28 05:23:14,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:14,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-28 05:23:14,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:14,691 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-28 05:23:14,692 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:23:14,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471325176] [2021-12-28 05:23:14,692 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471325176] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:23:14,692 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:23:14,692 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:23:14,692 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496197520] [2021-12-28 05:23:14,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:23:14,693 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:23:14,693 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:23:14,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:23:14,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:23:14,694 INFO L87 Difference]: Start difference. First operand 1169 states and 1510 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) [2021-12-28 05:23:16,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:23:16,739 INFO L93 Difference]: Finished difference Result 1169 states and 1510 transitions. [2021-12-28 05:23:16,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:23:16,740 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 [2021-12-28 05:23:16,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:23:16,747 INFO L225 Difference]: With dead ends: 1169 [2021-12-28 05:23:16,747 INFO L226 Difference]: Without dead ends: 1167 [2021-12-28 05:23:16,758 INFO L932 BasicCegarLoop]: 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 [2021-12-28 05:23:16,760 INFO L933 BasicCegarLoop]: 1400 mSDtfsCounter, 2103 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 1406 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2276 SdHoareTripleChecker+Valid, 2798 SdHoareTripleChecker+Invalid, 2422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 1406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-12-28 05:23:16,761 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2276 Valid, 2798 Invalid, 2422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 1406 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2021-12-28 05:23:16,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2021-12-28 05:23:16,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 1167. [2021-12-28 05:23:16,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1167 states, 771 states have (on average 1.1880674448767834) internal successors, (916), 799 states have internal predecessors, (916), 297 states have call successors, (297), 80 states have call predecessors, (297), 79 states have return successors, (295), 294 states have call predecessors, (295), 295 states have call successors, (295) [2021-12-28 05:23:16,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1167 states to 1167 states and 1508 transitions. [2021-12-28 05:23:16,799 INFO L78 Accepts]: Start accepts. Automaton has 1167 states and 1508 transitions. Word has length 115 [2021-12-28 05:23:16,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:23:16,800 INFO L470 AbstractCegarLoop]: Abstraction has 1167 states and 1508 transitions. [2021-12-28 05:23:16,800 INFO L471 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) [2021-12-28 05:23:16,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 1508 transitions. [2021-12-28 05:23:16,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-12-28 05:23:16,802 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:23:16,802 INFO L514 BasicCegarLoop]: 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] [2021-12-28 05:23:16,802 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-28 05:23:16,802 INFO L402 AbstractCegarLoop]: === Iteration 10 === 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 27 more)] === [2021-12-28 05:23:16,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:23:16,803 INFO L85 PathProgramCache]: Analyzing trace with hash -750920079, now seen corresponding path program 1 times [2021-12-28 05:23:16,803 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:23:16,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024848841] [2021-12-28 05:23:16,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:23:16,803 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:23:16,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:16,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:23:16,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:16,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:23:16,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:16,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 05:23:16,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:16,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 05:23:16,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:16,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 05:23:17,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:17,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-28 05:23:17,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:17,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 05:23:17,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:17,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:23:17,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:17,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-28 05:23:17,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:17,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-28 05:23:17,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:17,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-28 05:23:17,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:17,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-28 05:23:17,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:17,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-28 05:23:17,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:17,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-28 05:23:17,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:17,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-28 05:23:17,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:17,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-28 05:23:17,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:17,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-28 05:23:17,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:17,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-28 05:23:17,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:17,077 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-28 05:23:17,077 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:23:17,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024848841] [2021-12-28 05:23:17,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024848841] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:23:17,077 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:23:17,077 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:23:17,078 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420483867] [2021-12-28 05:23:17,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:23:17,078 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:23:17,078 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:23:17,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:23:17,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:23:17,079 INFO L87 Difference]: Start difference. First operand 1167 states and 1508 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) [2021-12-28 05:23:19,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:23:19,074 INFO L93 Difference]: Finished difference Result 1167 states and 1508 transitions. [2021-12-28 05:23:19,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:23:19,074 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 [2021-12-28 05:23:19,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:23:19,078 INFO L225 Difference]: With dead ends: 1167 [2021-12-28 05:23:19,079 INFO L226 Difference]: Without dead ends: 1165 [2021-12-28 05:23:19,080 INFO L932 BasicCegarLoop]: 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 [2021-12-28 05:23:19,080 INFO L933 BasicCegarLoop]: 1398 mSDtfsCounter, 2099 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 1404 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2271 SdHoareTripleChecker+Valid, 2796 SdHoareTripleChecker+Invalid, 2420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 1404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-12-28 05:23:19,081 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2271 Valid, 2796 Invalid, 2420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 1404 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2021-12-28 05:23:19,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2021-12-28 05:23:19,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 1165. [2021-12-28 05:23:19,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1165 states, 770 states have (on average 1.187012987012987) internal successors, (914), 797 states have internal predecessors, (914), 297 states have call successors, (297), 80 states have call predecessors, (297), 79 states have return successors, (295), 294 states have call predecessors, (295), 295 states have call successors, (295) [2021-12-28 05:23:19,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 1165 states and 1506 transitions. [2021-12-28 05:23:19,124 INFO L78 Accepts]: Start accepts. Automaton has 1165 states and 1506 transitions. Word has length 121 [2021-12-28 05:23:19,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:23:19,126 INFO L470 AbstractCegarLoop]: Abstraction has 1165 states and 1506 transitions. [2021-12-28 05:23:19,126 INFO L471 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) [2021-12-28 05:23:19,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1165 states and 1506 transitions. [2021-12-28 05:23:19,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-12-28 05:23:19,127 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:23:19,127 INFO L514 BasicCegarLoop]: 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] [2021-12-28 05:23:19,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-28 05:23:19,128 INFO L402 AbstractCegarLoop]: === Iteration 11 === 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 27 more)] === [2021-12-28 05:23:19,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:23:19,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1499616254, now seen corresponding path program 1 times [2021-12-28 05:23:19,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:23:19,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035639613] [2021-12-28 05:23:19,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:23:19,129 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:23:19,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:19,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:23:19,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:19,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:23:19,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:19,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 05:23:19,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:19,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 05:23:19,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:19,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 05:23:19,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:19,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-28 05:23:19,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:19,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 05:23:19,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:19,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:23:19,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:19,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-28 05:23:19,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:19,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-28 05:23:19,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:19,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-28 05:23:19,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:19,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-28 05:23:19,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:19,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-28 05:23:19,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:19,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-28 05:23:19,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:19,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-28 05:23:19,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:19,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-28 05:23:19,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:19,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-28 05:23:19,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:19,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-28 05:23:19,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:19,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-28 05:23:19,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:19,436 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-28 05:23:19,436 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:23:19,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035639613] [2021-12-28 05:23:19,436 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035639613] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:23:19,436 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:23:19,436 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:23:19,436 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690368324] [2021-12-28 05:23:19,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:23:19,437 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:23:19,437 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:23:19,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:23:19,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:23:19,438 INFO L87 Difference]: Start difference. First operand 1165 states and 1506 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) [2021-12-28 05:23:21,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:23:21,709 INFO L93 Difference]: Finished difference Result 1165 states and 1506 transitions. [2021-12-28 05:23:21,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:23:21,709 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 [2021-12-28 05:23:21,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:23:21,714 INFO L225 Difference]: With dead ends: 1165 [2021-12-28 05:23:21,715 INFO L226 Difference]: Without dead ends: 1163 [2021-12-28 05:23:21,715 INFO L932 BasicCegarLoop]: 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 [2021-12-28 05:23:21,715 INFO L933 BasicCegarLoop]: 1396 mSDtfsCounter, 2093 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 1402 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2264 SdHoareTripleChecker+Valid, 2794 SdHoareTripleChecker+Invalid, 2418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 1402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:23:21,716 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2264 Valid, 2794 Invalid, 2418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 1402 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2021-12-28 05:23:21,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2021-12-28 05:23:21,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 1163. [2021-12-28 05:23:21,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1163 states, 769 states have (on average 1.1859557867360209) internal successors, (912), 795 states have internal predecessors, (912), 297 states have call successors, (297), 80 states have call predecessors, (297), 79 states have return successors, (295), 294 states have call predecessors, (295), 295 states have call successors, (295) [2021-12-28 05:23:21,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 1504 transitions. [2021-12-28 05:23:21,757 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 1504 transitions. Word has length 127 [2021-12-28 05:23:21,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:23:21,758 INFO L470 AbstractCegarLoop]: Abstraction has 1163 states and 1504 transitions. [2021-12-28 05:23:21,758 INFO L471 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) [2021-12-28 05:23:21,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1504 transitions. [2021-12-28 05:23:21,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-12-28 05:23:21,759 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:23:21,760 INFO L514 BasicCegarLoop]: 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] [2021-12-28 05:23:21,760 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-28 05:23:21,760 INFO L402 AbstractCegarLoop]: === Iteration 12 === 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 27 more)] === [2021-12-28 05:23:21,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:23:21,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1163685789, now seen corresponding path program 1 times [2021-12-28 05:23:21,760 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:23:21,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502461888] [2021-12-28 05:23:21,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:23:21,761 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:23:21,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:21,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:23:21,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:21,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:23:21,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:21,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 05:23:21,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:21,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 05:23:21,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:21,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 05:23:21,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:21,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-28 05:23:21,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:21,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 05:23:21,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:21,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:23:21,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:21,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-28 05:23:21,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:21,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-28 05:23:22,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:22,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-28 05:23:22,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:22,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-28 05:23:22,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:22,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-28 05:23:22,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:22,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-28 05:23:22,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:22,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-28 05:23:22,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:22,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-28 05:23:22,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:22,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-28 05:23:22,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:22,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-28 05:23:22,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:22,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-28 05:23:22,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:22,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-12-28 05:23:22,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:22,073 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-28 05:23:22,073 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:23:22,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502461888] [2021-12-28 05:23:22,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502461888] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:23:22,073 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:23:22,073 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:23:22,073 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102619600] [2021-12-28 05:23:22,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:23:22,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:23:22,074 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:23:22,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:23:22,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:23:22,075 INFO L87 Difference]: Start difference. First operand 1163 states and 1504 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) [2021-12-28 05:23:24,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:23:24,114 INFO L93 Difference]: Finished difference Result 1163 states and 1504 transitions. [2021-12-28 05:23:24,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:23:24,114 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 [2021-12-28 05:23:24,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:23:24,133 INFO L225 Difference]: With dead ends: 1163 [2021-12-28 05:23:24,133 INFO L226 Difference]: Without dead ends: 1161 [2021-12-28 05:23:24,134 INFO L932 BasicCegarLoop]: 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 [2021-12-28 05:23:24,135 INFO L933 BasicCegarLoop]: 1394 mSDtfsCounter, 2087 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 1400 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2257 SdHoareTripleChecker+Valid, 2792 SdHoareTripleChecker+Invalid, 2416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 1400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-12-28 05:23:24,138 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2257 Valid, 2792 Invalid, 2416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 1400 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2021-12-28 05:23:24,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2021-12-28 05:23:24,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 1161. [2021-12-28 05:23:24,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1161 states, 768 states have (on average 1.1848958333333333) internal successors, (910), 793 states have internal predecessors, (910), 297 states have call successors, (297), 80 states have call predecessors, (297), 79 states have return successors, (295), 294 states have call predecessors, (295), 295 states have call successors, (295) [2021-12-28 05:23:24,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1502 transitions. [2021-12-28 05:23:24,176 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1502 transitions. Word has length 133 [2021-12-28 05:23:24,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:23:24,176 INFO L470 AbstractCegarLoop]: Abstraction has 1161 states and 1502 transitions. [2021-12-28 05:23:24,176 INFO L471 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) [2021-12-28 05:23:24,176 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1502 transitions. [2021-12-28 05:23:24,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-12-28 05:23:24,177 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:23:24,178 INFO L514 BasicCegarLoop]: 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] [2021-12-28 05:23:24,178 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-28 05:23:24,178 INFO L402 AbstractCegarLoop]: === Iteration 13 === 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 27 more)] === [2021-12-28 05:23:24,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:23:24,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1966142052, now seen corresponding path program 1 times [2021-12-28 05:23:24,179 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:23:24,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899181948] [2021-12-28 05:23:24,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:23:24,179 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:23:24,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:24,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:23:24,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:24,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:23:24,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:24,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 05:23:24,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:24,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 05:23:24,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:24,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 05:23:24,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:24,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-28 05:23:24,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:24,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 05:23:24,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:24,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:23:24,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:24,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-28 05:23:24,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:24,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-28 05:23:24,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:24,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-28 05:23:24,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:24,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-28 05:23:24,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:24,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-28 05:23:24,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:24,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-28 05:23:24,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:24,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-28 05:23:24,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:24,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-28 05:23:24,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:24,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-28 05:23:24,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:24,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-28 05:23:24,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:24,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-28 05:23:24,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:24,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-12-28 05:23:24,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:24,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-12-28 05:23:24,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:24,565 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-28 05:23:24,565 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:23:24,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899181948] [2021-12-28 05:23:24,565 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899181948] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:23:24,565 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:23:24,566 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:23:24,566 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829134188] [2021-12-28 05:23:24,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:23:24,566 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:23:24,566 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:23:24,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:23:24,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:23:24,567 INFO L87 Difference]: Start difference. First operand 1161 states and 1502 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) [2021-12-28 05:23:26,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:23:26,894 INFO L93 Difference]: Finished difference Result 1161 states and 1502 transitions. [2021-12-28 05:23:26,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:23:26,895 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 [2021-12-28 05:23:26,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:23:26,899 INFO L225 Difference]: With dead ends: 1161 [2021-12-28 05:23:26,899 INFO L226 Difference]: Without dead ends: 1159 [2021-12-28 05:23:26,899 INFO L932 BasicCegarLoop]: 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 [2021-12-28 05:23:26,900 INFO L933 BasicCegarLoop]: 1392 mSDtfsCounter, 2081 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 1398 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2250 SdHoareTripleChecker+Valid, 2790 SdHoareTripleChecker+Invalid, 2414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 1398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:23:26,900 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2250 Valid, 2790 Invalid, 2414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 1398 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2021-12-28 05:23:26,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2021-12-28 05:23:26,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1159. [2021-12-28 05:23:26,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1159 states, 767 states have (on average 1.1838331160365059) internal successors, (908), 791 states have internal predecessors, (908), 297 states have call successors, (297), 80 states have call predecessors, (297), 79 states have return successors, (295), 294 states have call predecessors, (295), 295 states have call successors, (295) [2021-12-28 05:23:26,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 1500 transitions. [2021-12-28 05:23:26,947 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 1500 transitions. Word has length 139 [2021-12-28 05:23:26,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:23:26,948 INFO L470 AbstractCegarLoop]: Abstraction has 1159 states and 1500 transitions. [2021-12-28 05:23:26,948 INFO L471 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) [2021-12-28 05:23:26,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 1500 transitions. [2021-12-28 05:23:26,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2021-12-28 05:23:26,949 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:23:26,950 INFO L514 BasicCegarLoop]: 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] [2021-12-28 05:23:26,950 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-28 05:23:26,950 INFO L402 AbstractCegarLoop]: === Iteration 14 === 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 27 more)] === [2021-12-28 05:23:26,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:23:26,950 INFO L85 PathProgramCache]: Analyzing trace with hash 788971441, now seen corresponding path program 1 times [2021-12-28 05:23:26,951 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:23:26,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462905289] [2021-12-28 05:23:26,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:23:26,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:23:27,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:27,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:23:27,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:27,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:23:27,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:27,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 05:23:27,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:27,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 05:23:27,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:27,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 05:23:27,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:27,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-28 05:23:27,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:27,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 05:23:27,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:27,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:23:27,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:27,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-28 05:23:27,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:27,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-28 05:23:27,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:27,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-28 05:23:27,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:27,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-28 05:23:27,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:27,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-28 05:23:27,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:27,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-28 05:23:27,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:27,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-28 05:23:27,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:27,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-28 05:23:27,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:27,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-28 05:23:27,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:27,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-28 05:23:27,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:27,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-28 05:23:27,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:27,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-12-28 05:23:27,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:27,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-12-28 05:23:27,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:27,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-12-28 05:23:27,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:27,304 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-28 05:23:27,304 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:23:27,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462905289] [2021-12-28 05:23:27,304 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462905289] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:23:27,304 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:23:27,305 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:23:27,305 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782288857] [2021-12-28 05:23:27,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:23:27,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:23:27,305 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:23:27,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:23:27,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:23:27,306 INFO L87 Difference]: Start difference. First operand 1159 states and 1500 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) [2021-12-28 05:23:29,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:23:29,367 INFO L93 Difference]: Finished difference Result 1159 states and 1500 transitions. [2021-12-28 05:23:29,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:23:29,368 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 [2021-12-28 05:23:29,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:23:29,372 INFO L225 Difference]: With dead ends: 1159 [2021-12-28 05:23:29,373 INFO L226 Difference]: Without dead ends: 1157 [2021-12-28 05:23:29,373 INFO L932 BasicCegarLoop]: 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 [2021-12-28 05:23:29,374 INFO L933 BasicCegarLoop]: 1390 mSDtfsCounter, 2075 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 1396 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2243 SdHoareTripleChecker+Valid, 2788 SdHoareTripleChecker+Invalid, 2412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 1396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-12-28 05:23:29,374 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2243 Valid, 2788 Invalid, 2412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 1396 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2021-12-28 05:23:29,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2021-12-28 05:23:29,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 1157. [2021-12-28 05:23:29,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 766 states have (on average 1.1827676240208878) internal successors, (906), 789 states have internal predecessors, (906), 297 states have call successors, (297), 80 states have call predecessors, (297), 79 states have return successors, (295), 294 states have call predecessors, (295), 295 states have call successors, (295) [2021-12-28 05:23:29,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1498 transitions. [2021-12-28 05:23:29,455 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1498 transitions. Word has length 145 [2021-12-28 05:23:29,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:23:29,456 INFO L470 AbstractCegarLoop]: Abstraction has 1157 states and 1498 transitions. [2021-12-28 05:23:29,456 INFO L471 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) [2021-12-28 05:23:29,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1498 transitions. [2021-12-28 05:23:29,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2021-12-28 05:23:29,457 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:23:29,458 INFO L514 BasicCegarLoop]: 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] [2021-12-28 05:23:29,458 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-28 05:23:29,458 INFO L402 AbstractCegarLoop]: === Iteration 15 === 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 27 more)] === [2021-12-28 05:23:29,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:23:29,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1891115065, now seen corresponding path program 1 times [2021-12-28 05:23:29,458 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:23:29,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435127516] [2021-12-28 05:23:29,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:23:29,459 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:23:29,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:29,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:23:29,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:29,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:23:29,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:29,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 05:23:29,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:29,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 05:23:29,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:29,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 05:23:29,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:29,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-28 05:23:29,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:29,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 05:23:29,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:29,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:23:29,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:29,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-28 05:23:29,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:29,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-28 05:23:29,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:29,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-28 05:23:29,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:29,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-28 05:23:29,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:29,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-28 05:23:29,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:29,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-28 05:23:29,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:29,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-28 05:23:29,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:29,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-28 05:23:29,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:29,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-28 05:23:29,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:29,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-28 05:23:29,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:29,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-28 05:23:29,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:29,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-12-28 05:23:29,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:29,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-12-28 05:23:29,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:29,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-12-28 05:23:29,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:29,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-28 05:23:29,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:29,814 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-28 05:23:29,814 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:23:29,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435127516] [2021-12-28 05:23:29,814 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435127516] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:23:29,814 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:23:29,815 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:23:29,815 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204430979] [2021-12-28 05:23:29,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:23:29,815 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:23:29,815 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:23:29,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:23:29,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:23:29,816 INFO L87 Difference]: Start difference. First operand 1157 states and 1498 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) [2021-12-28 05:23:31,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:23:31,815 INFO L93 Difference]: Finished difference Result 1157 states and 1498 transitions. [2021-12-28 05:23:31,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:23:31,816 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 [2021-12-28 05:23:31,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:23:31,820 INFO L225 Difference]: With dead ends: 1157 [2021-12-28 05:23:31,820 INFO L226 Difference]: Without dead ends: 1155 [2021-12-28 05:23:31,822 INFO L932 BasicCegarLoop]: 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 [2021-12-28 05:23:31,823 INFO L933 BasicCegarLoop]: 1388 mSDtfsCounter, 2069 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 1394 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2236 SdHoareTripleChecker+Valid, 2786 SdHoareTripleChecker+Invalid, 2410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 1394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-12-28 05:23:31,823 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2236 Valid, 2786 Invalid, 2410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 1394 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2021-12-28 05:23:31,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2021-12-28 05:23:31,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 1155. [2021-12-28 05:23:31,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1155 states, 765 states have (on average 1.1816993464052288) internal successors, (904), 787 states have internal predecessors, (904), 297 states have call successors, (297), 80 states have call predecessors, (297), 79 states have return successors, (295), 294 states have call predecessors, (295), 295 states have call successors, (295) [2021-12-28 05:23:31,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 1496 transitions. [2021-12-28 05:23:31,870 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 1496 transitions. Word has length 151 [2021-12-28 05:23:31,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:23:31,872 INFO L470 AbstractCegarLoop]: Abstraction has 1155 states and 1496 transitions. [2021-12-28 05:23:31,872 INFO L471 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) [2021-12-28 05:23:31,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 1496 transitions. [2021-12-28 05:23:31,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-12-28 05:23:31,874 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:23:31,874 INFO L514 BasicCegarLoop]: 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] [2021-12-28 05:23:31,874 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-28 05:23:31,874 INFO L402 AbstractCegarLoop]: === Iteration 16 === 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 27 more)] === [2021-12-28 05:23:31,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:23:31,875 INFO L85 PathProgramCache]: Analyzing trace with hash -116230766, now seen corresponding path program 1 times [2021-12-28 05:23:31,875 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:23:31,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96801855] [2021-12-28 05:23:31,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:23:31,875 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:23:31,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:32,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:23:32,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:32,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:23:32,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:32,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 05:23:32,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:32,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 05:23:32,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:32,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 05:23:32,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:32,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-28 05:23:32,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:32,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 05:23:32,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:32,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:23:32,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:32,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-28 05:23:32,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:32,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-28 05:23:32,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:32,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-28 05:23:32,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:32,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-28 05:23:32,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:32,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-28 05:23:32,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:32,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-28 05:23:32,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:32,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-28 05:23:32,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:32,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-28 05:23:32,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:32,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-28 05:23:32,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:32,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-28 05:23:32,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:32,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-28 05:23:32,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:32,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-12-28 05:23:32,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:32,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-12-28 05:23:32,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:32,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-12-28 05:23:32,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:32,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-28 05:23:32,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:32,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2021-12-28 05:23:32,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:32,226 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-28 05:23:32,227 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:23:32,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96801855] [2021-12-28 05:23:32,228 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96801855] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:23:32,228 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:23:32,228 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:23:32,229 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973429458] [2021-12-28 05:23:32,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:23:32,229 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:23:32,230 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:23:32,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:23:32,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:23:32,230 INFO L87 Difference]: Start difference. First operand 1155 states and 1496 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) [2021-12-28 05:23:34,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:23:34,423 INFO L93 Difference]: Finished difference Result 1155 states and 1496 transitions. [2021-12-28 05:23:34,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:23:34,423 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 [2021-12-28 05:23:34,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:23:34,428 INFO L225 Difference]: With dead ends: 1155 [2021-12-28 05:23:34,428 INFO L226 Difference]: Without dead ends: 1153 [2021-12-28 05:23:34,429 INFO L932 BasicCegarLoop]: 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 [2021-12-28 05:23:34,429 INFO L933 BasicCegarLoop]: 1386 mSDtfsCounter, 2063 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 1392 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2229 SdHoareTripleChecker+Valid, 2784 SdHoareTripleChecker+Invalid, 2408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 1392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:23:34,429 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2229 Valid, 2784 Invalid, 2408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 1392 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2021-12-28 05:23:34,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2021-12-28 05:23:34,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 1153. [2021-12-28 05:23:34,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1153 states, 764 states have (on average 1.1806282722513088) internal successors, (902), 785 states have internal predecessors, (902), 297 states have call successors, (297), 80 states have call predecessors, (297), 79 states have return successors, (295), 294 states have call predecessors, (295), 295 states have call successors, (295) [2021-12-28 05:23:34,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1494 transitions. [2021-12-28 05:23:34,473 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1494 transitions. Word has length 157 [2021-12-28 05:23:34,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:23:34,474 INFO L470 AbstractCegarLoop]: Abstraction has 1153 states and 1494 transitions. [2021-12-28 05:23:34,474 INFO L471 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) [2021-12-28 05:23:34,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1494 transitions. [2021-12-28 05:23:34,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2021-12-28 05:23:34,475 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:23:34,476 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2021-12-28 05:23:34,476 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-28 05:23:34,476 INFO L402 AbstractCegarLoop]: === Iteration 17 === 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 27 more)] === [2021-12-28 05:23:34,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:23:34,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1609989482, now seen corresponding path program 1 times [2021-12-28 05:23:34,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:23:34,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478767503] [2021-12-28 05:23:34,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:23:34,477 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:23:34,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:34,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:23:34,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:34,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:23:34,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:34,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 05:23:34,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:34,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 05:23:34,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:34,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-28 05:23:34,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:34,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:23:34,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:34,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:23:34,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:34,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:23:34,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:34,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-28 05:23:34,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:34,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:23:34,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:34,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:23:34,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:34,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:23:34,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:34,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-28 05:23:34,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:34,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:23:34,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:34,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:23:34,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:34,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:23:34,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:34,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-28 05:23:34,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:34,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:23:34,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:34,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:23:34,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:34,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:23:34,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:34,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-28 05:23:34,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:34,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:23:34,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:34,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:23:34,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:34,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:23:34,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:34,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-12-28 05:23:34,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:34,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-28 05:23:34,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:34,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-12-28 05:23:34,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:34,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-12-28 05:23:34,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:34,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2021-12-28 05:23:34,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:34,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2021-12-28 05:23:34,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:34,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:23:34,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:34,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2021-12-28 05:23:34,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:23:34,973 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 401 trivial. 0 not checked. [2021-12-28 05:23:34,973 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:23:34,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478767503] [2021-12-28 05:23:34,973 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478767503] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:23:34,974 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:23:34,974 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:23:34,974 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628749952] [2021-12-28 05:23:34,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:23:34,975 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:23:34,975 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:23:34,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:23:34,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:23:34,976 INFO L87 Difference]: Start difference. First operand 1153 states and 1494 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20)