./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 839c364b 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-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 19:10:30,759 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 19:10:30,761 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 19:10:30,803 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 19:10:30,804 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 19:10:30,806 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 19:10:30,808 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 19:10:30,810 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 19:10:30,811 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 19:10:30,814 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 19:10:30,815 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 19:10:30,816 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 19:10:30,816 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 19:10:30,818 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 19:10:30,819 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 19:10:30,822 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 19:10:30,823 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 19:10:30,824 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 19:10:30,825 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 19:10:30,829 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 19:10:30,830 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 19:10:30,831 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 19:10:30,833 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 19:10:30,833 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 19:10:30,838 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 19:10:30,838 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 19:10:30,838 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 19:10:30,840 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 19:10:30,840 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 19:10:30,840 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 19:10:30,841 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 19:10:30,841 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 19:10:30,842 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 19:10:30,843 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 19:10:30,844 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 19:10:30,844 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 19:10:30,845 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 19:10:30,845 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 19:10:30,845 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 19:10:30,845 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 19:10:30,846 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 19:10:30,848 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-12-14 19:10:30,872 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 19:10:30,873 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 19:10:30,873 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 19:10:30,873 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 19:10:30,874 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 19:10:30,874 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 19:10:30,875 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 19:10:30,875 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 19:10:30,875 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 19:10:30,875 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 19:10:30,876 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 19:10:30,876 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 19:10:30,876 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-14 19:10:30,876 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 19:10:30,876 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-14 19:10:30,876 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 19:10:30,876 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 19:10:30,877 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-14 19:10:30,877 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 19:10:30,877 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 19:10:30,877 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 19:10:30,877 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:10:30,877 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 19:10:30,877 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 19:10:30,878 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-14 19:10:30,878 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 19:10:30,878 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 19:10:30,879 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-14 19:10:30,879 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-14 19:10:30,879 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-14 19:10:30,879 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 19:10:30,879 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-14 19:10:31,097 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 19:10:31,120 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 19:10:31,123 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 19:10:31,124 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 19:10:31,124 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 19:10:31,125 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-14 19:10:31,175 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b80ab8fe/ab35d8052ce54bd0b586197ed742cf1d/FLAGdee890e8b [2021-12-14 19:10:31,750 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 19:10:31,750 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-14 19:10:31,788 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b80ab8fe/ab35d8052ce54bd0b586197ed742cf1d/FLAGdee890e8b [2021-12-14 19:10:31,908 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b80ab8fe/ab35d8052ce54bd0b586197ed742cf1d [2021-12-14 19:10:31,909 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 19:10:31,910 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 19:10:31,913 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 19:10:31,913 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 19:10:31,915 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 19:10:31,915 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:10:31" (1/1) ... [2021-12-14 19:10:31,917 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dc33644 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:10:31, skipping insertion in model container [2021-12-14 19:10:31,917 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:10:31" (1/1) ... [2021-12-14 19:10:31,922 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 19:10:32,014 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 19:10:34,662 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,664 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,664 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,665 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,665 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,665 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,666 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,666 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,666 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,666 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,667 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,667 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,667 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,668 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,668 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,668 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,669 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,669 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,669 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,669 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,670 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,670 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,670 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,671 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,671 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,671 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,671 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,672 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,672 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,672 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,673 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,673 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,673 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,673 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,674 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,674 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,674 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,675 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,675 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,675 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,675 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,676 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,676 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,676 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,677 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,677 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,677 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,677 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,678 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,678 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,678 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,679 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,679 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,679 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,680 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,681 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,681 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,681 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,681 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,682 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,682 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,682 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,683 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,683 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,683 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,684 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,684 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,684 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,684 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,685 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,685 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,685 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,685 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,686 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,686 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,686 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,687 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,687 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,687 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,687 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,688 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,688 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,688 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,689 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,689 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,689 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,689 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,690 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,704 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:10:34,727 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 19:10:34,951 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,952 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,955 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,956 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,956 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,957 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,958 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[386469,386482] [2021-12-14 19:10:34,958 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[386629,386642] [2021-12-14 19:10:34,959 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,960 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[386927,386940] [2021-12-14 19:10:34,960 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[387069,387082] [2021-12-14 19:10:34,960 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[387218,387231] [2021-12-14 19:10:34,960 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[387357,387370] [2021-12-14 19:10:34,961 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,961 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,961 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,962 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[387974,387987] [2021-12-14 19:10:34,962 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[388126,388139] [2021-12-14 19:10:34,962 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[388275,388288] [2021-12-14 19:10:34,962 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[388423,388436] [2021-12-14 19:10:34,963 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,963 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,964 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,964 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,965 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389184,389197] [2021-12-14 19:10:34,965 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389327,389340] [2021-12-14 19:10:34,965 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389479,389492] [2021-12-14 19:10:34,966 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389625,389638] [2021-12-14 19:10:34,966 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389770,389783] [2021-12-14 19:10:34,967 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389924,389937] [2021-12-14 19:10:34,967 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[390075,390088] [2021-12-14 19:10:34,967 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[390230,390243] [2021-12-14 19:10:34,968 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[390382,390395] [2021-12-14 19:10:34,968 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[390537,390550] [2021-12-14 19:10:34,968 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[390701,390714] [2021-12-14 19:10:34,969 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[390857,390870] [2021-12-14 19:10:34,969 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[391021,391034] [2021-12-14 19:10:34,969 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[391163,391176] [2021-12-14 19:10:34,970 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[391321,391334] [2021-12-14 19:10:34,970 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[391488,391501] [2021-12-14 19:10:34,971 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[391647,391660] [2021-12-14 19:10:34,971 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[391806,391819] [2021-12-14 19:10:34,972 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[391955,391968] [2021-12-14 19:10:34,972 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[392102,392115] [2021-12-14 19:10:34,972 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[392241,392254] [2021-12-14 19:10:34,973 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[392404,392417] [2021-12-14 19:10:34,973 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[392570,392583] [2021-12-14 19:10:34,973 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[392734,392747] [2021-12-14 19:10:34,973 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[392899,392912] [2021-12-14 19:10:34,974 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[393064,393077] [2021-12-14 19:10:34,974 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[393230,393243] [2021-12-14 19:10:34,975 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[393395,393408] [2021-12-14 19:10:34,975 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[393562,393575] [2021-12-14 19:10:34,975 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[393722,393735] [2021-12-14 19:10:34,976 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[393884,393897] [2021-12-14 19:10:34,977 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[394043,394056] [2021-12-14 19:10:34,978 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[394189,394202] [2021-12-14 19:10:34,978 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[394332,394345] [2021-12-14 19:10:34,978 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[394476,394489] [2021-12-14 19:10:34,979 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,979 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,980 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,981 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,983 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[395200,395213] [2021-12-14 19:10:34,983 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[395359,395372] [2021-12-14 19:10:34,986 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[395515,395528] [2021-12-14 19:10:34,987 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,987 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,988 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,988 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,988 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,989 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 19:10:34,994 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[396569,396582] [2021-12-14 19:10:34,994 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[396720,396733] [2021-12-14 19:10:34,994 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[396870,396883] [2021-12-14 19:10:34,995 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[397017,397030] [2021-12-14 19:10:34,995 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[397168,397181] [2021-12-14 19:10:34,995 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[397319,397332] [2021-12-14 19:10:34,996 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[397467,397480] [2021-12-14 19:10:34,997 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[397633,397646] [2021-12-14 19:10:34,997 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[397802,397815] [2021-12-14 19:10:34,998 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[397969,397982] [2021-12-14 19:10:34,998 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[398137,398150] [2021-12-14 19:10:34,998 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[398287,398300] [2021-12-14 19:10:34,999 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[398434,398447] [2021-12-14 19:10:34,999 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[398595,398608] [2021-12-14 19:10:34,999 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[398765,398778] [2021-12-14 19:10:34,999 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[398927,398940] [2021-12-14 19:10:35,003 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:10:35,165 INFO L208 MainTranslator]: Completed translation [2021-12-14 19:10:35,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:10:35 WrapperNode [2021-12-14 19:10:35,166 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 19:10:35,167 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 19:10:35,167 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 19:10:35,167 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 19:10:35,172 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:10:35" (1/1) ... [2021-12-14 19:10:35,259 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:10:35" (1/1) ... [2021-12-14 19:10:35,426 INFO L137 Inliner]: procedures = 616, calls = 2803, calls flagged for inlining = 287, calls inlined = 187, statements flattened = 4770 [2021-12-14 19:10:35,427 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 19:10:35,428 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 19:10:35,428 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 19:10:35,428 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 19:10:35,435 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:10:35" (1/1) ... [2021-12-14 19:10:35,435 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:10:35" (1/1) ... [2021-12-14 19:10:35,467 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:10:35" (1/1) ... [2021-12-14 19:10:35,467 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:10:35" (1/1) ... [2021-12-14 19:10:35,551 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:10:35" (1/1) ... [2021-12-14 19:10:35,570 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:10:35" (1/1) ... [2021-12-14 19:10:35,593 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:10:35" (1/1) ... [2021-12-14 19:10:35,620 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 19:10:35,621 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 19:10:35,621 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 19:10:35,622 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 19:10:35,622 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:10:35" (1/1) ... [2021-12-14 19:10:35,627 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:10:35,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:10:35,643 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-14 19:10:35,658 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-14 19:10:35,676 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2021-12-14 19:10:35,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2021-12-14 19:10:35,676 INFO L130 BoogieDeclarations]: Found specification of procedure netif_wake_queue [2021-12-14 19:10:35,677 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_wake_queue [2021-12-14 19:10:35,677 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-12-14 19:10:35,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-12-14 19:10:35,677 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_device_lock_of_kaweth_device [2021-12-14 19:10:35,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_device_lock_of_kaweth_device [2021-12-14 19:10:35,677 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2021-12-14 19:10:35,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2021-12-14 19:10:35,677 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_usb_alloc_coherent [2021-12-14 19:10:35,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_usb_alloc_coherent [2021-12-14 19:10:35,678 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2021-12-14 19:10:35,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2021-12-14 19:10:35,678 INFO L130 BoogieDeclarations]: Found specification of procedure kaweth_open [2021-12-14 19:10:35,678 INFO L138 BoogieDeclarations]: Found implementation of procedure kaweth_open [2021-12-14 19:10:35,678 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2021-12-14 19:10:35,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2021-12-14 19:10:35,679 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2021-12-14 19:10:35,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2021-12-14 19:10:35,680 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-12-14 19:10:35,680 INFO L130 BoogieDeclarations]: Found specification of procedure kaweth_resume [2021-12-14 19:10:35,680 INFO L138 BoogieDeclarations]: Found implementation of procedure kaweth_resume [2021-12-14 19:10:35,680 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2021-12-14 19:10:35,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2021-12-14 19:10:35,680 INFO L130 BoogieDeclarations]: Found specification of procedure eth_validate_addr [2021-12-14 19:10:35,680 INFO L138 BoogieDeclarations]: Found implementation of procedure eth_validate_addr [2021-12-14 19:10:35,680 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2021-12-14 19:10:35,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2021-12-14 19:10:35,680 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2021-12-14 19:10:35,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2021-12-14 19:10:35,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 19:10:35,681 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2021-12-14 19:10:35,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2021-12-14 19:10:35,681 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2021-12-14 19:10:35,681 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2021-12-14 19:10:35,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-12-14 19:10:35,681 INFO L130 BoogieDeclarations]: Found specification of procedure kaweth_resubmit_rx_urb [2021-12-14 19:10:35,681 INFO L138 BoogieDeclarations]: Found implementation of procedure kaweth_resubmit_rx_urb [2021-12-14 19:10:35,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-12-14 19:10:35,682 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2021-12-14 19:10:35,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2021-12-14 19:10:35,682 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2021-12-14 19:10:35,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2021-12-14 19:10:35,682 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2021-12-14 19:10:35,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2021-12-14 19:10:35,682 INFO L130 BoogieDeclarations]: Found specification of procedure usb_autopm_put_interface [2021-12-14 19:10:35,682 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_autopm_put_interface [2021-12-14 19:10:35,682 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-14 19:10:35,682 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2021-12-14 19:10:35,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2021-12-14 19:10:35,683 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2021-12-14 19:10:35,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2021-12-14 19:10:35,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2021-12-14 19:10:35,683 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2021-12-14 19:10:35,683 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2021-12-14 19:10:35,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2021-12-14 19:10:35,684 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2021-12-14 19:10:35,684 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2021-12-14 19:10:35,684 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2021-12-14 19:10:35,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2021-12-14 19:10:35,684 INFO L130 BoogieDeclarations]: Found specification of procedure kaweth_close [2021-12-14 19:10:35,684 INFO L138 BoogieDeclarations]: Found implementation of procedure kaweth_close [2021-12-14 19:10:35,684 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2021-12-14 19:10:35,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2021-12-14 19:10:35,684 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irq_129 [2021-12-14 19:10:35,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irq_129 [2021-12-14 19:10:35,685 INFO L130 BoogieDeclarations]: Found specification of procedure kaweth_download_firmware [2021-12-14 19:10:35,685 INFO L138 BoogieDeclarations]: Found implementation of procedure kaweth_download_firmware [2021-12-14 19:10:35,685 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2021-12-14 19:10:35,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2021-12-14 19:10:35,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-14 19:10:35,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 19:10:35,688 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2021-12-14 19:10:35,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2021-12-14 19:10:35,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-14 19:10:35,688 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2021-12-14 19:10:35,688 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2021-12-14 19:10:35,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2021-12-14 19:10:35,689 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_irq_check_alloc_flags [2021-12-14 19:10:35,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_irq_check_alloc_flags [2021-12-14 19:10:35,690 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2021-12-14 19:10:35,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2021-12-14 19:10:35,690 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_netdev [2021-12-14 19:10:35,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_netdev [2021-12-14 19:10:35,690 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_delayed_work [2021-12-14 19:10:35,690 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_delayed_work [2021-12-14 19:10:35,690 INFO L130 BoogieDeclarations]: Found specification of procedure __init_waitqueue_head [2021-12-14 19:10:35,690 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_waitqueue_head [2021-12-14 19:10:35,690 INFO L130 BoogieDeclarations]: Found specification of procedure kaweth_tx_timeout [2021-12-14 19:10:35,690 INFO L138 BoogieDeclarations]: Found implementation of procedure kaweth_tx_timeout [2021-12-14 19:10:35,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 19:10:35,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 19:10:35,691 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_intfdata [2021-12-14 19:10:35,691 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_intfdata [2021-12-14 19:10:35,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-12-14 19:10:35,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-12-14 19:10:35,691 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2021-12-14 19:10:35,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2021-12-14 19:10:35,691 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2021-12-14 19:10:35,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2021-12-14 19:10:35,692 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_133 [2021-12-14 19:10:35,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_133 [2021-12-14 19:10:35,692 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_bulk_urb [2021-12-14 19:10:35,692 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_bulk_urb [2021-12-14 19:10:35,692 INFO L130 BoogieDeclarations]: Found specification of procedure kaweth_async_set_rx_mode [2021-12-14 19:10:35,692 INFO L138 BoogieDeclarations]: Found implementation of procedure kaweth_async_set_rx_mode [2021-12-14 19:10:35,692 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_device_lock_of_kaweth_device [2021-12-14 19:10:35,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_device_lock_of_kaweth_device [2021-12-14 19:10:35,692 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2021-12-14 19:10:35,692 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2021-12-14 19:10:35,693 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2021-12-14 19:10:35,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2021-12-14 19:10:35,693 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_free_urb [2021-12-14 19:10:35,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_free_urb [2021-12-14 19:10:35,693 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2021-12-14 19:10:35,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2021-12-14 19:10:35,693 INFO L130 BoogieDeclarations]: Found specification of procedure netif_start_queue [2021-12-14 19:10:35,693 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_start_queue [2021-12-14 19:10:35,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-14 19:10:35,694 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2021-12-14 19:10:35,694 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2021-12-14 19:10:35,694 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2021-12-14 19:10:35,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2021-12-14 19:10:35,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-14 19:10:35,694 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_usb_free_coherent [2021-12-14 19:10:35,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_usb_free_coherent [2021-12-14 19:10:35,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-14 19:10:35,695 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2021-12-14 19:10:35,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2021-12-14 19:10:35,695 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2021-12-14 19:10:35,695 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2021-12-14 19:10:35,695 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2021-12-14 19:10:35,695 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2021-12-14 19:10:35,695 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2021-12-14 19:10:35,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2021-12-14 19:10:35,695 INFO L130 BoogieDeclarations]: Found specification of procedure release_firmware [2021-12-14 19:10:35,696 INFO L138 BoogieDeclarations]: Found implementation of procedure release_firmware [2021-12-14 19:10:35,696 INFO L130 BoogieDeclarations]: Found specification of procedure dev_kfree_skb_irq [2021-12-14 19:10:35,696 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_kfree_skb_irq [2021-12-14 19:10:35,696 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2021-12-14 19:10:35,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2021-12-14 19:10:35,696 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_alloc_urb [2021-12-14 19:10:35,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_alloc_urb [2021-12-14 19:10:35,696 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2021-12-14 19:10:35,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2021-12-14 19:10:35,696 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2021-12-14 19:10:35,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2021-12-14 19:10:35,697 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2021-12-14 19:10:35,697 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2021-12-14 19:10:35,697 INFO L130 BoogieDeclarations]: Found specification of procedure kaweth_set_rx_mode [2021-12-14 19:10:35,697 INFO L138 BoogieDeclarations]: Found implementation of procedure kaweth_set_rx_mode [2021-12-14 19:10:35,697 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2021-12-14 19:10:35,697 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2021-12-14 19:10:35,697 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2021-12-14 19:10:35,697 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2021-12-14 19:10:35,697 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2021-12-14 19:10:35,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2021-12-14 19:10:35,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-14 19:10:35,698 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2021-12-14 19:10:35,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2021-12-14 19:10:35,698 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2021-12-14 19:10:35,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2021-12-14 19:10:35,698 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2021-12-14 19:10:35,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2021-12-14 19:10:35,698 INFO L130 BoogieDeclarations]: Found specification of procedure kaweth_resubmit_int_urb [2021-12-14 19:10:35,698 INFO L138 BoogieDeclarations]: Found implementation of procedure kaweth_resubmit_int_urb [2021-12-14 19:10:35,698 INFO L130 BoogieDeclarations]: Found specification of procedure kaweth_control [2021-12-14 19:10:35,698 INFO L138 BoogieDeclarations]: Found implementation of procedure kaweth_control [2021-12-14 19:10:35,699 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2021-12-14 19:10:35,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2021-12-14 19:10:35,699 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2021-12-14 19:10:35,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2021-12-14 19:10:35,699 INFO L130 BoogieDeclarations]: Found specification of procedure delayed_work_timer_fn [2021-12-14 19:10:35,699 INFO L130 BoogieDeclarations]: Found specification of procedure kaweth_kill_urbs [2021-12-14 19:10:35,699 INFO L138 BoogieDeclarations]: Found implementation of procedure kaweth_kill_urbs [2021-12-14 19:10:35,699 INFO L130 BoogieDeclarations]: Found specification of procedure kaweth_disconnect [2021-12-14 19:10:35,699 INFO L138 BoogieDeclarations]: Found implementation of procedure kaweth_disconnect [2021-12-14 19:10:35,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 19:10:35,699 INFO L130 BoogieDeclarations]: Found specification of procedure preempt_count [2021-12-14 19:10:35,700 INFO L138 BoogieDeclarations]: Found implementation of procedure preempt_count [2021-12-14 19:10:36,212 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 19:10:36,214 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 19:10:36,310 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2021-12-14 19:10:41,448 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 19:10:41,467 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 19:10:41,467 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-14 19:10:41,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:10:41 BoogieIcfgContainer [2021-12-14 19:10:41,471 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 19:10:41,472 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 19:10:41,472 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 19:10:41,475 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 19:10:41,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 07:10:31" (1/3) ... [2021-12-14 19:10:41,476 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75728045 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:10:41, skipping insertion in model container [2021-12-14 19:10:41,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:10:35" (2/3) ... [2021-12-14 19:10:41,476 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75728045 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:10:41, skipping insertion in model container [2021-12-14 19:10:41,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:10:41" (3/3) ... [2021-12-14 19:10:41,478 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i [2021-12-14 19:10:41,482 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 19:10:41,483 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 29 error locations. [2021-12-14 19:10:41,532 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 19:10:41,547 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-14 19:10:41,547 INFO L340 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2021-12-14 19:10:41,579 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-14 19:10:41,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-12-14 19:10:41,585 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:10:41,586 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-14 19:10:41,586 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-14 19:10:41,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:10:41,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1445783568, now seen corresponding path program 1 times [2021-12-14 19:10:41,595 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:10:41,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678422991] [2021-12-14 19:10:41,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:10:41,596 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:10:41,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:42,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:10:42,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:42,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:10:42,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:42,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 19:10:42,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:42,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 19:10:42,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:42,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 19:10:42,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:42,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 19:10:42,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:42,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 19:10:42,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:42,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:10:42,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:42,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-14 19:10:42,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:42,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-14 19:10:42,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:42,331 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-14 19:10:42,332 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:10:42,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678422991] [2021-12-14 19:10:42,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678422991] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:10:42,333 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:10:42,333 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:10:42,334 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717827048] [2021-12-14 19:10:42,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:10:42,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:10:42,338 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:10:42,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:10:42,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:10:42,362 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-14 19:10:44,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:10:44,732 INFO L93 Difference]: Finished difference Result 2297 states and 3120 transitions. [2021-12-14 19:10:44,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:10:44,734 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-14 19:10:44,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:10:44,749 INFO L225 Difference]: With dead ends: 2297 [2021-12-14 19:10:44,749 INFO L226 Difference]: Without dead ends: 1183 [2021-12-14 19:10:44,761 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:10:44,763 INFO L933 BasicCegarLoop]: 1432 mSDtfsCounter, 2179 mSDsluCounter, 1717 mSDsCounter, 0 mSdLazyCounter, 1131 mSolverCounterSat, 1024 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2361 SdHoareTripleChecker+Valid, 3149 SdHoareTripleChecker+Invalid, 2155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1024 IncrementalHoareTripleChecker+Valid, 1131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:10:44,763 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2361 Valid, 3149 Invalid, 2155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1024 Valid, 1131 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2021-12-14 19:10:44,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2021-12-14 19:10:44,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1183. [2021-12-14 19:10:44,851 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-14 19:10:44,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1524 transitions. [2021-12-14 19:10:44,861 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1524 transitions. Word has length 71 [2021-12-14 19:10:44,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:10:44,863 INFO L470 AbstractCegarLoop]: Abstraction has 1183 states and 1524 transitions. [2021-12-14 19:10:44,863 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-14 19:10:44,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1524 transitions. [2021-12-14 19:10:44,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-12-14 19:10:44,865 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:10:44,865 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-14 19:10:44,866 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 19:10:44,866 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-14 19:10:44,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:10:44,866 INFO L85 PathProgramCache]: Analyzing trace with hash -559581025, now seen corresponding path program 1 times [2021-12-14 19:10:44,867 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:10:44,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890283989] [2021-12-14 19:10:44,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:10:44,867 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:10:44,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:45,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:10:45,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:45,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:10:45,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:45,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 19:10:45,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:45,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 19:10:45,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:45,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 19:10:45,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:45,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 19:10:45,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:45,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 19:10:45,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:45,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:10:45,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:45,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-14 19:10:45,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:45,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-14 19:10:45,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:45,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-14 19:10:45,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:45,266 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-14 19:10:45,267 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:10:45,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890283989] [2021-12-14 19:10:45,267 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890283989] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:10:45,267 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:10:45,267 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:10:45,267 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526439912] [2021-12-14 19:10:45,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:10:45,269 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:10:45,269 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:10:45,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:10:45,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:10:45,269 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-14 19:10:48,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:10:48,145 INFO L93 Difference]: Finished difference Result 1183 states and 1524 transitions. [2021-12-14 19:10:48,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:10:48,145 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-14 19:10:48,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:10:48,153 INFO L225 Difference]: With dead ends: 1183 [2021-12-14 19:10:48,154 INFO L226 Difference]: Without dead ends: 1181 [2021-12-14 19:10:48,155 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-14 19:10:48,158 INFO L933 BasicCegarLoop]: 1414 mSDtfsCounter, 2147 mSDsluCounter, 1699 mSDsCounter, 0 mSdLazyCounter, 1119 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2326 SdHoareTripleChecker+Valid, 3113 SdHoareTripleChecker+Invalid, 2135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 1119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2021-12-14 19:10:48,158 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2326 Valid, 3113 Invalid, 2135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 1119 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2021-12-14 19:10:48,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2021-12-14 19:10:48,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 1181. [2021-12-14 19:10:48,212 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-14 19:10:48,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 1181 states and 1522 transitions. [2021-12-14 19:10:48,221 INFO L78 Accepts]: Start accepts. Automaton has 1181 states and 1522 transitions. Word has length 77 [2021-12-14 19:10:48,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:10:48,223 INFO L470 AbstractCegarLoop]: Abstraction has 1181 states and 1522 transitions. [2021-12-14 19:10:48,223 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-14 19:10:48,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1181 states and 1522 transitions. [2021-12-14 19:10:48,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-12-14 19:10:48,227 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:10:48,228 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-14 19:10:48,228 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 19:10:48,228 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-14 19:10:48,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:10:48,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1865614216, now seen corresponding path program 1 times [2021-12-14 19:10:48,229 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:10:48,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869860950] [2021-12-14 19:10:48,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:10:48,229 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:10:48,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:48,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:10:48,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:48,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:10:48,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:48,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 19:10:48,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:48,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 19:10:48,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:48,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 19:10:48,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:48,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 19:10:48,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:48,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 19:10:48,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:48,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:10:48,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:48,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-14 19:10:48,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:48,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-14 19:10:48,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:48,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-14 19:10:48,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:48,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 19:10:48,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:48,639 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-14 19:10:48,639 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:10:48,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869860950] [2021-12-14 19:10:48,640 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869860950] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:10:48,640 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:10:48,640 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:10:48,640 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502725447] [2021-12-14 19:10:48,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:10:48,641 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:10:48,641 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:10:48,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:10:48,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:10:48,642 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-14 19:10:51,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:10:51,056 INFO L93 Difference]: Finished difference Result 1181 states and 1522 transitions. [2021-12-14 19:10:51,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:10:51,056 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-14 19:10:51,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:10:51,062 INFO L225 Difference]: With dead ends: 1181 [2021-12-14 19:10:51,062 INFO L226 Difference]: Without dead ends: 1179 [2021-12-14 19:10:51,063 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-14 19:10:51,065 INFO L933 BasicCegarLoop]: 1412 mSDtfsCounter, 2141 mSDsluCounter, 1699 mSDsCounter, 0 mSdLazyCounter, 1117 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2319 SdHoareTripleChecker+Valid, 3111 SdHoareTripleChecker+Invalid, 2133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 1117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:10:51,067 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2319 Valid, 3111 Invalid, 2133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 1117 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2021-12-14 19:10:51,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2021-12-14 19:10:51,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 1179. [2021-12-14 19:10:51,102 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-14 19:10:51,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1179 states to 1179 states and 1520 transitions. [2021-12-14 19:10:51,108 INFO L78 Accepts]: Start accepts. Automaton has 1179 states and 1520 transitions. Word has length 83 [2021-12-14 19:10:51,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:10:51,110 INFO L470 AbstractCegarLoop]: Abstraction has 1179 states and 1520 transitions. [2021-12-14 19:10:51,110 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-14 19:10:51,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1520 transitions. [2021-12-14 19:10:51,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-12-14 19:10:51,112 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:10:51,112 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-14 19:10:51,112 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-14 19:10:51,112 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-14 19:10:51,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:10:51,113 INFO L85 PathProgramCache]: Analyzing trace with hash -2110063066, now seen corresponding path program 1 times [2021-12-14 19:10:51,113 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:10:51,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184229533] [2021-12-14 19:10:51,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:10:51,113 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:10:51,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:51,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:10:51,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:51,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:10:51,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:51,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 19:10:51,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:51,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 19:10:51,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:51,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 19:10:51,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:51,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 19:10:51,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:51,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 19:10:51,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:51,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:10:51,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:51,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-14 19:10:51,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:51,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-14 19:10:51,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:51,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-14 19:10:51,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:51,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 19:10:51,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:51,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-14 19:10:51,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:51,457 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-14 19:10:51,457 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:10:51,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184229533] [2021-12-14 19:10:51,457 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184229533] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:10:51,457 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:10:51,457 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:10:51,458 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146999069] [2021-12-14 19:10:51,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:10:51,459 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:10:51,459 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:10:51,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:10:51,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:10:51,459 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-14 19:10:53,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:10:53,635 INFO L93 Difference]: Finished difference Result 1179 states and 1520 transitions. [2021-12-14 19:10:53,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:10:53,635 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-14 19:10:53,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:10:53,643 INFO L225 Difference]: With dead ends: 1179 [2021-12-14 19:10:53,643 INFO L226 Difference]: Without dead ends: 1177 [2021-12-14 19:10:53,644 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-14 19:10:53,645 INFO L933 BasicCegarLoop]: 1410 mSDtfsCounter, 2135 mSDsluCounter, 1699 mSDsCounter, 0 mSdLazyCounter, 1115 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2312 SdHoareTripleChecker+Valid, 3109 SdHoareTripleChecker+Invalid, 2131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 1115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:10:53,646 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2312 Valid, 3109 Invalid, 2131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 1115 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2021-12-14 19:10:53,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2021-12-14 19:10:53,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 1177. [2021-12-14 19:10:53,679 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-14 19:10:53,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1518 transitions. [2021-12-14 19:10:53,684 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1518 transitions. Word has length 89 [2021-12-14 19:10:53,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:10:53,685 INFO L470 AbstractCegarLoop]: Abstraction has 1177 states and 1518 transitions. [2021-12-14 19:10:53,685 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-14 19:10:53,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1518 transitions. [2021-12-14 19:10:53,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-12-14 19:10:53,690 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:10:53,690 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-14 19:10:53,690 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-14 19:10:53,691 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-14 19:10:53,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:10:53,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1926875297, now seen corresponding path program 1 times [2021-12-14 19:10:53,691 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:10:53,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722825403] [2021-12-14 19:10:53,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:10:53,692 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:10:53,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:53,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:10:53,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:53,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:10:53,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:53,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 19:10:53,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:53,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 19:10:53,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:53,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 19:10:53,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:54,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 19:10:54,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:54,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 19:10:54,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:54,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:10:54,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:54,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-14 19:10:54,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:54,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-14 19:10:54,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:54,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-14 19:10:54,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:54,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 19:10:54,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:54,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-14 19:10:54,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:54,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-14 19:10:54,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:54,064 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-14 19:10:54,065 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:10:54,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722825403] [2021-12-14 19:10:54,065 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722825403] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:10:54,065 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:10:54,065 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:10:54,065 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126254061] [2021-12-14 19:10:54,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:10:54,066 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:10:54,066 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:10:54,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:10:54,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:10:54,067 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-14 19:10:56,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:10:56,307 INFO L93 Difference]: Finished difference Result 1177 states and 1518 transitions. [2021-12-14 19:10:56,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:10:56,307 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-14 19:10:56,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:10:56,312 INFO L225 Difference]: With dead ends: 1177 [2021-12-14 19:10:56,312 INFO L226 Difference]: Without dead ends: 1175 [2021-12-14 19:10:56,313 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-14 19:10:56,313 INFO L933 BasicCegarLoop]: 1408 mSDtfsCounter, 2129 mSDsluCounter, 1699 mSDsCounter, 0 mSdLazyCounter, 1113 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2305 SdHoareTripleChecker+Valid, 3107 SdHoareTripleChecker+Invalid, 2129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 1113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:10:56,314 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2305 Valid, 3107 Invalid, 2129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 1113 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2021-12-14 19:10:56,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2021-12-14 19:10:56,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 1175. [2021-12-14 19:10:56,346 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-14 19:10:56,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1175 states to 1175 states and 1516 transitions. [2021-12-14 19:10:56,351 INFO L78 Accepts]: Start accepts. Automaton has 1175 states and 1516 transitions. Word has length 95 [2021-12-14 19:10:56,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:10:56,352 INFO L470 AbstractCegarLoop]: Abstraction has 1175 states and 1516 transitions. [2021-12-14 19:10:56,352 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-14 19:10:56,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1516 transitions. [2021-12-14 19:10:56,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-12-14 19:10:56,354 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:10:56,354 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-14 19:10:56,354 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-14 19:10:56,354 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-14 19:10:56,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:10:56,355 INFO L85 PathProgramCache]: Analyzing trace with hash -2113908543, now seen corresponding path program 1 times [2021-12-14 19:10:56,355 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:10:56,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388540065] [2021-12-14 19:10:56,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:10:56,355 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:10:56,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:56,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:10:56,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:56,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:10:56,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:56,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 19:10:56,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:56,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 19:10:56,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:56,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 19:10:56,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:56,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 19:10:56,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:56,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 19:10:56,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:56,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:10:56,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:56,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-14 19:10:56,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:56,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-14 19:10:56,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:56,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-14 19:10:56,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:56,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 19:10:56,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:56,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-14 19:10:56,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:56,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-14 19:10:56,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:56,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-14 19:10:56,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:56,667 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-14 19:10:56,668 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:10:56,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388540065] [2021-12-14 19:10:56,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388540065] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:10:56,668 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:10:56,668 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:10:56,668 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975285893] [2021-12-14 19:10:56,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:10:56,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:10:56,669 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:10:56,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:10:56,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:10:56,670 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-14 19:10:59,057 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-14 19:11:00,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:11:00,302 INFO L93 Difference]: Finished difference Result 1175 states and 1516 transitions. [2021-12-14 19:11:00,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:11:00,302 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-14 19:11:00,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:11:00,307 INFO L225 Difference]: With dead ends: 1175 [2021-12-14 19:11:00,308 INFO L226 Difference]: Without dead ends: 1173 [2021-12-14 19:11:00,308 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-14 19:11:00,309 INFO L933 BasicCegarLoop]: 1406 mSDtfsCounter, 2123 mSDsluCounter, 1699 mSDsCounter, 0 mSdLazyCounter, 1111 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2298 SdHoareTripleChecker+Valid, 3105 SdHoareTripleChecker+Invalid, 2127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 1111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2021-12-14 19:11:00,309 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2298 Valid, 3105 Invalid, 2127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 1111 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2021-12-14 19:11:00,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2021-12-14 19:11:00,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 1173. [2021-12-14 19:11:00,342 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-14 19:11:00,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1514 transitions. [2021-12-14 19:11:00,347 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 1514 transitions. Word has length 101 [2021-12-14 19:11:00,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:11:00,347 INFO L470 AbstractCegarLoop]: Abstraction has 1173 states and 1514 transitions. [2021-12-14 19:11:00,348 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-14 19:11:00,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1514 transitions. [2021-12-14 19:11:00,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-12-14 19:11:00,349 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:11:00,349 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-14 19:11:00,349 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-14 19:11:00,349 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-14 19:11:00,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:11:00,349 INFO L85 PathProgramCache]: Analyzing trace with hash -792552921, now seen corresponding path program 1 times [2021-12-14 19:11:00,350 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:11:00,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38940307] [2021-12-14 19:11:00,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:11:00,350 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:11:00,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:00,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:11:00,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:00,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:11:00,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:00,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 19:11:00,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:00,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 19:11:00,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:00,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 19:11:00,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:00,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 19:11:00,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:00,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 19:11:00,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:00,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:11:00,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:00,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-14 19:11:00,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:00,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-14 19:11:00,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:00,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-14 19:11:00,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:00,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 19:11:00,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:00,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-14 19:11:00,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:00,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-14 19:11:00,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:00,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-14 19:11:00,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:00,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-14 19:11:00,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:00,688 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-14 19:11:00,688 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:11:00,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38940307] [2021-12-14 19:11:00,689 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38940307] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:11:00,689 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:11:00,689 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:11:00,689 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584211305] [2021-12-14 19:11:00,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:11:00,690 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:11:00,690 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:11:00,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:11:00,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:11:00,690 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-14 19:11:02,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:11:02,827 INFO L93 Difference]: Finished difference Result 1173 states and 1514 transitions. [2021-12-14 19:11:02,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:11:02,828 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-14 19:11:02,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:11:02,833 INFO L225 Difference]: With dead ends: 1173 [2021-12-14 19:11:02,833 INFO L226 Difference]: Without dead ends: 1171 [2021-12-14 19:11:02,834 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-14 19:11:02,834 INFO L933 BasicCegarLoop]: 1404 mSDtfsCounter, 2117 mSDsluCounter, 1699 mSDsCounter, 0 mSdLazyCounter, 1109 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2291 SdHoareTripleChecker+Valid, 3103 SdHoareTripleChecker+Invalid, 2125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 1109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:11:02,834 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2291 Valid, 3103 Invalid, 2125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 1109 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2021-12-14 19:11:02,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2021-12-14 19:11:02,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 1171. [2021-12-14 19:11:02,876 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-14 19:11:02,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1171 states to 1171 states and 1512 transitions. [2021-12-14 19:11:02,881 INFO L78 Accepts]: Start accepts. Automaton has 1171 states and 1512 transitions. Word has length 107 [2021-12-14 19:11:02,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:11:02,881 INFO L470 AbstractCegarLoop]: Abstraction has 1171 states and 1512 transitions. [2021-12-14 19:11:02,881 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-14 19:11:02,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 1512 transitions. [2021-12-14 19:11:02,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-12-14 19:11:02,882 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:11:02,883 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-14 19:11:02,883 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-14 19:11:02,883 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-14 19:11:02,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:11:02,883 INFO L85 PathProgramCache]: Analyzing trace with hash 254667010, now seen corresponding path program 1 times [2021-12-14 19:11:02,883 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:11:02,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101333596] [2021-12-14 19:11:02,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:11:02,884 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:11:02,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:03,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:11:03,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:03,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:11:03,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:03,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 19:11:03,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:03,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 19:11:03,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:03,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 19:11:03,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:03,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 19:11:03,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:03,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 19:11:03,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:03,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:11:03,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:03,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-14 19:11:03,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:03,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-14 19:11:03,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:03,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-14 19:11:03,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:03,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 19:11:03,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:03,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-14 19:11:03,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:03,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-14 19:11:03,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:03,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-14 19:11:03,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:03,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-14 19:11:03,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:03,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-14 19:11:03,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:03,221 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-14 19:11:03,221 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:11:03,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101333596] [2021-12-14 19:11:03,221 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101333596] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:11:03,222 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:11:03,222 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:11:03,222 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003266408] [2021-12-14 19:11:03,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:11:03,222 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:11:03,222 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:11:03,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:11:03,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:11:03,223 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-14 19:11:05,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:11:05,189 INFO L93 Difference]: Finished difference Result 1171 states and 1512 transitions. [2021-12-14 19:11:05,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:11:05,190 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-14 19:11:05,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:11:05,194 INFO L225 Difference]: With dead ends: 1171 [2021-12-14 19:11:05,195 INFO L226 Difference]: Without dead ends: 1169 [2021-12-14 19:11:05,195 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-14 19:11:05,196 INFO L933 BasicCegarLoop]: 1402 mSDtfsCounter, 2115 mSDsluCounter, 1699 mSDsCounter, 0 mSdLazyCounter, 1103 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2288 SdHoareTripleChecker+Valid, 3101 SdHoareTripleChecker+Invalid, 2119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 1103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-12-14 19:11:05,196 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2288 Valid, 3101 Invalid, 2119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 1103 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2021-12-14 19:11:05,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2021-12-14 19:11:05,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 1169. [2021-12-14 19:11:05,251 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-14 19:11:05,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1169 states to 1169 states and 1510 transitions. [2021-12-14 19:11:05,255 INFO L78 Accepts]: Start accepts. Automaton has 1169 states and 1510 transitions. Word has length 113 [2021-12-14 19:11:05,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:11:05,255 INFO L470 AbstractCegarLoop]: Abstraction has 1169 states and 1510 transitions. [2021-12-14 19:11:05,255 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-14 19:11:05,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 1510 transitions. [2021-12-14 19:11:05,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-12-14 19:11:05,256 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:11:05,257 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-14 19:11:05,257 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-14 19:11:05,257 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-14 19:11:05,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:11:05,257 INFO L85 PathProgramCache]: Analyzing trace with hash -78006587, now seen corresponding path program 1 times [2021-12-14 19:11:05,258 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:11:05,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223713772] [2021-12-14 19:11:05,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:11:05,258 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:11:05,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:05,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:11:05,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:05,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:11:05,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:05,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 19:11:05,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:05,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 19:11:05,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:05,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 19:11:05,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:05,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 19:11:05,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:05,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 19:11:05,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:05,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:11:05,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:05,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-14 19:11:05,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:05,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-14 19:11:05,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:05,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-14 19:11:05,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:05,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 19:11:05,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:05,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-14 19:11:05,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:05,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-14 19:11:05,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:05,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-14 19:11:05,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:05,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-14 19:11:05,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:05,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-14 19:11:05,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:05,568 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-14 19:11:05,568 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:11:05,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223713772] [2021-12-14 19:11:05,569 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223713772] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:11:05,569 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:11:05,569 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:11:05,569 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121344914] [2021-12-14 19:11:05,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:11:05,570 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:11:05,570 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:11:05,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:11:05,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:11:05,571 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-14 19:11:07,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:11:07,594 INFO L93 Difference]: Finished difference Result 1169 states and 1510 transitions. [2021-12-14 19:11:07,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:11:07,595 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-14 19:11:07,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:11:07,600 INFO L225 Difference]: With dead ends: 1169 [2021-12-14 19:11:07,600 INFO L226 Difference]: Without dead ends: 1167 [2021-12-14 19:11:07,601 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-14 19:11:07,601 INFO L933 BasicCegarLoop]: 1400 mSDtfsCounter, 2103 mSDsluCounter, 1699 mSDsCounter, 0 mSdLazyCounter, 1105 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2276 SdHoareTripleChecker+Valid, 3099 SdHoareTripleChecker+Invalid, 2121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 1105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-12-14 19:11:07,602 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2276 Valid, 3099 Invalid, 2121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 1105 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2021-12-14 19:11:07,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2021-12-14 19:11:07,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 1167. [2021-12-14 19:11:07,637 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-14 19:11:07,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1167 states to 1167 states and 1508 transitions. [2021-12-14 19:11:07,641 INFO L78 Accepts]: Start accepts. Automaton has 1167 states and 1508 transitions. Word has length 115 [2021-12-14 19:11:07,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:11:07,642 INFO L470 AbstractCegarLoop]: Abstraction has 1167 states and 1508 transitions. [2021-12-14 19:11:07,642 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-14 19:11:07,642 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 1508 transitions. [2021-12-14 19:11:07,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-12-14 19:11:07,643 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:11:07,643 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-14 19:11:07,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-14 19:11:07,644 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-14 19:11:07,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:11:07,644 INFO L85 PathProgramCache]: Analyzing trace with hash -750920079, now seen corresponding path program 1 times [2021-12-14 19:11:07,644 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:11:07,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757358433] [2021-12-14 19:11:07,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:11:07,645 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:11:07,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:07,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:11:07,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:07,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:11:07,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:07,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 19:11:07,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:07,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 19:11:07,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:07,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 19:11:07,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:07,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 19:11:07,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:07,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 19:11:07,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:07,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:11:07,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:07,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-14 19:11:07,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:07,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-14 19:11:07,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:07,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-14 19:11:07,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:07,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 19:11:07,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:07,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-14 19:11:07,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:07,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-14 19:11:07,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:07,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-14 19:11:07,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:07,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-14 19:11:07,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:07,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-14 19:11:07,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:07,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-14 19:11:07,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:08,004 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-14 19:11:08,005 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:11:08,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757358433] [2021-12-14 19:11:08,005 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757358433] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:11:08,005 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:11:08,005 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:11:08,005 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858999833] [2021-12-14 19:11:08,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:11:08,006 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:11:08,006 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:11:08,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:11:08,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:11:08,006 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-14 19:11:10,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:11:10,686 INFO L93 Difference]: Finished difference Result 1167 states and 1508 transitions. [2021-12-14 19:11:10,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:11:10,687 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-14 19:11:10,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:11:10,691 INFO L225 Difference]: With dead ends: 1167 [2021-12-14 19:11:10,691 INFO L226 Difference]: Without dead ends: 1165 [2021-12-14 19:11:10,692 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-14 19:11:10,693 INFO L933 BasicCegarLoop]: 1398 mSDtfsCounter, 2099 mSDsluCounter, 1699 mSDsCounter, 0 mSdLazyCounter, 1103 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2271 SdHoareTripleChecker+Valid, 3097 SdHoareTripleChecker+Invalid, 2119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 1103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2021-12-14 19:11:10,693 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2271 Valid, 3097 Invalid, 2119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 1103 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2021-12-14 19:11:10,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2021-12-14 19:11:10,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 1165. [2021-12-14 19:11:10,726 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-14 19:11:10,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 1165 states and 1506 transitions. [2021-12-14 19:11:10,730 INFO L78 Accepts]: Start accepts. Automaton has 1165 states and 1506 transitions. Word has length 121 [2021-12-14 19:11:10,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:11:10,730 INFO L470 AbstractCegarLoop]: Abstraction has 1165 states and 1506 transitions. [2021-12-14 19:11:10,731 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-14 19:11:10,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1165 states and 1506 transitions. [2021-12-14 19:11:10,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-12-14 19:11:10,732 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:11:10,732 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-14 19:11:10,732 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-14 19:11:10,732 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-14 19:11:10,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:11:10,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1499616254, now seen corresponding path program 1 times [2021-12-14 19:11:10,733 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:11:10,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205615976] [2021-12-14 19:11:10,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:11:10,733 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:11:10,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:10,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:11:10,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:10,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:11:10,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:10,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 19:11:10,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:10,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 19:11:10,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:10,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 19:11:10,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:10,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 19:11:10,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:10,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 19:11:10,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:10,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:11:10,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:10,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-14 19:11:10,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:10,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-14 19:11:10,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:10,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-14 19:11:10,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:10,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 19:11:10,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:10,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-14 19:11:10,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:10,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-14 19:11:10,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:10,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-14 19:11:10,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:10,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-14 19:11:10,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:11,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-14 19:11:11,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:11,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-14 19:11:11,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:11,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-14 19:11:11,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:11,019 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-14 19:11:11,019 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:11:11,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205615976] [2021-12-14 19:11:11,019 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205615976] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:11:11,020 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:11:11,020 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:11:11,020 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785107459] [2021-12-14 19:11:11,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:11:11,020 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:11:11,020 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:11:11,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:11:11,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:11:11,021 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-14 19:11:13,282 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-14 19:11:14,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:11:14,501 INFO L93 Difference]: Finished difference Result 1165 states and 1506 transitions. [2021-12-14 19:11:14,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:11:14,501 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-14 19:11:14,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:11:14,507 INFO L225 Difference]: With dead ends: 1165 [2021-12-14 19:11:14,507 INFO L226 Difference]: Without dead ends: 1163 [2021-12-14 19:11:14,507 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-14 19:11:14,508 INFO L933 BasicCegarLoop]: 1396 mSDtfsCounter, 2093 mSDsluCounter, 1699 mSDsCounter, 0 mSdLazyCounter, 1101 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2264 SdHoareTripleChecker+Valid, 3095 SdHoareTripleChecker+Invalid, 2117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 1101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2021-12-14 19:11:14,508 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2264 Valid, 3095 Invalid, 2117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 1101 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2021-12-14 19:11:14,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2021-12-14 19:11:14,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 1163. [2021-12-14 19:11:14,546 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-14 19:11:14,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 1504 transitions. [2021-12-14 19:11:14,549 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 1504 transitions. Word has length 127 [2021-12-14 19:11:14,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:11:14,550 INFO L470 AbstractCegarLoop]: Abstraction has 1163 states and 1504 transitions. [2021-12-14 19:11:14,550 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-14 19:11:14,550 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1504 transitions. [2021-12-14 19:11:14,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-12-14 19:11:14,551 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:11:14,551 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-14 19:11:14,552 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-14 19:11:14,552 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-14 19:11:14,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:11:14,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1163685789, now seen corresponding path program 1 times [2021-12-14 19:11:14,552 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:11:14,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460859003] [2021-12-14 19:11:14,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:11:14,553 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:11:14,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:14,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:11:14,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:14,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:11:14,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:14,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 19:11:14,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:14,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 19:11:14,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:14,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 19:11:14,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:14,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 19:11:14,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:14,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 19:11:14,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:14,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:11:14,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:14,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-14 19:11:14,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:14,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-14 19:11:14,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:14,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-14 19:11:14,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:14,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 19:11:14,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:14,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-14 19:11:14,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:14,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-14 19:11:14,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:14,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-14 19:11:14,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:14,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-14 19:11:14,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:14,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-14 19:11:14,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:14,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-14 19:11:14,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:14,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-14 19:11:14,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:14,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-12-14 19:11:14,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:14,884 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-14 19:11:14,884 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:11:14,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460859003] [2021-12-14 19:11:14,884 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460859003] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:11:14,885 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:11:14,885 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:11:14,885 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310541227] [2021-12-14 19:11:14,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:11:14,885 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:11:14,885 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:11:14,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:11:14,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:11:14,886 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-14 19:11:17,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:11:17,564 INFO L93 Difference]: Finished difference Result 1163 states and 1504 transitions. [2021-12-14 19:11:17,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:11:17,565 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-14 19:11:17,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:11:17,569 INFO L225 Difference]: With dead ends: 1163 [2021-12-14 19:11:17,569 INFO L226 Difference]: Without dead ends: 1161 [2021-12-14 19:11:17,569 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-14 19:11:17,570 INFO L933 BasicCegarLoop]: 1394 mSDtfsCounter, 2087 mSDsluCounter, 1699 mSDsCounter, 0 mSdLazyCounter, 1099 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2257 SdHoareTripleChecker+Valid, 3093 SdHoareTripleChecker+Invalid, 2115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 1099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2021-12-14 19:11:17,570 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2257 Valid, 3093 Invalid, 2115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 1099 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2021-12-14 19:11:17,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2021-12-14 19:11:17,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 1161. [2021-12-14 19:11:17,605 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-14 19:11:17,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1502 transitions. [2021-12-14 19:11:17,608 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1502 transitions. Word has length 133 [2021-12-14 19:11:17,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:11:17,609 INFO L470 AbstractCegarLoop]: Abstraction has 1161 states and 1502 transitions. [2021-12-14 19:11:17,609 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-14 19:11:17,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1502 transitions. [2021-12-14 19:11:17,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-12-14 19:11:17,610 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:11:17,610 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-14 19:11:17,611 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-14 19:11:17,611 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-14 19:11:17,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:11:17,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1966142052, now seen corresponding path program 1 times [2021-12-14 19:11:17,611 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:11:17,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196266617] [2021-12-14 19:11:17,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:11:17,612 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:11:17,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:17,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:11:17,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:17,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:11:17,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:17,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 19:11:17,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:17,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 19:11:17,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:17,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 19:11:17,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:17,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 19:11:17,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:17,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 19:11:17,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:17,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:11:17,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:17,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-14 19:11:17,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:17,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-14 19:11:17,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:17,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-14 19:11:17,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:17,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 19:11:17,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:17,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-14 19:11:17,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:17,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-14 19:11:17,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:17,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-14 19:11:17,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:17,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-14 19:11:17,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:17,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-14 19:11:17,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:17,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-14 19:11:17,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:17,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-14 19:11:17,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:17,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-12-14 19:11:17,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:17,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-12-14 19:11:17,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:17,908 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-14 19:11:17,908 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:11:17,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196266617] [2021-12-14 19:11:17,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196266617] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:11:17,909 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:11:17,909 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:11:17,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795447964] [2021-12-14 19:11:17,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:11:17,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:11:17,910 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:11:17,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:11:17,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:11:17,910 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-14 19:11:19,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:11:19,833 INFO L93 Difference]: Finished difference Result 1161 states and 1502 transitions. [2021-12-14 19:11:19,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:11:19,834 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-14 19:11:19,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:11:19,838 INFO L225 Difference]: With dead ends: 1161 [2021-12-14 19:11:19,838 INFO L226 Difference]: Without dead ends: 1159 [2021-12-14 19:11:19,839 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-14 19:11:19,839 INFO L933 BasicCegarLoop]: 1392 mSDtfsCounter, 2081 mSDsluCounter, 1699 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2250 SdHoareTripleChecker+Valid, 3091 SdHoareTripleChecker+Invalid, 2113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-12-14 19:11:19,839 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2250 Valid, 3091 Invalid, 2113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2021-12-14 19:11:19,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2021-12-14 19:11:19,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1159. [2021-12-14 19:11:19,916 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-14 19:11:19,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 1500 transitions. [2021-12-14 19:11:19,920 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 1500 transitions. Word has length 139 [2021-12-14 19:11:19,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:11:19,920 INFO L470 AbstractCegarLoop]: Abstraction has 1159 states and 1500 transitions. [2021-12-14 19:11:19,921 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-14 19:11:19,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 1500 transitions. [2021-12-14 19:11:19,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2021-12-14 19:11:19,922 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:11:19,922 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-14 19:11:19,922 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-14 19:11:19,927 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-14 19:11:19,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:11:19,928 INFO L85 PathProgramCache]: Analyzing trace with hash 788971441, now seen corresponding path program 1 times [2021-12-14 19:11:19,928 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:11:19,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498261760] [2021-12-14 19:11:19,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:11:19,928 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:11:20,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:20,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:11:20,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:20,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:11:20,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:20,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 19:11:20,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:20,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 19:11:20,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:20,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 19:11:20,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:20,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 19:11:20,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:20,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 19:11:20,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:20,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:11:20,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:20,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-14 19:11:20,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:20,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-14 19:11:20,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:20,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-14 19:11:20,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:20,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 19:11:20,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:20,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-14 19:11:20,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:20,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-14 19:11:20,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:20,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-14 19:11:20,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:20,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-14 19:11:20,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:20,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-14 19:11:20,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:20,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-14 19:11:20,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:20,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-14 19:11:20,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:20,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-12-14 19:11:20,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:20,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-12-14 19:11:20,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:20,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-12-14 19:11:20,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:20,253 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-14 19:11:20,253 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:11:20,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498261760] [2021-12-14 19:11:20,253 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498261760] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:11:20,253 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:11:20,253 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:11:20,253 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785109850] [2021-12-14 19:11:20,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:11:20,254 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:11:20,254 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:11:20,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:11:20,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:11:20,255 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-14 19:11:22,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:11:22,448 INFO L93 Difference]: Finished difference Result 1159 states and 1500 transitions. [2021-12-14 19:11:22,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:11:22,449 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-14 19:11:22,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:11:22,453 INFO L225 Difference]: With dead ends: 1159 [2021-12-14 19:11:22,454 INFO L226 Difference]: Without dead ends: 1157 [2021-12-14 19:11:22,454 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-14 19:11:22,455 INFO L933 BasicCegarLoop]: 1390 mSDtfsCounter, 2075 mSDsluCounter, 1699 mSDsCounter, 0 mSdLazyCounter, 1095 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2243 SdHoareTripleChecker+Valid, 3089 SdHoareTripleChecker+Invalid, 2111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 1095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:11:22,455 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2243 Valid, 3089 Invalid, 2111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 1095 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2021-12-14 19:11:22,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2021-12-14 19:11:22,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 1157. [2021-12-14 19:11:22,495 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-14 19:11:22,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1498 transitions. [2021-12-14 19:11:22,499 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1498 transitions. Word has length 145 [2021-12-14 19:11:22,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:11:22,499 INFO L470 AbstractCegarLoop]: Abstraction has 1157 states and 1498 transitions. [2021-12-14 19:11:22,499 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-14 19:11:22,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1498 transitions. [2021-12-14 19:11:22,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2021-12-14 19:11:22,501 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:11:22,501 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-14 19:11:22,501 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-14 19:11:22,501 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-14 19:11:22,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:11:22,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1891115065, now seen corresponding path program 1 times [2021-12-14 19:11:22,502 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:11:22,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87835331] [2021-12-14 19:11:22,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:11:22,502 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:11:22,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:22,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:11:22,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:22,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:11:22,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:22,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 19:11:22,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:22,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 19:11:22,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:22,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 19:11:22,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:22,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 19:11:22,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:22,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 19:11:22,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:22,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:11:22,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:22,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-14 19:11:22,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:22,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-14 19:11:22,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:22,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-14 19:11:22,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:22,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 19:11:22,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:22,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-14 19:11:22,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:22,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-14 19:11:22,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:22,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-14 19:11:22,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:22,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-14 19:11:22,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:22,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-14 19:11:22,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:22,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-14 19:11:22,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:22,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-14 19:11:22,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:22,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-12-14 19:11:22,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:22,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-12-14 19:11:22,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:22,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-12-14 19:11:22,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:22,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-14 19:11:22,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:22,846 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-14 19:11:22,846 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:11:22,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87835331] [2021-12-14 19:11:22,847 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87835331] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:11:22,847 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:11:22,847 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:11:22,847 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011814923] [2021-12-14 19:11:22,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:11:22,847 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:11:22,848 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:11:22,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:11:22,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:11:22,848 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-14 19:11:24,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:11:24,719 INFO L93 Difference]: Finished difference Result 1157 states and 1498 transitions. [2021-12-14 19:11:24,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:11:24,720 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-14 19:11:24,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:11:24,724 INFO L225 Difference]: With dead ends: 1157 [2021-12-14 19:11:24,725 INFO L226 Difference]: Without dead ends: 1155 [2021-12-14 19:11:24,725 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-14 19:11:24,726 INFO L933 BasicCegarLoop]: 1388 mSDtfsCounter, 2069 mSDsluCounter, 1699 mSDsCounter, 0 mSdLazyCounter, 1093 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2236 SdHoareTripleChecker+Valid, 3087 SdHoareTripleChecker+Invalid, 2109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 1093 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-12-14 19:11:24,726 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2236 Valid, 3087 Invalid, 2109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 1093 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2021-12-14 19:11:24,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2021-12-14 19:11:24,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 1155. [2021-12-14 19:11:24,768 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-14 19:11:24,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 1496 transitions. [2021-12-14 19:11:24,772 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 1496 transitions. Word has length 151 [2021-12-14 19:11:24,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:11:24,772 INFO L470 AbstractCegarLoop]: Abstraction has 1155 states and 1496 transitions. [2021-12-14 19:11:24,773 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-14 19:11:24,773 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 1496 transitions. [2021-12-14 19:11:24,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-12-14 19:11:24,774 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:11:24,774 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-14 19:11:24,774 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-14 19:11:24,774 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-14 19:11:24,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:11:24,775 INFO L85 PathProgramCache]: Analyzing trace with hash -116230766, now seen corresponding path program 1 times [2021-12-14 19:11:24,775 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:11:24,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626025727] [2021-12-14 19:11:24,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:11:24,775 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:11:24,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:25,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:11:25,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:25,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:11:25,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:25,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 19:11:25,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:25,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 19:11:25,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:25,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 19:11:25,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:25,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 19:11:25,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:25,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 19:11:25,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:25,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:11:25,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:25,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-14 19:11:25,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:25,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-14 19:11:25,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:25,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-14 19:11:25,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:25,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 19:11:25,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:25,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-14 19:11:25,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:25,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-14 19:11:25,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:25,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-14 19:11:25,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:25,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-14 19:11:25,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:25,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-14 19:11:25,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:25,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-14 19:11:25,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:25,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-14 19:11:25,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:25,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-12-14 19:11:25,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:25,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-12-14 19:11:25,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:25,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-12-14 19:11:25,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:25,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-14 19:11:25,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:25,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2021-12-14 19:11:25,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:25,147 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-14 19:11:25,148 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:11:25,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626025727] [2021-12-14 19:11:25,149 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626025727] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:11:25,149 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:11:25,149 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:11:25,150 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962683194] [2021-12-14 19:11:25,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:11:25,150 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:11:25,150 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:11:25,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:11:25,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:11:25,151 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-14 19:11:27,282 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-14 19:11:28,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:11:28,485 INFO L93 Difference]: Finished difference Result 1155 states and 1496 transitions. [2021-12-14 19:11:28,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:11:28,486 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-14 19:11:28,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:11:28,491 INFO L225 Difference]: With dead ends: 1155 [2021-12-14 19:11:28,491 INFO L226 Difference]: Without dead ends: 1153 [2021-12-14 19:11:28,491 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-14 19:11:28,492 INFO L933 BasicCegarLoop]: 1386 mSDtfsCounter, 2063 mSDsluCounter, 1699 mSDsCounter, 0 mSdLazyCounter, 1091 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2229 SdHoareTripleChecker+Valid, 3085 SdHoareTripleChecker+Invalid, 2107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 1091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:11:28,492 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2229 Valid, 3085 Invalid, 2107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 1091 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2021-12-14 19:11:28,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2021-12-14 19:11:28,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 1153. [2021-12-14 19:11:28,537 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-14 19:11:28,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1494 transitions. [2021-12-14 19:11:28,541 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1494 transitions. Word has length 157 [2021-12-14 19:11:28,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:11:28,542 INFO L470 AbstractCegarLoop]: Abstraction has 1153 states and 1494 transitions. [2021-12-14 19:11:28,542 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-14 19:11:28,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1494 transitions. [2021-12-14 19:11:28,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2021-12-14 19:11:28,543 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:11:28,544 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-14 19:11:28,544 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-14 19:11:28,544 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-14 19:11:28,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:11:28,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1609989482, now seen corresponding path program 1 times [2021-12-14 19:11:28,544 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:11:28,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019248015] [2021-12-14 19:11:28,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:11:28,545 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:11:28,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:28,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:11:28,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:28,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:11:28,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:28,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 19:11:28,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:28,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 19:11:28,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:28,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-14 19:11:28,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:28,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:11:28,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:28,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:11:28,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:28,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 19:11:28,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:28,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-14 19:11:28,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:28,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:11:28,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:28,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:11:28,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:28,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 19:11:28,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:28,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-14 19:11:28,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:28,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:11:29,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:29,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:11:29,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:29,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 19:11:29,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:29,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-14 19:11:29,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:29,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:11:29,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:29,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:11:29,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:29,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 19:11:29,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:29,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-14 19:11:29,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:29,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:11:29,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:29,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:11:29,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:29,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 19:11:29,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:29,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-12-14 19:11:29,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:29,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-14 19:11:29,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:29,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-12-14 19:11:29,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:29,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-12-14 19:11:29,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:29,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2021-12-14 19:11:29,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:29,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2021-12-14 19:11:29,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:29,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:11:29,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:29,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2021-12-14 19:11:29,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:11:29,124 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-14 19:11:29,124 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:11:29,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019248015] [2021-12-14 19:11:29,124 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019248015] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:11:29,125 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:11:29,125 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:11:29,125 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805573218] [2021-12-14 19:11:29,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:11:29,126 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:11:29,126 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:11:29,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:11:29,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:11:29,127 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)