./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0f8a17c6 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 6fbcf05da5228307460c10a1ab2d8431ff74359811f7e2c9b55e8eaa9db8f14c --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-17 13:13:02,775 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-17 13:13:02,777 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-17 13:13:02,831 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-17 13:13:02,831 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-17 13:13:02,835 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-17 13:13:02,836 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-17 13:13:02,838 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-17 13:13:02,840 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-17 13:13:02,845 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-17 13:13:02,845 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-17 13:13:02,847 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-17 13:13:02,847 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-17 13:13:02,849 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-17 13:13:02,851 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-17 13:13:02,854 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-17 13:13:02,855 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-17 13:13:02,856 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-17 13:13:02,858 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-17 13:13:02,860 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-17 13:13:02,863 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-17 13:13:02,864 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-17 13:13:02,866 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-17 13:13:02,867 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-17 13:13:02,875 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-17 13:13:02,875 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-17 13:13:02,876 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-17 13:13:02,877 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-17 13:13:02,878 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-17 13:13:02,879 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-17 13:13:02,879 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-17 13:13:02,880 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-17 13:13:02,881 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-17 13:13:02,882 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-17 13:13:02,884 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-17 13:13:02,884 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-17 13:13:02,884 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-17 13:13:02,885 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-17 13:13:02,885 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-17 13:13:02,886 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-17 13:13:02,886 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-17 13:13:02,888 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-17 13:13:02,920 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-17 13:13:02,920 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-17 13:13:02,921 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-17 13:13:02,921 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-17 13:13:02,922 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-17 13:13:02,922 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-17 13:13:02,923 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-17 13:13:02,923 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-17 13:13:02,923 INFO L138 SettingsManager]: * Use SBE=true [2021-11-17 13:13:02,923 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-17 13:13:02,924 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-17 13:13:02,924 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-17 13:13:02,924 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-17 13:13:02,925 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-17 13:13:02,925 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-17 13:13:02,925 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-17 13:13:02,925 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-17 13:13:02,925 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-17 13:13:02,925 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-17 13:13:02,926 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-17 13:13:02,926 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-17 13:13:02,926 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-17 13:13:02,926 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-17 13:13:02,926 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-17 13:13:02,927 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-17 13:13:02,927 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-17 13:13:02,927 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-17 13:13:02,928 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-17 13:13:02,928 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-17 13:13:02,929 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-17 13:13:02,929 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-17 13:13:02,929 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6fbcf05da5228307460c10a1ab2d8431ff74359811f7e2c9b55e8eaa9db8f14c [2021-11-17 13:13:03,184 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-17 13:13:03,216 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-17 13:13:03,219 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-17 13:13:03,220 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-17 13:13:03,221 INFO L275 PluginConnector]: CDTParser initialized [2021-11-17 13:13:03,222 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i [2021-11-17 13:13:03,288 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/710b9060e/5dc879e9fee14f3cbbf33c6e04ea2140/FLAG609092684 [2021-11-17 13:13:04,046 INFO L306 CDTParser]: Found 1 translation units. [2021-11-17 13:13:04,048 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i [2021-11-17 13:13:04,106 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/710b9060e/5dc879e9fee14f3cbbf33c6e04ea2140/FLAG609092684 [2021-11-17 13:13:04,591 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/710b9060e/5dc879e9fee14f3cbbf33c6e04ea2140 [2021-11-17 13:13:04,594 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-17 13:13:04,596 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-17 13:13:04,597 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-17 13:13:04,598 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-17 13:13:04,600 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-17 13:13:04,601 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 01:13:04" (1/1) ... [2021-11-17 13:13:04,602 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64ca6c2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:13:04, skipping insertion in model container [2021-11-17 13:13:04,602 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 01:13:04" (1/1) ... [2021-11-17 13:13:04,607 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-17 13:13:04,749 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-17 13:13:07,635 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[307309,307322] [2021-11-17 13:13:07,639 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[307454,307467] [2021-11-17 13:13:07,640 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[307600,307613] [2021-11-17 13:13:07,641 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[307765,307778] [2021-11-17 13:13:07,641 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[307923,307936] [2021-11-17 13:13:07,647 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308081,308094] [2021-11-17 13:13:07,648 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308239,308252] [2021-11-17 13:13:07,649 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308399,308412] [2021-11-17 13:13:07,649 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308558,308571] [2021-11-17 13:13:07,650 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308697,308710] [2021-11-17 13:13:07,650 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308839,308852] [2021-11-17 13:13:07,655 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308988,309001] [2021-11-17 13:13:07,656 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[309127,309140] [2021-11-17 13:13:07,657 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[309282,309295] [2021-11-17 13:13:07,657 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[309442,309455] [2021-11-17 13:13:07,657 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[309593,309606] [2021-11-17 13:13:07,658 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[309744,309757] [2021-11-17 13:13:07,658 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[309896,309909] [2021-11-17 13:13:07,661 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310045,310058] [2021-11-17 13:13:07,661 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310193,310206] [2021-11-17 13:13:07,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--usb--class--cdc-wdm.ko.cil.i[310350,310363] [2021-11-17 13:13:07,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--usb--class--cdc-wdm.ko.cil.i[310499,310512] [2021-11-17 13:13:07,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--usb--class--cdc-wdm.ko.cil.i[310655,310668] [2021-11-17 13:13:07,663 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310808,310821] [2021-11-17 13:13:07,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--usb--class--cdc-wdm.ko.cil.i[310954,310967] [2021-11-17 13:13:07,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--usb--class--cdc-wdm.ko.cil.i[311097,311110] [2021-11-17 13:13:07,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--usb--class--cdc-wdm.ko.cil.i[311249,311262] [2021-11-17 13:13:07,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--usb--class--cdc-wdm.ko.cil.i[311395,311408] [2021-11-17 13:13:07,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--usb--class--cdc-wdm.ko.cil.i[311540,311553] [2021-11-17 13:13:07,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--usb--class--cdc-wdm.ko.cil.i[311694,311707] [2021-11-17 13:13:07,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--usb--class--cdc-wdm.ko.cil.i[311845,311858] [2021-11-17 13:13:07,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--usb--class--cdc-wdm.ko.cil.i[312000,312013] [2021-11-17 13:13:07,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--usb--class--cdc-wdm.ko.cil.i[312152,312165] [2021-11-17 13:13:07,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--usb--class--cdc-wdm.ko.cil.i[312307,312320] [2021-11-17 13:13:07,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--usb--class--cdc-wdm.ko.cil.i[312471,312484] [2021-11-17 13:13:07,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--usb--class--cdc-wdm.ko.cil.i[312627,312640] [2021-11-17 13:13:07,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--usb--class--cdc-wdm.ko.cil.i[312791,312804] [2021-11-17 13:13:07,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--usb--class--cdc-wdm.ko.cil.i[312933,312946] [2021-11-17 13:13:07,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--usb--class--cdc-wdm.ko.cil.i[313091,313104] [2021-11-17 13:13:07,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--usb--class--cdc-wdm.ko.cil.i[313258,313271] [2021-11-17 13:13:07,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--usb--class--cdc-wdm.ko.cil.i[313417,313430] [2021-11-17 13:13:07,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--usb--class--cdc-wdm.ko.cil.i[313576,313589] [2021-11-17 13:13:07,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--usb--class--cdc-wdm.ko.cil.i[313725,313738] [2021-11-17 13:13:07,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--usb--class--cdc-wdm.ko.cil.i[313872,313885] [2021-11-17 13:13:07,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--usb--class--cdc-wdm.ko.cil.i[314011,314024] [2021-11-17 13:13:07,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--usb--class--cdc-wdm.ko.cil.i[314174,314187] [2021-11-17 13:13:07,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--usb--class--cdc-wdm.ko.cil.i[314340,314353] [2021-11-17 13:13:07,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--usb--class--cdc-wdm.ko.cil.i[314504,314517] [2021-11-17 13:13:07,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--usb--class--cdc-wdm.ko.cil.i[314669,314682] [2021-11-17 13:13:07,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--usb--class--cdc-wdm.ko.cil.i[314834,314847] [2021-11-17 13:13:07,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--usb--class--cdc-wdm.ko.cil.i[315000,315013] [2021-11-17 13:13:07,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--usb--class--cdc-wdm.ko.cil.i[315165,315178] [2021-11-17 13:13:07,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--usb--class--cdc-wdm.ko.cil.i[315332,315345] [2021-11-17 13:13:07,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--usb--class--cdc-wdm.ko.cil.i[315492,315505] [2021-11-17 13:13:07,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--usb--class--cdc-wdm.ko.cil.i[315654,315667] [2021-11-17 13:13:07,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--usb--class--cdc-wdm.ko.cil.i[315813,315826] [2021-11-17 13:13:07,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--usb--class--cdc-wdm.ko.cil.i[315959,315972] [2021-11-17 13:13:07,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--usb--class--cdc-wdm.ko.cil.i[316102,316115] [2021-11-17 13:13:07,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--usb--class--cdc-wdm.ko.cil.i[316246,316259] [2021-11-17 13:13:07,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--usb--class--cdc-wdm.ko.cil.i[316389,316402] [2021-11-17 13:13:07,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--usb--class--cdc-wdm.ko.cil.i[316533,316546] [2021-11-17 13:13:07,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--usb--class--cdc-wdm.ko.cil.i[316674,316687] [2021-11-17 13:13:07,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--usb--class--cdc-wdm.ko.cil.i[316812,316825] [2021-11-17 13:13:07,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--usb--class--cdc-wdm.ko.cil.i[316970,316983] [2021-11-17 13:13:07,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--usb--class--cdc-wdm.ko.cil.i[317129,317142] [2021-11-17 13:13:07,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--usb--class--cdc-wdm.ko.cil.i[317285,317298] [2021-11-17 13:13:07,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--usb--class--cdc-wdm.ko.cil.i[317434,317447] [2021-11-17 13:13:07,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--usb--class--cdc-wdm.ko.cil.i[317586,317599] [2021-11-17 13:13:07,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--usb--class--cdc-wdm.ko.cil.i[317737,317750] [2021-11-17 13:13:07,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--usb--class--cdc-wdm.ko.cil.i[317886,317899] [2021-11-17 13:13:07,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--usb--class--cdc-wdm.ko.cil.i[318038,318051] [2021-11-17 13:13:07,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--usb--class--cdc-wdm.ko.cil.i[318186,318199] [2021-11-17 13:13:07,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--usb--class--cdc-wdm.ko.cil.i[318339,318352] [2021-11-17 13:13:07,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--usb--class--cdc-wdm.ko.cil.i[318490,318503] [2021-11-17 13:13:07,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--usb--class--cdc-wdm.ko.cil.i[318640,318653] [2021-11-17 13:13:07,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--usb--class--cdc-wdm.ko.cil.i[318787,318800] [2021-11-17 13:13:07,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--usb--class--cdc-wdm.ko.cil.i[318938,318951] [2021-11-17 13:13:07,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--usb--class--cdc-wdm.ko.cil.i[319089,319102] [2021-11-17 13:13:07,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--usb--class--cdc-wdm.ko.cil.i[319237,319250] [2021-11-17 13:13:07,701 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[319403,319416] [2021-11-17 13:13:07,702 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[319572,319585] [2021-11-17 13:13:07,702 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[319739,319752] [2021-11-17 13:13:07,702 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[319907,319920] [2021-11-17 13:13:07,703 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[320057,320070] [2021-11-17 13:13:07,703 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[320204,320217] [2021-11-17 13:13:07,704 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[320365,320378] [2021-11-17 13:13:07,704 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[320535,320548] [2021-11-17 13:13:07,705 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[320697,320710] [2021-11-17 13:13:07,714 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-17 13:13:07,751 INFO L203 MainTranslator]: Completed pre-run [2021-11-17 13:13:07,984 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[307309,307322] [2021-11-17 13:13:07,986 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[307454,307467] [2021-11-17 13:13:07,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--usb--class--cdc-wdm.ko.cil.i[307600,307613] [2021-11-17 13:13:07,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--usb--class--cdc-wdm.ko.cil.i[307765,307778] [2021-11-17 13:13:07,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--usb--class--cdc-wdm.ko.cil.i[307923,307936] [2021-11-17 13:13:07,992 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308081,308094] [2021-11-17 13:13:07,993 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308239,308252] [2021-11-17 13:13:07,994 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308399,308412] [2021-11-17 13:13:07,994 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308558,308571] [2021-11-17 13:13:07,995 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308697,308710] [2021-11-17 13:13:07,995 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308839,308852] [2021-11-17 13:13:07,996 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308988,309001] [2021-11-17 13:13:07,996 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[309127,309140] [2021-11-17 13:13:07,996 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[309282,309295] [2021-11-17 13:13:07,997 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[309442,309455] [2021-11-17 13:13:07,997 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[309593,309606] [2021-11-17 13:13:07,997 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[309744,309757] [2021-11-17 13:13:07,998 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[309896,309909] [2021-11-17 13:13:07,998 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310045,310058] [2021-11-17 13:13:07,998 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310193,310206] [2021-11-17 13:13:07,999 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310350,310363] [2021-11-17 13:13:07,999 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310499,310512] [2021-11-17 13:13:07,999 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310655,310668] [2021-11-17 13:13:08,001 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310808,310821] [2021-11-17 13:13:08,002 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310954,310967] [2021-11-17 13:13:08,003 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[311097,311110] [2021-11-17 13:13:08,003 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[311249,311262] [2021-11-17 13:13:08,003 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[311395,311408] [2021-11-17 13:13:08,004 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[311540,311553] [2021-11-17 13:13:08,004 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[311694,311707] [2021-11-17 13:13:08,004 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[311845,311858] [2021-11-17 13:13:08,005 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312000,312013] [2021-11-17 13:13:08,005 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312152,312165] [2021-11-17 13:13:08,005 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312307,312320] [2021-11-17 13:13:08,006 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312471,312484] [2021-11-17 13:13:08,007 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312627,312640] [2021-11-17 13:13:08,007 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312791,312804] [2021-11-17 13:13:08,007 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312933,312946] [2021-11-17 13:13:08,008 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[313091,313104] [2021-11-17 13:13:08,008 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[313258,313271] [2021-11-17 13:13:08,010 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[313417,313430] [2021-11-17 13:13:08,010 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[313576,313589] [2021-11-17 13:13:08,011 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[313725,313738] [2021-11-17 13:13:08,011 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[313872,313885] [2021-11-17 13:13:08,012 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[314011,314024] [2021-11-17 13:13:08,012 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[314174,314187] [2021-11-17 13:13:08,012 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[314340,314353] [2021-11-17 13:13:08,016 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[314504,314517] [2021-11-17 13:13:08,018 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[314669,314682] [2021-11-17 13:13:08,018 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[314834,314847] [2021-11-17 13:13:08,019 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315000,315013] [2021-11-17 13:13:08,019 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315165,315178] [2021-11-17 13:13:08,019 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315332,315345] [2021-11-17 13:13:08,020 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315492,315505] [2021-11-17 13:13:08,021 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315654,315667] [2021-11-17 13:13:08,021 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315813,315826] [2021-11-17 13:13:08,022 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315959,315972] [2021-11-17 13:13:08,022 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316102,316115] [2021-11-17 13:13:08,022 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316246,316259] [2021-11-17 13:13:08,023 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316389,316402] [2021-11-17 13:13:08,023 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316533,316546] [2021-11-17 13:13:08,024 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316674,316687] [2021-11-17 13:13:08,025 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316812,316825] [2021-11-17 13:13:08,028 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316970,316983] [2021-11-17 13:13:08,029 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[317129,317142] [2021-11-17 13:13:08,029 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[317285,317298] [2021-11-17 13:13:08,030 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[317434,317447] [2021-11-17 13:13:08,031 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[317586,317599] [2021-11-17 13:13:08,035 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[317737,317750] [2021-11-17 13:13:08,036 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[317886,317899] [2021-11-17 13:13:08,036 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318038,318051] [2021-11-17 13:13:08,037 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318186,318199] [2021-11-17 13:13:08,043 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318339,318352] [2021-11-17 13:13:08,043 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318490,318503] [2021-11-17 13:13:08,044 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318640,318653] [2021-11-17 13:13:08,044 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318787,318800] [2021-11-17 13:13:08,044 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318938,318951] [2021-11-17 13:13:08,044 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[319089,319102] [2021-11-17 13:13:08,046 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[319237,319250] [2021-11-17 13:13:08,046 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[319403,319416] [2021-11-17 13:13:08,047 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[319572,319585] [2021-11-17 13:13:08,047 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[319739,319752] [2021-11-17 13:13:08,048 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[319907,319920] [2021-11-17 13:13:08,048 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[320057,320070] [2021-11-17 13:13:08,048 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[320204,320217] [2021-11-17 13:13:08,049 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[320365,320378] [2021-11-17 13:13:08,049 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[320535,320548] [2021-11-17 13:13:08,049 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[320697,320710] [2021-11-17 13:13:08,052 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-17 13:13:08,227 INFO L208 MainTranslator]: Completed translation [2021-11-17 13:13:08,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:13:08 WrapperNode [2021-11-17 13:13:08,227 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-17 13:13:08,228 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-17 13:13:08,228 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-17 13:13:08,229 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-17 13:13:08,235 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:13:08" (1/1) ... [2021-11-17 13:13:08,317 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:13:08" (1/1) ... [2021-11-17 13:13:08,438 INFO L137 Inliner]: procedures = 592, calls = 1771, calls flagged for inlining = 263, calls inlined = 169, statements flattened = 3159 [2021-11-17 13:13:08,438 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-17 13:13:08,439 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-17 13:13:08,439 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-17 13:13:08,439 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-17 13:13:08,447 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:13:08" (1/1) ... [2021-11-17 13:13:08,447 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:13:08" (1/1) ... [2021-11-17 13:13:08,461 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:13:08" (1/1) ... [2021-11-17 13:13:08,461 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:13:08" (1/1) ... [2021-11-17 13:13:08,542 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:13:08" (1/1) ... [2021-11-17 13:13:08,552 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:13:08" (1/1) ... [2021-11-17 13:13:08,567 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:13:08" (1/1) ... [2021-11-17 13:13:08,599 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-17 13:13:08,600 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-17 13:13:08,600 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-17 13:13:08,600 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-17 13:13:08,601 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:13:08" (1/1) ... [2021-11-17 13:13:08,607 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-17 13:13:08,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 13:13:08,632 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-11-17 13:13:08,661 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-11-17 13:13:08,676 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2021-11-17 13:13:08,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2021-11-17 13:13:08,676 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2021-11-17 13:13:08,677 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2021-11-17 13:13:08,677 INFO L130 BoogieDeclarations]: Found specification of procedure recover_from_urb_loss [2021-11-17 13:13:08,677 INFO L138 BoogieDeclarations]: Found implementation of procedure recover_from_urb_loss [2021-11-17 13:13:08,677 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_control_urb [2021-11-17 13:13:08,677 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_control_urb [2021-11-17 13:13:08,677 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-11-17 13:13:08,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-11-17 13:13:08,677 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2021-11-17 13:13:08,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2021-11-17 13:13:08,678 INFO L130 BoogieDeclarations]: Found specification of procedure __might_sleep [2021-11-17 13:13:08,678 INFO L138 BoogieDeclarations]: Found implementation of procedure __might_sleep [2021-11-17 13:13:08,678 INFO L130 BoogieDeclarations]: Found specification of procedure usb_autopm_get_interface [2021-11-17 13:13:08,678 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_autopm_get_interface [2021-11-17 13:13:08,678 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2021-11-17 13:13:08,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2021-11-17 13:13:08,678 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2021-11-17 13:13:08,679 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2021-11-17 13:13:08,679 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2021-11-17 13:13:08,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2021-11-17 13:13:08,679 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2021-11-17 13:13:08,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2021-11-17 13:13:08,679 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_ioctl [2021-11-17 13:13:08,679 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_ioctl [2021-11-17 13:13:08,680 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2021-11-17 13:13:08,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2021-11-17 13:13:08,680 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_iuspin_of_wdm_device [2021-11-17 13:13:08,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_iuspin_of_wdm_device [2021-11-17 13:13:08,680 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2021-11-17 13:13:08,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2021-11-17 13:13:08,680 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2021-11-17 13:13:08,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2021-11-17 13:13:08,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-17 13:13:08,681 INFO L130 BoogieDeclarations]: Found specification of procedure cancel_work_sync [2021-11-17 13:13:08,681 INFO L138 BoogieDeclarations]: Found implementation of procedure cancel_work_sync [2021-11-17 13:13:08,681 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2021-11-17 13:13:08,681 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2021-11-17 13:13:08,681 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2021-11-17 13:13:08,681 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2021-11-17 13:13:08,681 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2021-11-17 13:13:08,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2021-11-17 13:13:08,682 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2021-11-17 13:13:08,682 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2021-11-17 13:13:08,682 INFO L130 BoogieDeclarations]: Found specification of procedure schedule [2021-11-17 13:13:08,682 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule [2021-11-17 13:13:08,682 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2021-11-17 13:13:08,682 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2021-11-17 13:13:08,682 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~TO~int [2021-11-17 13:13:08,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~TO~int [2021-11-17 13:13:08,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-17 13:13:08,683 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2021-11-17 13:13:08,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2021-11-17 13:13:08,683 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2021-11-17 13:13:08,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2021-11-17 13:13:08,684 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irq_111 [2021-11-17 13:13:08,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irq_111 [2021-11-17 13:13:08,684 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2021-11-17 13:13:08,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2021-11-17 13:13:08,684 INFO L130 BoogieDeclarations]: Found specification of procedure usb_autopm_put_interface [2021-11-17 13:13:08,684 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_autopm_put_interface [2021-11-17 13:13:08,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-17 13:13:08,685 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2021-11-17 13:13:08,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2021-11-17 13:13:08,685 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2021-11-17 13:13:08,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2021-11-17 13:13:08,685 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2021-11-17 13:13:08,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2021-11-17 13:13:08,685 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2021-11-17 13:13:08,685 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2021-11-17 13:13:08,686 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_wlock_of_wdm_device [2021-11-17 13:13:08,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_wlock_of_wdm_device [2021-11-17 13:13:08,689 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2021-11-17 13:13:08,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2021-11-17 13:13:08,689 INFO L130 BoogieDeclarations]: Found specification of procedure kill_urbs [2021-11-17 13:13:08,690 INFO L138 BoogieDeclarations]: Found implementation of procedure kill_urbs [2021-11-17 13:13:08,690 INFO L130 BoogieDeclarations]: Found specification of procedure prepare_to_wait_event [2021-11-17 13:13:08,690 INFO L138 BoogieDeclarations]: Found implementation of procedure prepare_to_wait_event [2021-11-17 13:13:08,690 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2021-11-17 13:13:08,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2021-11-17 13:13:08,691 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2021-11-17 13:13:08,691 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2021-11-17 13:13:08,691 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2021-11-17 13:13:08,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2021-11-17 13:13:08,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-17 13:13:08,692 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_iuspin_of_wdm_device [2021-11-17 13:13:08,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_iuspin_of_wdm_device [2021-11-17 13:13:08,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-17 13:13:08,692 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2021-11-17 13:13:08,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2021-11-17 13:13:08,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-17 13:13:08,692 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2021-11-17 13:13:08,693 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2021-11-17 13:13:08,693 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2021-11-17 13:13:08,693 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2021-11-17 13:13:08,693 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_irq_check_alloc_flags [2021-11-17 13:13:08,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_irq_check_alloc_flags [2021-11-17 13:13:08,693 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2021-11-17 13:13:08,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2021-11-17 13:13:08,693 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_find_device [2021-11-17 13:13:08,694 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_find_device [2021-11-17 13:13:08,694 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2021-11-17 13:13:08,694 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2021-11-17 13:13:08,694 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2021-11-17 13:13:08,694 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2021-11-17 13:13:08,694 INFO L130 BoogieDeclarations]: Found specification of procedure finish_wait [2021-11-17 13:13:08,694 INFO L138 BoogieDeclarations]: Found implementation of procedure finish_wait [2021-11-17 13:13:08,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-17 13:13:08,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-17 13:13:08,695 INFO L130 BoogieDeclarations]: Found specification of procedure usb_translate_errors [2021-11-17 13:13:08,695 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_translate_errors [2021-11-17 13:13:08,695 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2021-11-17 13:13:08,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2021-11-17 13:13:08,695 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2021-11-17 13:13:08,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2021-11-17 13:13:08,695 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_create [2021-11-17 13:13:08,695 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_create [2021-11-17 13:13:08,696 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_128 [2021-11-17 13:13:08,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_128 [2021-11-17 13:13:08,696 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2021-11-17 13:13:08,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2021-11-17 13:13:08,696 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_free_urb [2021-11-17 13:13:08,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_free_urb [2021-11-17 13:13:08,697 INFO L130 BoogieDeclarations]: Found specification of procedure clear_wdm_read_flag [2021-11-17 13:13:08,697 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_wdm_read_flag [2021-11-17 13:13:08,697 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2021-11-17 13:13:08,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2021-11-17 13:13:08,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-17 13:13:08,697 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2021-11-17 13:13:08,698 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2021-11-17 13:13:08,698 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2021-11-17 13:13:08,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2021-11-17 13:13:08,698 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_disconnect [2021-11-17 13:13:08,698 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_disconnect [2021-11-17 13:13:08,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-17 13:13:08,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-17 13:13:08,698 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_wdm_mutex [2021-11-17 13:13:08,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_wdm_mutex [2021-11-17 13:13:08,699 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2021-11-17 13:13:08,699 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2021-11-17 13:13:08,699 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2021-11-17 13:13:08,699 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2021-11-17 13:13:08,699 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2021-11-17 13:13:08,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2021-11-17 13:13:08,699 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_rlock_of_wdm_device [2021-11-17 13:13:08,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_rlock_of_wdm_device [2021-11-17 13:13:08,700 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2021-11-17 13:13:08,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2021-11-17 13:13:08,700 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2021-11-17 13:13:08,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2021-11-17 13:13:08,700 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2021-11-17 13:13:08,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2021-11-17 13:13:08,700 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_alloc_urb [2021-11-17 13:13:08,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_alloc_urb [2021-11-17 13:13:08,701 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2021-11-17 13:13:08,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2021-11-17 13:13:08,701 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2021-11-17 13:13:08,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2021-11-17 13:13:08,701 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2021-11-17 13:13:08,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2021-11-17 13:13:08,701 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2021-11-17 13:13:08,701 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2021-11-17 13:13:08,701 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2021-11-17 13:13:08,702 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2021-11-17 13:13:08,702 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2021-11-17 13:13:08,702 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2021-11-17 13:13:08,702 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_wdm_mutex [2021-11-17 13:13:08,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_wdm_mutex [2021-11-17 13:13:08,702 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2021-11-17 13:13:08,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2021-11-17 13:13:08,702 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2021-11-17 13:13:08,702 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2021-11-17 13:13:08,703 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2021-11-17 13:13:08,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2021-11-17 13:13:08,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-17 13:13:08,703 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2021-11-17 13:13:08,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2021-11-17 13:13:08,703 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2021-11-17 13:13:08,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2021-11-17 13:13:08,703 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_95 [2021-11-17 13:13:08,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_95 [2021-11-17 13:13:08,704 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_resume [2021-11-17 13:13:08,704 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_resume [2021-11-17 13:13:08,704 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2021-11-17 13:13:08,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2021-11-17 13:13:08,704 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_96 [2021-11-17 13:13:08,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_96 [2021-11-17 13:13:08,704 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_rlock_of_wdm_device [2021-11-17 13:13:08,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_rlock_of_wdm_device [2021-11-17 13:13:08,705 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2021-11-17 13:13:08,705 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2021-11-17 13:13:08,705 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2021-11-17 13:13:08,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2021-11-17 13:13:08,705 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2021-11-17 13:13:08,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2021-11-17 13:13:08,705 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2021-11-17 13:13:08,705 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2021-11-17 13:13:08,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-17 13:13:08,706 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_wlock_of_wdm_device [2021-11-17 13:13:08,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_wlock_of_wdm_device [2021-11-17 13:13:08,706 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_irq_110 [2021-11-17 13:13:08,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_irq_110 [2021-11-17 13:13:09,296 INFO L236 CfgBuilder]: Building ICFG [2021-11-17 13:13:09,298 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-17 13:13:09,410 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2021-11-17 13:13:14,459 INFO L277 CfgBuilder]: Performing block encoding [2021-11-17 13:13:14,480 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-17 13:13:14,480 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-17 13:13:14,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 01:13:14 BoogieIcfgContainer [2021-11-17 13:13:14,484 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-17 13:13:14,486 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-17 13:13:14,486 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-17 13:13:14,489 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-17 13:13:14,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 01:13:04" (1/3) ... [2021-11-17 13:13:14,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4def3638 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 01:13:14, skipping insertion in model container [2021-11-17 13:13:14,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:13:08" (2/3) ... [2021-11-17 13:13:14,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4def3638 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 01:13:14, skipping insertion in model container [2021-11-17 13:13:14,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 01:13:14" (3/3) ... [2021-11-17 13:13:14,492 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i [2021-11-17 13:13:14,499 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-17 13:13:14,499 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2021-11-17 13:13:14,555 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-17 13:13:14,562 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-11-17 13:13:14,563 INFO L340 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2021-11-17 13:13:14,615 INFO L276 IsEmpty]: Start isEmpty. Operand has 1343 states, 834 states have (on average 1.2470023980815348) internal successors, (1040), 886 states have internal predecessors, (1040), 384 states have call successors, (384), 95 states have call predecessors, (384), 94 states have return successors, (379), 377 states have call predecessors, (379), 379 states have call successors, (379) [2021-11-17 13:13:14,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-17 13:13:14,622 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:13:14,623 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-11-17 13:13:14,624 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 28 more)] === [2021-11-17 13:13:14,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:13:14,628 INFO L85 PathProgramCache]: Analyzing trace with hash 821102898, now seen corresponding path program 1 times [2021-11-17 13:13:14,635 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:13:14,635 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401362303] [2021-11-17 13:13:14,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:13:14,636 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:13:14,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:15,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:13:15,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:15,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 13:13:15,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:15,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:13:15,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:15,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 13:13:15,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:15,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 13:13:15,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:15,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 13:13:15,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:15,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 13:13:15,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:15,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:13:15,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:15,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 13:13:15,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:15,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 13:13:15,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:15,235 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-17 13:13:15,236 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:13:15,236 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401362303] [2021-11-17 13:13:15,237 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401362303] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:13:15,237 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:13:15,237 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 13:13:15,239 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047972718] [2021-11-17 13:13:15,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:13:15,246 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 13:13:15,246 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:13:15,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 13:13:15,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 13:13:15,277 INFO L87 Difference]: Start difference. First operand has 1343 states, 834 states have (on average 1.2470023980815348) internal successors, (1040), 886 states have internal predecessors, (1040), 384 states have call successors, (384), 95 states have call predecessors, (384), 94 states have return successors, (379), 377 states have call predecessors, (379), 379 states have call successors, (379) Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-11-17 13:13:17,314 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:13:19,351 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:13:22,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:13:22,437 INFO L93 Difference]: Finished difference Result 2623 states and 3670 transitions. [2021-11-17 13:13:22,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 13:13:22,440 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-11-17 13:13:22,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:13:22,461 INFO L225 Difference]: With dead ends: 2623 [2021-11-17 13:13:22,461 INFO L226 Difference]: Without dead ends: 1325 [2021-11-17 13:13:22,472 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 13:13:22,475 INFO L933 BasicCegarLoop]: 1633 mSDtfsCounter, 2286 mSDsluCounter, 2063 mSDsCounter, 0 mSdLazyCounter, 1286 mSolverCounterSat, 1298 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2523 SdHoareTripleChecker+Valid, 3696 SdHoareTripleChecker+Invalid, 2586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1298 IncrementalHoareTripleChecker+Valid, 1286 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2021-11-17 13:13:22,475 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2523 Valid, 3696 Invalid, 2586 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1298 Valid, 1286 Invalid, 2 Unknown, 0 Unchecked, 6.7s Time] [2021-11-17 13:13:22,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1325 states. [2021-11-17 13:13:22,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1325 to 1325. [2021-11-17 13:13:22,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1325 states, 824 states have (on average 1.2063106796116505) internal successors, (994), 871 states have internal predecessors, (994), 379 states have call successors, (379), 94 states have call predecessors, (379), 93 states have return successors, (377), 375 states have call predecessors, (377), 377 states have call successors, (377) [2021-11-17 13:13:22,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 1750 transitions. [2021-11-17 13:13:22,612 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 1750 transitions. Word has length 71 [2021-11-17 13:13:22,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:13:22,613 INFO L470 AbstractCegarLoop]: Abstraction has 1325 states and 1750 transitions. [2021-11-17 13:13:22,614 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-11-17 13:13:22,614 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 1750 transitions. [2021-11-17 13:13:22,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-11-17 13:13:22,617 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:13:22,617 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-11-17 13:13:22,617 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-17 13:13:22,618 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 28 more)] === [2021-11-17 13:13:22,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:13:22,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1010288334, now seen corresponding path program 1 times [2021-11-17 13:13:22,618 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:13:22,618 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796623044] [2021-11-17 13:13:22,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:13:22,619 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:13:22,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:22,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:13:22,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:22,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 13:13:22,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:22,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:13:22,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:22,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 13:13:22,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:22,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 13:13:22,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:22,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 13:13:22,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:22,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 13:13:22,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:22,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:13:22,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:22,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 13:13:22,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:22,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 13:13:22,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:22,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-17 13:13:22,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:22,858 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-17 13:13:22,859 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:13:22,859 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796623044] [2021-11-17 13:13:22,859 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796623044] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:13:22,859 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:13:22,860 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 13:13:22,860 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075913011] [2021-11-17 13:13:22,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:13:22,861 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 13:13:22,861 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:13:22,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 13:13:22,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 13:13:22,862 INFO L87 Difference]: Start difference. First operand 1325 states and 1750 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-11-17 13:13:24,886 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:13:26,920 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:13:29,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:13:29,512 INFO L93 Difference]: Finished difference Result 1325 states and 1750 transitions. [2021-11-17 13:13:29,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 13:13:29,513 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-11-17 13:13:29,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:13:29,526 INFO L225 Difference]: With dead ends: 1325 [2021-11-17 13:13:29,526 INFO L226 Difference]: Without dead ends: 1323 [2021-11-17 13:13:29,527 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-11-17 13:13:29,530 INFO L933 BasicCegarLoop]: 1613 mSDtfsCounter, 2252 mSDsluCounter, 2041 mSDsCounter, 0 mSdLazyCounter, 1274 mSolverCounterSat, 1288 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2486 SdHoareTripleChecker+Valid, 3654 SdHoareTripleChecker+Invalid, 2564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 1274 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2021-11-17 13:13:29,531 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2486 Valid, 3654 Invalid, 2564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 1274 Invalid, 2 Unknown, 0 Unchecked, 6.4s Time] [2021-11-17 13:13:29,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2021-11-17 13:13:29,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 1323. [2021-11-17 13:13:29,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1323 states, 823 states have (on average 1.2053462940461726) internal successors, (992), 869 states have internal predecessors, (992), 379 states have call successors, (379), 94 states have call predecessors, (379), 93 states have return successors, (377), 375 states have call predecessors, (377), 377 states have call successors, (377) [2021-11-17 13:13:29,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1323 states to 1323 states and 1748 transitions. [2021-11-17 13:13:29,626 INFO L78 Accepts]: Start accepts. Automaton has 1323 states and 1748 transitions. Word has length 77 [2021-11-17 13:13:29,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:13:29,629 INFO L470 AbstractCegarLoop]: Abstraction has 1323 states and 1748 transitions. [2021-11-17 13:13:29,629 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-11-17 13:13:29,629 INFO L276 IsEmpty]: Start isEmpty. Operand 1323 states and 1748 transitions. [2021-11-17 13:13:29,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-11-17 13:13:29,637 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:13:29,637 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-11-17 13:13:29,637 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-17 13:13:29,638 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 28 more)] === [2021-11-17 13:13:29,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:13:29,638 INFO L85 PathProgramCache]: Analyzing trace with hash -679234807, now seen corresponding path program 1 times [2021-11-17 13:13:29,639 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:13:29,639 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437432173] [2021-11-17 13:13:29,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:13:29,639 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:13:29,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:29,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:13:29,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:29,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 13:13:29,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:29,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:13:29,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:29,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 13:13:29,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:29,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 13:13:29,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:29,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 13:13:29,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:29,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 13:13:29,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:29,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:13:29,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:29,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 13:13:29,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:29,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 13:13:29,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:29,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-17 13:13:29,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:29,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-17 13:13:29,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:29,924 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-17 13:13:29,924 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:13:29,924 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437432173] [2021-11-17 13:13:29,925 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437432173] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:13:29,925 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:13:29,925 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 13:13:29,925 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421702318] [2021-11-17 13:13:29,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:13:29,926 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 13:13:29,926 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:13:29,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 13:13:29,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 13:13:29,927 INFO L87 Difference]: Start difference. First operand 1323 states and 1748 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-11-17 13:13:31,945 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:13:33,978 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:13:36,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:13:36,440 INFO L93 Difference]: Finished difference Result 1323 states and 1748 transitions. [2021-11-17 13:13:36,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 13:13:36,440 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-11-17 13:13:36,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:13:36,449 INFO L225 Difference]: With dead ends: 1323 [2021-11-17 13:13:36,450 INFO L226 Difference]: Without dead ends: 1321 [2021-11-17 13:13:36,451 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 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-11-17 13:13:36,452 INFO L933 BasicCegarLoop]: 1611 mSDtfsCounter, 2246 mSDsluCounter, 2041 mSDsCounter, 0 mSdLazyCounter, 1272 mSolverCounterSat, 1288 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2479 SdHoareTripleChecker+Valid, 3652 SdHoareTripleChecker+Invalid, 2562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 1272 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2021-11-17 13:13:36,452 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2479 Valid, 3652 Invalid, 2562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 1272 Invalid, 2 Unknown, 0 Unchecked, 6.3s Time] [2021-11-17 13:13:36,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2021-11-17 13:13:36,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 1321. [2021-11-17 13:13:36,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1321 states, 822 states have (on average 1.2043795620437956) internal successors, (990), 867 states have internal predecessors, (990), 379 states have call successors, (379), 94 states have call predecessors, (379), 93 states have return successors, (377), 375 states have call predecessors, (377), 377 states have call successors, (377) [2021-11-17 13:13:36,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1746 transitions. [2021-11-17 13:13:36,510 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1746 transitions. Word has length 83 [2021-11-17 13:13:36,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:13:36,511 INFO L470 AbstractCegarLoop]: Abstraction has 1321 states and 1746 transitions. [2021-11-17 13:13:36,511 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-11-17 13:13:36,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1746 transitions. [2021-11-17 13:13:36,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-11-17 13:13:36,512 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:13:36,513 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-11-17 13:13:36,513 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-17 13:13:36,513 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 28 more)] === [2021-11-17 13:13:36,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:13:36,514 INFO L85 PathProgramCache]: Analyzing trace with hash -472975165, now seen corresponding path program 1 times [2021-11-17 13:13:36,514 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:13:36,514 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546500716] [2021-11-17 13:13:36,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:13:36,514 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:13:36,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:36,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:13:36,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:36,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 13:13:36,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:36,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:13:36,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:36,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 13:13:36,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:36,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 13:13:36,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:36,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 13:13:36,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:36,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 13:13:36,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:36,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:13:36,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:36,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 13:13:36,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:36,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 13:13:36,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:36,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-17 13:13:36,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:36,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-17 13:13:36,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:36,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-17 13:13:36,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:36,787 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-17 13:13:36,788 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:13:36,788 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546500716] [2021-11-17 13:13:36,788 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546500716] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:13:36,788 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:13:36,788 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 13:13:36,789 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935957600] [2021-11-17 13:13:36,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:13:36,789 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 13:13:36,789 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:13:36,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 13:13:36,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 13:13:36,790 INFO L87 Difference]: Start difference. First operand 1321 states and 1746 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-11-17 13:13:38,809 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:13:40,853 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:13:43,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:13:43,178 INFO L93 Difference]: Finished difference Result 1321 states and 1746 transitions. [2021-11-17 13:13:43,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 13:13:43,178 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-11-17 13:13:43,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:13:43,186 INFO L225 Difference]: With dead ends: 1321 [2021-11-17 13:13:43,186 INFO L226 Difference]: Without dead ends: 1319 [2021-11-17 13:13:43,187 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-11-17 13:13:43,188 INFO L933 BasicCegarLoop]: 1609 mSDtfsCounter, 2240 mSDsluCounter, 2041 mSDsCounter, 0 mSdLazyCounter, 1270 mSolverCounterSat, 1288 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2472 SdHoareTripleChecker+Valid, 3650 SdHoareTripleChecker+Invalid, 2560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 1270 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2021-11-17 13:13:43,188 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2472 Valid, 3650 Invalid, 2560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 1270 Invalid, 2 Unknown, 0 Unchecked, 6.2s Time] [2021-11-17 13:13:43,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2021-11-17 13:13:43,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1319. [2021-11-17 13:13:43,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1319 states, 821 states have (on average 1.2034104750304506) internal successors, (988), 865 states have internal predecessors, (988), 379 states have call successors, (379), 94 states have call predecessors, (379), 93 states have return successors, (377), 375 states have call predecessors, (377), 377 states have call successors, (377) [2021-11-17 13:13:43,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1319 states and 1744 transitions. [2021-11-17 13:13:43,251 INFO L78 Accepts]: Start accepts. Automaton has 1319 states and 1744 transitions. Word has length 89 [2021-11-17 13:13:43,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:13:43,252 INFO L470 AbstractCegarLoop]: Abstraction has 1319 states and 1744 transitions. [2021-11-17 13:13:43,252 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-11-17 13:13:43,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 1744 transitions. [2021-11-17 13:13:43,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-11-17 13:13:43,254 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:13:43,254 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-11-17 13:13:43,254 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-17 13:13:43,254 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 28 more)] === [2021-11-17 13:13:43,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:13:43,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1464061347, now seen corresponding path program 1 times [2021-11-17 13:13:43,255 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:13:43,255 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534193309] [2021-11-17 13:13:43,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:13:43,255 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:13:43,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:43,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:13:43,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:43,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 13:13:43,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:43,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:13:43,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:43,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 13:13:43,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:43,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 13:13:43,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:43,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 13:13:43,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:43,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 13:13:43,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:43,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:13:43,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:43,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 13:13:43,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:43,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 13:13:43,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:43,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-17 13:13:43,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:43,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-17 13:13:43,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:43,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-17 13:13:43,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:43,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-17 13:13:43,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:43,502 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-17 13:13:43,502 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:13:43,503 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534193309] [2021-11-17 13:13:43,503 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534193309] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:13:43,503 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:13:43,503 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 13:13:43,503 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107850547] [2021-11-17 13:13:43,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:13:43,504 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 13:13:43,504 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:13:43,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 13:13:43,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 13:13:43,505 INFO L87 Difference]: Start difference. First operand 1319 states and 1744 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-11-17 13:13:45,525 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:13:47,560 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:13:49,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:13:49,907 INFO L93 Difference]: Finished difference Result 1319 states and 1744 transitions. [2021-11-17 13:13:49,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 13:13:49,907 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-11-17 13:13:49,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:13:49,916 INFO L225 Difference]: With dead ends: 1319 [2021-11-17 13:13:49,917 INFO L226 Difference]: Without dead ends: 1317 [2021-11-17 13:13:49,918 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-11-17 13:13:49,919 INFO L933 BasicCegarLoop]: 1607 mSDtfsCounter, 2234 mSDsluCounter, 2041 mSDsCounter, 0 mSdLazyCounter, 1268 mSolverCounterSat, 1288 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2465 SdHoareTripleChecker+Valid, 3648 SdHoareTripleChecker+Invalid, 2558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 1268 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2021-11-17 13:13:49,920 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2465 Valid, 3648 Invalid, 2558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 1268 Invalid, 2 Unknown, 0 Unchecked, 6.2s Time] [2021-11-17 13:13:49,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2021-11-17 13:13:49,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 1317. [2021-11-17 13:13:50,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1317 states, 820 states have (on average 1.2024390243902439) internal successors, (986), 863 states have internal predecessors, (986), 379 states have call successors, (379), 94 states have call predecessors, (379), 93 states have return successors, (377), 375 states have call predecessors, (377), 377 states have call successors, (377) [2021-11-17 13:13:50,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 1317 states and 1742 transitions. [2021-11-17 13:13:50,010 INFO L78 Accepts]: Start accepts. Automaton has 1317 states and 1742 transitions. Word has length 95 [2021-11-17 13:13:50,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:13:50,011 INFO L470 AbstractCegarLoop]: Abstraction has 1317 states and 1742 transitions. [2021-11-17 13:13:50,011 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-11-17 13:13:50,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 1742 transitions. [2021-11-17 13:13:50,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-11-17 13:13:50,014 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:13:50,014 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-11-17 13:13:50,014 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-17 13:13:50,014 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 28 more)] === [2021-11-17 13:13:50,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:13:50,015 INFO L85 PathProgramCache]: Analyzing trace with hash 170587273, now seen corresponding path program 1 times [2021-11-17 13:13:50,015 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:13:50,015 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561076004] [2021-11-17 13:13:50,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:13:50,015 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:13:50,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:50,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:13:50,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:50,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 13:13:50,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:50,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:13:50,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:50,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 13:13:50,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:50,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 13:13:50,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:50,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 13:13:50,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:50,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 13:13:50,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:50,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:13:50,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:50,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 13:13:50,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:50,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 13:13:50,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:50,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-17 13:13:50,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:50,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-17 13:13:50,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:50,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-17 13:13:50,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:50,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-17 13:13:50,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:50,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-11-17 13:13:50,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:50,251 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-17 13:13:50,251 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:13:50,251 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561076004] [2021-11-17 13:13:50,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561076004] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:13:50,251 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:13:50,252 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 13:13:50,252 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483007748] [2021-11-17 13:13:50,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:13:50,253 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 13:13:50,253 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:13:50,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 13:13:50,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 13:13:50,254 INFO L87 Difference]: Start difference. First operand 1317 states and 1742 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-11-17 13:13:52,274 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:13:53,295 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:13:55,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:13:55,514 INFO L93 Difference]: Finished difference Result 1317 states and 1742 transitions. [2021-11-17 13:13:55,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 13:13:55,514 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-11-17 13:13:55,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:13:55,520 INFO L225 Difference]: With dead ends: 1317 [2021-11-17 13:13:55,521 INFO L226 Difference]: Without dead ends: 1315 [2021-11-17 13:13:55,521 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-11-17 13:13:55,522 INFO L933 BasicCegarLoop]: 1605 mSDtfsCounter, 2228 mSDsluCounter, 2041 mSDsCounter, 0 mSdLazyCounter, 1267 mSolverCounterSat, 1288 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2458 SdHoareTripleChecker+Valid, 3646 SdHoareTripleChecker+Invalid, 2556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 1267 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2021-11-17 13:13:55,522 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2458 Valid, 3646 Invalid, 2556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 1267 Invalid, 1 Unknown, 0 Unchecked, 5.1s Time] [2021-11-17 13:13:55,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1315 states. [2021-11-17 13:13:55,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1315 to 1315. [2021-11-17 13:13:55,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1315 states, 819 states have (on average 1.2014652014652014) internal successors, (984), 861 states have internal predecessors, (984), 379 states have call successors, (379), 94 states have call predecessors, (379), 93 states have return successors, (377), 375 states have call predecessors, (377), 377 states have call successors, (377) [2021-11-17 13:13:55,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1315 states to 1315 states and 1740 transitions. [2021-11-17 13:13:55,575 INFO L78 Accepts]: Start accepts. Automaton has 1315 states and 1740 transitions. Word has length 101 [2021-11-17 13:13:55,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:13:55,575 INFO L470 AbstractCegarLoop]: Abstraction has 1315 states and 1740 transitions. [2021-11-17 13:13:55,575 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-11-17 13:13:55,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1315 states and 1740 transitions. [2021-11-17 13:13:55,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-11-17 13:13:55,577 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:13:55,577 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-11-17 13:13:55,577 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-17 13:13:55,578 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 28 more)] === [2021-11-17 13:13:55,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:13:55,578 INFO L85 PathProgramCache]: Analyzing trace with hash 834064536, now seen corresponding path program 1 times [2021-11-17 13:13:55,578 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:13:55,578 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281842904] [2021-11-17 13:13:55,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:13:55,579 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:13:55,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:55,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:13:55,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:55,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 13:13:55,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:55,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:13:55,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:55,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 13:13:55,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:55,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 13:13:55,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:55,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 13:13:55,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:55,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 13:13:55,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:55,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:13:55,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:55,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 13:13:55,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:55,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 13:13:55,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:55,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-17 13:13:55,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:55,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-17 13:13:55,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:55,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-17 13:13:55,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:55,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-17 13:13:55,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:55,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-11-17 13:13:55,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:55,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-17 13:13:55,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:13:55,806 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-17 13:13:55,806 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:13:55,806 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281842904] [2021-11-17 13:13:55,806 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281842904] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:13:55,806 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:13:55,807 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 13:13:55,807 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41734687] [2021-11-17 13:13:55,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:13:55,807 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 13:13:55,807 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:13:55,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 13:13:55,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 13:13:55,808 INFO L87 Difference]: Start difference. First operand 1315 states and 1740 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-11-17 13:13:57,829 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:13:59,423 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:14:01,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:14:01,590 INFO L93 Difference]: Finished difference Result 1315 states and 1740 transitions. [2021-11-17 13:14:01,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 13:14:01,591 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-11-17 13:14:01,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:14:01,597 INFO L225 Difference]: With dead ends: 1315 [2021-11-17 13:14:01,597 INFO L226 Difference]: Without dead ends: 1313 [2021-11-17 13:14:01,598 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-11-17 13:14:01,599 INFO L933 BasicCegarLoop]: 1603 mSDtfsCounter, 2222 mSDsluCounter, 2041 mSDsCounter, 0 mSdLazyCounter, 1265 mSolverCounterSat, 1288 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2451 SdHoareTripleChecker+Valid, 3644 SdHoareTripleChecker+Invalid, 2554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 1265 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2021-11-17 13:14:01,599 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2451 Valid, 3644 Invalid, 2554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 1265 Invalid, 1 Unknown, 0 Unchecked, 5.6s Time] [2021-11-17 13:14:01,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1313 states. [2021-11-17 13:14:01,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1313 to 1313. [2021-11-17 13:14:01,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1313 states, 818 states have (on average 1.2004889975550121) internal successors, (982), 859 states have internal predecessors, (982), 379 states have call successors, (379), 94 states have call predecessors, (379), 93 states have return successors, (377), 375 states have call predecessors, (377), 377 states have call successors, (377) [2021-11-17 13:14:01,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1313 states to 1313 states and 1738 transitions. [2021-11-17 13:14:01,657 INFO L78 Accepts]: Start accepts. Automaton has 1313 states and 1738 transitions. Word has length 107 [2021-11-17 13:14:01,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:14:01,657 INFO L470 AbstractCegarLoop]: Abstraction has 1313 states and 1738 transitions. [2021-11-17 13:14:01,658 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-11-17 13:14:01,658 INFO L276 IsEmpty]: Start isEmpty. Operand 1313 states and 1738 transitions. [2021-11-17 13:14:01,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-11-17 13:14:01,659 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:14:01,659 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-11-17 13:14:01,660 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-17 13:14:01,660 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 28 more)] === [2021-11-17 13:14:01,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:14:01,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1937534816, now seen corresponding path program 1 times [2021-11-17 13:14:01,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:14:01,661 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348864324] [2021-11-17 13:14:01,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:14:01,661 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:14:01,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:01,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:14:01,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:01,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 13:14:01,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:01,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:14:01,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:01,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 13:14:01,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:01,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 13:14:01,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:01,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 13:14:01,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:01,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 13:14:01,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:01,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:14:01,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:01,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 13:14:01,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:01,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 13:14:01,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:01,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-17 13:14:01,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:01,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-17 13:14:01,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:01,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-17 13:14:01,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:01,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-17 13:14:01,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:01,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-11-17 13:14:01,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:01,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-17 13:14:01,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:01,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-11-17 13:14:01,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:01,887 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-17 13:14:01,888 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:14:01,888 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348864324] [2021-11-17 13:14:01,888 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348864324] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:14:01,888 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:14:01,888 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 13:14:01,889 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159402893] [2021-11-17 13:14:01,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:14:01,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 13:14:01,889 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:14:01,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 13:14:01,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 13:14:01,890 INFO L87 Difference]: Start difference. First operand 1313 states and 1738 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-11-17 13:14:03,910 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:14:05,947 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:14:07,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:14:07,873 INFO L93 Difference]: Finished difference Result 1313 states and 1738 transitions. [2021-11-17 13:14:07,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 13:14:07,874 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-11-17 13:14:07,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:14:07,880 INFO L225 Difference]: With dead ends: 1313 [2021-11-17 13:14:07,880 INFO L226 Difference]: Without dead ends: 1311 [2021-11-17 13:14:07,881 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-11-17 13:14:07,882 INFO L933 BasicCegarLoop]: 1601 mSDtfsCounter, 2220 mSDsluCounter, 2041 mSDsCounter, 0 mSdLazyCounter, 1258 mSolverCounterSat, 1288 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2448 SdHoareTripleChecker+Valid, 3642 SdHoareTripleChecker+Invalid, 2548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 1258 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2021-11-17 13:14:07,882 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2448 Valid, 3642 Invalid, 2548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 1258 Invalid, 2 Unknown, 0 Unchecked, 5.9s Time] [2021-11-17 13:14:07,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1311 states. [2021-11-17 13:14:07,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1311 to 1311. [2021-11-17 13:14:07,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1311 states, 817 states have (on average 1.1995104039167688) internal successors, (980), 857 states have internal predecessors, (980), 379 states have call successors, (379), 94 states have call predecessors, (379), 93 states have return successors, (377), 375 states have call predecessors, (377), 377 states have call successors, (377) [2021-11-17 13:14:07,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1311 states to 1311 states and 1736 transitions. [2021-11-17 13:14:07,941 INFO L78 Accepts]: Start accepts. Automaton has 1311 states and 1736 transitions. Word has length 113 [2021-11-17 13:14:07,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:14:07,941 INFO L470 AbstractCegarLoop]: Abstraction has 1311 states and 1736 transitions. [2021-11-17 13:14:07,942 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-11-17 13:14:07,942 INFO L276 IsEmpty]: Start isEmpty. Operand 1311 states and 1736 transitions. [2021-11-17 13:14:07,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2021-11-17 13:14:07,944 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:14:07,944 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:14:07,944 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-17 13:14:07,944 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-11-17 13:14:07,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:14:07,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1447935505, now seen corresponding path program 1 times [2021-11-17 13:14:07,945 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:14:07,945 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191598956] [2021-11-17 13:14:07,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:14:07,945 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:14:07,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:08,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:14:08,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:08,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 13:14:08,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:08,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:14:08,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:08,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 13:14:08,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:08,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-17 13:14:08,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:08,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:14:08,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:08,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:14:08,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:08,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:14:08,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:08,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 13:14:08,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:08,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:14:08,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:08,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:14:08,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:08,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:14:08,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:08,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-11-17 13:14:08,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:08,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:14:08,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:08,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:14:08,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:08,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:14:08,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:08,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-17 13:14:08,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:08,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:14:08,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:08,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:14:08,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:08,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:14:08,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:08,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-17 13:14:08,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:08,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:14:08,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:08,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:14:08,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:08,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:14:08,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:08,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-11-17 13:14:08,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:08,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-11-17 13:14:08,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:08,245 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2021-11-17 13:14:08,245 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:14:08,245 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191598956] [2021-11-17 13:14:08,246 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191598956] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:14:08,246 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:14:08,246 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 13:14:08,246 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946189239] [2021-11-17 13:14:08,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:14:08,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 13:14:08,247 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:14:08,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 13:14:08,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 13:14:08,248 INFO L87 Difference]: Start difference. First operand 1311 states and 1736 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-17 13:14:10,269 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:14:12,297 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:14:14,333 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:14:16,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:14:16,663 INFO L93 Difference]: Finished difference Result 2436 states and 3207 transitions. [2021-11-17 13:14:16,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-17 13:14:16,663 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 155 [2021-11-17 13:14:16,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:14:16,670 INFO L225 Difference]: With dead ends: 2436 [2021-11-17 13:14:16,671 INFO L226 Difference]: Without dead ends: 1321 [2021-11-17 13:14:16,675 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-17 13:14:16,675 INFO L933 BasicCegarLoop]: 1345 mSDtfsCounter, 2592 mSDsluCounter, 1381 mSDsCounter, 0 mSdLazyCounter, 1391 mSolverCounterSat, 1770 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2832 SdHoareTripleChecker+Valid, 2726 SdHoareTripleChecker+Invalid, 3164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1770 IncrementalHoareTripleChecker+Valid, 1391 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2021-11-17 13:14:16,676 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2832 Valid, 2726 Invalid, 3164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1770 Valid, 1391 Invalid, 3 Unknown, 0 Unchecked, 8.2s Time] [2021-11-17 13:14:16,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2021-11-17 13:14:16,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 1307. [2021-11-17 13:14:16,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1307 states, 814 states have (on average 1.1977886977886978) internal successors, (975), 853 states have internal predecessors, (975), 379 states have call successors, (379), 94 states have call predecessors, (379), 93 states have return successors, (377), 375 states have call predecessors, (377), 377 states have call successors, (377) [2021-11-17 13:14:16,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1307 states to 1307 states and 1731 transitions. [2021-11-17 13:14:16,768 INFO L78 Accepts]: Start accepts. Automaton has 1307 states and 1731 transitions. Word has length 155 [2021-11-17 13:14:16,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:14:16,769 INFO L470 AbstractCegarLoop]: Abstraction has 1307 states and 1731 transitions. [2021-11-17 13:14:16,769 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-17 13:14:16,769 INFO L276 IsEmpty]: Start isEmpty. Operand 1307 states and 1731 transitions. [2021-11-17 13:14:16,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-11-17 13:14:16,772 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:14:16,772 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-11-17 13:14:16,772 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-17 13:14:16,772 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-11-17 13:14:16,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:14:16,773 INFO L85 PathProgramCache]: Analyzing trace with hash -2044715357, now seen corresponding path program 1 times [2021-11-17 13:14:16,773 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:14:16,773 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841058128] [2021-11-17 13:14:16,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:14:16,773 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:14:16,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:16,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:14:16,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:16,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 13:14:16,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:16,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:14:16,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:16,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 13:14:16,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:16,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 13:14:16,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:16,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 13:14:16,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:16,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 13:14:16,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:16,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:14:16,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:16,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 13:14:16,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:16,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 13:14:16,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:16,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-17 13:14:16,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:16,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-17 13:14:16,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:16,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-17 13:14:16,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:16,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-17 13:14:16,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:16,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-11-17 13:14:16,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:16,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-17 13:14:16,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:16,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-11-17 13:14:16,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:16,986 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-17 13:14:16,986 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:14:16,986 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841058128] [2021-11-17 13:14:16,986 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841058128] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:14:16,987 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:14:16,987 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 13:14:16,987 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381112689] [2021-11-17 13:14:16,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:14:16,987 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 13:14:16,988 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:14:16,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 13:14:16,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 13:14:16,988 INFO L87 Difference]: Start difference. First operand 1307 states and 1731 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-11-17 13:14:19,009 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:14:21,046 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:14:23,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:14:23,063 INFO L93 Difference]: Finished difference Result 1307 states and 1731 transitions. [2021-11-17 13:14:23,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 13:14:23,064 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-11-17 13:14:23,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:14:23,069 INFO L225 Difference]: With dead ends: 1307 [2021-11-17 13:14:23,069 INFO L226 Difference]: Without dead ends: 1305 [2021-11-17 13:14:23,070 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-11-17 13:14:23,070 INFO L933 BasicCegarLoop]: 1594 mSDtfsCounter, 2203 mSDsluCounter, 2027 mSDsCounter, 0 mSdLazyCounter, 1259 mSolverCounterSat, 1288 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2431 SdHoareTripleChecker+Valid, 3621 SdHoareTripleChecker+Invalid, 2549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 1259 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2021-11-17 13:14:23,071 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2431 Valid, 3621 Invalid, 2549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 1259 Invalid, 2 Unknown, 0 Unchecked, 5.9s Time] [2021-11-17 13:14:23,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1305 states. [2021-11-17 13:14:23,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1305 to 1305. [2021-11-17 13:14:23,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1305 states, 813 states have (on average 1.1968019680196802) internal successors, (973), 851 states have internal predecessors, (973), 379 states have call successors, (379), 94 states have call predecessors, (379), 93 states have return successors, (377), 375 states have call predecessors, (377), 377 states have call successors, (377) [2021-11-17 13:14:23,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1305 states to 1305 states and 1729 transitions. [2021-11-17 13:14:23,139 INFO L78 Accepts]: Start accepts. Automaton has 1305 states and 1729 transitions. Word has length 115 [2021-11-17 13:14:23,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:14:23,139 INFO L470 AbstractCegarLoop]: Abstraction has 1305 states and 1729 transitions. [2021-11-17 13:14:23,139 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-11-17 13:14:23,140 INFO L276 IsEmpty]: Start isEmpty. Operand 1305 states and 1729 transitions. [2021-11-17 13:14:23,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-11-17 13:14:23,141 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:14:23,142 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:14:23,142 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-17 13:14:23,142 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-11-17 13:14:23,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:14:23,142 INFO L85 PathProgramCache]: Analyzing trace with hash -287691040, now seen corresponding path program 1 times [2021-11-17 13:14:23,143 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:14:23,143 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707539017] [2021-11-17 13:14:23,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:14:23,143 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:14:23,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:23,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:14:23,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:23,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 13:14:23,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:23,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:14:23,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:23,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 13:14:23,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:23,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-17 13:14:23,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:23,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:14:23,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:23,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:14:23,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:23,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:14:23,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:23,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 13:14:23,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:23,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:14:23,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:23,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:14:23,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:23,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:14:23,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:23,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-11-17 13:14:23,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:23,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:14:23,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:23,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:14:23,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:23,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:14:23,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:23,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-17 13:14:23,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:23,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:14:23,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:23,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:14:23,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:23,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:14:23,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:23,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-17 13:14:23,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:23,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:14:23,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:23,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:14:23,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:23,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:14:23,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:23,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-11-17 13:14:23,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:23,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-11-17 13:14:23,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:23,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2021-11-17 13:14:23,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:23,439 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2021-11-17 13:14:23,440 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:14:23,440 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707539017] [2021-11-17 13:14:23,440 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707539017] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 13:14:23,440 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544907989] [2021-11-17 13:14:23,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:14:23,440 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 13:14:23,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 13:14:23,443 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-17 13:14:23,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-17 13:14:23,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:24,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 1832 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-17 13:14:24,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 13:14:24,354 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2021-11-17 13:14:24,354 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-17 13:14:24,355 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544907989] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:14:24,355 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-17 13:14:24,355 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2021-11-17 13:14:24,355 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720707604] [2021-11-17 13:14:24,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:14:24,356 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-17 13:14:24,356 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:14:24,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-17 13:14:24,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-11-17 13:14:24,357 INFO L87 Difference]: Start difference. First operand 1305 states and 1729 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-17 13:14:24,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:14:24,459 INFO L93 Difference]: Finished difference Result 2463 states and 3235 transitions. [2021-11-17 13:14:24,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-17 13:14:24,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 161 [2021-11-17 13:14:24,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:14:24,467 INFO L225 Difference]: With dead ends: 2463 [2021-11-17 13:14:24,468 INFO L226 Difference]: Without dead ends: 1357 [2021-11-17 13:14:24,471 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-11-17 13:14:24,472 INFO L933 BasicCegarLoop]: 1788 mSDtfsCounter, 1707 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1707 SdHoareTripleChecker+Valid, 1855 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-17 13:14:24,472 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1707 Valid, 1855 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-17 13:14:24,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2021-11-17 13:14:24,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 1354. [2021-11-17 13:14:24,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1354 states, 842 states have (on average 1.1912114014251782) internal successors, (1003), 883 states have internal predecessors, (1003), 394 states have call successors, (394), 100 states have call predecessors, (394), 99 states have return successors, (392), 388 states have call predecessors, (392), 392 states have call successors, (392) [2021-11-17 13:14:24,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1354 states to 1354 states and 1789 transitions. [2021-11-17 13:14:24,551 INFO L78 Accepts]: Start accepts. Automaton has 1354 states and 1789 transitions. Word has length 161 [2021-11-17 13:14:24,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:14:24,552 INFO L470 AbstractCegarLoop]: Abstraction has 1354 states and 1789 transitions. [2021-11-17 13:14:24,552 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-17 13:14:24,552 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 1789 transitions. [2021-11-17 13:14:24,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-11-17 13:14:24,554 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:14:24,554 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-11-17 13:14:24,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-17 13:14:24,777 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-11-17 13:14:24,778 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_linux_kernel_module_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-11-17 13:14:24,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:14:24,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1167838511, now seen corresponding path program 1 times [2021-11-17 13:14:24,778 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:14:24,778 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110731372] [2021-11-17 13:14:24,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:14:24,779 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:14:24,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:24,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:14:24,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:24,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 13:14:24,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:24,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:14:24,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:24,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 13:14:24,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:24,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 13:14:24,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:24,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 13:14:24,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:24,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 13:14:24,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:24,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:14:24,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:24,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 13:14:24,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:24,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 13:14:24,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:24,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-17 13:14:24,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:24,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-17 13:14:24,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:24,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-17 13:14:24,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:24,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-17 13:14:24,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:24,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-11-17 13:14:24,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:24,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-17 13:14:24,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:24,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-11-17 13:14:24,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:24,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-11-17 13:14:24,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:24,972 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-17 13:14:24,973 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:14:24,973 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110731372] [2021-11-17 13:14:24,973 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110731372] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:14:24,973 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:14:24,973 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 13:14:24,973 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838608828] [2021-11-17 13:14:24,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:14:24,974 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 13:14:24,974 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:14:24,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 13:14:24,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 13:14:24,975 INFO L87 Difference]: Start difference. First operand 1354 states and 1789 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-11-17 13:14:26,995 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:14:28,917 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:14:31,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:14:31,104 INFO L93 Difference]: Finished difference Result 1354 states and 1789 transitions. [2021-11-17 13:14:31,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 13:14:31,104 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-11-17 13:14:31,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:14:31,111 INFO L225 Difference]: With dead ends: 1354 [2021-11-17 13:14:31,112 INFO L226 Difference]: Without dead ends: 1352 [2021-11-17 13:14:31,112 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-11-17 13:14:31,113 INFO L933 BasicCegarLoop]: 1587 mSDtfsCounter, 2194 mSDsluCounter, 2013 mSDsCounter, 0 mSdLazyCounter, 1257 mSolverCounterSat, 1288 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2421 SdHoareTripleChecker+Valid, 3600 SdHoareTripleChecker+Invalid, 2546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 1257 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2021-11-17 13:14:31,113 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2421 Valid, 3600 Invalid, 2546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 1257 Invalid, 1 Unknown, 0 Unchecked, 6.0s Time] [2021-11-17 13:14:31,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2021-11-17 13:14:31,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1352. [2021-11-17 13:14:31,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1352 states, 841 states have (on average 1.1902497027348395) internal successors, (1001), 881 states have internal predecessors, (1001), 394 states have call successors, (394), 100 states have call predecessors, (394), 99 states have return successors, (392), 388 states have call predecessors, (392), 392 states have call successors, (392) [2021-11-17 13:14:31,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1787 transitions. [2021-11-17 13:14:31,204 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1787 transitions. Word has length 121 [2021-11-17 13:14:31,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:14:31,204 INFO L470 AbstractCegarLoop]: Abstraction has 1352 states and 1787 transitions. [2021-11-17 13:14:31,205 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-11-17 13:14:31,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1787 transitions. [2021-11-17 13:14:31,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2021-11-17 13:14:31,208 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:14:31,208 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:14:31,208 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-17 13:14:31,208 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-11-17 13:14:31,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:14:31,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1431177485, now seen corresponding path program 1 times [2021-11-17 13:14:31,210 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:14:31,210 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516667354] [2021-11-17 13:14:31,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:14:31,211 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:14:31,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:31,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:14:31,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:31,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 13:14:31,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:31,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:14:31,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:31,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 13:14:31,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:31,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 13:14:31,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:31,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 13:14:31,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:31,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 13:14:31,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:31,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:14:31,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:31,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 13:14:31,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:31,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 13:14:31,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:31,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-17 13:14:31,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:31,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 13:14:31,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:31,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:14:31,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:31,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:14:31,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:31,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:14:31,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:31,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-11-17 13:14:31,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:31,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:14:31,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:31,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:14:31,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:31,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:14:31,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:31,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-11-17 13:14:31,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:31,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:14:31,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:31,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:14:31,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:31,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:14:31,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:31,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-11-17 13:14:31,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:31,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-11-17 13:14:31,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:31,580 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2021-11-17 13:14:31,580 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:14:31,580 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516667354] [2021-11-17 13:14:31,581 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516667354] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:14:31,581 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:14:31,581 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-17 13:14:31,581 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012384094] [2021-11-17 13:14:31,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:14:31,582 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-17 13:14:31,582 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:14:31,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-17 13:14:31,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-17 13:14:31,583 INFO L87 Difference]: Start difference. First operand 1352 states and 1787 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2021-11-17 13:14:33,603 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:14:35,633 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:14:37,200 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:14:40,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:14:40,847 INFO L93 Difference]: Finished difference Result 1585 states and 2030 transitions. [2021-11-17 13:14:40,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-17 13:14:40,848 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 153 [2021-11-17 13:14:40,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:14:40,855 INFO L225 Difference]: With dead ends: 1585 [2021-11-17 13:14:40,856 INFO L226 Difference]: Without dead ends: 1583 [2021-11-17 13:14:40,857 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2021-11-17 13:14:40,857 INFO L933 BasicCegarLoop]: 1653 mSDtfsCounter, 2708 mSDsluCounter, 3751 mSDsCounter, 0 mSdLazyCounter, 2845 mSolverCounterSat, 1884 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2912 SdHoareTripleChecker+Valid, 5404 SdHoareTripleChecker+Invalid, 4731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1884 IncrementalHoareTripleChecker+Valid, 2845 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2021-11-17 13:14:40,858 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2912 Valid, 5404 Invalid, 4731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1884 Valid, 2845 Invalid, 2 Unknown, 0 Unchecked, 9.0s Time] [2021-11-17 13:14:40,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1583 states. [2021-11-17 13:14:40,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1583 to 1555. [2021-11-17 13:14:40,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1555 states, 973 states have (on average 1.1788283658787255) internal successors, (1147), 1013 states have internal predecessors, (1147), 426 states have call successors, (426), 139 states have call predecessors, (426), 138 states have return successors, (424), 420 states have call predecessors, (424), 424 states have call successors, (424) [2021-11-17 13:14:40,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 1997 transitions. [2021-11-17 13:14:40,942 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 1997 transitions. Word has length 153 [2021-11-17 13:14:40,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:14:40,943 INFO L470 AbstractCegarLoop]: Abstraction has 1555 states and 1997 transitions. [2021-11-17 13:14:40,943 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2021-11-17 13:14:40,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 1997 transitions. [2021-11-17 13:14:40,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2021-11-17 13:14:40,945 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:14:40,946 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:14:40,946 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-17 13:14:40,946 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_linux_alloc_irq_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-11-17 13:14:40,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:14:40,946 INFO L85 PathProgramCache]: Analyzing trace with hash 762840808, now seen corresponding path program 1 times [2021-11-17 13:14:40,947 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:14:40,947 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486855410] [2021-11-17 13:14:40,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:14:40,947 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:14:41,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:41,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:14:41,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:41,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 13:14:41,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:41,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:14:41,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:41,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 13:14:41,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:41,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-17 13:14:41,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:41,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:14:41,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:41,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:14:41,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:41,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:14:41,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:41,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 13:14:41,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:41,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:14:41,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:41,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:14:41,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:41,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:14:41,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:41,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-11-17 13:14:41,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:41,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:14:41,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:41,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:14:41,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:41,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:14:41,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:41,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-17 13:14:41,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:41,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:14:41,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:41,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:14:41,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:41,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:14:41,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:41,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-17 13:14:41,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:41,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:14:41,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:41,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:14:41,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:41,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:14:41,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:41,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-11-17 13:14:41,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:41,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-11-17 13:14:41,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:41,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2021-11-17 13:14:41,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:41,286 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2021-11-17 13:14:41,286 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:14:41,286 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486855410] [2021-11-17 13:14:41,286 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486855410] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:14:41,286 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:14:41,287 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-17 13:14:41,287 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306265965] [2021-11-17 13:14:41,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:14:41,288 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-17 13:14:41,288 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:14:41,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-17 13:14:41,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-17 13:14:41,289 INFO L87 Difference]: Start difference. First operand 1555 states and 1997 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-17 13:14:43,308 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:14:45,346 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:14:47,376 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:14:51,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:14:51,543 INFO L93 Difference]: Finished difference Result 3018 states and 3896 transitions. [2021-11-17 13:14:51,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-17 13:14:51,543 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 166 [2021-11-17 13:14:51,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:14:51,553 INFO L225 Difference]: With dead ends: 3018 [2021-11-17 13:14:51,553 INFO L226 Difference]: Without dead ends: 1569 [2021-11-17 13:14:51,558 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2021-11-17 13:14:51,559 INFO L933 BasicCegarLoop]: 1577 mSDtfsCounter, 2551 mSDsluCounter, 4045 mSDsCounter, 0 mSdLazyCounter, 3627 mSolverCounterSat, 1770 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2785 SdHoareTripleChecker+Valid, 5622 SdHoareTripleChecker+Invalid, 5400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1770 IncrementalHoareTripleChecker+Valid, 3627 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.0s IncrementalHoareTripleChecker+Time [2021-11-17 13:14:51,559 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2785 Valid, 5622 Invalid, 5400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1770 Valid, 3627 Invalid, 3 Unknown, 0 Unchecked, 10.0s Time] [2021-11-17 13:14:51,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2021-11-17 13:14:51,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 1555. [2021-11-17 13:14:51,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1555 states, 973 states have (on average 1.1767728674203495) internal successors, (1145), 1013 states have internal predecessors, (1145), 426 states have call successors, (426), 139 states have call predecessors, (426), 138 states have return successors, (424), 420 states have call predecessors, (424), 424 states have call successors, (424) [2021-11-17 13:14:51,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 1995 transitions. [2021-11-17 13:14:51,652 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 1995 transitions. Word has length 166 [2021-11-17 13:14:51,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:14:51,653 INFO L470 AbstractCegarLoop]: Abstraction has 1555 states and 1995 transitions. [2021-11-17 13:14:51,654 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-17 13:14:51,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 1995 transitions. [2021-11-17 13:14:51,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2021-11-17 13:14:51,656 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:14:51,657 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:14:51,657 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-17 13:14:51,657 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_linux_alloc_irq_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-11-17 13:14:51,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:14:51,657 INFO L85 PathProgramCache]: Analyzing trace with hash 762900390, now seen corresponding path program 1 times [2021-11-17 13:14:51,658 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:14:51,658 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178073213] [2021-11-17 13:14:51,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:14:51,658 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:14:51,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:51,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:14:51,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:51,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 13:14:51,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:51,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:14:51,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:51,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 13:14:51,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:51,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-17 13:14:51,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:51,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:14:51,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:51,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:14:51,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:51,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:14:51,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:51,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 13:14:51,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:51,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:14:51,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:51,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:14:51,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:51,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:14:51,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:51,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-11-17 13:14:51,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:51,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:14:51,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:51,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:14:51,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:51,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:14:51,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:51,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-17 13:14:51,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:51,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:14:51,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:51,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:14:51,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:51,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:14:51,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:51,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-17 13:14:51,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:51,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:14:51,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:51,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:14:51,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:51,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:14:51,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:51,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-11-17 13:14:51,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:51,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-11-17 13:14:51,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:51,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2021-11-17 13:14:51,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:14:51,927 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2021-11-17 13:14:51,928 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:14:51,928 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178073213] [2021-11-17 13:14:51,928 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178073213] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:14:51,928 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:14:51,928 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 13:14:51,930 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054575776] [2021-11-17 13:14:51,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:14:51,931 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 13:14:51,931 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:14:51,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 13:14:51,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-17 13:14:51,932 INFO L87 Difference]: Start difference. First operand 1555 states and 1995 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2021-11-17 13:14:53,953 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:14:55,987 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:14:58,020 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:15:01,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:15:01,021 INFO L93 Difference]: Finished difference Result 1569 states and 2019 transitions. [2021-11-17 13:15:01,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-17 13:15:01,022 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 166 [2021-11-17 13:15:01,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:15:01,029 INFO L225 Difference]: With dead ends: 1569 [2021-11-17 13:15:01,029 INFO L226 Difference]: Without dead ends: 1567 [2021-11-17 13:15:01,030 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-11-17 13:15:01,030 INFO L933 BasicCegarLoop]: 1577 mSDtfsCounter, 1364 mSDsluCounter, 3586 mSDsCounter, 0 mSdLazyCounter, 2368 mSolverCounterSat, 1482 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1364 SdHoareTripleChecker+Valid, 5163 SdHoareTripleChecker+Invalid, 3853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1482 IncrementalHoareTripleChecker+Valid, 2368 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2021-11-17 13:15:01,031 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1364 Valid, 5163 Invalid, 3853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1482 Valid, 2368 Invalid, 3 Unknown, 0 Unchecked, 8.9s Time] [2021-11-17 13:15:01,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2021-11-17 13:15:01,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1553. [2021-11-17 13:15:01,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1553 states, 972 states have (on average 1.1748971193415638) internal successors, (1142), 1011 states have internal predecessors, (1142), 426 states have call successors, (426), 139 states have call predecessors, (426), 138 states have return successors, (424), 420 states have call predecessors, (424), 424 states have call successors, (424) [2021-11-17 13:15:01,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1553 states to 1553 states and 1992 transitions. [2021-11-17 13:15:01,114 INFO L78 Accepts]: Start accepts. Automaton has 1553 states and 1992 transitions. Word has length 166 [2021-11-17 13:15:01,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:15:01,115 INFO L470 AbstractCegarLoop]: Abstraction has 1553 states and 1992 transitions. [2021-11-17 13:15:01,115 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2021-11-17 13:15:01,115 INFO L276 IsEmpty]: Start isEmpty. Operand 1553 states and 1992 transitions. [2021-11-17 13:15:01,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-11-17 13:15:01,117 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:15:01,117 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-11-17 13:15:01,117 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-17 13:15:01,118 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-11-17 13:15:01,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:15:01,118 INFO L85 PathProgramCache]: Analyzing trace with hash -318780407, now seen corresponding path program 1 times [2021-11-17 13:15:01,118 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:15:01,118 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250992427] [2021-11-17 13:15:01,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:15:01,119 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:15:01,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:01,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:15:01,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:01,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 13:15:01,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:01,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:15:01,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:01,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 13:15:01,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:01,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 13:15:01,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:01,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 13:15:01,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:01,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 13:15:01,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:01,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:15:01,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:01,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 13:15:01,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:01,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 13:15:01,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:01,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-17 13:15:01,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:01,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-17 13:15:01,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:01,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-17 13:15:01,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:01,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-17 13:15:01,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:01,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-11-17 13:15:01,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:01,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-17 13:15:01,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:01,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-11-17 13:15:01,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:01,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-11-17 13:15:01,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:01,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-11-17 13:15:01,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:01,316 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-17 13:15:01,316 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:15:01,316 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250992427] [2021-11-17 13:15:01,316 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250992427] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:15:01,316 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:15:01,317 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 13:15:01,317 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078687229] [2021-11-17 13:15:01,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:15:01,318 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 13:15:01,318 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:15:01,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 13:15:01,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 13:15:01,319 INFO L87 Difference]: Start difference. First operand 1553 states and 1992 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-11-17 13:15:03,339 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:15:05,374 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:15:07,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:15:07,511 INFO L93 Difference]: Finished difference Result 1553 states and 1992 transitions. [2021-11-17 13:15:07,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 13:15:07,511 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-11-17 13:15:07,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:15:07,519 INFO L225 Difference]: With dead ends: 1553 [2021-11-17 13:15:07,520 INFO L226 Difference]: Without dead ends: 1551 [2021-11-17 13:15:07,521 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-11-17 13:15:07,522 INFO L933 BasicCegarLoop]: 1582 mSDtfsCounter, 2179 mSDsluCounter, 2013 mSDsCounter, 0 mSdLazyCounter, 1251 mSolverCounterSat, 1288 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2405 SdHoareTripleChecker+Valid, 3595 SdHoareTripleChecker+Invalid, 2541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 1251 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2021-11-17 13:15:07,523 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2405 Valid, 3595 Invalid, 2541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 1251 Invalid, 2 Unknown, 0 Unchecked, 6.0s Time] [2021-11-17 13:15:07,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1551 states. [2021-11-17 13:15:07,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1551 to 1551. [2021-11-17 13:15:07,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1551 states, 971 states have (on average 1.1740473738414006) internal successors, (1140), 1009 states have internal predecessors, (1140), 426 states have call successors, (426), 139 states have call predecessors, (426), 138 states have return successors, (424), 420 states have call predecessors, (424), 424 states have call successors, (424) [2021-11-17 13:15:07,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1551 states to 1551 states and 1990 transitions. [2021-11-17 13:15:07,618 INFO L78 Accepts]: Start accepts. Automaton has 1551 states and 1990 transitions. Word has length 127 [2021-11-17 13:15:07,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:15:07,618 INFO L470 AbstractCegarLoop]: Abstraction has 1551 states and 1990 transitions. [2021-11-17 13:15:07,619 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-11-17 13:15:07,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1551 states and 1990 transitions. [2021-11-17 13:15:07,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2021-11-17 13:15:07,621 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:15:07,621 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:15:07,621 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-17 13:15:07,621 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-11-17 13:15:07,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:15:07,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1563561762, now seen corresponding path program 1 times [2021-11-17 13:15:07,622 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:15:07,622 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645403028] [2021-11-17 13:15:07,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:15:07,622 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:15:07,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:07,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:15:07,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:07,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 13:15:07,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:07,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:15:07,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:07,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 13:15:07,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:07,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-17 13:15:07,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:07,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:15:07,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:07,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:15:07,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:07,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:15:07,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:07,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 13:15:07,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:07,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:15:07,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:07,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:15:07,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:07,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:15:07,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:07,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-11-17 13:15:07,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:07,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:15:07,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:07,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:15:07,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:07,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:15:07,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:07,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-17 13:15:07,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:07,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:15:07,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:07,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:15:07,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:07,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:15:07,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:07,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-17 13:15:07,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:07,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:15:07,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:07,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:15:07,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:07,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:15:07,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:07,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-11-17 13:15:07,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:07,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-11-17 13:15:07,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:07,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2021-11-17 13:15:07,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:07,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:15:07,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:07,900 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2021-11-17 13:15:07,900 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:15:07,900 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645403028] [2021-11-17 13:15:07,900 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645403028] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:15:07,900 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:15:07,901 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 13:15:07,901 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671737106] [2021-11-17 13:15:07,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:15:07,902 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 13:15:07,902 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:15:07,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 13:15:07,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 13:15:07,903 INFO L87 Difference]: Start difference. First operand 1551 states and 1990 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-17 13:15:09,926 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:15:11,422 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:15:13,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:15:13,719 INFO L93 Difference]: Finished difference Result 3004 states and 3875 transitions. [2021-11-17 13:15:13,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 13:15:13,723 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 173 [2021-11-17 13:15:13,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:15:13,731 INFO L225 Difference]: With dead ends: 3004 [2021-11-17 13:15:13,731 INFO L226 Difference]: Without dead ends: 1559 [2021-11-17 13:15:13,735 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 13:15:13,736 INFO L933 BasicCegarLoop]: 1570 mSDtfsCounter, 2512 mSDsluCounter, 1411 mSDsCounter, 0 mSdLazyCounter, 1106 mSolverCounterSat, 1756 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2746 SdHoareTripleChecker+Valid, 2981 SdHoareTripleChecker+Invalid, 2863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1756 IncrementalHoareTripleChecker+Valid, 1106 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2021-11-17 13:15:13,736 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2746 Valid, 2981 Invalid, 2863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1756 Valid, 1106 Invalid, 1 Unknown, 0 Unchecked, 5.7s Time] [2021-11-17 13:15:13,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1559 states. [2021-11-17 13:15:13,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1559 to 1545. [2021-11-17 13:15:13,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1545 states, 966 states have (on average 1.170807453416149) internal successors, (1131), 1003 states have internal predecessors, (1131), 426 states have call successors, (426), 139 states have call predecessors, (426), 138 states have return successors, (424), 420 states have call predecessors, (424), 424 states have call successors, (424) [2021-11-17 13:15:13,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 1981 transitions. [2021-11-17 13:15:13,835 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 1981 transitions. Word has length 173 [2021-11-17 13:15:13,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:15:13,836 INFO L470 AbstractCegarLoop]: Abstraction has 1545 states and 1981 transitions. [2021-11-17 13:15:13,836 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-17 13:15:13,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 1981 transitions. [2021-11-17 13:15:13,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2021-11-17 13:15:13,838 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:15:13,838 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:15:13,839 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-17 13:15:13,839 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-11-17 13:15:13,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:15:13,839 INFO L85 PathProgramCache]: Analyzing trace with hash 810533866, now seen corresponding path program 1 times [2021-11-17 13:15:13,840 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:15:13,840 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667943352] [2021-11-17 13:15:13,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:15:13,841 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:15:13,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:13,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:15:13,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:13,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 13:15:13,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:13,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:15:13,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:13,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 13:15:13,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:13,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 13:15:13,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:13,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 13:15:13,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:13,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 13:15:13,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:13,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:15:13,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:14,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 13:15:14,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:14,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 13:15:14,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:14,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-17 13:15:14,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:14,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 13:15:14,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:14,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:15:14,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:14,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:15:14,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:14,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:15:14,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:14,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-11-17 13:15:14,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:14,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:15:14,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:14,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:15:14,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:14,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:15:14,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:14,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-11-17 13:15:14,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:14,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:15:14,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:14,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:15:14,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:14,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:15:14,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:14,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-11-17 13:15:14,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:14,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-11-17 13:15:14,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:14,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2021-11-17 13:15:14,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:14,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:15:14,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:14,119 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2021-11-17 13:15:14,119 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:15:14,119 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667943352] [2021-11-17 13:15:14,120 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667943352] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:15:14,120 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:15:14,120 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-17 13:15:14,120 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445528141] [2021-11-17 13:15:14,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:15:14,121 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-17 13:15:14,121 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:15:14,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-17 13:15:14,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-17 13:15:14,122 INFO L87 Difference]: Start difference. First operand 1545 states and 1981 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (23), 7 states have call predecessors, (23), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2021-11-17 13:15:16,142 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:15:18,181 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:15:20,217 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:15:22,251 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:15:25,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:15:25,454 INFO L93 Difference]: Finished difference Result 1587 states and 2029 transitions. [2021-11-17 13:15:25,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-17 13:15:25,455 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (23), 7 states have call predecessors, (23), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 164 [2021-11-17 13:15:25,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:15:25,462 INFO L225 Difference]: With dead ends: 1587 [2021-11-17 13:15:25,462 INFO L226 Difference]: Without dead ends: 1585 [2021-11-17 13:15:25,463 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=137, Invalid=283, Unknown=0, NotChecked=0, Total=420 [2021-11-17 13:15:25,464 INFO L933 BasicCegarLoop]: 1575 mSDtfsCounter, 2988 mSDsluCounter, 4068 mSDsCounter, 0 mSdLazyCounter, 2688 mSolverCounterSat, 2269 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3207 SdHoareTripleChecker+Valid, 5643 SdHoareTripleChecker+Invalid, 4961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2269 IncrementalHoareTripleChecker+Valid, 2688 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.1s IncrementalHoareTripleChecker+Time [2021-11-17 13:15:25,464 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3207 Valid, 5643 Invalid, 4961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2269 Valid, 2688 Invalid, 4 Unknown, 0 Unchecked, 11.1s Time] [2021-11-17 13:15:25,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2021-11-17 13:15:25,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1569. [2021-11-17 13:15:25,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1569 states, 984 states have (on average 1.1697154471544715) internal successors, (1151), 1021 states have internal predecessors, (1151), 426 states have call successors, (426), 145 states have call predecessors, (426), 144 states have return successors, (424), 420 states have call predecessors, (424), 424 states have call successors, (424) [2021-11-17 13:15:25,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 2001 transitions. [2021-11-17 13:15:25,554 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 2001 transitions. Word has length 164 [2021-11-17 13:15:25,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:15:25,555 INFO L470 AbstractCegarLoop]: Abstraction has 1569 states and 2001 transitions. [2021-11-17 13:15:25,555 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (23), 7 states have call predecessors, (23), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2021-11-17 13:15:25,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 2001 transitions. [2021-11-17 13:15:25,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-11-17 13:15:25,557 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:15:25,557 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-11-17 13:15:25,558 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-17 13:15:25,559 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-11-17 13:15:25,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:15:25,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1959974059, now seen corresponding path program 1 times [2021-11-17 13:15:25,560 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:15:25,560 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207553805] [2021-11-17 13:15:25,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:15:25,560 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:15:25,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:25,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:15:25,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:25,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 13:15:25,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:25,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:15:25,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:25,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 13:15:25,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:25,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 13:15:25,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:25,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 13:15:25,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:25,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 13:15:25,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:25,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:15:25,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:25,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 13:15:25,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:25,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 13:15:25,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:25,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-17 13:15:25,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:25,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-17 13:15:25,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:25,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-17 13:15:25,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:25,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-17 13:15:25,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:25,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-11-17 13:15:25,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:25,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-17 13:15:25,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:25,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-11-17 13:15:25,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:25,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-11-17 13:15:25,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:25,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-11-17 13:15:25,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:25,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-11-17 13:15:25,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:25,816 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-17 13:15:25,816 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:15:25,816 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207553805] [2021-11-17 13:15:25,816 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207553805] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:15:25,816 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:15:25,817 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 13:15:25,817 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381434459] [2021-11-17 13:15:25,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:15:25,817 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 13:15:25,817 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:15:25,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 13:15:25,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 13:15:25,818 INFO L87 Difference]: Start difference. First operand 1569 states and 2001 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-11-17 13:15:27,839 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:15:29,879 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:15:31,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:15:31,901 INFO L93 Difference]: Finished difference Result 1569 states and 2001 transitions. [2021-11-17 13:15:31,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 13:15:31,901 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-11-17 13:15:31,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:15:31,912 INFO L225 Difference]: With dead ends: 1569 [2021-11-17 13:15:31,912 INFO L226 Difference]: Without dead ends: 1567 [2021-11-17 13:15:31,913 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-11-17 13:15:31,914 INFO L933 BasicCegarLoop]: 1575 mSDtfsCounter, 2158 mSDsluCounter, 2013 mSDsCounter, 0 mSdLazyCounter, 1244 mSolverCounterSat, 1288 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2383 SdHoareTripleChecker+Valid, 3588 SdHoareTripleChecker+Invalid, 2534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 1244 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2021-11-17 13:15:31,914 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2383 Valid, 3588 Invalid, 2534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 1244 Invalid, 2 Unknown, 0 Unchecked, 5.9s Time] [2021-11-17 13:15:31,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2021-11-17 13:15:32,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1567. [2021-11-17 13:15:32,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 983 states have (on average 1.1688708036622584) internal successors, (1149), 1019 states have internal predecessors, (1149), 426 states have call successors, (426), 145 states have call predecessors, (426), 144 states have return successors, (424), 420 states have call predecessors, (424), 424 states have call successors, (424) [2021-11-17 13:15:32,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 1999 transitions. [2021-11-17 13:15:32,036 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 1999 transitions. Word has length 133 [2021-11-17 13:15:32,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:15:32,037 INFO L470 AbstractCegarLoop]: Abstraction has 1567 states and 1999 transitions. [2021-11-17 13:15:32,037 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-11-17 13:15:32,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 1999 transitions. [2021-11-17 13:15:32,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-11-17 13:15:32,039 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:15:32,039 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-11-17 13:15:32,039 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-17 13:15:32,040 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-11-17 13:15:32,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:15:32,040 INFO L85 PathProgramCache]: Analyzing trace with hash 2053208171, now seen corresponding path program 1 times [2021-11-17 13:15:32,040 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:15:32,040 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940046692] [2021-11-17 13:15:32,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:15:32,041 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:15:32,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:32,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:15:32,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:32,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 13:15:32,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:32,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:15:32,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:32,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 13:15:32,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:32,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 13:15:32,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:32,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 13:15:32,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:32,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 13:15:32,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:32,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:15:32,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:32,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 13:15:32,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:32,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 13:15:32,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:32,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-17 13:15:32,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:32,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-17 13:15:32,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:32,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-17 13:15:32,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:32,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-17 13:15:32,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:32,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-11-17 13:15:32,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:32,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-17 13:15:32,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:32,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-11-17 13:15:32,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:32,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-11-17 13:15:32,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:32,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-11-17 13:15:32,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:32,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-11-17 13:15:32,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:32,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-11-17 13:15:32,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:32,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-11-17 13:15:32,254 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:15:32,254 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940046692] [2021-11-17 13:15:32,254 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940046692] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:15:32,254 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:15:32,254 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 13:15:32,254 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923338593] [2021-11-17 13:15:32,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:15:32,255 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 13:15:32,255 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:15:32,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 13:15:32,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 13:15:32,256 INFO L87 Difference]: Start difference. First operand 1567 states and 1999 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-11-17 13:15:34,276 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:15:36,313 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:15:38,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:15:38,291 INFO L93 Difference]: Finished difference Result 1567 states and 1999 transitions. [2021-11-17 13:15:38,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 13:15:38,291 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-11-17 13:15:38,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:15:38,299 INFO L225 Difference]: With dead ends: 1567 [2021-11-17 13:15:38,299 INFO L226 Difference]: Without dead ends: 1565 [2021-11-17 13:15:38,300 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-11-17 13:15:38,300 INFO L933 BasicCegarLoop]: 1573 mSDtfsCounter, 2152 mSDsluCounter, 2013 mSDsCounter, 0 mSdLazyCounter, 1242 mSolverCounterSat, 1288 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2376 SdHoareTripleChecker+Valid, 3586 SdHoareTripleChecker+Invalid, 2532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 1242 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2021-11-17 13:15:38,301 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2376 Valid, 3586 Invalid, 2532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 1242 Invalid, 2 Unknown, 0 Unchecked, 5.9s Time] [2021-11-17 13:15:38,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1565 states. [2021-11-17 13:15:38,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1565 to 1565. [2021-11-17 13:15:38,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1565 states, 982 states have (on average 1.1680244399185336) internal successors, (1147), 1017 states have internal predecessors, (1147), 426 states have call successors, (426), 145 states have call predecessors, (426), 144 states have return successors, (424), 420 states have call predecessors, (424), 424 states have call successors, (424) [2021-11-17 13:15:38,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 1997 transitions. [2021-11-17 13:15:38,397 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 1997 transitions. Word has length 139 [2021-11-17 13:15:38,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:15:38,397 INFO L470 AbstractCegarLoop]: Abstraction has 1565 states and 1997 transitions. [2021-11-17 13:15:38,397 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-11-17 13:15:38,398 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 1997 transitions. [2021-11-17 13:15:38,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2021-11-17 13:15:38,400 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:15:38,400 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-11-17 13:15:38,400 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-17 13:15:38,400 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_linux_kernel_rcu_srcu_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-11-17 13:15:38,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:15:38,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1485080845, now seen corresponding path program 1 times [2021-11-17 13:15:38,401 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:15:38,401 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553877591] [2021-11-17 13:15:38,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:15:38,402 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:15:38,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:38,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:15:38,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:38,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 13:15:38,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:38,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:15:38,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:38,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 13:15:38,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:38,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 13:15:38,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:38,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 13:15:38,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:38,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 13:15:38,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:38,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:15:38,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:38,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 13:15:38,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:38,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 13:15:38,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:38,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-17 13:15:38,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:38,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-17 13:15:38,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:38,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-17 13:15:38,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:38,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-17 13:15:38,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:38,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-11-17 13:15:38,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:38,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-17 13:15:38,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:38,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-11-17 13:15:38,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:38,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-11-17 13:15:38,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:38,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-11-17 13:15:38,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:38,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-11-17 13:15:38,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:38,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-11-17 13:15:38,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:38,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-11-17 13:15:38,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:38,642 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-17 13:15:38,642 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:15:38,643 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553877591] [2021-11-17 13:15:38,643 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553877591] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:15:38,643 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:15:38,643 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 13:15:38,643 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999589895] [2021-11-17 13:15:38,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:15:38,645 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 13:15:38,646 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:15:38,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 13:15:38,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 13:15:38,646 INFO L87 Difference]: Start difference. First operand 1565 states and 1997 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-11-17 13:15:40,666 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:15:42,701 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:15:44,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:15:44,919 INFO L93 Difference]: Finished difference Result 1565 states and 1997 transitions. [2021-11-17 13:15:44,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 13:15:44,920 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-11-17 13:15:44,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:15:44,926 INFO L225 Difference]: With dead ends: 1565 [2021-11-17 13:15:44,926 INFO L226 Difference]: Without dead ends: 1563 [2021-11-17 13:15:44,927 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-11-17 13:15:44,927 INFO L933 BasicCegarLoop]: 1571 mSDtfsCounter, 2146 mSDsluCounter, 2013 mSDsCounter, 0 mSdLazyCounter, 1240 mSolverCounterSat, 1288 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2369 SdHoareTripleChecker+Valid, 3584 SdHoareTripleChecker+Invalid, 2530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 1240 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2021-11-17 13:15:44,928 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2369 Valid, 3584 Invalid, 2530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 1240 Invalid, 2 Unknown, 0 Unchecked, 6.1s Time] [2021-11-17 13:15:44,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2021-11-17 13:15:45,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 1563. [2021-11-17 13:15:45,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1563 states, 981 states have (on average 1.1671763506625892) internal successors, (1145), 1015 states have internal predecessors, (1145), 426 states have call successors, (426), 145 states have call predecessors, (426), 144 states have return successors, (424), 420 states have call predecessors, (424), 424 states have call successors, (424) [2021-11-17 13:15:45,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 1995 transitions. [2021-11-17 13:15:45,023 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 1995 transitions. Word has length 145 [2021-11-17 13:15:45,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:15:45,023 INFO L470 AbstractCegarLoop]: Abstraction has 1563 states and 1995 transitions. [2021-11-17 13:15:45,024 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-11-17 13:15:45,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 1995 transitions. [2021-11-17 13:15:45,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2021-11-17 13:15:45,026 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:15:45,026 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-11-17 13:15:45,026 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-17 13:15:45,026 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_linux_lib_idr_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-11-17 13:15:45,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:15:45,027 INFO L85 PathProgramCache]: Analyzing trace with hash -2138778281, now seen corresponding path program 1 times [2021-11-17 13:15:45,027 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:15:45,027 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555885880] [2021-11-17 13:15:45,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:15:45,027 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:15:45,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:45,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:15:45,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:45,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 13:15:45,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:45,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:15:45,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:45,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 13:15:45,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:45,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 13:15:45,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:45,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 13:15:45,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:45,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 13:15:45,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:45,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:15:45,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:45,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 13:15:45,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:45,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 13:15:45,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:45,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-17 13:15:45,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:45,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-17 13:15:45,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:45,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-17 13:15:45,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:45,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-17 13:15:45,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:45,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-11-17 13:15:45,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:45,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-17 13:15:45,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:45,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-11-17 13:15:45,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:45,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-11-17 13:15:45,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:45,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-11-17 13:15:45,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:45,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-11-17 13:15:45,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:45,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-11-17 13:15:45,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:45,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-11-17 13:15:45,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:45,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-11-17 13:15:45,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:45,254 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-17 13:15:45,254 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:15:45,255 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555885880] [2021-11-17 13:15:45,255 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555885880] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:15:45,255 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:15:45,255 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 13:15:45,256 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141182137] [2021-11-17 13:15:45,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:15:45,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 13:15:45,257 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:15:45,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 13:15:45,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 13:15:45,258 INFO L87 Difference]: Start difference. First operand 1563 states and 1995 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-11-17 13:15:47,280 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:15:49,314 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:15:51,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:15:51,411 INFO L93 Difference]: Finished difference Result 1563 states and 1995 transitions. [2021-11-17 13:15:51,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 13:15:51,411 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-11-17 13:15:51,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:15:51,418 INFO L225 Difference]: With dead ends: 1563 [2021-11-17 13:15:51,418 INFO L226 Difference]: Without dead ends: 1561 [2021-11-17 13:15:51,419 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-11-17 13:15:51,419 INFO L933 BasicCegarLoop]: 1569 mSDtfsCounter, 2140 mSDsluCounter, 2013 mSDsCounter, 0 mSdLazyCounter, 1238 mSolverCounterSat, 1288 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2362 SdHoareTripleChecker+Valid, 3582 SdHoareTripleChecker+Invalid, 2528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 1238 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2021-11-17 13:15:51,420 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2362 Valid, 3582 Invalid, 2528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 1238 Invalid, 2 Unknown, 0 Unchecked, 6.0s Time] [2021-11-17 13:15:51,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1561 states. [2021-11-17 13:15:51,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1561 to 1561. [2021-11-17 13:15:51,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1561 states, 980 states have (on average 1.166326530612245) internal successors, (1143), 1013 states have internal predecessors, (1143), 426 states have call successors, (426), 145 states have call predecessors, (426), 144 states have return successors, (424), 420 states have call predecessors, (424), 424 states have call successors, (424) [2021-11-17 13:15:51,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 1993 transitions. [2021-11-17 13:15:51,549 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 1993 transitions. Word has length 151 [2021-11-17 13:15:51,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:15:51,550 INFO L470 AbstractCegarLoop]: Abstraction has 1561 states and 1993 transitions. [2021-11-17 13:15:51,550 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-11-17 13:15:51,550 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 1993 transitions. [2021-11-17 13:15:51,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2021-11-17 13:15:51,552 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:15:51,553 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:15:51,553 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-17 13:15:51,553 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-11-17 13:15:51,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:15:51,553 INFO L85 PathProgramCache]: Analyzing trace with hash 436294476, now seen corresponding path program 1 times [2021-11-17 13:15:51,554 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:15:51,554 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726743532] [2021-11-17 13:15:51,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:15:51,554 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:15:51,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:51,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:15:51,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:51,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 13:15:51,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:51,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:15:51,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:51,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 13:15:51,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:51,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 13:15:51,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:51,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 13:15:51,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:51,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 13:15:51,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:51,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:15:51,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:51,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 13:15:51,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:51,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 13:15:51,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:51,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-17 13:15:51,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:51,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 13:15:51,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:51,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:15:51,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:51,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:15:51,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:51,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:15:51,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:51,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-11-17 13:15:51,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:51,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:15:51,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:51,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:15:51,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:51,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:15:51,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:51,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-11-17 13:15:51,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:51,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:15:51,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:51,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:15:51,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:51,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:15:51,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:51,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-11-17 13:15:51,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:51,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-11-17 13:15:51,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:51,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2021-11-17 13:15:51,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:51,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:15:51,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:51,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2021-11-17 13:15:51,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:51,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:15:51,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:51,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:15:51,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:51,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-17 13:15:51,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:15:51,818 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2021-11-17 13:15:51,818 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:15:51,818 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726743532] [2021-11-17 13:15:51,818 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726743532] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:15:51,819 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:15:51,819 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-17 13:15:51,819 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332807737] [2021-11-17 13:15:51,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:15:51,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-17 13:15:51,820 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:15:51,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-17 13:15:51,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-11-17 13:15:51,821 INFO L87 Difference]: Start difference. First operand 1561 states and 1993 transitions. Second operand has 10 states, 10 states have (on average 7.1) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (27), 8 states have call predecessors, (27), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2021-11-17 13:15:53,841 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:15:55,876 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:16:01,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:16:01,629 INFO L93 Difference]: Finished difference Result 1581 states and 2023 transitions. [2021-11-17 13:16:01,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-17 13:16:01,629 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (27), 8 states have call predecessors, (27), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 187 [2021-11-17 13:16:01,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:16:01,635 INFO L225 Difference]: With dead ends: 1581 [2021-11-17 13:16:01,635 INFO L226 Difference]: Without dead ends: 1579 [2021-11-17 13:16:01,635 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=183, Invalid=417, Unknown=0, NotChecked=0, Total=600 [2021-11-17 13:16:01,636 INFO L933 BasicCegarLoop]: 1564 mSDtfsCounter, 2266 mSDsluCounter, 5248 mSDsCounter, 0 mSdLazyCounter, 3885 mSolverCounterSat, 2522 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2266 SdHoareTripleChecker+Valid, 6812 SdHoareTripleChecker+Invalid, 6409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2522 IncrementalHoareTripleChecker+Valid, 3885 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2021-11-17 13:16:01,637 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2266 Valid, 6812 Invalid, 6409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2522 Valid, 3885 Invalid, 2 Unknown, 0 Unchecked, 9.5s Time] [2021-11-17 13:16:01,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1579 states. [2021-11-17 13:16:01,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1579 to 1561. [2021-11-17 13:16:01,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1561 states, 980 states have (on average 1.1642857142857144) internal successors, (1141), 1013 states have internal predecessors, (1141), 426 states have call successors, (426), 145 states have call predecessors, (426), 144 states have return successors, (424), 420 states have call predecessors, (424), 424 states have call successors, (424) [2021-11-17 13:16:01,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 1991 transitions. [2021-11-17 13:16:01,722 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 1991 transitions. Word has length 187 [2021-11-17 13:16:01,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:16:01,723 INFO L470 AbstractCegarLoop]: Abstraction has 1561 states and 1991 transitions. [2021-11-17 13:16:01,723 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (27), 8 states have call predecessors, (27), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2021-11-17 13:16:01,723 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 1991 transitions. [2021-11-17 13:16:01,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-11-17 13:16:01,725 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:16:01,725 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-11-17 13:16:01,726 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-17 13:16:01,726 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-11-17 13:16:01,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:16:01,726 INFO L85 PathProgramCache]: Analyzing trace with hash 223795412, now seen corresponding path program 1 times [2021-11-17 13:16:01,727 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:16:01,727 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219356083] [2021-11-17 13:16:01,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:16:01,727 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:16:01,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:01,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:16:01,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:01,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 13:16:01,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:01,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:16:01,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:01,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 13:16:01,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:01,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 13:16:01,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:01,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 13:16:01,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:01,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 13:16:01,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:01,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:16:01,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:01,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 13:16:01,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:01,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 13:16:01,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:01,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-17 13:16:01,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:01,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-17 13:16:01,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:01,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-17 13:16:01,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:01,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-17 13:16:01,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:01,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-11-17 13:16:01,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:01,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-17 13:16:01,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:01,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-11-17 13:16:01,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:01,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-11-17 13:16:01,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:01,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-11-17 13:16:01,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:01,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-11-17 13:16:01,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:01,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-11-17 13:16:01,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:01,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-11-17 13:16:01,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:01,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-11-17 13:16:01,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:01,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2021-11-17 13:16:01,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:01,933 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-17 13:16:01,933 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:16:01,933 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219356083] [2021-11-17 13:16:01,934 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219356083] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:16:01,934 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:16:01,934 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 13:16:01,934 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579705072] [2021-11-17 13:16:01,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:16:01,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 13:16:01,935 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:16:01,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 13:16:01,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 13:16:01,936 INFO L87 Difference]: Start difference. First operand 1561 states and 1991 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-11-17 13:16:03,956 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:16:05,996 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:16:08,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:16:08,057 INFO L93 Difference]: Finished difference Result 1561 states and 1991 transitions. [2021-11-17 13:16:08,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 13:16:08,058 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-11-17 13:16:08,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:16:08,063 INFO L225 Difference]: With dead ends: 1561 [2021-11-17 13:16:08,063 INFO L226 Difference]: Without dead ends: 1559 [2021-11-17 13:16:08,064 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-11-17 13:16:08,065 INFO L933 BasicCegarLoop]: 1567 mSDtfsCounter, 2134 mSDsluCounter, 2013 mSDsCounter, 0 mSdLazyCounter, 1236 mSolverCounterSat, 1288 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2355 SdHoareTripleChecker+Valid, 3580 SdHoareTripleChecker+Invalid, 2526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 1236 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2021-11-17 13:16:08,065 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2355 Valid, 3580 Invalid, 2526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 1236 Invalid, 2 Unknown, 0 Unchecked, 5.9s Time] [2021-11-17 13:16:08,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1559 states. [2021-11-17 13:16:08,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1559 to 1559. [2021-11-17 13:16:08,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1559 states, 979 states have (on average 1.163432073544433) internal successors, (1139), 1011 states have internal predecessors, (1139), 426 states have call successors, (426), 145 states have call predecessors, (426), 144 states have return successors, (424), 420 states have call predecessors, (424), 424 states have call successors, (424) [2021-11-17 13:16:08,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 1989 transitions. [2021-11-17 13:16:08,192 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 1989 transitions. Word has length 157 [2021-11-17 13:16:08,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:16:08,193 INFO L470 AbstractCegarLoop]: Abstraction has 1559 states and 1989 transitions. [2021-11-17 13:16:08,193 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-11-17 13:16:08,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 1989 transitions. [2021-11-17 13:16:08,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-11-17 13:16:08,196 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:16:08,196 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, 1, 1, 1, 1, 1, 1] [2021-11-17 13:16:08,196 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-17 13:16:08,197 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_linux_net_rtnetlink_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-11-17 13:16:08,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:16:08,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1886448964, now seen corresponding path program 1 times [2021-11-17 13:16:08,197 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:16:08,197 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247271139] [2021-11-17 13:16:08,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:16:08,198 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:16:08,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:08,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:16:08,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:08,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 13:16:08,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:08,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:16:08,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:08,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 13:16:08,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:08,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 13:16:08,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:08,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 13:16:08,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:08,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 13:16:08,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:08,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:16:08,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:08,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 13:16:08,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:08,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 13:16:08,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:08,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-17 13:16:08,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:08,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-17 13:16:08,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:08,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-17 13:16:08,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:08,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-17 13:16:08,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:08,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-11-17 13:16:08,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:08,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-17 13:16:08,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:08,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-11-17 13:16:08,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:08,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-11-17 13:16:08,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:08,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-11-17 13:16:08,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:08,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-11-17 13:16:08,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:08,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-11-17 13:16:08,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:08,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-11-17 13:16:08,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:08,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-11-17 13:16:08,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:08,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2021-11-17 13:16:08,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:08,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2021-11-17 13:16:08,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:08,416 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-17 13:16:08,417 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:16:08,417 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247271139] [2021-11-17 13:16:08,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247271139] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:16:08,417 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:16:08,417 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 13:16:08,417 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578513951] [2021-11-17 13:16:08,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:16:08,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 13:16:08,418 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:16:08,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 13:16:08,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 13:16:08,419 INFO L87 Difference]: Start difference. First operand 1559 states and 1989 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2021-11-17 13:16:10,439 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:16:12,468 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:16:14,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:16:14,464 INFO L93 Difference]: Finished difference Result 1559 states and 1989 transitions. [2021-11-17 13:16:14,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 13:16:14,465 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 163 [2021-11-17 13:16:14,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:16:14,469 INFO L225 Difference]: With dead ends: 1559 [2021-11-17 13:16:14,470 INFO L226 Difference]: Without dead ends: 1557 [2021-11-17 13:16:14,470 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 13:16:14,471 INFO L933 BasicCegarLoop]: 1565 mSDtfsCounter, 2128 mSDsluCounter, 2013 mSDsCounter, 0 mSdLazyCounter, 1234 mSolverCounterSat, 1288 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2348 SdHoareTripleChecker+Valid, 3578 SdHoareTripleChecker+Invalid, 2524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 1234 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2021-11-17 13:16:14,471 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2348 Valid, 3578 Invalid, 2524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 1234 Invalid, 2 Unknown, 0 Unchecked, 5.9s Time] [2021-11-17 13:16:14,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1557 states. [2021-11-17 13:16:14,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1557 to 1557. [2021-11-17 13:16:14,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1557 states, 978 states have (on average 1.1625766871165644) internal successors, (1137), 1009 states have internal predecessors, (1137), 426 states have call successors, (426), 145 states have call predecessors, (426), 144 states have return successors, (424), 420 states have call predecessors, (424), 424 states have call successors, (424) [2021-11-17 13:16:14,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1557 states to 1557 states and 1987 transitions. [2021-11-17 13:16:14,574 INFO L78 Accepts]: Start accepts. Automaton has 1557 states and 1987 transitions. Word has length 163 [2021-11-17 13:16:14,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:16:14,575 INFO L470 AbstractCegarLoop]: Abstraction has 1557 states and 1987 transitions. [2021-11-17 13:16:14,575 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2021-11-17 13:16:14,575 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 1987 transitions. [2021-11-17 13:16:14,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-11-17 13:16:14,596 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:16:14,597 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:16:14,597 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-17 13:16:14,597 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_linux_net_sock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-11-17 13:16:14,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:16:14,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1399962434, now seen corresponding path program 1 times [2021-11-17 13:16:14,598 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:16:14,598 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607729756] [2021-11-17 13:16:14,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:16:14,599 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:16:14,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:14,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:16:14,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:14,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 13:16:14,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:14,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:16:14,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:14,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 13:16:14,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:14,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 13:16:14,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:14,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 13:16:14,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:14,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 13:16:14,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:14,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:16:14,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:14,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 13:16:14,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:14,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 13:16:14,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:14,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-17 13:16:14,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:14,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-17 13:16:14,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:14,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-17 13:16:14,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:14,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-17 13:16:14,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:14,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-11-17 13:16:14,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:14,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-17 13:16:14,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:14,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-11-17 13:16:14,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:14,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-11-17 13:16:14,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:14,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-11-17 13:16:14,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:14,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-11-17 13:16:14,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:14,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-11-17 13:16:14,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:14,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-11-17 13:16:14,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:14,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-11-17 13:16:14,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:14,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2021-11-17 13:16:14,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:14,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2021-11-17 13:16:14,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:14,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2021-11-17 13:16:14,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:14,793 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-17 13:16:14,793 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:16:14,793 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607729756] [2021-11-17 13:16:14,793 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607729756] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:16:14,793 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:16:14,793 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 13:16:14,794 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626583760] [2021-11-17 13:16:14,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:16:14,794 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 13:16:14,794 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:16:14,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 13:16:14,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 13:16:14,796 INFO L87 Difference]: Start difference. First operand 1557 states and 1987 transitions. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2021-11-17 13:16:16,816 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:16:18,850 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:16:20,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:16:20,994 INFO L93 Difference]: Finished difference Result 1557 states and 1987 transitions. [2021-11-17 13:16:20,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 13:16:20,995 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 169 [2021-11-17 13:16:20,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:16:20,999 INFO L225 Difference]: With dead ends: 1557 [2021-11-17 13:16:20,999 INFO L226 Difference]: Without dead ends: 1555 [2021-11-17 13:16:21,000 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 13:16:21,000 INFO L933 BasicCegarLoop]: 1563 mSDtfsCounter, 2122 mSDsluCounter, 2013 mSDsCounter, 0 mSdLazyCounter, 1232 mSolverCounterSat, 1288 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2341 SdHoareTripleChecker+Valid, 3576 SdHoareTripleChecker+Invalid, 2522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 1232 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2021-11-17 13:16:21,000 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2341 Valid, 3576 Invalid, 2522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 1232 Invalid, 2 Unknown, 0 Unchecked, 6.0s Time] [2021-11-17 13:16:21,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1555 states. [2021-11-17 13:16:21,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1555 to 1555. [2021-11-17 13:16:21,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1555 states, 977 states have (on average 1.1617195496417605) internal successors, (1135), 1007 states have internal predecessors, (1135), 426 states have call successors, (426), 145 states have call predecessors, (426), 144 states have return successors, (424), 420 states have call predecessors, (424), 424 states have call successors, (424) [2021-11-17 13:16:21,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 1985 transitions. [2021-11-17 13:16:21,115 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 1985 transitions. Word has length 169 [2021-11-17 13:16:21,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:16:21,115 INFO L470 AbstractCegarLoop]: Abstraction has 1555 states and 1985 transitions. [2021-11-17 13:16:21,115 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2021-11-17 13:16:21,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 1985 transitions. [2021-11-17 13:16:21,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2021-11-17 13:16:21,118 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:16:21,118 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:16:21,118 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-17 13:16:21,118 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-11-17 13:16:21,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:16:21,119 INFO L85 PathProgramCache]: Analyzing trace with hash -455654723, now seen corresponding path program 1 times [2021-11-17 13:16:21,119 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:16:21,119 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543052722] [2021-11-17 13:16:21,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:16:21,120 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:16:21,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:21,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:16:21,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:21,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 13:16:21,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:21,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:16:21,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:21,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 13:16:21,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:21,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 13:16:21,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:21,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 13:16:21,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:21,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 13:16:21,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:21,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:16:21,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:21,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 13:16:21,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:21,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 13:16:21,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:21,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-17 13:16:21,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:21,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-17 13:16:21,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:21,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-17 13:16:21,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:21,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-17 13:16:21,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:21,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-11-17 13:16:21,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:21,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-17 13:16:21,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:21,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-11-17 13:16:21,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:21,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-11-17 13:16:21,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:21,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-11-17 13:16:21,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:21,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-11-17 13:16:21,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:21,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-11-17 13:16:21,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:21,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-11-17 13:16:21,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:21,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-11-17 13:16:21,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:21,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2021-11-17 13:16:21,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:21,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2021-11-17 13:16:21,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:21,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2021-11-17 13:16:21,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:21,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2021-11-17 13:16:21,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:21,357 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-17 13:16:21,358 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:16:21,359 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543052722] [2021-11-17 13:16:21,359 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543052722] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:16:21,359 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:16:21,359 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 13:16:21,359 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354662166] [2021-11-17 13:16:21,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:16:21,360 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 13:16:21,361 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:16:21,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 13:16:21,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 13:16:21,361 INFO L87 Difference]: Start difference. First operand 1555 states and 1985 transitions. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2021-11-17 13:16:23,382 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:16:25,417 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:16:27,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:16:27,519 INFO L93 Difference]: Finished difference Result 1555 states and 1985 transitions. [2021-11-17 13:16:27,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 13:16:27,519 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 175 [2021-11-17 13:16:27,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:16:27,523 INFO L225 Difference]: With dead ends: 1555 [2021-11-17 13:16:27,523 INFO L226 Difference]: Without dead ends: 1553 [2021-11-17 13:16:27,523 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 13:16:27,524 INFO L933 BasicCegarLoop]: 1561 mSDtfsCounter, 2116 mSDsluCounter, 2013 mSDsCounter, 0 mSdLazyCounter, 1230 mSolverCounterSat, 1288 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2334 SdHoareTripleChecker+Valid, 3574 SdHoareTripleChecker+Invalid, 2520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 1230 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2021-11-17 13:16:27,524 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2334 Valid, 3574 Invalid, 2520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 1230 Invalid, 2 Unknown, 0 Unchecked, 6.0s Time] [2021-11-17 13:16:27,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1553 states. [2021-11-17 13:16:27,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1553 to 1553. [2021-11-17 13:16:27,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1553 states, 976 states have (on average 1.160860655737705) internal successors, (1133), 1005 states have internal predecessors, (1133), 426 states have call successors, (426), 145 states have call predecessors, (426), 144 states have return successors, (424), 420 states have call predecessors, (424), 424 states have call successors, (424) [2021-11-17 13:16:27,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1553 states to 1553 states and 1983 transitions. [2021-11-17 13:16:27,637 INFO L78 Accepts]: Start accepts. Automaton has 1553 states and 1983 transitions. Word has length 175 [2021-11-17 13:16:27,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:16:27,637 INFO L470 AbstractCegarLoop]: Abstraction has 1553 states and 1983 transitions. [2021-11-17 13:16:27,638 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2021-11-17 13:16:27,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1553 states and 1983 transitions. [2021-11-17 13:16:27,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2021-11-17 13:16:27,640 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:16:27,641 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:16:27,641 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-17 13:16:27,641 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-11-17 13:16:27,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:16:27,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1414320707, now seen corresponding path program 1 times [2021-11-17 13:16:27,642 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:16:27,642 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942260177] [2021-11-17 13:16:27,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:16:27,642 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:16:27,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:27,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:16:27,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:27,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 13:16:27,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:27,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:16:27,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:27,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 13:16:27,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:27,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 13:16:27,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:27,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 13:16:27,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:27,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 13:16:27,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:27,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:16:27,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:27,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 13:16:27,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:27,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 13:16:27,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:27,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-17 13:16:27,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:27,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 13:16:27,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:27,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:16:27,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:27,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:16:27,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:27,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:16:27,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:27,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-11-17 13:16:27,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:27,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:16:27,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:27,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:16:27,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:27,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:16:27,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:27,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-11-17 13:16:27,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:27,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:16:27,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:27,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:16:27,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:27,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:16:27,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:27,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-11-17 13:16:27,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:27,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-11-17 13:16:27,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:27,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2021-11-17 13:16:27,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:27,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:16:27,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:27,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2021-11-17 13:16:27,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:28,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:16:28,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:28,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:16:28,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:28,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-17 13:16:28,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:28,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2021-11-17 13:16:28,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:28,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:16:28,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:28,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:16:28,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:28,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-17 13:16:28,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:28,036 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2021-11-17 13:16:28,037 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:16:28,037 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942260177] [2021-11-17 13:16:28,037 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942260177] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:16:28,037 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:16:28,037 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-17 13:16:28,037 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800222105] [2021-11-17 13:16:28,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:16:28,038 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-17 13:16:28,038 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:16:28,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-17 13:16:28,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-11-17 13:16:28,039 INFO L87 Difference]: Start difference. First operand 1553 states and 1983 transitions. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (31), 8 states have call predecessors, (31), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2021-11-17 13:16:30,060 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:16:32,095 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:16:34,129 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:16:36,164 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:16:38,203 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:16:40,012 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:16:44,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:16:44,542 INFO L93 Difference]: Finished difference Result 1587 states and 2022 transitions. [2021-11-17 13:16:44,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-17 13:16:44,543 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (31), 8 states have call predecessors, (31), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 212 [2021-11-17 13:16:44,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:16:44,547 INFO L225 Difference]: With dead ends: 1587 [2021-11-17 13:16:44,548 INFO L226 Difference]: Without dead ends: 1585 [2021-11-17 13:16:44,548 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=180, Invalid=420, Unknown=0, NotChecked=0, Total=600 [2021-11-17 13:16:44,549 INFO L933 BasicCegarLoop]: 1618 mSDtfsCounter, 2796 mSDsluCounter, 5145 mSDsCounter, 0 mSdLazyCounter, 4165 mSolverCounterSat, 2819 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2814 SdHoareTripleChecker+Valid, 6763 SdHoareTripleChecker+Invalid, 6989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2819 IncrementalHoareTripleChecker+Valid, 4165 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.1s IncrementalHoareTripleChecker+Time [2021-11-17 13:16:44,549 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2814 Valid, 6763 Invalid, 6989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2819 Valid, 4165 Invalid, 5 Unknown, 0 Unchecked, 16.1s Time] [2021-11-17 13:16:44,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2021-11-17 13:16:44,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1557. [2021-11-17 13:16:44,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1557 states, 979 states have (on average 1.160367722165475) internal successors, (1136), 1008 states have internal predecessors, (1136), 426 states have call successors, (426), 146 states have call predecessors, (426), 145 states have return successors, (424), 420 states have call predecessors, (424), 424 states have call successors, (424) [2021-11-17 13:16:44,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1557 states to 1557 states and 1986 transitions. [2021-11-17 13:16:44,657 INFO L78 Accepts]: Start accepts. Automaton has 1557 states and 1986 transitions. Word has length 212 [2021-11-17 13:16:44,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:16:44,658 INFO L470 AbstractCegarLoop]: Abstraction has 1557 states and 1986 transitions. [2021-11-17 13:16:44,658 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (31), 8 states have call predecessors, (31), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2021-11-17 13:16:44,658 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 1986 transitions. [2021-11-17 13:16:44,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2021-11-17 13:16:44,661 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:16:44,661 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, 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-11-17 13:16:44,661 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-17 13:16:44,661 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-11-17 13:16:44,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:16:44,662 INFO L85 PathProgramCache]: Analyzing trace with hash -472763115, now seen corresponding path program 1 times [2021-11-17 13:16:44,662 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:16:44,662 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329643254] [2021-11-17 13:16:44,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:16:44,662 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:16:44,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:44,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:16:44,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:44,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 13:16:44,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:44,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:16:44,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:44,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 13:16:44,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:44,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 13:16:44,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:44,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 13:16:44,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:44,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 13:16:44,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:44,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:16:44,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:44,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 13:16:44,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:44,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 13:16:44,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:44,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-17 13:16:44,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:44,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-17 13:16:44,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:44,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-17 13:16:44,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:44,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-17 13:16:44,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:44,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-11-17 13:16:44,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:44,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-17 13:16:44,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:44,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-11-17 13:16:44,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:44,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-11-17 13:16:44,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:44,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-11-17 13:16:44,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:44,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-11-17 13:16:44,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:44,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-11-17 13:16:44,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:44,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-11-17 13:16:44,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:44,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-11-17 13:16:44,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:44,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2021-11-17 13:16:44,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:44,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2021-11-17 13:16:44,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:44,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2021-11-17 13:16:44,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:44,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2021-11-17 13:16:44,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:44,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2021-11-17 13:16:44,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:44,887 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-17 13:16:44,887 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:16:44,888 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329643254] [2021-11-17 13:16:44,888 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329643254] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:16:44,888 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:16:44,888 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 13:16:44,888 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715700589] [2021-11-17 13:16:44,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:16:44,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 13:16:44,889 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:16:44,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 13:16:44,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 13:16:44,890 INFO L87 Difference]: Start difference. First operand 1557 states and 1986 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2021-11-17 13:16:46,909 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:16:48,809 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:16:50,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:16:50,798 INFO L93 Difference]: Finished difference Result 1557 states and 1986 transitions. [2021-11-17 13:16:50,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 13:16:50,799 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 181 [2021-11-17 13:16:50,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:16:50,803 INFO L225 Difference]: With dead ends: 1557 [2021-11-17 13:16:50,803 INFO L226 Difference]: Without dead ends: 1555 [2021-11-17 13:16:50,803 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 13:16:50,804 INFO L933 BasicCegarLoop]: 1559 mSDtfsCounter, 2110 mSDsluCounter, 2013 mSDsCounter, 0 mSdLazyCounter, 1229 mSolverCounterSat, 1288 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2327 SdHoareTripleChecker+Valid, 3572 SdHoareTripleChecker+Invalid, 2518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 1229 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2021-11-17 13:16:50,804 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2327 Valid, 3572 Invalid, 2518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 1229 Invalid, 1 Unknown, 0 Unchecked, 5.8s Time] [2021-11-17 13:16:50,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1555 states. [2021-11-17 13:16:50,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1555 to 1555. [2021-11-17 13:16:50,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1555 states, 978 states have (on average 1.1595092024539877) internal successors, (1134), 1006 states have internal predecessors, (1134), 426 states have call successors, (426), 146 states have call predecessors, (426), 145 states have return successors, (424), 420 states have call predecessors, (424), 424 states have call successors, (424) [2021-11-17 13:16:50,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 1984 transitions. [2021-11-17 13:16:50,935 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 1984 transitions. Word has length 181 [2021-11-17 13:16:50,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:16:50,936 INFO L470 AbstractCegarLoop]: Abstraction has 1555 states and 1984 transitions. [2021-11-17 13:16:50,936 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2021-11-17 13:16:50,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 1984 transitions. [2021-11-17 13:16:50,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2021-11-17 13:16:50,938 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:16:50,939 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, 1, 1, 1, 1, 1, 1, 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-11-17 13:16:50,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-17 13:16:50,940 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ldv_linux_usb_urb_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-11-17 13:16:50,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:16:50,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1896480811, now seen corresponding path program 1 times [2021-11-17 13:16:50,941 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:16:50,941 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367280364] [2021-11-17 13:16:50,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:16:50,941 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:16:50,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:51,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:16:51,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:51,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 13:16:51,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:51,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:16:51,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:51,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 13:16:51,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:51,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 13:16:51,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:51,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 13:16:51,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:51,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 13:16:51,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:51,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:16:51,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:51,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 13:16:51,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:51,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 13:16:51,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:51,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-17 13:16:51,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:51,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-17 13:16:51,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:51,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-17 13:16:51,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:51,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-17 13:16:51,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:51,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-11-17 13:16:51,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:51,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-17 13:16:51,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:51,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-11-17 13:16:51,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:51,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-11-17 13:16:51,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:51,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-11-17 13:16:51,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:51,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-11-17 13:16:51,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:51,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-11-17 13:16:51,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:51,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-11-17 13:16:51,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:51,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-11-17 13:16:51,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:51,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2021-11-17 13:16:51,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:51,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2021-11-17 13:16:51,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:51,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2021-11-17 13:16:51,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:51,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2021-11-17 13:16:51,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:51,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2021-11-17 13:16:51,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:51,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2021-11-17 13:16:51,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:51,158 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-17 13:16:51,158 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:16:51,158 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367280364] [2021-11-17 13:16:51,158 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367280364] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:16:51,159 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:16:51,159 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 13:16:51,159 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332572128] [2021-11-17 13:16:51,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:16:51,159 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 13:16:51,160 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:16:51,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 13:16:51,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 13:16:51,160 INFO L87 Difference]: Start difference. First operand 1555 states and 1984 transitions. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (30), 4 states have call predecessors, (30), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2021-11-17 13:16:53,182 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:16:54,649 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:16:58,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:16:58,684 INFO L93 Difference]: Finished difference Result 2951 states and 3765 transitions. [2021-11-17 13:16:58,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-17 13:16:58,685 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (30), 4 states have call predecessors, (30), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 187 [2021-11-17 13:16:58,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:16:58,695 INFO L225 Difference]: With dead ends: 2951 [2021-11-17 13:16:58,696 INFO L226 Difference]: Without dead ends: 2796 [2021-11-17 13:16:58,700 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-11-17 13:16:58,700 INFO L933 BasicCegarLoop]: 1962 mSDtfsCounter, 2765 mSDsluCounter, 3356 mSDsCounter, 0 mSdLazyCounter, 2578 mSolverCounterSat, 2109 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2978 SdHoareTripleChecker+Valid, 5318 SdHoareTripleChecker+Invalid, 4688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2109 IncrementalHoareTripleChecker+Valid, 2578 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2021-11-17 13:16:58,701 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2978 Valid, 5318 Invalid, 4688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2109 Valid, 2578 Invalid, 1 Unknown, 0 Unchecked, 7.2s Time] [2021-11-17 13:16:58,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2796 states. [2021-11-17 13:16:58,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2796 to 2782. [2021-11-17 13:16:58,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2782 states, 1751 states have (on average 1.1633352370074244) internal successors, (2037), 1794 states have internal predecessors, (2037), 763 states have call successors, (763), 262 states have call predecessors, (763), 262 states have return successors, (775), 757 states have call predecessors, (775), 761 states have call successors, (775) [2021-11-17 13:16:58,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2782 states to 2782 states and 3575 transitions. [2021-11-17 13:16:58,946 INFO L78 Accepts]: Start accepts. Automaton has 2782 states and 3575 transitions. Word has length 187 [2021-11-17 13:16:58,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:16:58,947 INFO L470 AbstractCegarLoop]: Abstraction has 2782 states and 3575 transitions. [2021-11-17 13:16:58,947 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (30), 4 states have call predecessors, (30), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2021-11-17 13:16:58,947 INFO L276 IsEmpty]: Start isEmpty. Operand 2782 states and 3575 transitions. [2021-11-17 13:16:58,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2021-11-17 13:16:58,949 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:16:58,950 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:16:58,950 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-17 13:16:58,950 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-11-17 13:16:58,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:16:58,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1060801433, now seen corresponding path program 1 times [2021-11-17 13:16:58,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:16:58,952 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259306949] [2021-11-17 13:16:58,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:16:58,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:16:59,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:59,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:16:59,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:59,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 13:16:59,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:59,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:16:59,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:59,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 13:16:59,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:59,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 13:16:59,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:59,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 13:16:59,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:59,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 13:16:59,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:59,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:16:59,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:59,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 13:16:59,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:59,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 13:16:59,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:59,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-17 13:16:59,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:59,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 13:16:59,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:59,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:16:59,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:59,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:16:59,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:59,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:16:59,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:59,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-11-17 13:16:59,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:59,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:16:59,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:59,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:16:59,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:59,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:16:59,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:59,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-11-17 13:16:59,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:59,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:16:59,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:59,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:16:59,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:59,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:16:59,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:59,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-11-17 13:16:59,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:59,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-11-17 13:16:59,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:59,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2021-11-17 13:16:59,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:59,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:16:59,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:59,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2021-11-17 13:16:59,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:59,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:16:59,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:59,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:16:59,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:59,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-17 13:16:59,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:59,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2021-11-17 13:16:59,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:59,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:16:59,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:59,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:16:59,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:59,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-17 13:16:59,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:59,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2021-11-17 13:16:59,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:59,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2021-11-17 13:16:59,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:16:59,320 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2021-11-17 13:16:59,320 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:16:59,320 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259306949] [2021-11-17 13:16:59,320 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259306949] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:16:59,320 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:16:59,321 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-17 13:16:59,321 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432809663] [2021-11-17 13:16:59,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:16:59,321 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-17 13:16:59,321 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:16:59,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-17 13:16:59,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-11-17 13:16:59,322 INFO L87 Difference]: Start difference. First operand 2782 states and 3575 transitions. Second operand has 10 states, 10 states have (on average 9.2) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (33), 7 states have call predecessors, (33), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2021-11-17 13:17:01,343 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:17:03,378 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:17:05,366 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:17:11,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:17:11,257 INFO L93 Difference]: Finished difference Result 5231 states and 6857 transitions. [2021-11-17 13:17:11,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-17 13:17:11,257 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (33), 7 states have call predecessors, (33), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) Word has length 223 [2021-11-17 13:17:11,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:17:11,268 INFO L225 Difference]: With dead ends: 5231 [2021-11-17 13:17:11,269 INFO L226 Difference]: Without dead ends: 3504 [2021-11-17 13:17:11,274 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2021-11-17 13:17:11,275 INFO L933 BasicCegarLoop]: 1695 mSDtfsCounter, 3030 mSDsluCounter, 5621 mSDsCounter, 0 mSdLazyCounter, 4258 mSolverCounterSat, 3593 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3030 SdHoareTripleChecker+Valid, 7316 SdHoareTripleChecker+Invalid, 7853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3593 IncrementalHoareTripleChecker+Valid, 4258 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.4s IncrementalHoareTripleChecker+Time [2021-11-17 13:17:11,275 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3030 Valid, 7316 Invalid, 7853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3593 Valid, 4258 Invalid, 2 Unknown, 0 Unchecked, 11.4s Time] [2021-11-17 13:17:11,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3504 states. [2021-11-17 13:17:11,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3504 to 2790. [2021-11-17 13:17:11,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2790 states, 1757 states have (on average 1.1627774615822424) internal successors, (2043), 1800 states have internal predecessors, (2043), 765 states have call successors, (765), 262 states have call predecessors, (765), 262 states have return successors, (777), 759 states have call predecessors, (777), 763 states have call successors, (777) [2021-11-17 13:17:11,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2790 states to 2790 states and 3585 transitions. [2021-11-17 13:17:11,550 INFO L78 Accepts]: Start accepts. Automaton has 2790 states and 3585 transitions. Word has length 223 [2021-11-17 13:17:11,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:17:11,551 INFO L470 AbstractCegarLoop]: Abstraction has 2790 states and 3585 transitions. [2021-11-17 13:17:11,551 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (33), 7 states have call predecessors, (33), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2021-11-17 13:17:11,551 INFO L276 IsEmpty]: Start isEmpty. Operand 2790 states and 3585 transitions. [2021-11-17 13:17:11,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2021-11-17 13:17:11,554 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:17:11,554 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:17:11,554 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-17 13:17:11,555 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-11-17 13:17:11,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:17:11,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1603522296, now seen corresponding path program 1 times [2021-11-17 13:17:11,555 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:17:11,555 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526542229] [2021-11-17 13:17:11,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:17:11,556 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:17:11,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:11,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:17:11,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:11,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 13:17:11,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:11,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:17:11,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:11,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 13:17:11,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:11,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 13:17:11,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:11,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 13:17:11,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:11,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 13:17:11,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:11,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:17:11,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:11,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 13:17:11,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:11,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 13:17:11,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:11,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-17 13:17:11,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:11,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 13:17:11,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:11,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:17:11,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:11,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:17:11,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:11,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:17:11,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:11,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-11-17 13:17:11,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:11,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:17:11,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:11,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:17:11,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:11,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:17:11,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:11,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-11-17 13:17:11,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:11,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:17:11,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:11,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:17:11,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:11,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:17:11,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:11,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-11-17 13:17:11,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:11,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-11-17 13:17:11,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:11,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2021-11-17 13:17:11,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:11,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:17:11,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:11,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2021-11-17 13:17:11,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:11,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:17:11,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:11,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:17:11,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:11,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-17 13:17:11,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:11,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2021-11-17 13:17:11,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:11,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:17:11,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:11,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:17:11,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:11,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-17 13:17:11,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:11,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2021-11-17 13:17:11,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:11,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2021-11-17 13:17:11,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:11,880 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2021-11-17 13:17:11,880 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:17:11,880 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526542229] [2021-11-17 13:17:11,880 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526542229] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:17:11,880 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:17:11,881 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-17 13:17:11,881 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066222500] [2021-11-17 13:17:11,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:17:11,881 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-17 13:17:11,881 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:17:11,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-17 13:17:11,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-11-17 13:17:11,882 INFO L87 Difference]: Start difference. First operand 2790 states and 3585 transitions. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (33), 8 states have call predecessors, (33), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2021-11-17 13:17:13,903 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:17:15,944 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:17:17,979 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:17:20,020 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:17:22,054 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:17:27,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:17:27,520 INFO L93 Difference]: Finished difference Result 4298 states and 5517 transitions. [2021-11-17 13:17:27,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-17 13:17:27,521 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (33), 8 states have call predecessors, (33), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 225 [2021-11-17 13:17:27,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:17:27,536 INFO L225 Difference]: With dead ends: 4298 [2021-11-17 13:17:27,536 INFO L226 Difference]: Without dead ends: 4296 [2021-11-17 13:17:27,539 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=234, Invalid=522, Unknown=0, NotChecked=0, Total=756 [2021-11-17 13:17:27,540 INFO L933 BasicCegarLoop]: 1772 mSDtfsCounter, 4272 mSDsluCounter, 5776 mSDsCounter, 0 mSdLazyCounter, 4085 mSolverCounterSat, 3849 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4480 SdHoareTripleChecker+Valid, 7548 SdHoareTripleChecker+Invalid, 7939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3849 IncrementalHoareTripleChecker+Valid, 4085 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.0s IncrementalHoareTripleChecker+Time [2021-11-17 13:17:27,540 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4480 Valid, 7548 Invalid, 7939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3849 Valid, 4085 Invalid, 5 Unknown, 0 Unchecked, 15.0s Time] [2021-11-17 13:17:27,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4296 states. [2021-11-17 13:17:27,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4296 to 4240. [2021-11-17 13:17:27,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4240 states, 2677 states have (on average 1.173328352633545) internal successors, (3141), 2748 states have internal predecessors, (3141), 1141 states have call successors, (1141), 422 states have call predecessors, (1141), 416 states have return successors, (1154), 1119 states have call predecessors, (1154), 1139 states have call successors, (1154) [2021-11-17 13:17:27,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4240 states to 4240 states and 5436 transitions. [2021-11-17 13:17:27,942 INFO L78 Accepts]: Start accepts. Automaton has 4240 states and 5436 transitions. Word has length 225 [2021-11-17 13:17:27,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:17:27,942 INFO L470 AbstractCegarLoop]: Abstraction has 4240 states and 5436 transitions. [2021-11-17 13:17:27,943 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (33), 8 states have call predecessors, (33), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2021-11-17 13:17:27,943 INFO L276 IsEmpty]: Start isEmpty. Operand 4240 states and 5436 transitions. [2021-11-17 13:17:27,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2021-11-17 13:17:27,945 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:17:27,946 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:17:27,946 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-17 13:17:27,947 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-11-17 13:17:27,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:17:27,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1211749612, now seen corresponding path program 1 times [2021-11-17 13:17:27,947 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:17:27,948 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106111752] [2021-11-17 13:17:27,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:17:27,948 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:17:28,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:28,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:17:28,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:28,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 13:17:28,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:28,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:17:28,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:28,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 13:17:28,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:28,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 13:17:28,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:28,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 13:17:28,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:28,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 13:17:28,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:28,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:17:28,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:28,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 13:17:28,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:28,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 13:17:28,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:28,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-17 13:17:28,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:28,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 13:17:28,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:28,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:17:28,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:28,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:17:28,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:28,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:17:28,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:28,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-11-17 13:17:28,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:28,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:17:28,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:28,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:17:28,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:28,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:17:28,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:28,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-11-17 13:17:28,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:28,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:17:28,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:28,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:17:28,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:28,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:17:28,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:28,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-11-17 13:17:28,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:28,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-11-17 13:17:28,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:28,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2021-11-17 13:17:28,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:28,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:17:28,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:28,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2021-11-17 13:17:28,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:28,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:17:28,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:28,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:17:28,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:28,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-17 13:17:28,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:28,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2021-11-17 13:17:28,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:28,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:17:28,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:28,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:17:28,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:28,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-17 13:17:28,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:28,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2021-11-17 13:17:28,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:28,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2021-11-17 13:17:28,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:28,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2021-11-17 13:17:28,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:28,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:17:28,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:28,386 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2021-11-17 13:17:28,386 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:17:28,386 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106111752] [2021-11-17 13:17:28,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106111752] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:17:28,387 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:17:28,387 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-17 13:17:28,387 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177628768] [2021-11-17 13:17:28,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:17:28,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-17 13:17:28,388 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:17:28,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-17 13:17:28,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-11-17 13:17:28,388 INFO L87 Difference]: Start difference. First operand 4240 states and 5436 transitions. Second operand has 11 states, 11 states have (on average 9.090909090909092) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (35), 9 states have call predecessors, (35), 2 states have return successors, (33), 2 states have call predecessors, (33), 1 states have call successors, (33) [2021-11-17 13:17:30,409 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:17:32,449 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:17:34,486 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:17:36,525 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:17:38,562 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:17:40,596 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:17:42,636 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:17:49,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:17:49,096 INFO L93 Difference]: Finished difference Result 4320 states and 5539 transitions. [2021-11-17 13:17:49,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-17 13:17:49,097 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.090909090909092) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (35), 9 states have call predecessors, (35), 2 states have return successors, (33), 2 states have call predecessors, (33), 1 states have call successors, (33) Word has length 238 [2021-11-17 13:17:49,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:17:49,112 INFO L225 Difference]: With dead ends: 4320 [2021-11-17 13:17:49,113 INFO L226 Difference]: Without dead ends: 4318 [2021-11-17 13:17:49,116 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=270, Invalid=660, Unknown=0, NotChecked=0, Total=930 [2021-11-17 13:17:49,117 INFO L933 BasicCegarLoop]: 2122 mSDtfsCounter, 3395 mSDsluCounter, 7682 mSDsCounter, 0 mSdLazyCounter, 5993 mSolverCounterSat, 3708 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3516 SdHoareTripleChecker+Valid, 9804 SdHoareTripleChecker+Invalid, 9708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3708 IncrementalHoareTripleChecker+Valid, 5993 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.0s IncrementalHoareTripleChecker+Time [2021-11-17 13:17:49,117 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3516 Valid, 9804 Invalid, 9708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3708 Valid, 5993 Invalid, 7 Unknown, 0 Unchecked, 20.0s Time] [2021-11-17 13:17:49,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4318 states. [2021-11-17 13:17:49,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4318 to 4254. [2021-11-17 13:17:49,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4254 states, 2687 states have (on average 1.1719389653889096) internal successors, (3149), 2758 states have internal predecessors, (3149), 1141 states have call successors, (1141), 424 states have call predecessors, (1141), 420 states have return successors, (1154), 1121 states have call predecessors, (1154), 1139 states have call successors, (1154) [2021-11-17 13:17:49,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4254 states to 4254 states and 5444 transitions. [2021-11-17 13:17:49,499 INFO L78 Accepts]: Start accepts. Automaton has 4254 states and 5444 transitions. Word has length 238 [2021-11-17 13:17:49,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:17:49,500 INFO L470 AbstractCegarLoop]: Abstraction has 4254 states and 5444 transitions. [2021-11-17 13:17:49,500 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.090909090909092) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (35), 9 states have call predecessors, (35), 2 states have return successors, (33), 2 states have call predecessors, (33), 1 states have call successors, (33) [2021-11-17 13:17:49,500 INFO L276 IsEmpty]: Start isEmpty. Operand 4254 states and 5444 transitions. [2021-11-17 13:17:49,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2021-11-17 13:17:49,503 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:17:49,503 INFO L514 BasicCegarLoop]: trace histogram [16, 16, 16, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:17:49,503 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-11-17 13:17:49,503 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-11-17 13:17:49,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:17:49,504 INFO L85 PathProgramCache]: Analyzing trace with hash 969542739, now seen corresponding path program 1 times [2021-11-17 13:17:49,504 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:17:49,504 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158374081] [2021-11-17 13:17:49,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:17:49,505 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:17:49,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:49,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:17:49,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:49,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 13:17:49,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:49,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:17:49,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:49,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 13:17:49,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:49,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-17 13:17:49,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:49,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:17:49,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:49,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:17:49,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:49,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:17:49,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:49,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 13:17:49,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:49,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:17:49,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:49,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:17:49,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:49,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:17:49,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:49,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-11-17 13:17:49,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:49,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:17:49,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:49,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:17:49,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:49,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:17:49,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:49,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-17 13:17:49,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:49,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:17:49,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:49,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:17:49,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:49,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:17:49,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:49,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-17 13:17:49,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:49,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:17:49,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:49,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:17:49,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:49,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:17:49,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:49,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-11-17 13:17:49,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:49,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-11-17 13:17:49,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:49,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2021-11-17 13:17:49,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:49,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2021-11-17 13:17:49,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:49,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2021-11-17 13:17:49,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:49,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:17:49,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:49,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2021-11-17 13:17:49,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:49,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2021-11-17 13:17:49,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:49,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2021-11-17 13:17:49,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:49,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2021-11-17 13:17:49,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:49,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2021-11-17 13:17:49,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:49,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:17:49,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:49,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:17:49,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:49,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:17:49,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:49,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-17 13:17:49,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:49,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-17 13:17:49,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:49,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:17:49,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:49,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:17:49,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:49,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-17 13:17:49,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:17:49,893 INFO L134 CoverageAnalysis]: Checked inductivity of 616 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 614 trivial. 0 not checked. [2021-11-17 13:17:49,894 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:17:49,894 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158374081] [2021-11-17 13:17:49,894 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158374081] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:17:49,894 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:17:49,894 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-17 13:17:49,894 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917594570] [2021-11-17 13:17:49,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:17:49,895 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-17 13:17:49,895 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:17:49,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-17 13:17:49,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-11-17 13:17:49,896 INFO L87 Difference]: Start difference. First operand 4254 states and 5444 transitions. Second operand has 10 states, 10 states have (on average 8.9) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (34), 8 states have call predecessors, (34), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2021-11-17 13:17:51,917 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:17:53,954 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:17:55,995 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:17:57,327 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:18:01,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:18:01,145 INFO L93 Difference]: Finished difference Result 4378 states and 5568 transitions. [2021-11-17 13:18:01,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-17 13:18:01,146 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (34), 8 states have call predecessors, (34), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 257 [2021-11-17 13:18:01,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:18:01,160 INFO L225 Difference]: With dead ends: 4378 [2021-11-17 13:18:01,160 INFO L226 Difference]: Without dead ends: 4376 [2021-11-17 13:18:01,163 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2021-11-17 13:18:01,164 INFO L933 BasicCegarLoop]: 1555 mSDtfsCounter, 3144 mSDsluCounter, 4163 mSDsCounter, 0 mSdLazyCounter, 2702 mSolverCounterSat, 2688 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3333 SdHoareTripleChecker+Valid, 5718 SdHoareTripleChecker+Invalid, 5393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2688 IncrementalHoareTripleChecker+Valid, 2702 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2021-11-17 13:18:01,164 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3333 Valid, 5718 Invalid, 5393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2688 Valid, 2702 Invalid, 3 Unknown, 0 Unchecked, 10.8s Time] [2021-11-17 13:18:01,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4376 states. [2021-11-17 13:18:01,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4376 to 4332. [2021-11-17 13:18:01,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4332 states, 2742 states have (on average 1.1655725747629468) internal successors, (3196), 2812 states have internal predecessors, (3196), 1141 states have call successors, (1141), 448 states have call predecessors, (1141), 444 states have return successors, (1154), 1121 states have call predecessors, (1154), 1139 states have call successors, (1154) [2021-11-17 13:18:01,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4332 states to 4332 states and 5491 transitions. [2021-11-17 13:18:01,552 INFO L78 Accepts]: Start accepts. Automaton has 4332 states and 5491 transitions. Word has length 257 [2021-11-17 13:18:01,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:18:01,552 INFO L470 AbstractCegarLoop]: Abstraction has 4332 states and 5491 transitions. [2021-11-17 13:18:01,553 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (34), 8 states have call predecessors, (34), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2021-11-17 13:18:01,553 INFO L276 IsEmpty]: Start isEmpty. Operand 4332 states and 5491 transitions. [2021-11-17 13:18:01,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2021-11-17 13:18:01,556 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:18:01,556 INFO L514 BasicCegarLoop]: trace histogram [18, 18, 18, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:18:01,556 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-11-17 13:18:01,556 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-11-17 13:18:01,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:18:01,557 INFO L85 PathProgramCache]: Analyzing trace with hash -156759213, now seen corresponding path program 1 times [2021-11-17 13:18:01,557 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:18:01,557 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752554556] [2021-11-17 13:18:01,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:18:01,557 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:18:01,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:01,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:18:01,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:01,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 13:18:01,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:01,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:18:01,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:01,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 13:18:01,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:01,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-17 13:18:01,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:01,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:18:01,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:01,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:18:01,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:01,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:18:01,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:01,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 13:18:01,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:01,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:18:01,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:01,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:18:01,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:01,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:18:01,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:01,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-11-17 13:18:01,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:01,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:18:01,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:01,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:18:01,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:01,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:18:01,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:01,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-17 13:18:01,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:01,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:18:01,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:01,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:18:01,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:01,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:18:01,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:01,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-17 13:18:01,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:01,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:18:01,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:01,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:18:01,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:01,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:18:01,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:01,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-11-17 13:18:01,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:01,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-11-17 13:18:01,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:01,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2021-11-17 13:18:01,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:01,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2021-11-17 13:18:01,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:01,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2021-11-17 13:18:01,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:01,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:18:01,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:01,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2021-11-17 13:18:01,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:01,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2021-11-17 13:18:01,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:01,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2021-11-17 13:18:01,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:01,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2021-11-17 13:18:01,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:01,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2021-11-17 13:18:01,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:01,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:18:01,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:01,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:18:01,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:01,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:18:01,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:01,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2021-11-17 13:18:01,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:01,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:18:01,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:01,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:18:01,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:01,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:18:01,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:01,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-17 13:18:01,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:01,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-17 13:18:01,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:01,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:18:01,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:01,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:18:01,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:01,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-17 13:18:01,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:01,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2021-11-17 13:18:01,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:01,992 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2021-11-17 13:18:01,992 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:18:01,993 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752554556] [2021-11-17 13:18:01,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752554556] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:18:01,993 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:18:01,993 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-17 13:18:01,993 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427814765] [2021-11-17 13:18:01,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:18:01,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-17 13:18:01,994 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:18:01,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-17 13:18:01,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-11-17 13:18:01,995 INFO L87 Difference]: Start difference. First operand 4332 states and 5491 transitions. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (35), 8 states have call predecessors, (35), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2021-11-17 13:18:04,014 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:18:06,052 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:18:07,592 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:18:13,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:18:13,247 INFO L93 Difference]: Finished difference Result 7273 states and 9178 transitions. [2021-11-17 13:18:13,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-17 13:18:13,248 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (35), 8 states have call predecessors, (35), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 283 [2021-11-17 13:18:13,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:18:13,270 INFO L225 Difference]: With dead ends: 7273 [2021-11-17 13:18:13,270 INFO L226 Difference]: Without dead ends: 7271 [2021-11-17 13:18:13,274 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=175, Invalid=377, Unknown=0, NotChecked=0, Total=552 [2021-11-17 13:18:13,274 INFO L933 BasicCegarLoop]: 1908 mSDtfsCounter, 4580 mSDsluCounter, 5892 mSDsCounter, 0 mSdLazyCounter, 4069 mSolverCounterSat, 3981 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4789 SdHoareTripleChecker+Valid, 7800 SdHoareTripleChecker+Invalid, 8052 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3981 IncrementalHoareTripleChecker+Valid, 4069 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2021-11-17 13:18:13,275 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4789 Valid, 7800 Invalid, 8052 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3981 Valid, 4069 Invalid, 2 Unknown, 0 Unchecked, 10.5s Time] [2021-11-17 13:18:13,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7271 states. [2021-11-17 13:18:13,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7271 to 7156. [2021-11-17 13:18:13,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7156 states, 4580 states have (on average 1.1724890829694323) internal successors, (5370), 4711 states have internal predecessors, (5370), 1820 states have call successors, (1820), 759 states have call predecessors, (1820), 751 states have return successors, (1837), 1777 states have call predecessors, (1837), 1818 states have call successors, (1837) [2021-11-17 13:18:13,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7156 states to 7156 states and 9027 transitions. [2021-11-17 13:18:13,945 INFO L78 Accepts]: Start accepts. Automaton has 7156 states and 9027 transitions. Word has length 283 [2021-11-17 13:18:13,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:18:13,946 INFO L470 AbstractCegarLoop]: Abstraction has 7156 states and 9027 transitions. [2021-11-17 13:18:13,946 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (35), 8 states have call predecessors, (35), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2021-11-17 13:18:13,946 INFO L276 IsEmpty]: Start isEmpty. Operand 7156 states and 9027 transitions. [2021-11-17 13:18:13,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2021-11-17 13:18:13,971 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:18:13,972 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 14, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:18:13,972 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-11-17 13:18:13,972 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ldv_linux_usb_urb_usb_free_urbErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-11-17 13:18:13,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:18:13,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1715553, now seen corresponding path program 1 times [2021-11-17 13:18:13,973 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:18:13,973 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138808453] [2021-11-17 13:18:13,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:18:13,974 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:18:14,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:14,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:18:14,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:14,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 13:18:14,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:14,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:18:14,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:14,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 13:18:14,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:14,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-17 13:18:14,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:14,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:18:14,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:14,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:18:14,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:14,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:18:14,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:14,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 13:18:14,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:14,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:18:14,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:14,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:18:14,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:14,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:18:14,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:14,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-11-17 13:18:14,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:14,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:18:14,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:14,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:18:14,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:14,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:18:14,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:14,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-17 13:18:14,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:14,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:18:14,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:14,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:18:14,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:14,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:18:14,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:14,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-17 13:18:14,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:14,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:18:14,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:14,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:18:14,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:14,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:18:14,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:14,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-11-17 13:18:14,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:14,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-11-17 13:18:14,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:14,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2021-11-17 13:18:14,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:14,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:18:14,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:14,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:18:14,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:14,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-17 13:18:14,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:14,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2021-11-17 13:18:14,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:14,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:18:14,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:14,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2021-11-17 13:18:14,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:14,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2021-11-17 13:18:14,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:14,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2021-11-17 13:18:14,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:14,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2021-11-17 13:18:14,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:14,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2021-11-17 13:18:14,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:14,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2021-11-17 13:18:14,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:14,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:18:14,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:14,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:18:14,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:14,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-17 13:18:14,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:14,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2021-11-17 13:18:14,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:14,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2021-11-17 13:18:14,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:14,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:18:14,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:14,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:18:14,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:14,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-17 13:18:14,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:14,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2021-11-17 13:18:14,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:14,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2021-11-17 13:18:14,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:14,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2021-11-17 13:18:14,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:14,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2021-11-17 13:18:14,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:14,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2021-11-17 13:18:14,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:14,551 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2021-11-17 13:18:14,551 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:18:14,552 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138808453] [2021-11-17 13:18:14,552 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138808453] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:18:14,552 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:18:14,552 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-17 13:18:14,553 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215812639] [2021-11-17 13:18:14,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:18:14,554 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-17 13:18:14,554 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:18:14,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-17 13:18:14,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2021-11-17 13:18:14,555 INFO L87 Difference]: Start difference. First operand 7156 states and 9027 transitions. Second operand has 16 states, 16 states have (on average 7.3125) internal successors, (117), 8 states have internal predecessors, (117), 3 states have call successors, (42), 9 states have call predecessors, (42), 2 states have return successors, (39), 4 states have call predecessors, (39), 3 states have call successors, (39) [2021-11-17 13:18:16,576 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:18:18,492 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:18:20,528 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:18:22,562 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:18:30,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:18:30,771 INFO L93 Difference]: Finished difference Result 14297 states and 18035 transitions. [2021-11-17 13:18:30,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-17 13:18:30,772 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.3125) internal successors, (117), 8 states have internal predecessors, (117), 3 states have call successors, (42), 9 states have call predecessors, (42), 2 states have return successors, (39), 4 states have call predecessors, (39), 3 states have call successors, (39) Word has length 301 [2021-11-17 13:18:30,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:18:30,794 INFO L225 Difference]: With dead ends: 14297 [2021-11-17 13:18:30,795 INFO L226 Difference]: Without dead ends: 7271 [2021-11-17 13:18:30,811 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=216, Invalid=776, Unknown=0, NotChecked=0, Total=992 [2021-11-17 13:18:30,812 INFO L933 BasicCegarLoop]: 1524 mSDtfsCounter, 2409 mSDsluCounter, 9898 mSDsCounter, 0 mSdLazyCounter, 6301 mSolverCounterSat, 2942 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2409 SdHoareTripleChecker+Valid, 11422 SdHoareTripleChecker+Invalid, 9246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2942 IncrementalHoareTripleChecker+Valid, 6301 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.3s IncrementalHoareTripleChecker+Time [2021-11-17 13:18:30,812 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2409 Valid, 11422 Invalid, 9246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2942 Valid, 6301 Invalid, 3 Unknown, 0 Unchecked, 15.3s Time] [2021-11-17 13:18:30,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7271 states. [2021-11-17 13:18:31,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7271 to 7170. [2021-11-17 13:18:31,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7170 states, 4590 states have (on average 1.1721132897603486) internal successors, (5380), 4721 states have internal predecessors, (5380), 1822 states have call successors, (1822), 759 states have call predecessors, (1822), 753 states have return successors, (1842), 1780 states have call predecessors, (1842), 1820 states have call successors, (1842) [2021-11-17 13:18:31,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7170 states to 7170 states and 9044 transitions. [2021-11-17 13:18:31,495 INFO L78 Accepts]: Start accepts. Automaton has 7170 states and 9044 transitions. Word has length 301 [2021-11-17 13:18:31,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:18:31,496 INFO L470 AbstractCegarLoop]: Abstraction has 7170 states and 9044 transitions. [2021-11-17 13:18:31,496 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.3125) internal successors, (117), 8 states have internal predecessors, (117), 3 states have call successors, (42), 9 states have call predecessors, (42), 2 states have return successors, (39), 4 states have call predecessors, (39), 3 states have call successors, (39) [2021-11-17 13:18:31,496 INFO L276 IsEmpty]: Start isEmpty. Operand 7170 states and 9044 transitions. [2021-11-17 13:18:31,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2021-11-17 13:18:31,499 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:18:31,500 INFO L514 BasicCegarLoop]: trace histogram [19, 19, 19, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:18:31,500 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-11-17 13:18:31,500 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-11-17 13:18:31,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:18:31,501 INFO L85 PathProgramCache]: Analyzing trace with hash 275809966, now seen corresponding path program 1 times [2021-11-17 13:18:31,501 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:18:31,501 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887183710] [2021-11-17 13:18:31,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:18:31,501 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:18:31,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:31,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:18:31,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:31,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 13:18:31,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:31,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:18:31,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:31,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 13:18:31,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:31,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-17 13:18:31,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:31,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:18:31,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:31,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:18:31,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:31,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:18:31,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:31,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 13:18:31,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:31,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:18:31,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:31,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:18:31,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:31,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:18:31,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:31,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-11-17 13:18:31,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:31,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:18:31,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:31,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:18:31,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:31,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:18:31,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:31,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-17 13:18:31,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:31,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:18:31,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:31,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:18:31,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:31,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:18:31,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:31,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-17 13:18:31,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:31,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:18:31,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:31,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:18:31,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:31,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:18:31,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:31,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-11-17 13:18:31,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:31,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-11-17 13:18:31,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:31,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2021-11-17 13:18:31,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:31,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2021-11-17 13:18:31,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:31,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2021-11-17 13:18:31,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:31,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:18:31,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:31,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2021-11-17 13:18:31,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:31,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2021-11-17 13:18:31,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:31,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2021-11-17 13:18:31,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:31,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2021-11-17 13:18:31,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:31,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2021-11-17 13:18:31,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:31,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:18:31,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:31,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:18:31,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:31,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:18:31,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:31,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2021-11-17 13:18:31,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:31,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:18:31,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:31,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:18:31,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:31,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:18:31,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:31,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-17 13:18:31,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:31,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-17 13:18:31,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:31,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:18:31,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:31,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:18:31,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:31,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-17 13:18:31,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:31,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2021-11-17 13:18:31,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:31,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2021-11-17 13:18:31,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:31,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:18:31,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:31,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-17 13:18:31,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:31,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 13:18:31,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:31,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 300 [2021-11-17 13:18:31,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:31,883 INFO L134 CoverageAnalysis]: Checked inductivity of 879 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 877 trivial. 0 not checked. [2021-11-17 13:18:31,883 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:18:31,884 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887183710] [2021-11-17 13:18:31,884 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887183710] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:18:31,884 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:18:31,884 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-17 13:18:31,884 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808260855] [2021-11-17 13:18:31,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:18:31,886 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-17 13:18:31,886 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:18:31,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-17 13:18:31,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-11-17 13:18:31,887 INFO L87 Difference]: Start difference. First operand 7170 states and 9044 transitions. Second operand has 11 states, 11 states have (on average 9.545454545454545) internal successors, (105), 4 states have internal predecessors, (105), 3 states have call successors, (41), 9 states have call predecessors, (41), 2 states have return successors, (38), 2 states have call predecessors, (38), 3 states have call successors, (38) [2021-11-17 13:18:33,907 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:18:35,945 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:18:38,258 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:18:40,289 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:18:42,328 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:18:47,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:18:47,551 INFO L93 Difference]: Finished difference Result 7263 states and 9173 transitions. [2021-11-17 13:18:47,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-17 13:18:47,552 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.545454545454545) internal successors, (105), 4 states have internal predecessors, (105), 3 states have call successors, (41), 9 states have call predecessors, (41), 2 states have return successors, (38), 2 states have call predecessors, (38), 3 states have call successors, (38) Word has length 311 [2021-11-17 13:18:47,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:18:47,569 INFO L225 Difference]: With dead ends: 7263 [2021-11-17 13:18:47,569 INFO L226 Difference]: Without dead ends: 7261 [2021-11-17 13:18:47,572 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=418, Unknown=0, NotChecked=0, Total=600 [2021-11-17 13:18:47,572 INFO L933 BasicCegarLoop]: 1545 mSDtfsCounter, 2258 mSDsluCounter, 5650 mSDsCounter, 0 mSdLazyCounter, 4350 mSolverCounterSat, 2529 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2270 SdHoareTripleChecker+Valid, 7195 SdHoareTripleChecker+Invalid, 6884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2529 IncrementalHoareTripleChecker+Valid, 4350 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.9s IncrementalHoareTripleChecker+Time [2021-11-17 13:18:47,572 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2270 Valid, 7195 Invalid, 6884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2529 Valid, 4350 Invalid, 5 Unknown, 0 Unchecked, 14.9s Time] [2021-11-17 13:18:47,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7261 states. [2021-11-17 13:18:48,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7261 to 7168. [2021-11-17 13:18:48,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7168 states, 4589 states have (on average 1.16910002179124) internal successors, (5365), 4719 states have internal predecessors, (5365), 1822 states have call successors, (1822), 759 states have call predecessors, (1822), 753 states have return successors, (1842), 1780 states have call predecessors, (1842), 1820 states have call successors, (1842) [2021-11-17 13:18:48,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7168 states to 7168 states and 9029 transitions. [2021-11-17 13:18:48,210 INFO L78 Accepts]: Start accepts. Automaton has 7168 states and 9029 transitions. Word has length 311 [2021-11-17 13:18:48,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:18:48,211 INFO L470 AbstractCegarLoop]: Abstraction has 7168 states and 9029 transitions. [2021-11-17 13:18:48,211 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.545454545454545) internal successors, (105), 4 states have internal predecessors, (105), 3 states have call successors, (41), 9 states have call predecessors, (41), 2 states have return successors, (38), 2 states have call predecessors, (38), 3 states have call successors, (38) [2021-11-17 13:18:48,211 INFO L276 IsEmpty]: Start isEmpty. Operand 7168 states and 9029 transitions. [2021-11-17 13:18:48,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2021-11-17 13:18:48,216 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:18:48,216 INFO L514 BasicCegarLoop]: trace histogram [16, 16, 16, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:18:48,217 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-11-17 13:18:48,217 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ldv_linux_usb_urb_usb_free_urbErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-11-17 13:18:48,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:18:48,217 INFO L85 PathProgramCache]: Analyzing trace with hash -533248846, now seen corresponding path program 1 times [2021-11-17 13:18:48,218 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:18:48,218 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136822803] [2021-11-17 13:18:48,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:18:48,218 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:18:48,263 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-17 13:18:48,264 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1389526427] [2021-11-17 13:18:48,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:18:48,264 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 13:18:48,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 13:18:48,271 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-17 13:18:48,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-17 13:18:48,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:48,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 2615 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-17 13:18:48,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 13:18:49,623 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2021-11-17 13:18:49,623 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-17 13:18:49,623 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:18:49,623 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136822803] [2021-11-17 13:18:49,623 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-17 13:18:49,624 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389526427] [2021-11-17 13:18:49,624 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389526427] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:18:49,624 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:18:49,624 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 13:18:49,624 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974514718] [2021-11-17 13:18:49,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:18:49,626 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 13:18:49,626 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:18:49,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 13:18:49,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 13:18:49,627 INFO L87 Difference]: Start difference. First operand 7168 states and 9029 transitions. Second operand has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 3 states have call successors, (46), 2 states have call predecessors, (46), 3 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2021-11-17 13:18:50,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:18:50,844 INFO L93 Difference]: Finished difference Result 16897 states and 22075 transitions. [2021-11-17 13:18:50,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 13:18:50,844 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 3 states have call successors, (46), 2 states have call predecessors, (46), 3 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) Word has length 322 [2021-11-17 13:18:50,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:18:50,871 INFO L225 Difference]: With dead ends: 16897 [2021-11-17 13:18:50,871 INFO L226 Difference]: Without dead ends: 9774 [2021-11-17 13:18:50,894 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-17 13:18:50,894 INFO L933 BasicCegarLoop]: 1817 mSDtfsCounter, 676 mSDsluCounter, 6904 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 318 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 8721 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 318 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-17 13:18:50,894 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [676 Valid, 8721 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [318 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-17 13:18:50,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9774 states. [2021-11-17 13:18:51,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9774 to 7136. [2021-11-17 13:18:51,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7136 states, 4572 states have (on average 1.1690726159230096) internal successors, (5345), 4699 states have internal predecessors, (5345), 1810 states have call successors, (1810), 756 states have call predecessors, (1810), 750 states have return successors, (1830), 1769 states have call predecessors, (1830), 1808 states have call successors, (1830) [2021-11-17 13:18:51,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7136 states to 7136 states and 8985 transitions. [2021-11-17 13:18:51,550 INFO L78 Accepts]: Start accepts. Automaton has 7136 states and 8985 transitions. Word has length 322 [2021-11-17 13:18:51,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:18:51,551 INFO L470 AbstractCegarLoop]: Abstraction has 7136 states and 8985 transitions. [2021-11-17 13:18:51,551 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 3 states have call successors, (46), 2 states have call predecessors, (46), 3 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2021-11-17 13:18:51,551 INFO L276 IsEmpty]: Start isEmpty. Operand 7136 states and 8985 transitions. [2021-11-17 13:18:51,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2021-11-17 13:18:51,554 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:18:51,554 INFO L514 BasicCegarLoop]: trace histogram [16, 16, 16, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:18:51,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-17 13:18:51,761 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2021-11-17 13:18:51,761 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ldv_linux_usb_urb_usb_free_urbErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-11-17 13:18:51,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:18:51,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1176944588, now seen corresponding path program 1 times [2021-11-17 13:18:51,762 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:18:51,762 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422165545] [2021-11-17 13:18:51,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:18:51,762 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:18:51,824 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-17 13:18:51,824 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1361509827] [2021-11-17 13:18:51,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:18:51,825 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 13:18:51,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 13:18:51,826 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-17 13:18:51,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-17 13:18:53,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:18:53,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 2613 conjuncts, 48 conjunts are in the unsatisfiable core [2021-11-17 13:18:53,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 13:18:54,673 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 251 proven. 3 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2021-11-17 13:18:54,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 13:18:55,677 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 6 proven. 63 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2021-11-17 13:18:55,677 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:18:55,677 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422165545] [2021-11-17 13:18:55,677 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-17 13:18:55,677 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361509827] [2021-11-17 13:18:55,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361509827] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-17 13:18:55,678 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-17 13:18:55,678 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2021-11-17 13:18:55,678 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288565798] [2021-11-17 13:18:55,678 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-17 13:18:55,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-17 13:18:55,679 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:18:55,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-17 13:18:55,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2021-11-17 13:18:55,680 INFO L87 Difference]: Start difference. First operand 7136 states and 8985 transitions. Second operand has 14 states, 13 states have (on average 15.76923076923077) internal successors, (205), 12 states have internal predecessors, (205), 5 states have call successors, (89), 2 states have call predecessors, (89), 5 states have return successors, (88), 6 states have call predecessors, (88), 5 states have call successors, (88) [2021-11-17 13:18:57,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:18:57,539 INFO L93 Difference]: Finished difference Result 16873 states and 22049 transitions. [2021-11-17 13:18:57,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-17 13:18:57,540 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 15.76923076923077) internal successors, (205), 12 states have internal predecessors, (205), 5 states have call successors, (89), 2 states have call predecessors, (89), 5 states have return successors, (88), 6 states have call predecessors, (88), 5 states have call successors, (88) Word has length 322 [2021-11-17 13:18:57,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:18:57,567 INFO L225 Difference]: With dead ends: 16873 [2021-11-17 13:18:57,567 INFO L226 Difference]: Without dead ends: 9779 [2021-11-17 13:18:57,582 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 644 GetRequests, 630 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2021-11-17 13:18:57,582 INFO L933 BasicCegarLoop]: 2305 mSDtfsCounter, 903 mSDsluCounter, 19965 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1142 SdHoareTripleChecker+Valid, 22270 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-17 13:18:57,582 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1142 Valid, 22270 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-11-17 13:18:57,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9779 states. [2021-11-17 13:18:58,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9779 to 7136. [2021-11-17 13:18:58,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7136 states, 4572 states have (on average 1.168853893263342) internal successors, (5344), 4698 states have internal predecessors, (5344), 1810 states have call successors, (1810), 756 states have call predecessors, (1810), 750 states have return successors, (1830), 1769 states have call predecessors, (1830), 1808 states have call successors, (1830) [2021-11-17 13:18:58,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7136 states to 7136 states and 8984 transitions. [2021-11-17 13:18:58,233 INFO L78 Accepts]: Start accepts. Automaton has 7136 states and 8984 transitions. Word has length 322 [2021-11-17 13:18:58,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:18:58,233 INFO L470 AbstractCegarLoop]: Abstraction has 7136 states and 8984 transitions. [2021-11-17 13:18:58,233 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 15.76923076923077) internal successors, (205), 12 states have internal predecessors, (205), 5 states have call successors, (89), 2 states have call predecessors, (89), 5 states have return successors, (88), 6 states have call predecessors, (88), 5 states have call successors, (88) [2021-11-17 13:18:58,233 INFO L276 IsEmpty]: Start isEmpty. Operand 7136 states and 8984 transitions. [2021-11-17 13:18:58,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2021-11-17 13:18:58,237 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:18:58,237 INFO L514 BasicCegarLoop]: trace histogram [16, 16, 16, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:18:58,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-11-17 13:18:58,437 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 13:18:58,438 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ldv_linux_usb_urb_usb_free_urbErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-11-17 13:18:58,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:18:58,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1451007145, now seen corresponding path program 1 times [2021-11-17 13:18:58,439 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:18:58,439 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379477337] [2021-11-17 13:18:58,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:18:58,439 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:18:58,496 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-17 13:18:58,497 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1273974501] [2021-11-17 13:18:58,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:18:58,497 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 13:18:58,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 13:18:58,498 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-17 13:18:58,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-17 13:19:06,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:19:06,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 2629 conjuncts, 70 conjunts are in the unsatisfiable core [2021-11-17 13:19:06,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 13:19:06,919 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 337 proven. 3 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2021-11-17 13:19:06,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 13:19:07,838 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 18 proven. 51 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2021-11-17 13:19:07,838 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:19:07,838 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379477337] [2021-11-17 13:19:07,838 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-17 13:19:07,839 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273974501] [2021-11-17 13:19:07,839 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273974501] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-17 13:19:07,839 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-17 13:19:07,839 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2021-11-17 13:19:07,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804970862] [2021-11-17 13:19:07,840 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-17 13:19:07,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-17 13:19:07,840 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:19:07,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-17 13:19:07,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2021-11-17 13:19:07,841 INFO L87 Difference]: Start difference. First operand 7136 states and 8984 transitions. Second operand has 14 states, 13 states have (on average 15.923076923076923) internal successors, (207), 12 states have internal predecessors, (207), 5 states have call successors, (89), 2 states have call predecessors, (89), 5 states have return successors, (88), 6 states have call predecessors, (88), 5 states have call successors, (88) [2021-11-17 13:19:08,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:19:08,906 INFO L93 Difference]: Finished difference Result 16868 states and 22040 transitions. [2021-11-17 13:19:08,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-17 13:19:08,908 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 15.923076923076923) internal successors, (207), 12 states have internal predecessors, (207), 5 states have call successors, (89), 2 states have call predecessors, (89), 5 states have return successors, (88), 6 states have call predecessors, (88), 5 states have call successors, (88) Word has length 326 [2021-11-17 13:19:08,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:19:08,942 INFO L225 Difference]: With dead ends: 16868 [2021-11-17 13:19:08,943 INFO L226 Difference]: Without dead ends: 9779 [2021-11-17 13:19:08,967 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 652 GetRequests, 638 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2021-11-17 13:19:08,968 INFO L933 BasicCegarLoop]: 2304 mSDtfsCounter, 448 mSDsluCounter, 23924 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 685 SdHoareTripleChecker+Valid, 26228 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-17 13:19:08,968 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [685 Valid, 26228 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-17 13:19:08,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9779 states. [2021-11-17 13:19:09,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9779 to 7136. [2021-11-17 13:19:09,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7136 states, 4572 states have (on average 1.1686351706036746) internal successors, (5343), 4697 states have internal predecessors, (5343), 1810 states have call successors, (1810), 756 states have call predecessors, (1810), 750 states have return successors, (1830), 1769 states have call predecessors, (1830), 1808 states have call successors, (1830) [2021-11-17 13:19:09,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7136 states to 7136 states and 8983 transitions. [2021-11-17 13:19:09,636 INFO L78 Accepts]: Start accepts. Automaton has 7136 states and 8983 transitions. Word has length 326 [2021-11-17 13:19:09,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:19:09,636 INFO L470 AbstractCegarLoop]: Abstraction has 7136 states and 8983 transitions. [2021-11-17 13:19:09,637 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 15.923076923076923) internal successors, (207), 12 states have internal predecessors, (207), 5 states have call successors, (89), 2 states have call predecessors, (89), 5 states have return successors, (88), 6 states have call predecessors, (88), 5 states have call successors, (88) [2021-11-17 13:19:09,637 INFO L276 IsEmpty]: Start isEmpty. Operand 7136 states and 8983 transitions. [2021-11-17 13:19:09,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2021-11-17 13:19:09,640 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:19:09,640 INFO L514 BasicCegarLoop]: trace histogram [16, 16, 16, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:19:09,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-11-17 13:19:09,840 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2021-11-17 13:19:09,841 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ldv_linux_usb_urb_usb_free_urbErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-11-17 13:19:09,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:19:09,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1740522220, now seen corresponding path program 1 times [2021-11-17 13:19:09,841 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:19:09,841 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079778427] [2021-11-17 13:19:09,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:19:09,841 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:19:09,880 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-17 13:19:09,881 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1318164385] [2021-11-17 13:19:09,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:19:09,881 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 13:19:09,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 13:19:09,882 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-17 13:19:09,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process Killed by 15