./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash f0d35ad3183ac446cae7457c51fa9452f8942f4b349e6e40633392db1dd8aa97 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 17:04:51,019 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 17:04:51,022 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 17:04:51,050 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 17:04:51,051 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 17:04:51,052 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 17:04:51,053 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 17:04:51,055 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 17:04:51,056 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 17:04:51,057 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 17:04:51,058 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 17:04:51,059 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 17:04:51,059 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 17:04:51,060 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 17:04:51,061 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 17:04:51,062 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 17:04:51,063 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 17:04:51,063 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 17:04:51,065 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 17:04:51,066 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 17:04:51,068 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 17:04:51,068 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 17:04:51,069 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 17:04:51,070 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 17:04:51,071 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 17:04:51,074 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 17:04:51,074 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 17:04:51,074 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 17:04:51,075 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 17:04:51,076 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 17:04:51,077 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 17:04:51,077 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 17:04:51,078 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 17:04:51,078 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 17:04:51,079 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 17:04:51,080 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 17:04:51,080 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 17:04:51,081 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 17:04:51,082 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 17:04:51,082 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 17:04:51,083 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 17:04:51,087 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 17:04:51,088 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-12 17:04:51,119 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 17:04:51,120 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 17:04:51,120 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 17:04:51,121 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 17:04:51,121 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 17:04:51,122 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 17:04:51,122 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 17:04:51,122 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 17:04:51,123 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 17:04:51,123 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 17:04:51,124 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 17:04:51,124 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 17:04:51,124 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 17:04:51,124 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 17:04:51,125 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 17:04:51,125 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 17:04:51,125 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 17:04:51,125 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 17:04:51,125 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 17:04:51,126 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 17:04:51,126 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 17:04:51,126 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 17:04:51,126 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 17:04:51,127 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 17:04:51,127 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 17:04:51,127 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 17:04:51,127 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 17:04:51,128 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 17:04:51,128 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 17:04:51,128 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 17:04:51,128 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f0d35ad3183ac446cae7457c51fa9452f8942f4b349e6e40633392db1dd8aa97 [2022-07-12 17:04:51,360 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 17:04:51,385 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 17:04:51,387 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 17:04:51,388 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 17:04:51,388 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 17:04:51,389 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i [2022-07-12 17:04:51,447 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a723f5630/1defe1a3b9814c92a75911db912f95fd/FLAG861305698 [2022-07-12 17:04:52,174 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 17:04:52,175 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i [2022-07-12 17:04:52,236 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a723f5630/1defe1a3b9814c92a75911db912f95fd/FLAG861305698 [2022-07-12 17:04:52,413 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a723f5630/1defe1a3b9814c92a75911db912f95fd [2022-07-12 17:04:52,417 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 17:04:52,420 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 17:04:52,422 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 17:04:52,422 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 17:04:52,425 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 17:04:52,427 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 05:04:52" (1/1) ... [2022-07-12 17:04:52,428 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c1f9f46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:04:52, skipping insertion in model container [2022-07-12 17:04:52,428 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 05:04:52" (1/1) ... [2022-07-12 17:04:52,434 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 17:04:52,559 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 17:04:55,273 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[385539,385552] [2022-07-12 17:04:55,275 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[385684,385697] [2022-07-12 17:04:55,276 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[385830,385843] [2022-07-12 17:04:55,277 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[385995,386008] [2022-07-12 17:04:55,277 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[386153,386166] [2022-07-12 17:04:55,278 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[386311,386324] [2022-07-12 17:04:55,278 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[386469,386482] [2022-07-12 17:04:55,279 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[386629,386642] [2022-07-12 17:04:55,279 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[386788,386801] [2022-07-12 17:04:55,280 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[386927,386940] [2022-07-12 17:04:55,280 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[387069,387082] [2022-07-12 17:04:55,280 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[387218,387231] [2022-07-12 17:04:55,281 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[387357,387370] [2022-07-12 17:04:55,281 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[387512,387525] [2022-07-12 17:04:55,282 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[387672,387685] [2022-07-12 17:04:55,282 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[387823,387836] [2022-07-12 17:04:55,282 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[387974,387987] [2022-07-12 17:04:55,283 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[388126,388139] [2022-07-12 17:04:55,284 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[388275,388288] [2022-07-12 17:04:55,284 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[388423,388436] [2022-07-12 17:04:55,284 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[388580,388593] [2022-07-12 17:04:55,285 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[388729,388742] [2022-07-12 17:04:55,285 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[388885,388898] [2022-07-12 17:04:55,286 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389038,389051] [2022-07-12 17:04:55,287 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389184,389197] [2022-07-12 17:04:55,288 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389327,389340] [2022-07-12 17:04:55,288 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389479,389492] [2022-07-12 17:04:55,288 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389625,389638] [2022-07-12 17:04:55,289 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389770,389783] [2022-07-12 17:04:55,290 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389924,389937] [2022-07-12 17:04:55,291 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[390075,390088] [2022-07-12 17:04:55,291 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[390230,390243] [2022-07-12 17:04:55,291 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[390382,390395] [2022-07-12 17:04:55,292 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[390537,390550] [2022-07-12 17:04:55,293 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[390701,390714] [2022-07-12 17:04:55,293 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[390857,390870] [2022-07-12 17:04:55,293 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[391021,391034] [2022-07-12 17:04:55,294 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[391163,391176] [2022-07-12 17:04:55,295 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[391321,391334] [2022-07-12 17:04:55,295 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[391488,391501] [2022-07-12 17:04:55,295 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[391647,391660] [2022-07-12 17:04:55,296 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[391806,391819] [2022-07-12 17:04:55,296 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[391955,391968] [2022-07-12 17:04:55,296 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[392102,392115] [2022-07-12 17:04:55,297 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[392241,392254] [2022-07-12 17:04:55,297 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[392404,392417] [2022-07-12 17:04:55,298 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[392570,392583] [2022-07-12 17:04:55,299 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[392734,392747] [2022-07-12 17:04:55,299 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[392899,392912] [2022-07-12 17:04:55,299 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[393064,393077] [2022-07-12 17:04:55,300 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[393230,393243] [2022-07-12 17:04:55,300 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[393395,393408] [2022-07-12 17:04:55,301 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[393562,393575] [2022-07-12 17:04:55,301 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[393722,393735] [2022-07-12 17:04:55,303 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[393884,393897] [2022-07-12 17:04:55,303 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[394043,394056] [2022-07-12 17:04:55,303 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[394189,394202] [2022-07-12 17:04:55,304 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[394332,394345] [2022-07-12 17:04:55,304 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[394476,394489] [2022-07-12 17:04:55,304 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[394619,394632] [2022-07-12 17:04:55,305 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[394763,394776] [2022-07-12 17:04:55,306 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[394904,394917] [2022-07-12 17:04:55,306 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[395042,395055] [2022-07-12 17:04:55,306 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[395200,395213] [2022-07-12 17:04:55,307 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[395359,395372] [2022-07-12 17:04:55,307 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[395515,395528] [2022-07-12 17:04:55,308 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[395664,395677] [2022-07-12 17:04:55,308 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[395816,395829] [2022-07-12 17:04:55,308 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[395967,395980] [2022-07-12 17:04:55,309 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[396116,396129] [2022-07-12 17:04:55,309 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[396268,396281] [2022-07-12 17:04:55,309 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[396416,396429] [2022-07-12 17:04:55,310 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[396569,396582] [2022-07-12 17:04:55,310 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[396720,396733] [2022-07-12 17:04:55,310 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[396870,396883] [2022-07-12 17:04:55,311 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[397017,397030] [2022-07-12 17:04:55,311 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[397168,397181] [2022-07-12 17:04:55,311 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[397319,397332] [2022-07-12 17:04:55,312 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[397467,397480] [2022-07-12 17:04:55,312 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[397633,397646] [2022-07-12 17:04:55,313 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[397802,397815] [2022-07-12 17:04:55,313 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[397969,397982] [2022-07-12 17:04:55,314 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[398137,398150] [2022-07-12 17:04:55,314 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[398287,398300] [2022-07-12 17:04:55,314 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[398434,398447] [2022-07-12 17:04:55,315 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[398595,398608] [2022-07-12 17:04:55,315 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[398765,398778] [2022-07-12 17:04:55,315 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[398927,398940] [2022-07-12 17:04:55,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 17:04:55,381 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 17:04:55,693 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[385539,385552] [2022-07-12 17:04:55,695 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[385684,385697] [2022-07-12 17:04:55,699 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[385830,385843] [2022-07-12 17:04:55,699 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[385995,386008] [2022-07-12 17:04:55,700 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[386153,386166] [2022-07-12 17:04:55,700 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[386311,386324] [2022-07-12 17:04:55,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--net--usb--kaweth.ko.cil.i[386469,386482] [2022-07-12 17:04:55,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--net--usb--kaweth.ko.cil.i[386629,386642] [2022-07-12 17:04:55,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--net--usb--kaweth.ko.cil.i[386788,386801] [2022-07-12 17:04:55,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--net--usb--kaweth.ko.cil.i[386927,386940] [2022-07-12 17:04:55,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--net--usb--kaweth.ko.cil.i[387069,387082] [2022-07-12 17:04:55,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--net--usb--kaweth.ko.cil.i[387218,387231] [2022-07-12 17:04:55,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--net--usb--kaweth.ko.cil.i[387357,387370] [2022-07-12 17:04:55,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--net--usb--kaweth.ko.cil.i[387512,387525] [2022-07-12 17:04:55,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--net--usb--kaweth.ko.cil.i[387672,387685] [2022-07-12 17:04:55,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--net--usb--kaweth.ko.cil.i[387823,387836] [2022-07-12 17:04:55,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--net--usb--kaweth.ko.cil.i[387974,387987] [2022-07-12 17:04:55,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--net--usb--kaweth.ko.cil.i[388126,388139] [2022-07-12 17:04:55,706 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[388275,388288] [2022-07-12 17:04:55,706 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[388423,388436] [2022-07-12 17:04:55,706 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[388580,388593] [2022-07-12 17:04:55,707 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[388729,388742] [2022-07-12 17:04:55,708 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[388885,388898] [2022-07-12 17:04:55,708 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389038,389051] [2022-07-12 17:04:55,708 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389184,389197] [2022-07-12 17:04:55,709 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389327,389340] [2022-07-12 17:04:55,709 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389479,389492] [2022-07-12 17:04:55,709 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389625,389638] [2022-07-12 17:04:55,709 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389770,389783] [2022-07-12 17:04:55,710 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389924,389937] [2022-07-12 17:04:55,710 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[390075,390088] [2022-07-12 17:04:55,710 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[390230,390243] [2022-07-12 17:04:55,711 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[390382,390395] [2022-07-12 17:04:55,711 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[390537,390550] [2022-07-12 17:04:55,712 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[390701,390714] [2022-07-12 17:04:55,712 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[390857,390870] [2022-07-12 17:04:55,712 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[391021,391034] [2022-07-12 17:04:55,713 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[391163,391176] [2022-07-12 17:04:55,713 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[391321,391334] [2022-07-12 17:04:55,714 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[391488,391501] [2022-07-12 17:04:55,714 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[391647,391660] [2022-07-12 17:04:55,715 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[391806,391819] [2022-07-12 17:04:55,715 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[391955,391968] [2022-07-12 17:04:55,715 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[392102,392115] [2022-07-12 17:04:55,716 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[392241,392254] [2022-07-12 17:04:55,716 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[392404,392417] [2022-07-12 17:04:55,716 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[392570,392583] [2022-07-12 17:04:55,717 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[392734,392747] [2022-07-12 17:04:55,717 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[392899,392912] [2022-07-12 17:04:55,718 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[393064,393077] [2022-07-12 17:04:55,718 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[393230,393243] [2022-07-12 17:04:55,718 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[393395,393408] [2022-07-12 17:04:55,718 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[393562,393575] [2022-07-12 17:04:55,719 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[393722,393735] [2022-07-12 17:04:55,719 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[393884,393897] [2022-07-12 17:04:55,720 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[394043,394056] [2022-07-12 17:04:55,721 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[394189,394202] [2022-07-12 17:04:55,721 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[394332,394345] [2022-07-12 17:04:55,721 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[394476,394489] [2022-07-12 17:04:55,722 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[394619,394632] [2022-07-12 17:04:55,722 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[394763,394776] [2022-07-12 17:04:55,723 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[394904,394917] [2022-07-12 17:04:55,724 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[395042,395055] [2022-07-12 17:04:55,726 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[395200,395213] [2022-07-12 17:04:55,727 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[395359,395372] [2022-07-12 17:04:55,731 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[395515,395528] [2022-07-12 17:04:55,732 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[395664,395677] [2022-07-12 17:04:55,733 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[395816,395829] [2022-07-12 17:04:55,733 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[395967,395980] [2022-07-12 17:04:55,733 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[396116,396129] [2022-07-12 17:04:55,734 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[396268,396281] [2022-07-12 17:04:55,734 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[396416,396429] [2022-07-12 17:04:55,738 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[396569,396582] [2022-07-12 17:04:55,740 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[396720,396733] [2022-07-12 17:04:55,740 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[396870,396883] [2022-07-12 17:04:55,741 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[397017,397030] [2022-07-12 17:04:55,741 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[397168,397181] [2022-07-12 17:04:55,741 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[397319,397332] [2022-07-12 17:04:55,742 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[397467,397480] [2022-07-12 17:04:55,743 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[397633,397646] [2022-07-12 17:04:55,743 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[397802,397815] [2022-07-12 17:04:55,744 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[397969,397982] [2022-07-12 17:04:55,744 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[398137,398150] [2022-07-12 17:04:55,745 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[398287,398300] [2022-07-12 17:04:55,745 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[398434,398447] [2022-07-12 17:04:55,745 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[398595,398608] [2022-07-12 17:04:55,745 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[398765,398778] [2022-07-12 17:04:55,746 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[398927,398940] [2022-07-12 17:04:55,750 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 17:04:55,972 INFO L208 MainTranslator]: Completed translation [2022-07-12 17:04:55,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:04:55 WrapperNode [2022-07-12 17:04:55,973 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 17:04:55,974 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 17:04:55,974 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 17:04:55,974 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 17:04:55,980 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:04:55" (1/1) ... [2022-07-12 17:04:56,106 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:04:55" (1/1) ... [2022-07-12 17:04:56,292 INFO L137 Inliner]: procedures = 616, calls = 2803, calls flagged for inlining = 287, calls inlined = 187, statements flattened = 4770 [2022-07-12 17:04:56,293 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 17:04:56,294 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 17:04:56,294 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 17:04:56,294 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 17:04:56,302 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:04:55" (1/1) ... [2022-07-12 17:04:56,302 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:04:55" (1/1) ... [2022-07-12 17:04:56,332 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:04:55" (1/1) ... [2022-07-12 17:04:56,333 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:04:55" (1/1) ... [2022-07-12 17:04:56,429 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:04:55" (1/1) ... [2022-07-12 17:04:56,451 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:04:55" (1/1) ... [2022-07-12 17:04:56,479 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:04:55" (1/1) ... [2022-07-12 17:04:56,507 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 17:04:56,509 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 17:04:56,509 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 17:04:56,509 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 17:04:56,510 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:04:55" (1/1) ... [2022-07-12 17:04:56,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 17:04:56,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 17:04:56,536 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 17:04:56,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 17:04:56,576 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-07-12 17:04:56,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-07-12 17:04:56,577 INFO L130 BoogieDeclarations]: Found specification of procedure netif_wake_queue [2022-07-12 17:04:56,577 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_wake_queue [2022-07-12 17:04:56,577 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-12 17:04:56,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-12 17:04:56,577 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_device_lock_of_kaweth_device [2022-07-12 17:04:56,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_device_lock_of_kaweth_device [2022-07-12 17:04:56,577 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-12 17:04:56,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-12 17:04:56,578 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_usb_alloc_coherent [2022-07-12 17:04:56,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_usb_alloc_coherent [2022-07-12 17:04:56,578 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-12 17:04:56,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-12 17:04:56,578 INFO L130 BoogieDeclarations]: Found specification of procedure kaweth_open [2022-07-12 17:04:56,578 INFO L138 BoogieDeclarations]: Found implementation of procedure kaweth_open [2022-07-12 17:04:56,579 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-07-12 17:04:56,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-07-12 17:04:56,579 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-07-12 17:04:56,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-07-12 17:04:56,579 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-07-12 17:04:56,579 INFO L130 BoogieDeclarations]: Found specification of procedure kaweth_resume [2022-07-12 17:04:56,579 INFO L138 BoogieDeclarations]: Found implementation of procedure kaweth_resume [2022-07-12 17:04:56,579 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-12 17:04:56,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-12 17:04:56,580 INFO L130 BoogieDeclarations]: Found specification of procedure eth_validate_addr [2022-07-12 17:04:56,580 INFO L138 BoogieDeclarations]: Found implementation of procedure eth_validate_addr [2022-07-12 17:04:56,580 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-12 17:04:56,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-12 17:04:56,580 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-07-12 17:04:56,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-07-12 17:04:56,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 17:04:56,581 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-07-12 17:04:56,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-07-12 17:04:56,581 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-07-12 17:04:56,581 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-07-12 17:04:56,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-12 17:04:56,581 INFO L130 BoogieDeclarations]: Found specification of procedure kaweth_resubmit_rx_urb [2022-07-12 17:04:56,582 INFO L138 BoogieDeclarations]: Found implementation of procedure kaweth_resubmit_rx_urb [2022-07-12 17:04:56,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-12 17:04:56,582 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2022-07-12 17:04:56,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2022-07-12 17:04:56,582 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-12 17:04:56,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-12 17:04:56,582 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-12 17:04:56,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-12 17:04:56,583 INFO L130 BoogieDeclarations]: Found specification of procedure usb_autopm_put_interface [2022-07-12 17:04:56,583 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_autopm_put_interface [2022-07-12 17:04:56,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 17:04:56,583 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-07-12 17:04:56,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-07-12 17:04:56,583 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2022-07-12 17:04:56,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2022-07-12 17:04:56,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-12 17:04:56,584 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-12 17:04:56,584 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-07-12 17:04:56,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-07-12 17:04:56,584 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-07-12 17:04:56,584 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-07-12 17:04:56,585 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-07-12 17:04:56,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-07-12 17:04:56,585 INFO L130 BoogieDeclarations]: Found specification of procedure kaweth_close [2022-07-12 17:04:56,585 INFO L138 BoogieDeclarations]: Found implementation of procedure kaweth_close [2022-07-12 17:04:56,585 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-07-12 17:04:56,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-07-12 17:04:56,585 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irq_129 [2022-07-12 17:04:56,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irq_129 [2022-07-12 17:04:56,586 INFO L130 BoogieDeclarations]: Found specification of procedure kaweth_download_firmware [2022-07-12 17:04:56,586 INFO L138 BoogieDeclarations]: Found implementation of procedure kaweth_download_firmware [2022-07-12 17:04:56,586 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-12 17:04:56,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-12 17:04:56,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 17:04:56,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 17:04:56,587 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-12 17:04:56,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-12 17:04:56,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 17:04:56,587 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-07-12 17:04:56,587 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-07-12 17:04:56,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-07-12 17:04:56,587 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_irq_check_alloc_flags [2022-07-12 17:04:56,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_irq_check_alloc_flags [2022-07-12 17:04:56,588 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-07-12 17:04:56,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-07-12 17:04:56,588 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_netdev [2022-07-12 17:04:56,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_netdev [2022-07-12 17:04:56,588 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_delayed_work [2022-07-12 17:04:56,588 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_delayed_work [2022-07-12 17:04:56,589 INFO L130 BoogieDeclarations]: Found specification of procedure __init_waitqueue_head [2022-07-12 17:04:56,589 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_waitqueue_head [2022-07-12 17:04:56,589 INFO L130 BoogieDeclarations]: Found specification of procedure kaweth_tx_timeout [2022-07-12 17:04:56,589 INFO L138 BoogieDeclarations]: Found implementation of procedure kaweth_tx_timeout [2022-07-12 17:04:56,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 17:04:56,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 17:04:56,589 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_intfdata [2022-07-12 17:04:56,590 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_intfdata [2022-07-12 17:04:56,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-12 17:04:56,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-12 17:04:56,590 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-12 17:04:56,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-12 17:04:56,590 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-12 17:04:56,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-12 17:04:56,590 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_133 [2022-07-12 17:04:56,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_133 [2022-07-12 17:04:56,591 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_bulk_urb [2022-07-12 17:04:56,591 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_bulk_urb [2022-07-12 17:04:56,591 INFO L130 BoogieDeclarations]: Found specification of procedure kaweth_async_set_rx_mode [2022-07-12 17:04:56,591 INFO L138 BoogieDeclarations]: Found implementation of procedure kaweth_async_set_rx_mode [2022-07-12 17:04:56,591 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_device_lock_of_kaweth_device [2022-07-12 17:04:56,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_device_lock_of_kaweth_device [2022-07-12 17:04:56,592 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-07-12 17:04:56,592 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-07-12 17:04:56,631 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-07-12 17:04:56,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-07-12 17:04:56,631 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_free_urb [2022-07-12 17:04:56,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_free_urb [2022-07-12 17:04:56,631 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-07-12 17:04:56,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-07-12 17:04:56,631 INFO L130 BoogieDeclarations]: Found specification of procedure netif_start_queue [2022-07-12 17:04:56,631 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_start_queue [2022-07-12 17:04:56,631 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 17:04:56,631 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2022-07-12 17:04:56,631 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2022-07-12 17:04:56,631 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-12 17:04:56,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-12 17:04:56,632 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 17:04:56,632 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_usb_free_coherent [2022-07-12 17:04:56,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_usb_free_coherent [2022-07-12 17:04:56,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 17:04:56,632 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-12 17:04:56,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-12 17:04:56,632 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-07-12 17:04:56,632 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-07-12 17:04:56,632 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2022-07-12 17:04:56,632 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2022-07-12 17:04:56,632 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-12 17:04:56,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-12 17:04:56,632 INFO L130 BoogieDeclarations]: Found specification of procedure release_firmware [2022-07-12 17:04:56,632 INFO L138 BoogieDeclarations]: Found implementation of procedure release_firmware [2022-07-12 17:04:56,632 INFO L130 BoogieDeclarations]: Found specification of procedure dev_kfree_skb_irq [2022-07-12 17:04:56,632 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_kfree_skb_irq [2022-07-12 17:04:56,632 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2022-07-12 17:04:56,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2022-07-12 17:04:56,633 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_alloc_urb [2022-07-12 17:04:56,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_alloc_urb [2022-07-12 17:04:56,633 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-12 17:04:56,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-12 17:04:56,633 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-07-12 17:04:56,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-07-12 17:04:56,633 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2022-07-12 17:04:56,633 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2022-07-12 17:04:56,633 INFO L130 BoogieDeclarations]: Found specification of procedure kaweth_set_rx_mode [2022-07-12 17:04:56,633 INFO L138 BoogieDeclarations]: Found implementation of procedure kaweth_set_rx_mode [2022-07-12 17:04:56,633 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2022-07-12 17:04:56,633 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2022-07-12 17:04:56,633 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-12 17:04:56,633 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-12 17:04:56,633 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-12 17:04:56,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-12 17:04:56,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 17:04:56,633 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-12 17:04:56,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-12 17:04:56,634 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-12 17:04:56,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-12 17:04:56,634 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-12 17:04:56,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-12 17:04:56,634 INFO L130 BoogieDeclarations]: Found specification of procedure kaweth_resubmit_int_urb [2022-07-12 17:04:56,634 INFO L138 BoogieDeclarations]: Found implementation of procedure kaweth_resubmit_int_urb [2022-07-12 17:04:56,634 INFO L130 BoogieDeclarations]: Found specification of procedure kaweth_control [2022-07-12 17:04:56,634 INFO L138 BoogieDeclarations]: Found implementation of procedure kaweth_control [2022-07-12 17:04:56,634 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-12 17:04:56,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-12 17:04:56,634 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-12 17:04:56,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-12 17:04:56,634 INFO L130 BoogieDeclarations]: Found specification of procedure delayed_work_timer_fn [2022-07-12 17:04:56,634 INFO L130 BoogieDeclarations]: Found specification of procedure kaweth_kill_urbs [2022-07-12 17:04:56,634 INFO L138 BoogieDeclarations]: Found implementation of procedure kaweth_kill_urbs [2022-07-12 17:04:56,634 INFO L130 BoogieDeclarations]: Found specification of procedure kaweth_disconnect [2022-07-12 17:04:56,634 INFO L138 BoogieDeclarations]: Found implementation of procedure kaweth_disconnect [2022-07-12 17:04:56,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 17:04:56,635 INFO L130 BoogieDeclarations]: Found specification of procedure preempt_count [2022-07-12 17:04:56,635 INFO L138 BoogieDeclarations]: Found implementation of procedure preempt_count [2022-07-12 17:04:57,183 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 17:04:57,187 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 17:04:57,302 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-12 17:05:02,611 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 17:05:02,624 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 17:05:02,625 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-12 17:05:02,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 05:05:02 BoogieIcfgContainer [2022-07-12 17:05:02,628 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 17:05:02,629 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 17:05:02,629 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 17:05:02,632 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 17:05:02,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 05:04:52" (1/3) ... [2022-07-12 17:05:02,633 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17117453 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 05:05:02, skipping insertion in model container [2022-07-12 17:05:02,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:04:55" (2/3) ... [2022-07-12 17:05:02,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17117453 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 05:05:02, skipping insertion in model container [2022-07-12 17:05:02,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 05:05:02" (3/3) ... [2022-07-12 17:05:02,635 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i [2022-07-12 17:05:02,647 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 17:05:02,647 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 29 error locations. [2022-07-12 17:05:02,708 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 17:05:02,713 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6b99ccd9, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@67d9a67d [2022-07-12 17:05:02,714 INFO L358 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2022-07-12 17:05:02,725 INFO L276 IsEmpty]: Start isEmpty. Operand has 1202 states, 791 states have (on average 1.2414664981036663) internal successors, (982), 831 states have internal predecessors, (982), 301 states have call successors, (301), 81 states have call predecessors, (301), 80 states have return successors, (297), 296 states have call predecessors, (297), 297 states have call successors, (297) [2022-07-12 17:05:02,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-12 17:05:02,738 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:05:02,738 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:05:02,739 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:05:02,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:05:02,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1445783568, now seen corresponding path program 1 times [2022-07-12 17:05:02,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:05:02,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492419903] [2022-07-12 17:05:02,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:05:02,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:05:03,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:03,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:05:03,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:03,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:05:03,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:03,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:05:03,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:03,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:05:03,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:03,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:05:03,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:03,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:05:03,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:03,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:05:03,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:03,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:03,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:03,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:05:03,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:03,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:05:03,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:03,783 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 17:05:03,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:05:03,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492419903] [2022-07-12 17:05:03,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492419903] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:05:03,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:05:03,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:05:03,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760119370] [2022-07-12 17:05:03,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:05:03,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:05:03,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:05:03,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:05:03,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:05:03,826 INFO L87 Difference]: Start difference. First operand has 1202 states, 791 states have (on average 1.2414664981036663) internal successors, (982), 831 states have internal predecessors, (982), 301 states have call successors, (301), 81 states have call predecessors, (301), 80 states have return successors, (297), 296 states have call predecessors, (297), 297 states have call successors, (297) Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-12 17:05:07,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:05:07,277 INFO L93 Difference]: Finished difference Result 2297 states and 3120 transitions. [2022-07-12 17:05:07,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:05:07,280 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 71 [2022-07-12 17:05:07,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:05:07,300 INFO L225 Difference]: With dead ends: 2297 [2022-07-12 17:05:07,300 INFO L226 Difference]: Without dead ends: 1183 [2022-07-12 17:05:07,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:05:07,313 INFO L413 NwaCegarLoop]: 1432 mSDtfsCounter, 2179 mSDsluCounter, 1414 mSDsCounter, 0 mSdLazyCounter, 1434 mSolverCounterSat, 1024 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2361 SdHoareTripleChecker+Valid, 2846 SdHoareTripleChecker+Invalid, 2458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1024 IncrementalHoareTripleChecker+Valid, 1434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-07-12 17:05:07,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2361 Valid, 2846 Invalid, 2458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1024 Valid, 1434 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-07-12 17:05:07,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2022-07-12 17:05:07,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1183. [2022-07-12 17:05:07,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 779 states have (on average 1.196405648267009) internal successors, (932), 815 states have internal predecessors, (932), 297 states have call successors, (297), 80 states have call predecessors, (297), 79 states have return successors, (295), 294 states have call predecessors, (295), 295 states have call successors, (295) [2022-07-12 17:05:07,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1524 transitions. [2022-07-12 17:05:07,463 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1524 transitions. Word has length 71 [2022-07-12 17:05:07,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:05:07,464 INFO L495 AbstractCegarLoop]: Abstraction has 1183 states and 1524 transitions. [2022-07-12 17:05:07,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-12 17:05:07,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1524 transitions. [2022-07-12 17:05:07,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-12 17:05:07,474 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:05:07,475 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:05:07,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 17:05:07,475 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_linux_block_genhd_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:05:07,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:05:07,476 INFO L85 PathProgramCache]: Analyzing trace with hash -559581025, now seen corresponding path program 1 times [2022-07-12 17:05:07,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:05:07,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259626674] [2022-07-12 17:05:07,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:05:07,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:05:07,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:07,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:05:07,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:07,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:05:07,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:07,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:05:07,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:07,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:05:07,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:07,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:05:07,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:07,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:05:07,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:07,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:05:07,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:07,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:07,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:07,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:05:07,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:07,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:05:07,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:07,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:05:07,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:07,935 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 17:05:07,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:05:07,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259626674] [2022-07-12 17:05:07,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259626674] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:05:07,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:05:07,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:05:07,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376926780] [2022-07-12 17:05:07,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:05:07,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:05:07,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:05:07,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:05:07,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:05:07,939 INFO L87 Difference]: Start difference. First operand 1183 states and 1524 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-12 17:05:10,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:05:10,470 INFO L93 Difference]: Finished difference Result 1183 states and 1524 transitions. [2022-07-12 17:05:10,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:05:10,471 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 77 [2022-07-12 17:05:10,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:05:10,479 INFO L225 Difference]: With dead ends: 1183 [2022-07-12 17:05:10,480 INFO L226 Difference]: Without dead ends: 1181 [2022-07-12 17:05:10,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:05:10,481 INFO L413 NwaCegarLoop]: 1414 mSDtfsCounter, 2147 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 1420 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2326 SdHoareTripleChecker+Valid, 2812 SdHoareTripleChecker+Invalid, 2436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 1420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-12 17:05:10,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2326 Valid, 2812 Invalid, 2436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 1420 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-07-12 17:05:10,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2022-07-12 17:05:10,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 1181. [2022-07-12 17:05:10,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1181 states, 778 states have (on average 1.1953727506426735) internal successors, (930), 813 states have internal predecessors, (930), 297 states have call successors, (297), 80 states have call predecessors, (297), 79 states have return successors, (295), 294 states have call predecessors, (295), 295 states have call successors, (295) [2022-07-12 17:05:10,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 1181 states and 1522 transitions. [2022-07-12 17:05:10,536 INFO L78 Accepts]: Start accepts. Automaton has 1181 states and 1522 transitions. Word has length 77 [2022-07-12 17:05:10,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:05:10,537 INFO L495 AbstractCegarLoop]: Abstraction has 1181 states and 1522 transitions. [2022-07-12 17:05:10,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-12 17:05:10,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1181 states and 1522 transitions. [2022-07-12 17:05:10,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-12 17:05:10,539 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:05:10,539 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:05:10,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 17:05:10,540 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:05:10,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:05:10,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1865614216, now seen corresponding path program 1 times [2022-07-12 17:05:10,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:05:10,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584830296] [2022-07-12 17:05:10,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:05:10,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:05:10,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:10,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:05:10,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:10,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:05:10,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:10,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:05:10,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:10,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:05:10,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:10,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:05:10,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:10,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:05:10,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:10,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:05:10,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:10,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:10,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:10,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:05:10,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:10,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:05:10,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:10,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:05:10,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:10,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:05:10,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:10,931 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 17:05:10,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:05:10,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584830296] [2022-07-12 17:05:10,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584830296] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:05:10,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:05:10,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:05:10,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810555605] [2022-07-12 17:05:10,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:05:10,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:05:10,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:05:10,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:05:10,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:05:10,934 INFO L87 Difference]: Start difference. First operand 1181 states and 1522 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-12 17:05:13,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:05:13,866 INFO L93 Difference]: Finished difference Result 1181 states and 1522 transitions. [2022-07-12 17:05:13,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:05:13,866 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 83 [2022-07-12 17:05:13,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:05:13,873 INFO L225 Difference]: With dead ends: 1181 [2022-07-12 17:05:13,873 INFO L226 Difference]: Without dead ends: 1179 [2022-07-12 17:05:13,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:05:13,875 INFO L413 NwaCegarLoop]: 1412 mSDtfsCounter, 2141 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 1418 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2319 SdHoareTripleChecker+Valid, 2810 SdHoareTripleChecker+Invalid, 2434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 1418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-07-12 17:05:13,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2319 Valid, 2810 Invalid, 2434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 1418 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-07-12 17:05:13,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2022-07-12 17:05:13,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 1179. [2022-07-12 17:05:13,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1179 states, 777 states have (on average 1.1943371943371943) internal successors, (928), 811 states have internal predecessors, (928), 297 states have call successors, (297), 80 states have call predecessors, (297), 79 states have return successors, (295), 294 states have call predecessors, (295), 295 states have call successors, (295) [2022-07-12 17:05:13,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1179 states to 1179 states and 1520 transitions. [2022-07-12 17:05:13,969 INFO L78 Accepts]: Start accepts. Automaton has 1179 states and 1520 transitions. Word has length 83 [2022-07-12 17:05:13,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:05:13,969 INFO L495 AbstractCegarLoop]: Abstraction has 1179 states and 1520 transitions. [2022-07-12 17:05:13,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-12 17:05:13,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1520 transitions. [2022-07-12 17:05:13,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-12 17:05:13,972 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:05:13,972 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:05:13,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 17:05:13,973 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:05:13,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:05:13,974 INFO L85 PathProgramCache]: Analyzing trace with hash -2110063066, now seen corresponding path program 1 times [2022-07-12 17:05:13,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:05:13,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074250801] [2022-07-12 17:05:13,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:05:13,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:05:14,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:14,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:05:14,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:14,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:05:14,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:14,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:05:14,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:14,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:05:14,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:14,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:05:14,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:14,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:05:14,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:14,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:05:14,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:14,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:14,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:14,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:05:14,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:14,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:05:14,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:14,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:05:14,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:14,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:05:14,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:14,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:05:14,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:14,373 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 17:05:14,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:05:14,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074250801] [2022-07-12 17:05:14,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074250801] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:05:14,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:05:14,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:05:14,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026463835] [2022-07-12 17:05:14,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:05:14,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:05:14,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:05:14,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:05:14,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:05:14,377 INFO L87 Difference]: Start difference. First operand 1179 states and 1520 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 17:05:17,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:05:17,509 INFO L93 Difference]: Finished difference Result 1179 states and 1520 transitions. [2022-07-12 17:05:17,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:05:17,510 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 89 [2022-07-12 17:05:17,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:05:17,516 INFO L225 Difference]: With dead ends: 1179 [2022-07-12 17:05:17,516 INFO L226 Difference]: Without dead ends: 1177 [2022-07-12 17:05:17,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:05:17,517 INFO L413 NwaCegarLoop]: 1410 mSDtfsCounter, 2135 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 1416 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2312 SdHoareTripleChecker+Valid, 2808 SdHoareTripleChecker+Invalid, 2432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 1416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-07-12 17:05:17,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2312 Valid, 2808 Invalid, 2432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 1416 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-07-12 17:05:17,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2022-07-12 17:05:17,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 1177. [2022-07-12 17:05:17,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1177 states, 776 states have (on average 1.193298969072165) internal successors, (926), 809 states have internal predecessors, (926), 297 states have call successors, (297), 80 states have call predecessors, (297), 79 states have return successors, (295), 294 states have call predecessors, (295), 295 states have call successors, (295) [2022-07-12 17:05:17,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1518 transitions. [2022-07-12 17:05:17,558 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1518 transitions. Word has length 89 [2022-07-12 17:05:17,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:05:17,558 INFO L495 AbstractCegarLoop]: Abstraction has 1177 states and 1518 transitions. [2022-07-12 17:05:17,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 17:05:17,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1518 transitions. [2022-07-12 17:05:17,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-12 17:05:17,560 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:05:17,560 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:05:17,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 17:05:17,560 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:05:17,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:05:17,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1926875297, now seen corresponding path program 1 times [2022-07-12 17:05:17,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:05:17,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133226027] [2022-07-12 17:05:17,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:05:17,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:05:17,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:17,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:05:17,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:17,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:05:17,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:17,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:05:17,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:17,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:05:17,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:17,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:05:17,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:17,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:05:17,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:17,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:05:17,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:17,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:17,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:17,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:05:17,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:17,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:05:17,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:17,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:05:17,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:17,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:05:17,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:17,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:05:17,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:17,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 17:05:17,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:17,940 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 17:05:17,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:05:17,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133226027] [2022-07-12 17:05:17,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133226027] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:05:17,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:05:17,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:05:17,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707683239] [2022-07-12 17:05:17,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:05:17,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:05:17,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:05:17,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:05:17,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:05:17,942 INFO L87 Difference]: Start difference. First operand 1177 states and 1518 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-12 17:05:20,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:05:20,793 INFO L93 Difference]: Finished difference Result 1177 states and 1518 transitions. [2022-07-12 17:05:20,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:05:20,794 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 95 [2022-07-12 17:05:20,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:05:20,799 INFO L225 Difference]: With dead ends: 1177 [2022-07-12 17:05:20,800 INFO L226 Difference]: Without dead ends: 1175 [2022-07-12 17:05:20,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:05:20,801 INFO L413 NwaCegarLoop]: 1408 mSDtfsCounter, 2129 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 1414 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2305 SdHoareTripleChecker+Valid, 2806 SdHoareTripleChecker+Invalid, 2430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 1414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-07-12 17:05:20,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2305 Valid, 2806 Invalid, 2430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 1414 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-07-12 17:05:20,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2022-07-12 17:05:20,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 1175. [2022-07-12 17:05:20,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1175 states, 775 states have (on average 1.192258064516129) internal successors, (924), 807 states have internal predecessors, (924), 297 states have call successors, (297), 80 states have call predecessors, (297), 79 states have return successors, (295), 294 states have call predecessors, (295), 295 states have call successors, (295) [2022-07-12 17:05:20,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1175 states to 1175 states and 1516 transitions. [2022-07-12 17:05:20,844 INFO L78 Accepts]: Start accepts. Automaton has 1175 states and 1516 transitions. Word has length 95 [2022-07-12 17:05:20,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:05:20,845 INFO L495 AbstractCegarLoop]: Abstraction has 1175 states and 1516 transitions. [2022-07-12 17:05:20,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-12 17:05:20,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1516 transitions. [2022-07-12 17:05:20,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-12 17:05:20,847 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:05:20,847 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:05:20,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 17:05:20,847 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:05:20,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:05:20,848 INFO L85 PathProgramCache]: Analyzing trace with hash -2113908543, now seen corresponding path program 1 times [2022-07-12 17:05:20,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:05:20,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890452506] [2022-07-12 17:05:20,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:05:20,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:05:20,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:21,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:05:21,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:21,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:05:21,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:21,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:05:21,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:21,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:05:21,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:21,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:05:21,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:21,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:05:21,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:21,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:05:21,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:21,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:21,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:21,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:05:21,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:21,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:05:21,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:21,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:05:21,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:21,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:05:21,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:21,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:05:21,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:21,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 17:05:21,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:21,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 17:05:21,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:21,203 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 17:05:21,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:05:21,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890452506] [2022-07-12 17:05:21,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890452506] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:05:21,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:05:21,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:05:21,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145521348] [2022-07-12 17:05:21,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:05:21,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:05:21,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:05:21,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:05:21,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:05:21,205 INFO L87 Difference]: Start difference. First operand 1175 states and 1516 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-12 17:05:23,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:05:23,284 INFO L93 Difference]: Finished difference Result 1175 states and 1516 transitions. [2022-07-12 17:05:23,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:05:23,285 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 101 [2022-07-12 17:05:23,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:05:23,291 INFO L225 Difference]: With dead ends: 1175 [2022-07-12 17:05:23,291 INFO L226 Difference]: Without dead ends: 1173 [2022-07-12 17:05:23,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:05:23,292 INFO L413 NwaCegarLoop]: 1406 mSDtfsCounter, 2123 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 1412 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2298 SdHoareTripleChecker+Valid, 2804 SdHoareTripleChecker+Invalid, 2428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 1412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-12 17:05:23,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2298 Valid, 2804 Invalid, 2428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 1412 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-07-12 17:05:23,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2022-07-12 17:05:23,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 1173. [2022-07-12 17:05:23,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1173 states, 774 states have (on average 1.1912144702842378) internal successors, (922), 805 states have internal predecessors, (922), 297 states have call successors, (297), 80 states have call predecessors, (297), 79 states have return successors, (295), 294 states have call predecessors, (295), 295 states have call successors, (295) [2022-07-12 17:05:23,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1514 transitions. [2022-07-12 17:05:23,338 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 1514 transitions. Word has length 101 [2022-07-12 17:05:23,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:05:23,338 INFO L495 AbstractCegarLoop]: Abstraction has 1173 states and 1514 transitions. [2022-07-12 17:05:23,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-12 17:05:23,339 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1514 transitions. [2022-07-12 17:05:23,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-12 17:05:23,341 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:05:23,341 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:05:23,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 17:05:23,341 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:05:23,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:05:23,342 INFO L85 PathProgramCache]: Analyzing trace with hash -792552921, now seen corresponding path program 1 times [2022-07-12 17:05:23,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:05:23,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56681215] [2022-07-12 17:05:23,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:05:23,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:05:23,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:23,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:05:23,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:23,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:05:23,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:23,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:05:23,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:23,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:05:23,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:23,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:05:23,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:23,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:05:23,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:23,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:05:23,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:23,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:23,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:23,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:05:23,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:23,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:05:23,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:23,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:05:23,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:23,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:05:23,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:23,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:05:23,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:23,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 17:05:23,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:23,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 17:05:23,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:23,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 17:05:23,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:23,693 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 17:05:23,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:05:23,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56681215] [2022-07-12 17:05:23,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56681215] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:05:23,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:05:23,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:05:23,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460387120] [2022-07-12 17:05:23,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:05:23,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:05:23,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:05:23,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:05:23,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:05:23,695 INFO L87 Difference]: Start difference. First operand 1173 states and 1514 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-12 17:05:25,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:05:25,977 INFO L93 Difference]: Finished difference Result 1173 states and 1514 transitions. [2022-07-12 17:05:25,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:05:25,978 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 107 [2022-07-12 17:05:25,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:05:25,985 INFO L225 Difference]: With dead ends: 1173 [2022-07-12 17:05:25,985 INFO L226 Difference]: Without dead ends: 1171 [2022-07-12 17:05:25,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:05:25,987 INFO L413 NwaCegarLoop]: 1404 mSDtfsCounter, 2117 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 1410 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2291 SdHoareTripleChecker+Valid, 2802 SdHoareTripleChecker+Invalid, 2426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 1410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-12 17:05:25,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2291 Valid, 2802 Invalid, 2426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 1410 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-07-12 17:05:25,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2022-07-12 17:05:26,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 1171. [2022-07-12 17:05:26,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1171 states, 773 states have (on average 1.1901681759379044) internal successors, (920), 803 states have internal predecessors, (920), 297 states have call successors, (297), 80 states have call predecessors, (297), 79 states have return successors, (295), 294 states have call predecessors, (295), 295 states have call successors, (295) [2022-07-12 17:05:26,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1171 states to 1171 states and 1512 transitions. [2022-07-12 17:05:26,033 INFO L78 Accepts]: Start accepts. Automaton has 1171 states and 1512 transitions. Word has length 107 [2022-07-12 17:05:26,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:05:26,033 INFO L495 AbstractCegarLoop]: Abstraction has 1171 states and 1512 transitions. [2022-07-12 17:05:26,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-12 17:05:26,034 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 1512 transitions. [2022-07-12 17:05:26,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-07-12 17:05:26,035 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:05:26,035 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:05:26,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 17:05:26,036 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:05:26,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:05:26,036 INFO L85 PathProgramCache]: Analyzing trace with hash 254667010, now seen corresponding path program 1 times [2022-07-12 17:05:26,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:05:26,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307489184] [2022-07-12 17:05:26,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:05:26,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:05:26,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:26,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:05:26,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:26,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:05:26,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:26,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:05:26,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:26,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:05:26,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:26,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:05:26,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:26,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:05:26,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:26,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:05:26,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:26,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:26,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:26,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:05:26,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:26,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:05:26,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:26,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:05:26,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:26,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:05:26,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:26,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:05:26,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:26,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 17:05:26,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:26,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 17:05:26,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:26,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 17:05:26,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:26,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 17:05:26,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:26,377 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 17:05:26,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:05:26,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307489184] [2022-07-12 17:05:26,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307489184] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:05:26,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:05:26,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:05:26,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704876569] [2022-07-12 17:05:26,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:05:26,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:05:26,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:05:26,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:05:26,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:05:26,379 INFO L87 Difference]: Start difference. First operand 1171 states and 1512 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-12 17:05:28,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:05:28,419 INFO L93 Difference]: Finished difference Result 1171 states and 1512 transitions. [2022-07-12 17:05:28,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:05:28,420 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 113 [2022-07-12 17:05:28,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:05:28,425 INFO L225 Difference]: With dead ends: 1171 [2022-07-12 17:05:28,425 INFO L226 Difference]: Without dead ends: 1169 [2022-07-12 17:05:28,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:05:28,426 INFO L413 NwaCegarLoop]: 1402 mSDtfsCounter, 2115 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 1404 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2288 SdHoareTripleChecker+Valid, 2800 SdHoareTripleChecker+Invalid, 2420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 1404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-12 17:05:28,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2288 Valid, 2800 Invalid, 2420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 1404 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-12 17:05:28,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2022-07-12 17:05:28,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 1169. [2022-07-12 17:05:28,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1169 states, 772 states have (on average 1.189119170984456) internal successors, (918), 801 states have internal predecessors, (918), 297 states have call successors, (297), 80 states have call predecessors, (297), 79 states have return successors, (295), 294 states have call predecessors, (295), 295 states have call successors, (295) [2022-07-12 17:05:28,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1169 states to 1169 states and 1510 transitions. [2022-07-12 17:05:28,471 INFO L78 Accepts]: Start accepts. Automaton has 1169 states and 1510 transitions. Word has length 113 [2022-07-12 17:05:28,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:05:28,472 INFO L495 AbstractCegarLoop]: Abstraction has 1169 states and 1510 transitions. [2022-07-12 17:05:28,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-12 17:05:28,472 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 1510 transitions. [2022-07-12 17:05:28,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-12 17:05:28,474 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:05:28,474 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:05:28,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 17:05:28,474 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:05:28,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:05:28,475 INFO L85 PathProgramCache]: Analyzing trace with hash -78006587, now seen corresponding path program 1 times [2022-07-12 17:05:28,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:05:28,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334554967] [2022-07-12 17:05:28,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:05:28,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:05:28,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:28,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:05:28,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:28,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:05:28,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:28,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:05:28,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:28,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:05:28,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:28,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:05:28,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:28,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:05:28,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:28,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:05:28,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:28,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:28,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:28,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:05:28,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:28,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:05:28,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:28,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:05:28,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:28,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:05:28,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:28,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:05:28,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:28,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 17:05:28,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:28,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 17:05:28,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:28,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 17:05:28,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:28,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 17:05:28,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:28,834 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 17:05:28,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:05:28,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334554967] [2022-07-12 17:05:28,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334554967] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:05:28,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:05:28,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:05:28,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167254889] [2022-07-12 17:05:28,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:05:28,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:05:28,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:05:28,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:05:28,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:05:28,837 INFO L87 Difference]: Start difference. First operand 1169 states and 1510 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-12 17:05:31,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:05:31,393 INFO L93 Difference]: Finished difference Result 1169 states and 1510 transitions. [2022-07-12 17:05:31,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:05:31,393 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 115 [2022-07-12 17:05:31,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:05:31,398 INFO L225 Difference]: With dead ends: 1169 [2022-07-12 17:05:31,398 INFO L226 Difference]: Without dead ends: 1167 [2022-07-12 17:05:31,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:05:31,399 INFO L413 NwaCegarLoop]: 1400 mSDtfsCounter, 2103 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 1406 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2276 SdHoareTripleChecker+Valid, 2798 SdHoareTripleChecker+Invalid, 2422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 1406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-12 17:05:31,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2276 Valid, 2798 Invalid, 2422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 1406 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-07-12 17:05:31,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2022-07-12 17:05:31,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 1167. [2022-07-12 17:05:31,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1167 states, 771 states have (on average 1.1880674448767834) internal successors, (916), 799 states have internal predecessors, (916), 297 states have call successors, (297), 80 states have call predecessors, (297), 79 states have return successors, (295), 294 states have call predecessors, (295), 295 states have call successors, (295) [2022-07-12 17:05:31,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1167 states to 1167 states and 1508 transitions. [2022-07-12 17:05:31,446 INFO L78 Accepts]: Start accepts. Automaton has 1167 states and 1508 transitions. Word has length 115 [2022-07-12 17:05:31,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:05:31,446 INFO L495 AbstractCegarLoop]: Abstraction has 1167 states and 1508 transitions. [2022-07-12 17:05:31,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-12 17:05:31,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 1508 transitions. [2022-07-12 17:05:31,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-12 17:05:31,448 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:05:31,448 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:05:31,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 17:05:31,449 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_linux_kernel_module_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:05:31,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:05:31,449 INFO L85 PathProgramCache]: Analyzing trace with hash -750920079, now seen corresponding path program 1 times [2022-07-12 17:05:31,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:05:31,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781568370] [2022-07-12 17:05:31,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:05:31,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:05:31,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:31,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:05:31,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:31,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:05:31,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:31,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:05:31,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:31,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:05:31,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:31,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:05:31,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:31,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:05:31,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:31,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:05:31,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:31,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:31,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:31,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:05:31,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:31,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:05:31,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:31,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:05:31,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:31,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:05:31,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:31,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:05:31,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:31,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 17:05:31,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:31,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 17:05:31,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:31,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 17:05:31,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:31,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 17:05:31,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:31,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 17:05:31,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:31,771 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 17:05:31,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:05:31,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781568370] [2022-07-12 17:05:31,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781568370] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:05:31,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:05:31,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:05:31,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359958005] [2022-07-12 17:05:31,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:05:31,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:05:31,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:05:31,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:05:31,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:05:31,774 INFO L87 Difference]: Start difference. First operand 1167 states and 1508 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-12 17:05:33,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:05:33,853 INFO L93 Difference]: Finished difference Result 1167 states and 1508 transitions. [2022-07-12 17:05:33,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:05:33,854 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 121 [2022-07-12 17:05:33,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:05:33,861 INFO L225 Difference]: With dead ends: 1167 [2022-07-12 17:05:33,864 INFO L226 Difference]: Without dead ends: 1165 [2022-07-12 17:05:33,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:05:33,866 INFO L413 NwaCegarLoop]: 1398 mSDtfsCounter, 2099 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 1404 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2271 SdHoareTripleChecker+Valid, 2796 SdHoareTripleChecker+Invalid, 2420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 1404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-12 17:05:33,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2271 Valid, 2796 Invalid, 2420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 1404 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-07-12 17:05:33,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2022-07-12 17:05:33,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 1165. [2022-07-12 17:05:33,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1165 states, 770 states have (on average 1.187012987012987) internal successors, (914), 797 states have internal predecessors, (914), 297 states have call successors, (297), 80 states have call predecessors, (297), 79 states have return successors, (295), 294 states have call predecessors, (295), 295 states have call successors, (295) [2022-07-12 17:05:33,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 1165 states and 1506 transitions. [2022-07-12 17:05:33,921 INFO L78 Accepts]: Start accepts. Automaton has 1165 states and 1506 transitions. Word has length 121 [2022-07-12 17:05:33,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:05:33,923 INFO L495 AbstractCegarLoop]: Abstraction has 1165 states and 1506 transitions. [2022-07-12 17:05:33,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-12 17:05:33,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1165 states and 1506 transitions. [2022-07-12 17:05:33,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-12 17:05:33,924 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:05:33,925 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:05:33,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 17:05:33,925 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:05:33,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:05:33,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1499616254, now seen corresponding path program 1 times [2022-07-12 17:05:33,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:05:33,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929839615] [2022-07-12 17:05:33,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:05:33,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:05:34,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:34,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:05:34,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:34,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:05:34,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:34,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:05:34,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:34,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:05:34,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:34,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:05:34,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:34,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:05:34,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:34,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:05:34,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:34,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:34,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:34,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:05:34,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:34,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:05:34,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:34,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:05:34,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:34,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:05:34,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:34,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:05:34,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:34,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 17:05:34,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:34,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 17:05:34,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:34,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 17:05:34,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:34,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 17:05:34,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:34,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 17:05:34,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:34,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 17:05:34,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:34,303 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 17:05:34,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:05:34,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929839615] [2022-07-12 17:05:34,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929839615] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:05:34,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:05:34,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:05:34,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699516252] [2022-07-12 17:05:34,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:05:34,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:05:34,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:05:34,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:05:34,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:05:34,306 INFO L87 Difference]: Start difference. First operand 1165 states and 1506 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-12 17:05:36,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:05:36,550 INFO L93 Difference]: Finished difference Result 1165 states and 1506 transitions. [2022-07-12 17:05:36,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:05:36,551 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 127 [2022-07-12 17:05:36,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:05:36,557 INFO L225 Difference]: With dead ends: 1165 [2022-07-12 17:05:36,557 INFO L226 Difference]: Without dead ends: 1163 [2022-07-12 17:05:36,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:05:36,558 INFO L413 NwaCegarLoop]: 1396 mSDtfsCounter, 2093 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 1402 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2264 SdHoareTripleChecker+Valid, 2794 SdHoareTripleChecker+Invalid, 2418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 1402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-12 17:05:36,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2264 Valid, 2794 Invalid, 2418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 1402 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-07-12 17:05:36,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2022-07-12 17:05:36,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 1163. [2022-07-12 17:05:36,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1163 states, 769 states have (on average 1.1859557867360209) internal successors, (912), 795 states have internal predecessors, (912), 297 states have call successors, (297), 80 states have call predecessors, (297), 79 states have return successors, (295), 294 states have call predecessors, (295), 295 states have call successors, (295) [2022-07-12 17:05:36,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 1504 transitions. [2022-07-12 17:05:36,610 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 1504 transitions. Word has length 127 [2022-07-12 17:05:36,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:05:36,611 INFO L495 AbstractCegarLoop]: Abstraction has 1163 states and 1504 transitions. [2022-07-12 17:05:36,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-12 17:05:36,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1504 transitions. [2022-07-12 17:05:36,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-07-12 17:05:36,613 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:05:36,613 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:05:36,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 17:05:36,613 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:05:36,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:05:36,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1163685789, now seen corresponding path program 1 times [2022-07-12 17:05:36,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:05:36,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803296744] [2022-07-12 17:05:36,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:05:36,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:05:36,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:36,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:05:36,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:36,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:05:36,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:36,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:05:36,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:36,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:05:36,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:36,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:05:36,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:36,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:05:36,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:36,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:05:36,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:36,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:36,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:36,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:05:36,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:36,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:05:36,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:36,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:05:36,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:36,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:05:36,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:36,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:05:36,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:36,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 17:05:36,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:36,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 17:05:36,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:36,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 17:05:36,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:36,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 17:05:36,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:36,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 17:05:36,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:36,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 17:05:36,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:36,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 17:05:36,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:36,952 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 17:05:36,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:05:36,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803296744] [2022-07-12 17:05:36,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803296744] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:05:36,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:05:36,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:05:36,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760614234] [2022-07-12 17:05:36,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:05:36,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:05:36,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:05:36,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:05:36,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:05:36,955 INFO L87 Difference]: Start difference. First operand 1163 states and 1504 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-12 17:05:39,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:05:39,185 INFO L93 Difference]: Finished difference Result 1163 states and 1504 transitions. [2022-07-12 17:05:39,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:05:39,185 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 133 [2022-07-12 17:05:39,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:05:39,190 INFO L225 Difference]: With dead ends: 1163 [2022-07-12 17:05:39,190 INFO L226 Difference]: Without dead ends: 1161 [2022-07-12 17:05:39,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:05:39,191 INFO L413 NwaCegarLoop]: 1394 mSDtfsCounter, 2087 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 1400 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2257 SdHoareTripleChecker+Valid, 2792 SdHoareTripleChecker+Invalid, 2416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 1400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-12 17:05:39,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2257 Valid, 2792 Invalid, 2416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 1400 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-07-12 17:05:39,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2022-07-12 17:05:39,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 1161. [2022-07-12 17:05:39,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1161 states, 768 states have (on average 1.1848958333333333) internal successors, (910), 793 states have internal predecessors, (910), 297 states have call successors, (297), 80 states have call predecessors, (297), 79 states have return successors, (295), 294 states have call predecessors, (295), 295 states have call successors, (295) [2022-07-12 17:05:39,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1502 transitions. [2022-07-12 17:05:39,244 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1502 transitions. Word has length 133 [2022-07-12 17:05:39,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:05:39,245 INFO L495 AbstractCegarLoop]: Abstraction has 1161 states and 1502 transitions. [2022-07-12 17:05:39,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-12 17:05:39,245 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1502 transitions. [2022-07-12 17:05:39,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-12 17:05:39,247 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:05:39,247 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:05:39,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 17:05:39,247 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:05:39,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:05:39,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1966142052, now seen corresponding path program 1 times [2022-07-12 17:05:39,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:05:39,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612837590] [2022-07-12 17:05:39,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:05:39,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:05:39,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:39,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:05:39,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:39,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:05:39,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:39,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:05:39,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:39,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:05:39,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:39,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:05:39,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:39,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:05:39,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:39,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:05:39,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:39,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:39,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:39,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:05:39,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:39,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:05:39,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:39,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:05:39,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:39,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:05:39,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:39,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:05:39,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:39,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 17:05:39,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:39,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 17:05:39,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:39,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 17:05:39,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:39,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 17:05:39,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:39,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 17:05:39,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:39,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 17:05:39,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:39,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 17:05:39,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:39,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 17:05:39,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:39,597 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 17:05:39,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:05:39,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612837590] [2022-07-12 17:05:39,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612837590] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:05:39,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:05:39,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:05:39,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575871386] [2022-07-12 17:05:39,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:05:39,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:05:39,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:05:39,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:05:39,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:05:39,600 INFO L87 Difference]: Start difference. First operand 1161 states and 1502 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-12 17:05:41,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:05:41,661 INFO L93 Difference]: Finished difference Result 1161 states and 1502 transitions. [2022-07-12 17:05:41,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:05:41,662 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 139 [2022-07-12 17:05:41,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:05:41,666 INFO L225 Difference]: With dead ends: 1161 [2022-07-12 17:05:41,666 INFO L226 Difference]: Without dead ends: 1159 [2022-07-12 17:05:41,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:05:41,667 INFO L413 NwaCegarLoop]: 1392 mSDtfsCounter, 2081 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 1398 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2250 SdHoareTripleChecker+Valid, 2790 SdHoareTripleChecker+Invalid, 2414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 1398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-12 17:05:41,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2250 Valid, 2790 Invalid, 2414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 1398 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-07-12 17:05:41,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2022-07-12 17:05:41,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1159. [2022-07-12 17:05:41,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1159 states, 767 states have (on average 1.1838331160365059) internal successors, (908), 791 states have internal predecessors, (908), 297 states have call successors, (297), 80 states have call predecessors, (297), 79 states have return successors, (295), 294 states have call predecessors, (295), 295 states have call successors, (295) [2022-07-12 17:05:41,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 1500 transitions. [2022-07-12 17:05:41,720 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 1500 transitions. Word has length 139 [2022-07-12 17:05:41,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:05:41,721 INFO L495 AbstractCegarLoop]: Abstraction has 1159 states and 1500 transitions. [2022-07-12 17:05:41,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-12 17:05:41,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 1500 transitions. [2022-07-12 17:05:41,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-07-12 17:05:41,723 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:05:41,723 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:05:41,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 17:05:41,723 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_linux_kernel_rcu_srcu_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:05:41,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:05:41,724 INFO L85 PathProgramCache]: Analyzing trace with hash 788971441, now seen corresponding path program 1 times [2022-07-12 17:05:41,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:05:41,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819636805] [2022-07-12 17:05:41,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:05:41,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:05:41,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:41,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:05:41,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:41,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:05:41,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:41,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:05:41,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:41,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:05:41,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:41,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:05:41,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:41,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:05:41,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:41,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:05:41,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:41,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:41,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:41,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:05:41,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:42,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:05:42,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:42,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:05:42,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:42,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:05:42,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:42,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:05:42,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:42,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 17:05:42,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:42,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 17:05:42,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:42,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 17:05:42,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:42,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 17:05:42,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:42,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 17:05:42,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:42,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 17:05:42,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:42,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 17:05:42,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:42,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 17:05:42,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:42,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 17:05:42,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:42,105 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 17:05:42,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:05:42,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819636805] [2022-07-12 17:05:42,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819636805] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:05:42,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:05:42,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:05:42,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412170132] [2022-07-12 17:05:42,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:05:42,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:05:42,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:05:42,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:05:42,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:05:42,108 INFO L87 Difference]: Start difference. First operand 1159 states and 1500 transitions. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-12 17:05:44,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:05:44,315 INFO L93 Difference]: Finished difference Result 1159 states and 1500 transitions. [2022-07-12 17:05:44,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:05:44,315 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 145 [2022-07-12 17:05:44,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:05:44,320 INFO L225 Difference]: With dead ends: 1159 [2022-07-12 17:05:44,320 INFO L226 Difference]: Without dead ends: 1157 [2022-07-12 17:05:44,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:05:44,321 INFO L413 NwaCegarLoop]: 1390 mSDtfsCounter, 2075 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 1396 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2243 SdHoareTripleChecker+Valid, 2788 SdHoareTripleChecker+Invalid, 2412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 1396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-12 17:05:44,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2243 Valid, 2788 Invalid, 2412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 1396 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-07-12 17:05:44,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2022-07-12 17:05:44,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 1157. [2022-07-12 17:05:44,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 766 states have (on average 1.1827676240208878) internal successors, (906), 789 states have internal predecessors, (906), 297 states have call successors, (297), 80 states have call predecessors, (297), 79 states have return successors, (295), 294 states have call predecessors, (295), 295 states have call successors, (295) [2022-07-12 17:05:44,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1498 transitions. [2022-07-12 17:05:44,376 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1498 transitions. Word has length 145 [2022-07-12 17:05:44,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:05:44,377 INFO L495 AbstractCegarLoop]: Abstraction has 1157 states and 1498 transitions. [2022-07-12 17:05:44,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-12 17:05:44,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1498 transitions. [2022-07-12 17:05:44,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-07-12 17:05:44,379 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:05:44,379 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:05:44,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 17:05:44,380 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_linux_lib_idr_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:05:44,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:05:44,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1891115065, now seen corresponding path program 1 times [2022-07-12 17:05:44,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:05:44,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147306691] [2022-07-12 17:05:44,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:05:44,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:05:44,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:44,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:05:44,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:44,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:05:44,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:44,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:05:44,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:44,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:05:44,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:44,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:05:44,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:44,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:05:44,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:44,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:05:44,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:44,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:44,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:44,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:05:44,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:44,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:05:44,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:44,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:05:44,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:44,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:05:44,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:44,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:05:44,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:44,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 17:05:44,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:44,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 17:05:44,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:44,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 17:05:44,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:44,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 17:05:44,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:44,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 17:05:44,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:44,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 17:05:44,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:44,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 17:05:44,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:44,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 17:05:44,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:44,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 17:05:44,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:44,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:05:44,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:44,809 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 17:05:44,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:05:44,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147306691] [2022-07-12 17:05:44,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147306691] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:05:44,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:05:44,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:05:44,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235169704] [2022-07-12 17:05:44,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:05:44,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:05:44,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:05:44,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:05:44,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:05:44,812 INFO L87 Difference]: Start difference. First operand 1157 states and 1498 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-12 17:05:47,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:05:47,306 INFO L93 Difference]: Finished difference Result 1157 states and 1498 transitions. [2022-07-12 17:05:47,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:05:47,306 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 151 [2022-07-12 17:05:47,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:05:47,311 INFO L225 Difference]: With dead ends: 1157 [2022-07-12 17:05:47,311 INFO L226 Difference]: Without dead ends: 1155 [2022-07-12 17:05:47,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:05:47,312 INFO L413 NwaCegarLoop]: 1388 mSDtfsCounter, 2069 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 1394 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2236 SdHoareTripleChecker+Valid, 2786 SdHoareTripleChecker+Invalid, 2410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 1394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-12 17:05:47,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2236 Valid, 2786 Invalid, 2410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 1394 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-07-12 17:05:47,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2022-07-12 17:05:47,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 1155. [2022-07-12 17:05:47,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1155 states, 765 states have (on average 1.1816993464052288) internal successors, (904), 787 states have internal predecessors, (904), 297 states have call successors, (297), 80 states have call predecessors, (297), 79 states have return successors, (295), 294 states have call predecessors, (295), 295 states have call successors, (295) [2022-07-12 17:05:47,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 1496 transitions. [2022-07-12 17:05:47,371 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 1496 transitions. Word has length 151 [2022-07-12 17:05:47,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:05:47,372 INFO L495 AbstractCegarLoop]: Abstraction has 1155 states and 1496 transitions. [2022-07-12 17:05:47,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-12 17:05:47,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 1496 transitions. [2022-07-12 17:05:47,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-12 17:05:47,374 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:05:47,374 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:05:47,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 17:05:47,375 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:05:47,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:05:47,375 INFO L85 PathProgramCache]: Analyzing trace with hash -116230766, now seen corresponding path program 1 times [2022-07-12 17:05:47,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:05:47,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737438734] [2022-07-12 17:05:47,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:05:47,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:05:47,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:47,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:05:47,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:47,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:05:47,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:47,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:05:47,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:47,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:05:47,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:47,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:05:47,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:47,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:05:47,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:47,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:05:47,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:47,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:47,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:47,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:05:47,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:47,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:05:47,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:47,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:05:47,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:47,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:05:47,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:47,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:05:47,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:47,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 17:05:47,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:47,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 17:05:47,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:47,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 17:05:47,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:47,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 17:05:47,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:47,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 17:05:47,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:47,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 17:05:47,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:47,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 17:05:47,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:47,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 17:05:47,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:47,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 17:05:47,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:47,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:05:47,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:47,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-12 17:05:47,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:47,776 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 17:05:47,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:05:47,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737438734] [2022-07-12 17:05:47,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737438734] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:05:47,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:05:47,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:05:47,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925033890] [2022-07-12 17:05:47,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:05:47,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:05:47,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:05:47,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:05:47,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:05:47,781 INFO L87 Difference]: Start difference. First operand 1155 states and 1496 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-12 17:05:50,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:05:50,641 INFO L93 Difference]: Finished difference Result 1155 states and 1496 transitions. [2022-07-12 17:05:50,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:05:50,641 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 157 [2022-07-12 17:05:50,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:05:50,646 INFO L225 Difference]: With dead ends: 1155 [2022-07-12 17:05:50,646 INFO L226 Difference]: Without dead ends: 1153 [2022-07-12 17:05:50,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:05:50,647 INFO L413 NwaCegarLoop]: 1386 mSDtfsCounter, 2063 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 1392 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2229 SdHoareTripleChecker+Valid, 2784 SdHoareTripleChecker+Invalid, 2408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 1392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-07-12 17:05:50,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2229 Valid, 2784 Invalid, 2408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 1392 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-07-12 17:05:50,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2022-07-12 17:05:50,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 1153. [2022-07-12 17:05:50,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1153 states, 764 states have (on average 1.1806282722513088) internal successors, (902), 785 states have internal predecessors, (902), 297 states have call successors, (297), 80 states have call predecessors, (297), 79 states have return successors, (295), 294 states have call predecessors, (295), 295 states have call successors, (295) [2022-07-12 17:05:50,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1494 transitions. [2022-07-12 17:05:50,744 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1494 transitions. Word has length 157 [2022-07-12 17:05:50,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:05:50,747 INFO L495 AbstractCegarLoop]: Abstraction has 1153 states and 1494 transitions. [2022-07-12 17:05:50,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-12 17:05:50,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1494 transitions. [2022-07-12 17:05:50,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-07-12 17:05:50,749 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:05:50,750 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:05:50,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 17:05:50,750 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:05:50,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:05:50,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1609989482, now seen corresponding path program 1 times [2022-07-12 17:05:50,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:05:50,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353636259] [2022-07-12 17:05:50,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:05:50,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:05:50,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:51,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:05:51,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:51,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:05:51,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:51,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:05:51,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:51,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:05:51,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:51,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 17:05:51,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:51,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:51,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:51,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:05:51,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:51,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:05:51,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:51,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:05:51,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:51,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:51,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:51,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:05:51,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:51,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:05:51,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:51,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 17:05:51,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:51,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:51,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:51,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:05:51,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:51,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:05:51,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:51,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 17:05:51,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:51,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:51,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:51,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:05:51,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:51,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:05:51,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:51,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:05:51,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:51,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:51,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:51,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:05:51,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:51,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:05:51,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:51,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 17:05:51,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:51,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:05:51,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:51,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-12 17:05:51,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:51,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-12 17:05:51,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:51,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-12 17:05:51,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:51,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-12 17:05:51,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:51,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:51,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:51,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-12 17:05:51,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:51,363 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 401 trivial. 0 not checked. [2022-07-12 17:05:51,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:05:51,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353636259] [2022-07-12 17:05:51,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353636259] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:05:51,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:05:51,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:05:51,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092409275] [2022-07-12 17:05:51,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:05:51,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:05:51,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:05:51,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:05:51,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:05:51,366 INFO L87 Difference]: Start difference. First operand 1153 states and 1494 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-12 17:05:55,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:05:55,538 INFO L93 Difference]: Finished difference Result 2366 states and 2983 transitions. [2022-07-12 17:05:55,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 17:05:55,538 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 196 [2022-07-12 17:05:55,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:05:55,545 INFO L225 Difference]: With dead ends: 2366 [2022-07-12 17:05:55,545 INFO L226 Difference]: Without dead ends: 1664 [2022-07-12 17:05:55,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-07-12 17:05:55,547 INFO L413 NwaCegarLoop]: 1405 mSDtfsCounter, 3004 mSDsluCounter, 1668 mSDsCounter, 0 mSdLazyCounter, 1879 mSolverCounterSat, 1734 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3190 SdHoareTripleChecker+Valid, 3073 SdHoareTripleChecker+Invalid, 3613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1734 IncrementalHoareTripleChecker+Valid, 1879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-07-12 17:05:55,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3190 Valid, 3073 Invalid, 3613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1734 Valid, 1879 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-07-12 17:05:55,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1664 states. [2022-07-12 17:05:55,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1664 to 1633. [2022-07-12 17:05:55,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1633 states, 1098 states have (on average 1.1848816029143898) internal successors, (1301), 1124 states have internal predecessors, (1301), 398 states have call successors, (398), 125 states have call predecessors, (398), 124 states have return successors, (396), 393 states have call predecessors, (396), 396 states have call successors, (396) [2022-07-12 17:05:55,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1633 states to 1633 states and 2095 transitions. [2022-07-12 17:05:55,647 INFO L78 Accepts]: Start accepts. Automaton has 1633 states and 2095 transitions. Word has length 196 [2022-07-12 17:05:55,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:05:55,648 INFO L495 AbstractCegarLoop]: Abstraction has 1633 states and 2095 transitions. [2022-07-12 17:05:55,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-12 17:05:55,648 INFO L276 IsEmpty]: Start isEmpty. Operand 1633 states and 2095 transitions. [2022-07-12 17:05:55,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-07-12 17:05:55,650 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:05:55,650 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:05:55,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-12 17:05:55,651 INFO L420 AbstractCegarLoop]: === Iteration 18 === 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 27 more)] === [2022-07-12 17:05:55,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:05:55,651 INFO L85 PathProgramCache]: Analyzing trace with hash -124157913, now seen corresponding path program 1 times [2022-07-12 17:05:55,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:05:55,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738217640] [2022-07-12 17:05:55,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:05:55,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:05:55,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:55,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:05:55,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:55,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:05:55,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:55,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:05:55,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:55,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:05:55,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:55,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:05:55,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:55,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:05:55,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:55,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:05:55,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:55,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:55,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:55,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:05:55,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:55,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:05:55,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:55,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:05:55,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:55,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:05:55,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:55,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:05:55,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:56,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 17:05:56,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:56,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 17:05:56,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:56,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 17:05:56,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:56,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 17:05:56,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:56,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 17:05:56,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:56,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 17:05:56,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:56,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 17:05:56,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:56,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 17:05:56,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:56,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 17:05:56,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:56,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:05:56,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:56,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-12 17:05:56,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:56,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-12 17:05:56,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:56,065 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 17:05:56,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:05:56,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738217640] [2022-07-12 17:05:56,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738217640] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:05:56,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:05:56,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:05:56,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856949647] [2022-07-12 17:05:56,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:05:56,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:05:56,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:05:56,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:05:56,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:05:56,068 INFO L87 Difference]: Start difference. First operand 1633 states and 2095 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-12 17:05:59,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:05:59,130 INFO L93 Difference]: Finished difference Result 1633 states and 2095 transitions. [2022-07-12 17:05:59,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:05:59,131 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 163 [2022-07-12 17:05:59,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:05:59,138 INFO L225 Difference]: With dead ends: 1633 [2022-07-12 17:05:59,139 INFO L226 Difference]: Without dead ends: 1631 [2022-07-12 17:05:59,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:05:59,140 INFO L413 NwaCegarLoop]: 1384 mSDtfsCounter, 2057 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 1390 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2222 SdHoareTripleChecker+Valid, 2782 SdHoareTripleChecker+Invalid, 2406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 1390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-07-12 17:05:59,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2222 Valid, 2782 Invalid, 2406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 1390 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-07-12 17:05:59,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2022-07-12 17:05:59,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1631. [2022-07-12 17:05:59,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1631 states, 1097 states have (on average 1.1841385597082954) internal successors, (1299), 1122 states have internal predecessors, (1299), 398 states have call successors, (398), 125 states have call predecessors, (398), 124 states have return successors, (396), 393 states have call predecessors, (396), 396 states have call successors, (396) [2022-07-12 17:05:59,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 2093 transitions. [2022-07-12 17:05:59,276 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 2093 transitions. Word has length 163 [2022-07-12 17:05:59,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:05:59,277 INFO L495 AbstractCegarLoop]: Abstraction has 1631 states and 2093 transitions. [2022-07-12 17:05:59,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-12 17:05:59,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2093 transitions. [2022-07-12 17:05:59,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2022-07-12 17:05:59,279 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:05:59,280 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 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] [2022-07-12 17:05:59,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-12 17:05:59,280 INFO L420 AbstractCegarLoop]: === Iteration 19 === 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 27 more)] === [2022-07-12 17:05:59,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:05:59,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1153362727, now seen corresponding path program 1 times [2022-07-12 17:05:59,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:05:59,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897317739] [2022-07-12 17:05:59,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:05:59,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:05:59,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:59,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:05:59,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:59,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:05:59,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:59,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:05:59,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:59,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:05:59,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:59,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 17:05:59,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:59,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:59,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:59,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:05:59,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:59,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:05:59,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:59,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:05:59,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:59,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:59,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:59,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:05:59,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:59,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:05:59,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:59,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 17:05:59,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:59,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:59,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:59,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:05:59,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:59,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:05:59,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:59,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 17:05:59,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:59,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:59,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:59,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:05:59,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:59,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:05:59,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:59,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:05:59,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:59,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:59,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:59,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:05:59,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:59,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:05:59,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:59,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 17:05:59,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:59,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:05:59,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:59,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-12 17:05:59,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:59,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-12 17:05:59,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:59,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-12 17:05:59,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:59,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-12 17:05:59,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:59,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:59,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:59,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-12 17:05:59,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:59,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-12 17:05:59,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:59,813 INFO L134 CoverageAnalysis]: Checked inductivity of 404 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2022-07-12 17:05:59,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:05:59,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897317739] [2022-07-12 17:05:59,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897317739] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 17:05:59,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291405046] [2022-07-12 17:05:59,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:05:59,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:05:59,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 17:05:59,827 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 17:05:59,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 17:06:01,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:01,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 5415 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 17:06:01,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:06:01,466 INFO L134 CoverageAnalysis]: Checked inductivity of 404 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 389 trivial. 0 not checked. [2022-07-12 17:06:01,466 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:06:01,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291405046] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:06:01,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 17:06:01,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2022-07-12 17:06:01,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599931882] [2022-07-12 17:06:01,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:06:01,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 17:06:01,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:06:01,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 17:06:01,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:06:01,469 INFO L87 Difference]: Start difference. First operand 1631 states and 2093 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-12 17:06:01,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:06:01,624 INFO L93 Difference]: Finished difference Result 2376 states and 2995 transitions. [2022-07-12 17:06:01,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 17:06:01,625 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 202 [2022-07-12 17:06:01,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:06:01,633 INFO L225 Difference]: With dead ends: 2376 [2022-07-12 17:06:01,633 INFO L226 Difference]: Without dead ends: 1683 [2022-07-12 17:06:01,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:06:01,636 INFO L413 NwaCegarLoop]: 1549 mSDtfsCounter, 1435 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1435 SdHoareTripleChecker+Valid, 1616 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 17:06:01,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1435 Valid, 1616 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 17:06:01,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1683 states. [2022-07-12 17:06:01,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1683 to 1680. [2022-07-12 17:06:01,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1680 states, 1126 states have (on average 1.1802841918294849) internal successors, (1329), 1154 states have internal predecessors, (1329), 413 states have call successors, (413), 131 states have call predecessors, (413), 130 states have return successors, (411), 406 states have call predecessors, (411), 411 states have call successors, (411) [2022-07-12 17:06:01,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1680 states to 1680 states and 2153 transitions. [2022-07-12 17:06:01,749 INFO L78 Accepts]: Start accepts. Automaton has 1680 states and 2153 transitions. Word has length 202 [2022-07-12 17:06:01,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:06:01,750 INFO L495 AbstractCegarLoop]: Abstraction has 1680 states and 2153 transitions. [2022-07-12 17:06:01,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-12 17:06:01,750 INFO L276 IsEmpty]: Start isEmpty. Operand 1680 states and 2153 transitions. [2022-07-12 17:06:01,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-07-12 17:06:01,752 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:06:01,752 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:06:01,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 17:06:01,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:06:01,980 INFO L420 AbstractCegarLoop]: === Iteration 20 === 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 27 more)] === [2022-07-12 17:06:01,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:06:01,980 INFO L85 PathProgramCache]: Analyzing trace with hash 915941882, now seen corresponding path program 1 times [2022-07-12 17:06:01,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:06:01,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769576020] [2022-07-12 17:06:01,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:06:01,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:06:02,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:02,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:06:02,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:02,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:06:02,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:02,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:06:02,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:02,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:06:02,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:02,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:06:02,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:02,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:06:02,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:02,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:06:02,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:02,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:02,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:02,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:06:02,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:02,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:06:02,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:02,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:06:02,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:02,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:06:02,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:02,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:06:02,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:02,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 17:06:02,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:02,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 17:06:02,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:02,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 17:06:02,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:02,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 17:06:02,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:02,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 17:06:02,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:02,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 17:06:02,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:02,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 17:06:02,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:02,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 17:06:02,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:02,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 17:06:02,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:02,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:06:02,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:02,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-12 17:06:02,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:02,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-12 17:06:02,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:02,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-12 17:06:02,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:02,395 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 17:06:02,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:06:02,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769576020] [2022-07-12 17:06:02,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769576020] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:06:02,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:06:02,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:06:02,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731477038] [2022-07-12 17:06:02,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:06:02,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:06:02,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:06:02,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:06:02,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:06:02,398 INFO L87 Difference]: Start difference. First operand 1680 states and 2153 transitions. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-12 17:06:04,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:06:04,983 INFO L93 Difference]: Finished difference Result 1680 states and 2153 transitions. [2022-07-12 17:06:04,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:06:04,984 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 169 [2022-07-12 17:06:04,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:06:04,991 INFO L225 Difference]: With dead ends: 1680 [2022-07-12 17:06:04,992 INFO L226 Difference]: Without dead ends: 1678 [2022-07-12 17:06:04,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:06:04,993 INFO L413 NwaCegarLoop]: 1377 mSDtfsCounter, 2046 mSDsluCounter, 1384 mSDsCounter, 0 mSdLazyCounter, 1387 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2210 SdHoareTripleChecker+Valid, 2761 SdHoareTripleChecker+Invalid, 2403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 1387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-12 17:06:04,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2210 Valid, 2761 Invalid, 2403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 1387 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-07-12 17:06:05,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1678 states. [2022-07-12 17:06:05,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1678 to 1678. [2022-07-12 17:06:05,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1678 states, 1125 states have (on average 1.1795555555555555) internal successors, (1327), 1152 states have internal predecessors, (1327), 413 states have call successors, (413), 131 states have call predecessors, (413), 130 states have return successors, (411), 406 states have call predecessors, (411), 411 states have call successors, (411) [2022-07-12 17:06:05,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1678 states to 1678 states and 2151 transitions. [2022-07-12 17:06:05,115 INFO L78 Accepts]: Start accepts. Automaton has 1678 states and 2151 transitions. Word has length 169 [2022-07-12 17:06:05,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:06:05,115 INFO L495 AbstractCegarLoop]: Abstraction has 1678 states and 2151 transitions. [2022-07-12 17:06:05,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-12 17:06:05,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1678 states and 2151 transitions. [2022-07-12 17:06:05,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-07-12 17:06:05,118 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:06:05,118 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:06:05,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-12 17:06:05,119 INFO L420 AbstractCegarLoop]: === Iteration 21 === 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 27 more)] === [2022-07-12 17:06:05,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:06:05,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1248913033, now seen corresponding path program 1 times [2022-07-12 17:06:05,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:06:05,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143676230] [2022-07-12 17:06:05,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:06:05,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:06:05,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:05,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:06:05,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:05,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:06:05,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:05,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:06:05,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:05,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:06:05,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:05,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:06:05,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:05,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:06:05,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:05,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:06:05,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:05,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:05,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:05,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:06:05,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:05,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:06:05,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:05,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:06:05,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:05,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:06:05,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:05,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:06:05,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:05,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 17:06:05,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:05,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 17:06:05,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:05,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 17:06:05,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:05,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 17:06:05,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:05,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 17:06:05,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:05,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 17:06:05,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:05,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 17:06:05,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:05,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 17:06:05,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:05,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 17:06:05,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:05,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:06:05,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:05,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-12 17:06:05,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:05,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-12 17:06:05,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:05,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-12 17:06:05,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:05,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-12 17:06:05,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:05,546 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 17:06:05,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:06:05,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143676230] [2022-07-12 17:06:05,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143676230] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:06:05,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:06:05,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:06:05,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268984256] [2022-07-12 17:06:05,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:06:05,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:06:05,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:06:05,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:06:05,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:06:05,551 INFO L87 Difference]: Start difference. First operand 1678 states and 2151 transitions. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-07-12 17:06:09,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:06:09,455 INFO L93 Difference]: Finished difference Result 3075 states and 3907 transitions. [2022-07-12 17:06:09,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 17:06:09,456 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 175 [2022-07-12 17:06:09,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:06:09,468 INFO L225 Difference]: With dead ends: 3075 [2022-07-12 17:06:09,468 INFO L226 Difference]: Without dead ends: 3073 [2022-07-12 17:06:09,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-07-12 17:06:09,469 INFO L413 NwaCegarLoop]: 1722 mSDtfsCounter, 2900 mSDsluCounter, 2199 mSDsCounter, 0 mSdLazyCounter, 2793 mSolverCounterSat, 1562 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3058 SdHoareTripleChecker+Valid, 3921 SdHoareTripleChecker+Invalid, 4355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1562 IncrementalHoareTripleChecker+Valid, 2793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-07-12 17:06:09,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3058 Valid, 3921 Invalid, 4355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1562 Valid, 2793 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-07-12 17:06:09,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3073 states. [2022-07-12 17:06:09,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3073 to 3040. [2022-07-12 17:06:09,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3040 states, 2046 states have (on average 1.1749755620723363) internal successors, (2404), 2085 states have internal predecessors, (2404), 733 states have call successors, (733), 252 states have call predecessors, (733), 251 states have return successors, (740), 722 states have call predecessors, (740), 731 states have call successors, (740) [2022-07-12 17:06:09,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3040 states to 3040 states and 3877 transitions. [2022-07-12 17:06:09,660 INFO L78 Accepts]: Start accepts. Automaton has 3040 states and 3877 transitions. Word has length 175 [2022-07-12 17:06:09,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:06:09,661 INFO L495 AbstractCegarLoop]: Abstraction has 3040 states and 3877 transitions. [2022-07-12 17:06:09,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-07-12 17:06:09,661 INFO L276 IsEmpty]: Start isEmpty. Operand 3040 states and 3877 transitions. [2022-07-12 17:06:09,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2022-07-12 17:06:09,664 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:06:09,664 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:06:09,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-12 17:06:09,664 INFO L420 AbstractCegarLoop]: === Iteration 22 === 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 27 more)] === [2022-07-12 17:06:09,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:06:09,665 INFO L85 PathProgramCache]: Analyzing trace with hash 175315228, now seen corresponding path program 1 times [2022-07-12 17:06:09,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:06:09,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141764160] [2022-07-12 17:06:09,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:06:09,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:06:09,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:09,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:06:09,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:09,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:06:09,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:09,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:06:09,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:09,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:06:09,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:09,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:06:09,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:09,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:06:09,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:09,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:06:09,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:09,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:09,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:09,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:06:09,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:09,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:06:09,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:09,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:06:09,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:09,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:06:09,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:09,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:06:09,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:09,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 17:06:09,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:09,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 17:06:09,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:09,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 17:06:09,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:09,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 17:06:09,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:09,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 17:06:09,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:09,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 17:06:09,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:09,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 17:06:09,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:09,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 17:06:09,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:09,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 17:06:09,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:09,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:06:09,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:09,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-12 17:06:09,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:09,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-12 17:06:09,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:10,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-12 17:06:10,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:10,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-12 17:06:10,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:10,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-12 17:06:10,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:10,018 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 17:06:10,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:06:10,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141764160] [2022-07-12 17:06:10,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141764160] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:06:10,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:06:10,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:06:10,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759746413] [2022-07-12 17:06:10,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:06:10,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:06:10,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:06:10,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:06:10,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:06:10,022 INFO L87 Difference]: Start difference. First operand 3040 states and 3877 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-12 17:06:12,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:06:12,290 INFO L93 Difference]: Finished difference Result 3040 states and 3877 transitions. [2022-07-12 17:06:12,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:06:12,290 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 181 [2022-07-12 17:06:12,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:06:12,302 INFO L225 Difference]: With dead ends: 3040 [2022-07-12 17:06:12,302 INFO L226 Difference]: Without dead ends: 3038 [2022-07-12 17:06:12,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:06:12,304 INFO L413 NwaCegarLoop]: 1375 mSDtfsCounter, 2040 mSDsluCounter, 1384 mSDsCounter, 0 mSdLazyCounter, 1385 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2202 SdHoareTripleChecker+Valid, 2759 SdHoareTripleChecker+Invalid, 2401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 1385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-12 17:06:12,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2202 Valid, 2759 Invalid, 2401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 1385 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-07-12 17:06:12,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3038 states. [2022-07-12 17:06:12,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3038 to 3038. [2022-07-12 17:06:12,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3038 states, 2045 states have (on average 1.1745721271393643) internal successors, (2402), 2083 states have internal predecessors, (2402), 733 states have call successors, (733), 252 states have call predecessors, (733), 251 states have return successors, (740), 722 states have call predecessors, (740), 731 states have call successors, (740) [2022-07-12 17:06:12,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3038 states to 3038 states and 3875 transitions. [2022-07-12 17:06:12,474 INFO L78 Accepts]: Start accepts. Automaton has 3038 states and 3875 transitions. Word has length 181 [2022-07-12 17:06:12,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:06:12,474 INFO L495 AbstractCegarLoop]: Abstraction has 3038 states and 3875 transitions. [2022-07-12 17:06:12,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-12 17:06:12,475 INFO L276 IsEmpty]: Start isEmpty. Operand 3038 states and 3875 transitions. [2022-07-12 17:06:12,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-07-12 17:06:12,477 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:06:12,477 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:06:12,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-12 17:06:12,477 INFO L420 AbstractCegarLoop]: === Iteration 23 === 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 27 more)] === [2022-07-12 17:06:12,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:06:12,478 INFO L85 PathProgramCache]: Analyzing trace with hash 247841666, now seen corresponding path program 1 times [2022-07-12 17:06:12,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:06:12,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799672938] [2022-07-12 17:06:12,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:06:12,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:06:12,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:12,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:06:12,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:12,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:06:12,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:12,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:06:12,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:12,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:06:12,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:12,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:06:12,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:12,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:06:12,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:12,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:06:12,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:12,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:12,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:12,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:06:12,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:12,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:06:12,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:12,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:06:12,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:12,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:06:12,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:12,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:06:12,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:12,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 17:06:12,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:12,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 17:06:12,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:12,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 17:06:12,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:12,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 17:06:12,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:12,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 17:06:12,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:12,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 17:06:12,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:12,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 17:06:12,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:12,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 17:06:12,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:12,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 17:06:12,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:12,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:06:12,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:12,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-12 17:06:12,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:12,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-12 17:06:12,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:12,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-12 17:06:12,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:12,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-12 17:06:12,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:12,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-12 17:06:12,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:12,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-12 17:06:12,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:12,850 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 17:06:12,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:06:12,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799672938] [2022-07-12 17:06:12,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799672938] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:06:12,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:06:12,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:06:12,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521890319] [2022-07-12 17:06:12,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:06:12,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:06:12,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:06:12,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:06:12,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:06:12,853 INFO L87 Difference]: Start difference. First operand 3038 states and 3875 transitions. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (30), 4 states have call predecessors, (30), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2022-07-12 17:06:17,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:06:17,230 INFO L93 Difference]: Finished difference Result 5924 states and 7608 transitions. [2022-07-12 17:06:17,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 17:06:17,230 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (30), 4 states have call predecessors, (30), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 187 [2022-07-12 17:06:17,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:06:17,253 INFO L225 Difference]: With dead ends: 5924 [2022-07-12 17:06:17,254 INFO L226 Difference]: Without dead ends: 5710 [2022-07-12 17:06:17,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-12 17:06:17,259 INFO L413 NwaCegarLoop]: 1589 mSDtfsCounter, 2907 mSDsluCounter, 1861 mSDsCounter, 0 mSdLazyCounter, 3027 mSolverCounterSat, 1784 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3048 SdHoareTripleChecker+Valid, 3450 SdHoareTripleChecker+Invalid, 4811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1784 IncrementalHoareTripleChecker+Valid, 3027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-07-12 17:06:17,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3048 Valid, 3450 Invalid, 4811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1784 Valid, 3027 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-07-12 17:06:17,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5710 states. [2022-07-12 17:06:17,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5710 to 5686. [2022-07-12 17:06:17,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5686 states, 3840 states have (on average 1.1778645833333334) internal successors, (4523), 3896 states have internal predecessors, (4523), 1362 states have call successors, (1362), 478 states have call predecessors, (1362), 475 states have return successors, (1442), 1345 states have call predecessors, (1442), 1358 states have call successors, (1442) [2022-07-12 17:06:17,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5686 states to 5686 states and 7327 transitions. [2022-07-12 17:06:17,601 INFO L78 Accepts]: Start accepts. Automaton has 5686 states and 7327 transitions. Word has length 187 [2022-07-12 17:06:17,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:06:17,601 INFO L495 AbstractCegarLoop]: Abstraction has 5686 states and 7327 transitions. [2022-07-12 17:06:17,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (30), 4 states have call predecessors, (30), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2022-07-12 17:06:17,602 INFO L276 IsEmpty]: Start isEmpty. Operand 5686 states and 7327 transitions. [2022-07-12 17:06:17,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2022-07-12 17:06:17,603 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:06:17,604 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:06:17,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-12 17:06:17,604 INFO L420 AbstractCegarLoop]: === Iteration 24 === 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 27 more)] === [2022-07-12 17:06:17,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:06:17,604 INFO L85 PathProgramCache]: Analyzing trace with hash 573848340, now seen corresponding path program 1 times [2022-07-12 17:06:17,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:06:17,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497147601] [2022-07-12 17:06:17,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:06:17,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:06:17,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:17,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:06:17,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:18,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:06:18,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:18,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:06:18,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:18,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:06:18,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:18,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 17:06:18,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:18,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:18,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:18,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:06:18,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:18,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:06:18,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:18,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:06:18,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:18,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:18,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:18,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:06:18,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:18,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:06:18,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:18,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 17:06:18,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:18,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:18,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:18,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:06:18,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:18,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:06:18,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:18,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 17:06:18,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:18,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:18,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:18,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:06:18,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:18,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:06:18,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:18,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:06:18,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:18,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:18,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:18,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:06:18,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:18,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:06:18,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:18,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 17:06:18,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:18,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:06:18,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:18,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-12 17:06:18,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:18,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-12 17:06:18,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:18,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-12 17:06:18,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:18,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-12 17:06:18,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:18,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:18,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:18,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-12 17:06:18,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:18,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-12 17:06:18,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:18,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-12 17:06:18,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:18,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-07-12 17:06:18,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:18,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-07-12 17:06:18,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:18,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-07-12 17:06:18,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:18,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-07-12 17:06:18,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:18,192 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 437 trivial. 0 not checked. [2022-07-12 17:06:18,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:06:18,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497147601] [2022-07-12 17:06:18,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497147601] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:06:18,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:06:18,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 17:06:18,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627236521] [2022-07-12 17:06:18,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:06:18,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 17:06:18,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:06:18,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 17:06:18,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 17:06:18,195 INFO L87 Difference]: Start difference. First operand 5686 states and 7327 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (28), 5 states have call predecessors, (28), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-12 17:06:21,554 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:06:24,203 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:06:26,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:06:26,702 INFO L93 Difference]: Finished difference Result 11685 states and 15181 transitions. [2022-07-12 17:06:26,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 17:06:26,702 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (28), 5 states have call predecessors, (28), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 242 [2022-07-12 17:06:26,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:06:26,726 INFO L225 Difference]: With dead ends: 11685 [2022-07-12 17:06:26,727 INFO L226 Difference]: Without dead ends: 6104 [2022-07-12 17:06:26,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-07-12 17:06:26,747 INFO L413 NwaCegarLoop]: 1481 mSDtfsCounter, 1553 mSDsluCounter, 3056 mSDsCounter, 0 mSdLazyCounter, 3896 mSolverCounterSat, 1502 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1553 SdHoareTripleChecker+Valid, 4537 SdHoareTripleChecker+Invalid, 5399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1502 IncrementalHoareTripleChecker+Valid, 3896 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2022-07-12 17:06:26,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1553 Valid, 4537 Invalid, 5399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1502 Valid, 3896 Invalid, 1 Unknown, 0 Unchecked, 8.1s Time] [2022-07-12 17:06:26,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6104 states. [2022-07-12 17:06:27,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6104 to 5695. [2022-07-12 17:06:27,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5695 states, 3847 states have (on average 1.1775409409929816) internal successors, (4530), 3905 states have internal predecessors, (4530), 1362 states have call successors, (1362), 478 states have call predecessors, (1362), 477 states have return successors, (1446), 1345 states have call predecessors, (1446), 1358 states have call successors, (1446) [2022-07-12 17:06:27,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5695 states to 5695 states and 7338 transitions. [2022-07-12 17:06:27,226 INFO L78 Accepts]: Start accepts. Automaton has 5695 states and 7338 transitions. Word has length 242 [2022-07-12 17:06:27,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:06:27,226 INFO L495 AbstractCegarLoop]: Abstraction has 5695 states and 7338 transitions. [2022-07-12 17:06:27,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (28), 5 states have call predecessors, (28), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-12 17:06:27,227 INFO L276 IsEmpty]: Start isEmpty. Operand 5695 states and 7338 transitions. [2022-07-12 17:06:27,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2022-07-12 17:06:27,228 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:06:27,229 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:06:27,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-12 17:06:27,229 INFO L420 AbstractCegarLoop]: === Iteration 25 === 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 27 more)] === [2022-07-12 17:06:27,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:06:27,230 INFO L85 PathProgramCache]: Analyzing trace with hash -381389916, now seen corresponding path program 1 times [2022-07-12 17:06:27,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:06:27,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098425520] [2022-07-12 17:06:27,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:06:27,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:06:27,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:27,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:06:27,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:27,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:06:27,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:27,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:06:27,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:27,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:06:27,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:27,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 17:06:27,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:27,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:27,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:27,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:06:27,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:27,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:06:27,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:27,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:06:27,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:27,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:27,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:27,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:06:27,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:27,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:06:27,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:27,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 17:06:27,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:27,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:27,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:27,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:06:27,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:27,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:06:27,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:27,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 17:06:27,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:27,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:27,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:27,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:06:27,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:27,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:06:27,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:27,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:06:27,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:27,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:27,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:27,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:06:27,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:27,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:06:27,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:27,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 17:06:27,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:27,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:06:27,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:27,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-12 17:06:27,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:27,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-12 17:06:27,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:27,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-12 17:06:27,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:27,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-12 17:06:27,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:27,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:27,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:27,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-12 17:06:27,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:27,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-12 17:06:27,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:27,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:27,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:27,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:06:27,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:27,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:06:27,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:27,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-07-12 17:06:27,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:27,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-12 17:06:27,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:27,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-12 17:06:27,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:27,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-12 17:06:27,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:27,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2022-07-12 17:06:27,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:27,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2022-07-12 17:06:27,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:27,751 INFO L134 CoverageAnalysis]: Checked inductivity of 592 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 592 trivial. 0 not checked. [2022-07-12 17:06:27,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:06:27,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098425520] [2022-07-12 17:06:27,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098425520] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:06:27,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:06:27,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 17:06:27,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172540406] [2022-07-12 17:06:27,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:06:27,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 17:06:27,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:06:27,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 17:06:27,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 17:06:27,754 INFO L87 Difference]: Start difference. First operand 5695 states and 7338 transitions. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-07-12 17:06:31,446 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:06:33,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:06:33,261 INFO L93 Difference]: Finished difference Result 11338 states and 14637 transitions. [2022-07-12 17:06:33,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 17:06:33,262 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 263 [2022-07-12 17:06:33,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:06:33,283 INFO L225 Difference]: With dead ends: 11338 [2022-07-12 17:06:33,284 INFO L226 Difference]: Without dead ends: 5770 [2022-07-12 17:06:33,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-07-12 17:06:33,304 INFO L413 NwaCegarLoop]: 1365 mSDtfsCounter, 1283 mSDsluCounter, 2332 mSDsCounter, 0 mSdLazyCounter, 2797 mSolverCounterSat, 1156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1283 SdHoareTripleChecker+Valid, 3697 SdHoareTripleChecker+Invalid, 3953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1156 IncrementalHoareTripleChecker+Valid, 2797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-07-12 17:06:33,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1283 Valid, 3697 Invalid, 3953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1156 Valid, 2797 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-07-12 17:06:33,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5770 states. [2022-07-12 17:06:33,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5770 to 5697. [2022-07-12 17:06:33,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5697 states, 3849 states have (on average 1.1774486879709016) internal successors, (4532), 3907 states have internal predecessors, (4532), 1362 states have call successors, (1362), 478 states have call predecessors, (1362), 477 states have return successors, (1446), 1345 states have call predecessors, (1446), 1358 states have call successors, (1446) [2022-07-12 17:06:33,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5697 states to 5697 states and 7340 transitions. [2022-07-12 17:06:33,809 INFO L78 Accepts]: Start accepts. Automaton has 5697 states and 7340 transitions. Word has length 263 [2022-07-12 17:06:33,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:06:33,810 INFO L495 AbstractCegarLoop]: Abstraction has 5697 states and 7340 transitions. [2022-07-12 17:06:33,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-07-12 17:06:33,810 INFO L276 IsEmpty]: Start isEmpty. Operand 5697 states and 7340 transitions. [2022-07-12 17:06:33,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2022-07-12 17:06:33,813 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:06:33,813 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:06:33,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-12 17:06:33,813 INFO L420 AbstractCegarLoop]: === Iteration 26 === 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 27 more)] === [2022-07-12 17:06:33,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:06:33,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1816089751, now seen corresponding path program 1 times [2022-07-12 17:06:33,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:06:33,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579312131] [2022-07-12 17:06:33,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:06:33,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:06:34,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:34,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:06:34,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:34,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:06:34,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:34,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:06:34,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:34,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:06:34,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:34,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 17:06:34,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:34,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:34,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:34,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:06:34,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:34,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:06:34,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:34,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:06:34,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:34,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:34,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:34,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:06:34,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:34,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:06:34,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:34,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 17:06:34,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:34,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:34,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:34,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:06:34,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:34,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:06:34,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:34,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 17:06:34,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:34,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:34,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:34,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:06:34,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:34,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:06:34,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:34,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:06:34,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:34,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:34,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:34,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:06:34,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:34,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:06:34,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:34,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 17:06:34,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:34,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:06:34,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:34,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-12 17:06:34,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:34,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-12 17:06:34,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:34,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-12 17:06:34,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:34,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-12 17:06:34,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:34,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:34,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:34,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-12 17:06:34,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:34,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-12 17:06:34,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:34,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:34,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:34,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:06:34,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:34,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:06:34,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:34,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-07-12 17:06:34,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:34,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-12 17:06:34,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:34,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-12 17:06:34,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:34,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-12 17:06:34,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:34,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2022-07-12 17:06:34,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:34,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2022-07-12 17:06:34,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:34,356 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 592 trivial. 0 not checked. [2022-07-12 17:06:34,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:06:34,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579312131] [2022-07-12 17:06:34,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579312131] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 17:06:34,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616642535] [2022-07-12 17:06:34,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:06:34,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:06:34,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 17:06:34,359 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 17:06:34,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 17:06:36,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:36,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 5882 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 17:06:36,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:06:36,413 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 577 trivial. 0 not checked. [2022-07-12 17:06:36,413 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 17:06:36,635 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 592 trivial. 0 not checked. [2022-07-12 17:06:36,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1616642535] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 17:06:36,636 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 17:06:36,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 12 [2022-07-12 17:06:36,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114665267] [2022-07-12 17:06:36,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 17:06:36,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 17:06:36,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:06:36,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 17:06:36,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-07-12 17:06:36,639 INFO L87 Difference]: Start difference. First operand 5697 states and 7340 transitions. Second operand has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 9 states have internal predecessors, (113), 2 states have call successors, (40), 5 states have call predecessors, (40), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2022-07-12 17:06:42,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:06:42,890 INFO L93 Difference]: Finished difference Result 11347 states and 14648 transitions. [2022-07-12 17:06:42,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 17:06:42,891 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 9 states have internal predecessors, (113), 2 states have call successors, (40), 5 states have call predecessors, (40), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 267 [2022-07-12 17:06:42,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:06:42,913 INFO L225 Difference]: With dead ends: 11347 [2022-07-12 17:06:42,914 INFO L226 Difference]: Without dead ends: 5779 [2022-07-12 17:06:42,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 630 GetRequests, 611 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2022-07-12 17:06:42,934 INFO L413 NwaCegarLoop]: 1366 mSDtfsCounter, 1307 mSDsluCounter, 3509 mSDsCounter, 0 mSdLazyCounter, 4611 mSolverCounterSat, 1161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1307 SdHoareTripleChecker+Valid, 4875 SdHoareTripleChecker+Invalid, 5772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1161 IncrementalHoareTripleChecker+Valid, 4611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-07-12 17:06:42,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1307 Valid, 4875 Invalid, 5772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1161 Valid, 4611 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2022-07-12 17:06:42,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5779 states. [2022-07-12 17:06:43,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5779 to 5709. [2022-07-12 17:06:43,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5709 states, 3861 states have (on average 1.176897176897177) internal successors, (4544), 3919 states have internal predecessors, (4544), 1362 states have call successors, (1362), 478 states have call predecessors, (1362), 477 states have return successors, (1446), 1345 states have call predecessors, (1446), 1358 states have call successors, (1446) [2022-07-12 17:06:43,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5709 states to 5709 states and 7352 transitions. [2022-07-12 17:06:43,359 INFO L78 Accepts]: Start accepts. Automaton has 5709 states and 7352 transitions. Word has length 267 [2022-07-12 17:06:43,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:06:43,359 INFO L495 AbstractCegarLoop]: Abstraction has 5709 states and 7352 transitions. [2022-07-12 17:06:43,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 9 states have internal predecessors, (113), 2 states have call successors, (40), 5 states have call predecessors, (40), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2022-07-12 17:06:43,360 INFO L276 IsEmpty]: Start isEmpty. Operand 5709 states and 7352 transitions. [2022-07-12 17:06:43,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2022-07-12 17:06:43,362 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:06:43,362 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2022-07-12 17:06:43,403 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-12 17:06:43,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-07-12 17:06:43,576 INFO L420 AbstractCegarLoop]: === Iteration 27 === 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 27 more)] === [2022-07-12 17:06:43,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:06:43,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1770603785, now seen corresponding path program 1 times [2022-07-12 17:06:43,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:06:43,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172055555] [2022-07-12 17:06:43,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:06:43,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:06:43,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:43,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:06:43,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:43,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:06:43,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:43,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:06:43,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:43,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:06:43,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:43,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 17:06:43,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:43,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:43,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:43,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:06:43,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:43,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:06:43,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:43,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:06:43,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:43,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:43,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:43,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:06:43,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:43,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:06:43,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:43,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 17:06:43,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:43,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:43,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:43,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:06:43,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:43,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:06:43,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:43,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 17:06:43,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:43,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:43,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:43,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:06:44,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:44,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:06:44,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:44,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:06:44,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:44,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:44,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:44,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:06:44,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:44,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:06:44,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:44,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 17:06:44,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:44,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:06:44,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:44,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-12 17:06:44,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:44,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-12 17:06:44,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:44,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-12 17:06:44,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:44,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-12 17:06:44,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:44,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:44,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:44,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-12 17:06:44,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:44,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-12 17:06:44,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:44,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-12 17:06:44,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:44,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-07-12 17:06:44,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:44,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:44,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:44,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-07-12 17:06:44,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:44,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2022-07-12 17:06:44,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:44,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2022-07-12 17:06:44,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:44,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-07-12 17:06:44,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:44,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-07-12 17:06:44,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:44,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2022-07-12 17:06:44,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:44,123 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 543 trivial. 0 not checked. [2022-07-12 17:06:44,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:06:44,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172055555] [2022-07-12 17:06:44,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172055555] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:06:44,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:06:44,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 17:06:44,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547814987] [2022-07-12 17:06:44,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:06:44,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 17:06:44,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:06:44,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 17:06:44,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-12 17:06:44,127 INFO L87 Difference]: Start difference. First operand 5709 states and 7352 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (34), 7 states have call predecessors, (34), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2022-07-12 17:06:48,225 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:06:50,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:06:50,430 INFO L93 Difference]: Finished difference Result 7313 states and 9336 transitions. [2022-07-12 17:06:50,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 17:06:50,430 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (34), 7 states have call predecessors, (34), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 267 [2022-07-12 17:06:50,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:06:50,455 INFO L225 Difference]: With dead ends: 7313 [2022-07-12 17:06:50,455 INFO L226 Difference]: Without dead ends: 7311 [2022-07-12 17:06:50,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2022-07-12 17:06:50,460 INFO L413 NwaCegarLoop]: 1360 mSDtfsCounter, 3018 mSDsluCounter, 2394 mSDsCounter, 0 mSdLazyCounter, 3151 mSolverCounterSat, 1934 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3169 SdHoareTripleChecker+Valid, 3754 SdHoareTripleChecker+Invalid, 5085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1934 IncrementalHoareTripleChecker+Valid, 3151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-07-12 17:06:50,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3169 Valid, 3754 Invalid, 5085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1934 Valid, 3151 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2022-07-12 17:06:50,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7311 states. [2022-07-12 17:06:51,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7311 to 7187. [2022-07-12 17:06:51,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7187 states, 4892 states have (on average 1.1813164349959118) internal successors, (5779), 4949 states have internal predecessors, (5779), 1626 states have call successors, (1626), 662 states have call predecessors, (1626), 661 states have return successors, (1726), 1609 states have call predecessors, (1726), 1622 states have call successors, (1726) [2022-07-12 17:06:51,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7187 states to 7187 states and 9131 transitions. [2022-07-12 17:06:51,052 INFO L78 Accepts]: Start accepts. Automaton has 7187 states and 9131 transitions. Word has length 267 [2022-07-12 17:06:51,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:06:51,053 INFO L495 AbstractCegarLoop]: Abstraction has 7187 states and 9131 transitions. [2022-07-12 17:06:51,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (34), 7 states have call predecessors, (34), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2022-07-12 17:06:51,053 INFO L276 IsEmpty]: Start isEmpty. Operand 7187 states and 9131 transitions. [2022-07-12 17:06:51,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2022-07-12 17:06:51,055 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:06:51,056 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:06:51,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-12 17:06:51,056 INFO L420 AbstractCegarLoop]: === Iteration 28 === 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 27 more)] === [2022-07-12 17:06:51,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:06:51,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1859507128, now seen corresponding path program 2 times [2022-07-12 17:06:51,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:06:51,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992690035] [2022-07-12 17:06:51,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:06:51,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:06:51,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:51,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:06:51,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:51,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:06:51,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:51,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:06:51,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:51,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:06:51,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:51,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 17:06:51,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:51,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:51,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:51,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:06:51,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:51,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:06:51,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:51,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:06:51,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:51,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:51,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:51,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:06:51,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:51,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:06:51,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:51,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 17:06:51,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:51,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:51,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:51,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:06:51,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:51,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:06:51,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:51,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 17:06:51,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:51,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:51,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:51,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:06:51,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:51,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:06:51,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:51,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:06:51,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:51,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:51,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:51,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:06:51,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:51,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:06:51,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:51,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 17:06:51,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:51,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:06:51,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:51,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-12 17:06:51,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:51,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-12 17:06:51,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:51,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-12 17:06:51,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:51,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-12 17:06:51,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:51,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:51,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:51,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-12 17:06:51,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:51,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-12 17:06:51,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:51,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:51,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:51,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:06:51,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:51,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:06:51,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:51,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-07-12 17:06:51,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:51,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-12 17:06:51,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:51,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-12 17:06:51,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:51,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-12 17:06:51,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:51,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-07-12 17:06:51,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:51,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2022-07-12 17:06:51,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:51,626 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 592 trivial. 0 not checked. [2022-07-12 17:06:51,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:06:51,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992690035] [2022-07-12 17:06:51,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992690035] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 17:06:51,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026078799] [2022-07-12 17:06:51,627 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 17:06:51,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:06:51,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 17:06:51,629 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 17:06:51,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 17:06:53,305 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-12 17:06:53,305 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 17:06:53,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 4181 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-12 17:06:53,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:06:53,663 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2022-07-12 17:06:53,664 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:06:53,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026078799] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:06:53,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 17:06:53,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 15 [2022-07-12 17:06:53,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678720595] [2022-07-12 17:06:53,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:06:53,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:06:53,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:06:53,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:06:53,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2022-07-12 17:06:53,666 INFO L87 Difference]: Start difference. First operand 7187 states and 9131 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (29), 1 states have call predecessors, (29), 2 states have return successors, (27), 2 states have call predecessors, (27), 1 states have call successors, (27) [2022-07-12 17:06:54,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:06:54,734 INFO L93 Difference]: Finished difference Result 14218 states and 18299 transitions. [2022-07-12 17:06:54,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 17:06:54,735 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), 1 states have call successors, (29), 1 states have call predecessors, (29), 2 states have return successors, (27), 2 states have call predecessors, (27), 1 states have call successors, (27) Word has length 279 [2022-07-12 17:06:54,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:06:54,763 INFO L225 Difference]: With dead ends: 14218 [2022-07-12 17:06:54,763 INFO L226 Difference]: Without dead ends: 7187 [2022-07-12 17:06:54,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2022-07-12 17:06:54,789 INFO L413 NwaCegarLoop]: 1473 mSDtfsCounter, 1324 mSDsluCounter, 3822 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1332 SdHoareTripleChecker+Valid, 5295 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 17:06:54,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1332 Valid, 5295 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-12 17:06:54,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7187 states. [2022-07-12 17:06:55,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7187 to 7187. [2022-07-12 17:06:55,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7187 states, 4892 states have (on average 1.178045789043336) internal successors, (5763), 4949 states have internal predecessors, (5763), 1626 states have call successors, (1626), 662 states have call predecessors, (1626), 661 states have return successors, (1726), 1609 states have call predecessors, (1726), 1622 states have call successors, (1726) [2022-07-12 17:06:55,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7187 states to 7187 states and 9115 transitions. [2022-07-12 17:06:55,340 INFO L78 Accepts]: Start accepts. Automaton has 7187 states and 9115 transitions. Word has length 279 [2022-07-12 17:06:55,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:06:55,341 INFO L495 AbstractCegarLoop]: Abstraction has 7187 states and 9115 transitions. [2022-07-12 17:06:55,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (29), 1 states have call predecessors, (29), 2 states have return successors, (27), 2 states have call predecessors, (27), 1 states have call successors, (27) [2022-07-12 17:06:55,341 INFO L276 IsEmpty]: Start isEmpty. Operand 7187 states and 9115 transitions. [2022-07-12 17:06:55,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2022-07-12 17:06:55,343 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:06:55,343 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:06:55,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 17:06:55,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:06:55,572 INFO L420 AbstractCegarLoop]: === Iteration 29 === 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 27 more)] === [2022-07-12 17:06:55,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:06:55,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1859566710, now seen corresponding path program 1 times [2022-07-12 17:06:55,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:06:55,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618711450] [2022-07-12 17:06:55,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:06:55,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:06:55,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:55,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:06:55,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:55,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:06:55,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:55,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:06:55,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:55,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:06:55,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:55,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 17:06:55,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:55,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:55,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:55,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:06:55,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:55,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:06:55,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:55,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:06:55,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:55,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:55,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:55,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:06:55,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:55,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:06:55,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:55,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 17:06:55,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:55,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:55,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:55,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:06:55,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:55,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:06:55,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:55,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 17:06:55,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:55,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:55,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:55,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:06:55,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:55,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:06:55,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:55,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:06:55,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:55,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:55,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:55,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:06:55,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:55,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:06:55,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:55,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 17:06:55,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:55,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:06:55,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:55,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-12 17:06:55,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:55,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-12 17:06:55,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:55,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-12 17:06:55,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:55,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-12 17:06:55,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:56,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:56,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:56,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-12 17:06:56,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:56,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-12 17:06:56,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:56,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:56,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:56,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:06:56,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:56,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:06:56,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:56,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-07-12 17:06:56,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:56,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-12 17:06:56,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:56,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-12 17:06:56,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:56,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-12 17:06:56,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:56,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-07-12 17:06:56,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:56,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2022-07-12 17:06:56,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:56,054 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2022-07-12 17:06:56,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:06:56,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618711450] [2022-07-12 17:06:56,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618711450] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:06:56,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:06:56,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 17:06:56,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65574978] [2022-07-12 17:06:56,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:06:56,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 17:06:56,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:06:56,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 17:06:56,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 17:06:56,056 INFO L87 Difference]: Start difference. First operand 7187 states and 9115 transitions. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2022-07-12 17:06:58,950 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:07:02,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:07:02,470 INFO L93 Difference]: Finished difference Result 7305 states and 9308 transitions. [2022-07-12 17:07:02,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 17:07:02,470 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 279 [2022-07-12 17:07:02,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:07:02,488 INFO L225 Difference]: With dead ends: 7305 [2022-07-12 17:07:02,488 INFO L226 Difference]: Without dead ends: 7303 [2022-07-12 17:07:02,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-07-12 17:07:02,492 INFO L413 NwaCegarLoop]: 1358 mSDtfsCounter, 1272 mSDsluCounter, 2343 mSDsCounter, 0 mSdLazyCounter, 2759 mSolverCounterSat, 1156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1272 SdHoareTripleChecker+Valid, 3701 SdHoareTripleChecker+Invalid, 3915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1156 IncrementalHoareTripleChecker+Valid, 2759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-07-12 17:07:02,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1272 Valid, 3701 Invalid, 3915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1156 Valid, 2759 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2022-07-12 17:07:02,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7303 states. [2022-07-12 17:07:02,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7303 to 7185. [2022-07-12 17:07:02,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7185 states, 4891 states have (on average 1.174810877121243) internal successors, (5746), 4947 states have internal predecessors, (5746), 1626 states have call successors, (1626), 662 states have call predecessors, (1626), 661 states have return successors, (1726), 1609 states have call predecessors, (1726), 1622 states have call successors, (1726) [2022-07-12 17:07:02,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7185 states to 7185 states and 9098 transitions. [2022-07-12 17:07:02,995 INFO L78 Accepts]: Start accepts. Automaton has 7185 states and 9098 transitions. Word has length 279 [2022-07-12 17:07:02,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:07:02,996 INFO L495 AbstractCegarLoop]: Abstraction has 7185 states and 9098 transitions. [2022-07-12 17:07:02,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2022-07-12 17:07:02,996 INFO L276 IsEmpty]: Start isEmpty. Operand 7185 states and 9098 transitions. [2022-07-12 17:07:02,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2022-07-12 17:07:02,999 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:07:02,999 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:07:02,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-12 17:07:02,999 INFO L420 AbstractCegarLoop]: === Iteration 30 === 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 27 more)] === [2022-07-12 17:07:03,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:07:03,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1346050784, now seen corresponding path program 1 times [2022-07-12 17:07:03,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:07:03,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159411153] [2022-07-12 17:07:03,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:07:03,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:07:03,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:03,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:07:03,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:03,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:07:03,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:03,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:07:03,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:03,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:07:03,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:03,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 17:07:03,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:03,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:03,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:03,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:03,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:03,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:03,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:03,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:07:03,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:03,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:03,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:03,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:03,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:03,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:03,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:03,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 17:07:03,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:03,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:03,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:03,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:03,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:03,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:03,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:03,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 17:07:03,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:03,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:03,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:03,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:03,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:03,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:03,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:03,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:07:03,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:03,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:03,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:03,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:03,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:03,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:03,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:03,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 17:07:03,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:03,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:07:03,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:03,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-12 17:07:03,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:03,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-12 17:07:03,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:03,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-12 17:07:03,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:03,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-12 17:07:03,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:03,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:03,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:03,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-12 17:07:03,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:03,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-12 17:07:03,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:03,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:03,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:03,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:03,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:03,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:03,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:03,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-07-12 17:07:03,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:03,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-12 17:07:03,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:03,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-12 17:07:03,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:03,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-12 17:07:03,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:03,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-07-12 17:07:03,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:03,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2022-07-12 17:07:03,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:03,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:03,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:03,611 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2022-07-12 17:07:03,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:07:03,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159411153] [2022-07-12 17:07:03,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159411153] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:07:03,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:07:03,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:07:03,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228830139] [2022-07-12 17:07:03,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:07:03,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:07:03,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:07:03,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:07:03,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:07:03,614 INFO L87 Difference]: Start difference. First operand 7185 states and 9098 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (30), 5 states have call predecessors, (30), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-12 17:07:07,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:07:07,078 INFO L93 Difference]: Finished difference Result 14298 states and 18377 transitions. [2022-07-12 17:07:07,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:07:07,078 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (30), 5 states have call predecessors, (30), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 286 [2022-07-12 17:07:07,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:07:07,111 INFO L225 Difference]: With dead ends: 14298 [2022-07-12 17:07:07,112 INFO L226 Difference]: Without dead ends: 7269 [2022-07-12 17:07:07,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:07:07,137 INFO L413 NwaCegarLoop]: 1354 mSDtfsCounter, 2256 mSDsluCounter, 1167 mSDsCounter, 0 mSdLazyCounter, 991 mSolverCounterSat, 1380 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2429 SdHoareTripleChecker+Valid, 2521 SdHoareTripleChecker+Invalid, 2371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1380 IncrementalHoareTripleChecker+Valid, 991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-07-12 17:07:07,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2429 Valid, 2521 Invalid, 2371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1380 Valid, 991 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-07-12 17:07:07,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7269 states. [2022-07-12 17:07:07,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7269 to 7151. [2022-07-12 17:07:07,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7151 states, 4858 states have (on average 1.169411280362289) internal successors, (5681), 4913 states have internal predecessors, (5681), 1626 states have call successors, (1626), 662 states have call predecessors, (1626), 661 states have return successors, (1726), 1609 states have call predecessors, (1726), 1622 states have call successors, (1726) [2022-07-12 17:07:07,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7151 states to 7151 states and 9033 transitions. [2022-07-12 17:07:07,680 INFO L78 Accepts]: Start accepts. Automaton has 7151 states and 9033 transitions. Word has length 286 [2022-07-12 17:07:07,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:07:07,681 INFO L495 AbstractCegarLoop]: Abstraction has 7151 states and 9033 transitions. [2022-07-12 17:07:07,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (30), 5 states have call predecessors, (30), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-12 17:07:07,681 INFO L276 IsEmpty]: Start isEmpty. Operand 7151 states and 9033 transitions. [2022-07-12 17:07:07,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2022-07-12 17:07:07,683 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:07:07,683 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:07:07,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-12 17:07:07,684 INFO L420 AbstractCegarLoop]: === Iteration 31 === 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 27 more)] === [2022-07-12 17:07:07,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:07:07,684 INFO L85 PathProgramCache]: Analyzing trace with hash -881185240, now seen corresponding path program 1 times [2022-07-12 17:07:07,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:07:07,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371305840] [2022-07-12 17:07:07,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:07:07,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:07:07,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:07,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:07:07,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:07,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:07:07,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:07,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:07:07,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:07,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:07:07,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:08,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 17:07:08,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:08,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:08,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:08,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:08,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:08,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:08,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:08,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:07:08,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:08,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:08,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:08,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:08,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:08,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:08,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:08,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 17:07:08,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:08,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:08,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:08,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:08,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:08,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:08,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:08,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 17:07:08,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:08,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:08,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:08,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:08,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:08,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:08,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:08,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:07:08,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:08,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:08,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:08,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:08,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:08,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:08,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:08,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 17:07:08,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:08,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:07:08,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:08,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-12 17:07:08,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:08,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-12 17:07:08,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:08,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-12 17:07:08,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:08,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-12 17:07:08,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:08,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:08,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:08,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-12 17:07:08,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:08,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-12 17:07:08,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:08,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-12 17:07:08,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:08,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-07-12 17:07:08,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:08,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:08,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:08,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-07-12 17:07:08,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:08,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2022-07-12 17:07:08,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:08,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2022-07-12 17:07:08,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:08,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-07-12 17:07:08,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:08,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-07-12 17:07:08,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:08,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:08,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:08,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:08,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:08,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:08,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:08,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-07-12 17:07:08,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:08,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2022-07-12 17:07:08,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:08,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2022-07-12 17:07:08,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:08,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 17:07:08,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:08,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-12 17:07:08,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:08,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2022-07-12 17:07:08,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:08,264 INFO L134 CoverageAnalysis]: Checked inductivity of 778 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 778 trivial. 0 not checked. [2022-07-12 17:07:08,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:07:08,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371305840] [2022-07-12 17:07:08,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371305840] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:07:08,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:07:08,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 17:07:08,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425124974] [2022-07-12 17:07:08,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:07:08,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 17:07:08,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:07:08,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 17:07:08,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:07:08,266 INFO L87 Difference]: Start difference. First operand 7151 states and 9033 transitions. Second operand has 10 states, 9 states have (on average 10.88888888888889) internal successors, (98), 4 states have internal predecessors, (98), 3 states have call successors, (38), 8 states have call predecessors, (38), 2 states have return successors, (35), 2 states have call predecessors, (35), 3 states have call successors, (35) [2022-07-12 17:07:15,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:07:15,533 INFO L93 Difference]: Finished difference Result 7283 states and 9243 transitions. [2022-07-12 17:07:15,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 17:07:15,534 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 10.88888888888889) internal successors, (98), 4 states have internal predecessors, (98), 3 states have call successors, (38), 8 states have call predecessors, (38), 2 states have return successors, (35), 2 states have call predecessors, (35), 3 states have call successors, (35) Word has length 299 [2022-07-12 17:07:15,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:07:15,552 INFO L225 Difference]: With dead ends: 7283 [2022-07-12 17:07:15,552 INFO L226 Difference]: Without dead ends: 7281 [2022-07-12 17:07:15,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2022-07-12 17:07:15,556 INFO L413 NwaCegarLoop]: 1523 mSDtfsCounter, 2214 mSDsluCounter, 3276 mSDsCounter, 0 mSdLazyCounter, 4416 mSolverCounterSat, 2101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2226 SdHoareTripleChecker+Valid, 4799 SdHoareTripleChecker+Invalid, 6517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2101 IncrementalHoareTripleChecker+Valid, 4416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-07-12 17:07:15,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2226 Valid, 4799 Invalid, 6517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2101 Valid, 4416 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2022-07-12 17:07:15,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7281 states. [2022-07-12 17:07:16,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7281 to 7149. [2022-07-12 17:07:16,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7149 states, 4857 states have (on average 1.167799052913321) internal successors, (5672), 4911 states have internal predecessors, (5672), 1626 states have call successors, (1626), 662 states have call predecessors, (1626), 661 states have return successors, (1726), 1609 states have call predecessors, (1726), 1622 states have call successors, (1726) [2022-07-12 17:07:16,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7149 states to 7149 states and 9024 transitions. [2022-07-12 17:07:16,064 INFO L78 Accepts]: Start accepts. Automaton has 7149 states and 9024 transitions. Word has length 299 [2022-07-12 17:07:16,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:07:16,065 INFO L495 AbstractCegarLoop]: Abstraction has 7149 states and 9024 transitions. [2022-07-12 17:07:16,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 10.88888888888889) internal successors, (98), 4 states have internal predecessors, (98), 3 states have call successors, (38), 8 states have call predecessors, (38), 2 states have return successors, (35), 2 states have call predecessors, (35), 3 states have call successors, (35) [2022-07-12 17:07:16,065 INFO L276 IsEmpty]: Start isEmpty. Operand 7149 states and 9024 transitions. [2022-07-12 17:07:16,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2022-07-12 17:07:16,068 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:07:16,069 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 6, 6, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:07:16,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-12 17:07:16,069 INFO L420 AbstractCegarLoop]: === Iteration 32 === 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 27 more)] === [2022-07-12 17:07:16,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:07:16,070 INFO L85 PathProgramCache]: Analyzing trace with hash 95962582, now seen corresponding path program 1 times [2022-07-12 17:07:16,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:07:16,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240704666] [2022-07-12 17:07:16,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:07:16,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:07:16,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:16,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:07:16,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:16,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:07:16,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:16,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:07:16,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:16,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:07:16,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:16,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 17:07:16,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:16,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:16,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:16,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:16,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:16,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:16,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:16,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:07:16,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:16,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:16,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:16,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:16,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:16,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:16,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:16,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 17:07:16,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:16,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:16,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:16,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:16,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:16,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:16,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:16,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 17:07:16,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:16,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:16,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:16,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:16,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:16,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:16,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:16,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:07:16,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:16,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:16,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:16,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:16,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:16,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:16,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:16,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 17:07:16,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:16,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:07:16,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:16,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-12 17:07:16,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:16,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-12 17:07:16,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:16,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-12 17:07:16,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:16,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-12 17:07:16,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:16,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:16,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:16,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-12 17:07:16,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:16,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-12 17:07:16,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:16,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-12 17:07:16,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:16,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-07-12 17:07:16,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:16,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:16,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:16,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-07-12 17:07:16,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:16,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2022-07-12 17:07:16,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:16,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2022-07-12 17:07:16,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:16,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-07-12 17:07:16,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:16,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2022-07-12 17:07:16,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:16,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2022-07-12 17:07:16,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:16,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2022-07-12 17:07:16,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:16,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2022-07-12 17:07:16,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:16,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:16,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:16,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:16,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:16,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:16,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:16,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:16,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:16,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 17:07:16,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:16,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 17:07:16,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:16,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:16,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:16,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:16,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:16,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:16,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:16,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:07:16,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:16,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 17:07:16,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:16,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:07:16,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:16,711 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 584 trivial. 0 not checked. [2022-07-12 17:07:16,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:07:16,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240704666] [2022-07-12 17:07:16,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240704666] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:07:16,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:07:16,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-12 17:07:16,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498264013] [2022-07-12 17:07:16,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:07:16,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 17:07:16,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:07:16,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 17:07:16,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-07-12 17:07:16,713 INFO L87 Difference]: Start difference. First operand 7149 states and 9024 transitions. Second operand has 13 states, 12 states have (on average 11.25) internal successors, (135), 6 states have internal predecessors, (135), 3 states have call successors, (46), 7 states have call predecessors, (46), 3 states have return successors, (44), 4 states have call predecessors, (44), 3 states have call successors, (44) [2022-07-12 17:07:21,714 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:07:27,740 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:07:29,754 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:07:31,766 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:07:35,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:07:35,871 INFO L93 Difference]: Finished difference Result 12986 states and 16332 transitions. [2022-07-12 17:07:35,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 17:07:35,872 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 11.25) internal successors, (135), 6 states have internal predecessors, (135), 3 states have call successors, (46), 7 states have call predecessors, (46), 3 states have return successors, (44), 4 states have call predecessors, (44), 3 states have call successors, (44) Word has length 342 [2022-07-12 17:07:35,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:07:35,891 INFO L225 Difference]: With dead ends: 12986 [2022-07-12 17:07:35,891 INFO L226 Difference]: Without dead ends: 7471 [2022-07-12 17:07:35,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=176, Invalid=474, Unknown=0, NotChecked=0, Total=650 [2022-07-12 17:07:35,908 INFO L413 NwaCegarLoop]: 1314 mSDtfsCounter, 1523 mSDsluCounter, 5376 mSDsCounter, 0 mSdLazyCounter, 7439 mSolverCounterSat, 1569 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1523 SdHoareTripleChecker+Valid, 6690 SdHoareTripleChecker+Invalid, 9011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1569 IncrementalHoareTripleChecker+Valid, 7439 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.4s IncrementalHoareTripleChecker+Time [2022-07-12 17:07:35,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1523 Valid, 6690 Invalid, 9011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1569 Valid, 7439 Invalid, 3 Unknown, 0 Unchecked, 18.4s Time] [2022-07-12 17:07:35,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7471 states. [2022-07-12 17:07:36,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7471 to 7199. [2022-07-12 17:07:36,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7199 states, 4890 states have (on average 1.1666666666666667) internal successors, (5705), 4945 states have internal predecessors, (5705), 1642 states have call successors, (1642), 662 states have call predecessors, (1642), 662 states have return successors, (1745), 1625 states have call predecessors, (1745), 1638 states have call successors, (1745) [2022-07-12 17:07:36,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7199 states to 7199 states and 9092 transitions. [2022-07-12 17:07:36,552 INFO L78 Accepts]: Start accepts. Automaton has 7199 states and 9092 transitions. Word has length 342 [2022-07-12 17:07:36,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:07:36,553 INFO L495 AbstractCegarLoop]: Abstraction has 7199 states and 9092 transitions. [2022-07-12 17:07:36,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 11.25) internal successors, (135), 6 states have internal predecessors, (135), 3 states have call successors, (46), 7 states have call predecessors, (46), 3 states have return successors, (44), 4 states have call predecessors, (44), 3 states have call successors, (44) [2022-07-12 17:07:36,553 INFO L276 IsEmpty]: Start isEmpty. Operand 7199 states and 9092 transitions. [2022-07-12 17:07:36,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2022-07-12 17:07:36,556 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:07:36,557 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 6, 6, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:07:36,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-12 17:07:36,557 INFO L420 AbstractCegarLoop]: === Iteration 33 === 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 27 more)] === [2022-07-12 17:07:36,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:07:36,558 INFO L85 PathProgramCache]: Analyzing trace with hash -2041872285, now seen corresponding path program 1 times [2022-07-12 17:07:36,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:07:36,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332612529] [2022-07-12 17:07:36,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:07:36,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:07:37,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:37,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:07:37,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:37,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:07:37,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:37,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:07:37,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:37,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:07:37,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:37,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 17:07:37,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:37,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:37,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:37,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:37,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:37,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:37,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:37,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:07:37,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:37,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:37,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:37,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:37,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:37,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:37,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:37,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 17:07:37,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:37,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:37,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:37,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:37,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:37,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:37,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:37,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 17:07:37,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:37,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:37,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:37,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:37,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:37,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:37,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:37,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:07:37,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:37,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:37,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:37,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:37,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:37,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:37,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:37,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 17:07:37,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:37,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:07:37,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:37,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-12 17:07:37,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:37,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-12 17:07:37,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:37,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-12 17:07:37,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:37,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-12 17:07:37,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:37,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:37,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:37,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-12 17:07:37,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:37,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-12 17:07:37,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:37,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-12 17:07:37,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:37,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-07-12 17:07:37,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:37,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:37,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:37,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-07-12 17:07:37,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:37,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2022-07-12 17:07:37,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:37,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2022-07-12 17:07:37,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:37,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-07-12 17:07:37,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:37,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2022-07-12 17:07:37,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:37,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2022-07-12 17:07:37,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:37,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2022-07-12 17:07:37,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:37,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2022-07-12 17:07:37,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:37,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:37,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:37,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:37,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:37,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:37,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:37,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:37,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:37,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 17:07:37,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:37,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:07:37,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:37,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:37,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:37,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:37,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:37,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:37,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:37,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:07:37,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:37,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 17:07:37,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:38,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:07:38,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:38,004 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 6 proven. 61 refuted. 0 times theorem prover too weak. 533 trivial. 0 not checked. [2022-07-12 17:07:38,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:07:38,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332612529] [2022-07-12 17:07:38,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332612529] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 17:07:38,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318390479] [2022-07-12 17:07:38,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:07:38,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:07:38,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 17:07:38,006 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 17:07:38,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 17:07:40,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:40,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 6156 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-12 17:07:40,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:07:40,553 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2022-07-12 17:07:40,553 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:07:40,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318390479] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:07:40,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 17:07:40,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [14] total 24 [2022-07-12 17:07:40,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545729348] [2022-07-12 17:07:40,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:07:40,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 17:07:40,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:07:40,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 17:07:40,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=505, Unknown=0, NotChecked=0, Total=552 [2022-07-12 17:07:40,555 INFO L87 Difference]: Start difference. First operand 7199 states and 9092 transitions. Second operand has 14 states, 13 states have (on average 10.846153846153847) internal successors, (141), 13 states have internal predecessors, (141), 6 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (44), 6 states have call predecessors, (44), 6 states have call successors, (44) [2022-07-12 17:07:41,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:07:41,403 INFO L93 Difference]: Finished difference Result 8765 states and 10962 transitions. [2022-07-12 17:07:41,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 17:07:41,404 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 10.846153846153847) internal successors, (141), 13 states have internal predecessors, (141), 6 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (44), 6 states have call predecessors, (44), 6 states have call successors, (44) Word has length 343 [2022-07-12 17:07:41,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:07:41,429 INFO L225 Difference]: With dead ends: 8765 [2022-07-12 17:07:41,429 INFO L226 Difference]: Without dead ends: 7196 [2022-07-12 17:07:41,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 439 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=110, Invalid=882, Unknown=0, NotChecked=0, Total=992 [2022-07-12 17:07:41,439 INFO L413 NwaCegarLoop]: 1437 mSDtfsCounter, 38 mSDsluCounter, 17148 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 18585 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 17:07:41,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 18585 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 17:07:41,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7196 states. [2022-07-12 17:07:41,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7196 to 7196. [2022-07-12 17:07:42,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7196 states, 4887 states have (on average 1.1663597298956414) internal successors, (5700), 4942 states have internal predecessors, (5700), 1642 states have call successors, (1642), 662 states have call predecessors, (1642), 662 states have return successors, (1745), 1625 states have call predecessors, (1745), 1638 states have call successors, (1745) [2022-07-12 17:07:42,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7196 states to 7196 states and 9087 transitions. [2022-07-12 17:07:42,021 INFO L78 Accepts]: Start accepts. Automaton has 7196 states and 9087 transitions. Word has length 343 [2022-07-12 17:07:42,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:07:42,022 INFO L495 AbstractCegarLoop]: Abstraction has 7196 states and 9087 transitions. [2022-07-12 17:07:42,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 10.846153846153847) internal successors, (141), 13 states have internal predecessors, (141), 6 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (44), 6 states have call predecessors, (44), 6 states have call successors, (44) [2022-07-12 17:07:42,022 INFO L276 IsEmpty]: Start isEmpty. Operand 7196 states and 9087 transitions. [2022-07-12 17:07:42,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2022-07-12 17:07:42,027 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:07:42,027 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 10, 10, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:07:42,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 17:07:42,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:07:42,248 INFO L420 AbstractCegarLoop]: === Iteration 34 === 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 27 more)] === [2022-07-12 17:07:42,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:07:42,248 INFO L85 PathProgramCache]: Analyzing trace with hash -848962049, now seen corresponding path program 1 times [2022-07-12 17:07:42,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:07:42,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356850474] [2022-07-12 17:07:42,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:07:42,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:07:42,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:42,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:07:42,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:42,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:07:42,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:42,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:07:42,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:42,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:07:42,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:42,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 17:07:42,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:42,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:42,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:42,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:42,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:42,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:42,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:42,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:07:42,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:42,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:42,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:42,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:42,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:42,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:42,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:42,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 17:07:42,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:42,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:42,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:42,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:42,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:42,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:42,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:42,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 17:07:42,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:42,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:42,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:42,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:42,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:42,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:42,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:42,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:07:42,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:42,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:42,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:42,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:42,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:42,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:42,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:42,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 17:07:42,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:42,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:07:42,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:42,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-12 17:07:42,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:42,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-12 17:07:43,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:43,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-12 17:07:43,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:43,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-12 17:07:43,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:43,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:43,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:43,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-12 17:07:43,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:43,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-12 17:07:43,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:43,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:43,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:43,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:43,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:43,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:43,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:43,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-07-12 17:07:43,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:43,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-12 17:07:43,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:43,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-12 17:07:43,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:43,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-12 17:07:43,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:43,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-07-12 17:07:43,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:43,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2022-07-12 17:07:43,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:43,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:43,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:43,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:43,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:43,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 17:07:43,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:43,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2022-07-12 17:07:43,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:43,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:43,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:43,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 300 [2022-07-12 17:07:43,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:43,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 313 [2022-07-12 17:07:43,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:43,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 320 [2022-07-12 17:07:43,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:43,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 325 [2022-07-12 17:07:43,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:43,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 332 [2022-07-12 17:07:43,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:43,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 339 [2022-07-12 17:07:43,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:43,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 346 [2022-07-12 17:07:43,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:43,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 353 [2022-07-12 17:07:43,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:43,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 359 [2022-07-12 17:07:43,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:43,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 369 [2022-07-12 17:07:43,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:43,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:43,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:43,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:43,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:43,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 17:07:43,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:43,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 391 [2022-07-12 17:07:43,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:43,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:43,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:43,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 402 [2022-07-12 17:07:43,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:43,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 409 [2022-07-12 17:07:43,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:43,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:43,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:43,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:43,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:43,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 426 [2022-07-12 17:07:43,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:43,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 431 [2022-07-12 17:07:43,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:43,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 436 [2022-07-12 17:07:43,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:43,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:43,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:43,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 449 [2022-07-12 17:07:43,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:43,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 458 [2022-07-12 17:07:43,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:43,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 463 [2022-07-12 17:07:43,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:43,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:43,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:43,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:43,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:43,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 17:07:43,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:43,248 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 3 proven. 32 refuted. 0 times theorem prover too weak. 951 trivial. 0 not checked. [2022-07-12 17:07:43,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:07:43,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356850474] [2022-07-12 17:07:43,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356850474] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 17:07:43,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581412948] [2022-07-12 17:07:43,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:07:43,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:07:43,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 17:07:43,250 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 17:07:43,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 17:07:45,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:45,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 7605 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-12 17:07:45,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:07:45,621 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 271 proven. 0 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2022-07-12 17:07:45,621 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:07:45,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581412948] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:07:45,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 17:07:45,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 18 [2022-07-12 17:07:45,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584695273] [2022-07-12 17:07:45,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:07:45,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:07:45,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:07:45,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:07:45,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2022-07-12 17:07:45,623 INFO L87 Difference]: Start difference. First operand 7196 states and 9087 transitions. Second operand has 6 states, 5 states have (on average 35.6) internal successors, (178), 5 states have internal predecessors, (178), 3 states have call successors, (57), 2 states have call predecessors, (57), 3 states have return successors, (54), 3 states have call predecessors, (54), 3 states have call successors, (54) [2022-07-12 17:07:46,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:07:46,326 INFO L93 Difference]: Finished difference Result 14307 states and 18062 transitions. [2022-07-12 17:07:46,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 17:07:46,327 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 35.6) internal successors, (178), 5 states have internal predecessors, (178), 3 states have call successors, (57), 2 states have call predecessors, (57), 3 states have return successors, (54), 3 states have call predecessors, (54), 3 states have call successors, (54) Word has length 493 [2022-07-12 17:07:46,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:07:46,348 INFO L225 Difference]: With dead ends: 14307 [2022-07-12 17:07:46,348 INFO L226 Difference]: Without dead ends: 7196 [2022-07-12 17:07:46,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 653 GetRequests, 636 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2022-07-12 17:07:46,365 INFO L413 NwaCegarLoop]: 1434 mSDtfsCounter, 368 mSDsluCounter, 5172 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 6606 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 17:07:46,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 6606 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 17:07:46,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7196 states. [2022-07-12 17:07:46,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7196 to 7196. [2022-07-12 17:07:46,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7196 states, 4887 states have (on average 1.1661551053816248) internal successors, (5699), 4942 states have internal predecessors, (5699), 1642 states have call successors, (1642), 662 states have call predecessors, (1642), 662 states have return successors, (1745), 1625 states have call predecessors, (1745), 1638 states have call successors, (1745) [2022-07-12 17:07:46,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7196 states to 7196 states and 9086 transitions. [2022-07-12 17:07:46,845 INFO L78 Accepts]: Start accepts. Automaton has 7196 states and 9086 transitions. Word has length 493 [2022-07-12 17:07:46,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:07:46,845 INFO L495 AbstractCegarLoop]: Abstraction has 7196 states and 9086 transitions. [2022-07-12 17:07:46,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 35.6) internal successors, (178), 5 states have internal predecessors, (178), 3 states have call successors, (57), 2 states have call predecessors, (57), 3 states have return successors, (54), 3 states have call predecessors, (54), 3 states have call successors, (54) [2022-07-12 17:07:46,845 INFO L276 IsEmpty]: Start isEmpty. Operand 7196 states and 9086 transitions. [2022-07-12 17:07:46,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2022-07-12 17:07:46,849 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:07:46,849 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:07:46,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-12 17:07:47,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-07-12 17:07:47,063 INFO L420 AbstractCegarLoop]: === Iteration 35 === 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 27 more)] === [2022-07-12 17:07:47,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:07:47,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1321697722, now seen corresponding path program 1 times [2022-07-12 17:07:47,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:07:47,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253278015] [2022-07-12 17:07:47,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:07:47,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:07:47,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:07:47,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:07:47,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:07:47,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:07:47,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 17:07:47,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:47,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:47,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:47,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:07:47,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:47,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:47,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:47,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 17:07:47,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:47,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:47,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:47,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 17:07:47,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:47,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:47,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:47,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:07:47,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:47,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:47,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:47,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 17:07:47,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:07:47,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-12 17:07:47,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-12 17:07:47,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-12 17:07:47,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-12 17:07:47,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:47,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-12 17:07:47,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-12 17:07:47,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:47,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:47,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:47,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-07-12 17:07:47,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-12 17:07:47,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-12 17:07:47,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-12 17:07:47,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-07-12 17:07:47,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2022-07-12 17:07:47,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2022-07-12 17:07:47,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-07-12 17:07:47,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2022-07-12 17:07:47,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 297 [2022-07-12 17:07:47,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:47,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:47,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 17:07:47,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 319 [2022-07-12 17:07:47,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:47,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2022-07-12 17:07:47,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 337 [2022-07-12 17:07:47,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:47,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:47,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 354 [2022-07-12 17:07:47,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 359 [2022-07-12 17:07:47,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 364 [2022-07-12 17:07:47,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:47,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 377 [2022-07-12 17:07:47,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 386 [2022-07-12 17:07:47,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 391 [2022-07-12 17:07:47,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:47,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:47,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 17:07:47,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,936 INFO L134 CoverageAnalysis]: Checked inductivity of 838 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 806 trivial. 0 not checked. [2022-07-12 17:07:47,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:07:47,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253278015] [2022-07-12 17:07:47,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253278015] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 17:07:47,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1382826744] [2022-07-12 17:07:47,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:07:47,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:07:47,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 17:07:47,940 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 17:07:47,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-12 17:07:50,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:50,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 6891 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-12 17:07:50,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:07:50,875 INFO L134 CoverageAnalysis]: Checked inductivity of 838 backedges. 274 proven. 0 refuted. 0 times theorem prover too weak. 564 trivial. 0 not checked. [2022-07-12 17:07:50,876 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:07:50,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1382826744] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:07:50,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 17:07:50,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 19 [2022-07-12 17:07:50,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435119983] [2022-07-12 17:07:50,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:07:50,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 17:07:50,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:07:50,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 17:07:50,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2022-07-12 17:07:50,878 INFO L87 Difference]: Start difference. First operand 7196 states and 9086 transitions. Second operand has 9 states, 7 states have (on average 22.142857142857142) internal successors, (155), 7 states have internal predecessors, (155), 4 states have call successors, (49), 2 states have call predecessors, (49), 3 states have return successors, (47), 4 states have call predecessors, (47), 4 states have call successors, (47) [2022-07-12 17:07:51,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:07:51,817 INFO L93 Difference]: Finished difference Result 14303 states and 18055 transitions. [2022-07-12 17:07:51,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 17:07:51,817 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 22.142857142857142) internal successors, (155), 7 states have internal predecessors, (155), 4 states have call successors, (49), 2 states have call predecessors, (49), 3 states have return successors, (47), 4 states have call predecessors, (47), 4 states have call successors, (47) Word has length 421 [2022-07-12 17:07:51,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:07:51,843 INFO L225 Difference]: With dead ends: 14303 [2022-07-12 17:07:51,843 INFO L226 Difference]: Without dead ends: 7196 [2022-07-12 17:07:51,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 562 GetRequests, 541 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2022-07-12 17:07:51,861 INFO L413 NwaCegarLoop]: 1431 mSDtfsCounter, 730 mSDsluCounter, 8920 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 349 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 10351 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 349 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 17:07:51,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [731 Valid, 10351 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [349 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 17:07:51,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7196 states. [2022-07-12 17:07:52,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7196 to 7196. [2022-07-12 17:07:52,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7196 states, 4887 states have (on average 1.165950480867608) internal successors, (5698), 4942 states have internal predecessors, (5698), 1642 states have call successors, (1642), 662 states have call predecessors, (1642), 662 states have return successors, (1745), 1625 states have call predecessors, (1745), 1638 states have call successors, (1745) [2022-07-12 17:07:52,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7196 states to 7196 states and 9085 transitions. [2022-07-12 17:07:52,342 INFO L78 Accepts]: Start accepts. Automaton has 7196 states and 9085 transitions. Word has length 421 [2022-07-12 17:07:52,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:07:52,342 INFO L495 AbstractCegarLoop]: Abstraction has 7196 states and 9085 transitions. [2022-07-12 17:07:52,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 22.142857142857142) internal successors, (155), 7 states have internal predecessors, (155), 4 states have call successors, (49), 2 states have call predecessors, (49), 3 states have return successors, (47), 4 states have call predecessors, (47), 4 states have call successors, (47) [2022-07-12 17:07:52,342 INFO L276 IsEmpty]: Start isEmpty. Operand 7196 states and 9085 transitions. [2022-07-12 17:07:52,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2022-07-12 17:07:52,346 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:07:52,346 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 10, 10, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:07:52,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-12 17:07:52,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:07:52,556 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ldv_linux_usb_urb_usb_free_urbErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:07:52,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:07:52,556 INFO L85 PathProgramCache]: Analyzing trace with hash 624684712, now seen corresponding path program 1 times [2022-07-12 17:07:52,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:07:52,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339475368] [2022-07-12 17:07:52,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:07:52,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:07:52,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:07:53,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:07:53,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:07:53,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:07:53,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 17:07:53,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:53,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:53,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:53,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:07:53,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:53,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:53,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:53,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 17:07:53,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:53,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:53,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:53,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 17:07:53,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:53,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:53,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:53,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:07:53,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:53,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:53,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:53,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 17:07:53,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:07:53,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-12 17:07:53,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-12 17:07:53,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-12 17:07:53,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-12 17:07:53,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:53,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-12 17:07:53,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-12 17:07:53,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:53,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:53,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:53,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-07-12 17:07:53,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-12 17:07:53,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-12 17:07:53,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-12 17:07:53,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-07-12 17:07:53,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2022-07-12 17:07:53,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:53,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:53,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 17:07:53,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2022-07-12 17:07:53,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:53,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 300 [2022-07-12 17:07:53,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 308 [2022-07-12 17:07:53,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 321 [2022-07-12 17:07:53,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2022-07-12 17:07:53,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 333 [2022-07-12 17:07:53,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 340 [2022-07-12 17:07:53,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 347 [2022-07-12 17:07:53,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 354 [2022-07-12 17:07:53,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 361 [2022-07-12 17:07:53,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 367 [2022-07-12 17:07:53,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 377 [2022-07-12 17:07:53,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:53,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:53,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 17:07:53,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 399 [2022-07-12 17:07:53,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:53,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 410 [2022-07-12 17:07:53,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 417 [2022-07-12 17:07:53,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:53,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:53,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 434 [2022-07-12 17:07:53,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 439 [2022-07-12 17:07:53,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 444 [2022-07-12 17:07:53,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:53,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 457 [2022-07-12 17:07:53,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 466 [2022-07-12 17:07:53,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 471 [2022-07-12 17:07:53,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:53,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:53,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 17:07:53,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,442 INFO L134 CoverageAnalysis]: Checked inductivity of 994 backedges. 6 proven. 32 refuted. 0 times theorem prover too weak. 956 trivial. 0 not checked. [2022-07-12 17:07:53,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:07:53,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339475368] [2022-07-12 17:07:53,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339475368] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 17:07:53,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741884412] [2022-07-12 17:07:53,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:07:53,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:07:53,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 17:07:53,444 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 17:07:53,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-12 17:07:55,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:55,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 7753 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-12 17:07:55,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:07:56,059 INFO L134 CoverageAnalysis]: Checked inductivity of 994 backedges. 309 proven. 2 refuted. 0 times theorem prover too weak. 683 trivial. 0 not checked. [2022-07-12 17:07:56,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 17:07:56,445 INFO L134 CoverageAnalysis]: Checked inductivity of 994 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 970 trivial. 0 not checked. [2022-07-12 17:07:56,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741884412] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 17:07:56,446 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 17:07:56,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 6] total 23 [2022-07-12 17:07:56,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042141783] [2022-07-12 17:07:56,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 17:07:56,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-12 17:07:56,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:07:56,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-12 17:07:56,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=457, Unknown=0, NotChecked=0, Total=506 [2022-07-12 17:07:56,448 INFO L87 Difference]: Start difference. First operand 7196 states and 9085 transitions. Second operand has 23 states, 20 states have (on average 14.1) internal successors, (282), 15 states have internal predecessors, (282), 5 states have call successors, (117), 8 states have call predecessors, (117), 4 states have return successors, (100), 4 states have call predecessors, (100), 5 states have call successors, (100) [2022-07-12 17:07:58,431 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:08:05,642 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:08:08,695 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:08:12,164 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []