./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--ethernet--amd--amd8111e.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 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--ethernet--amd--amd8111e.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 a88d6e7bf2b158373436b40548cbe71d2b3a1f454b281f07c3b1b175d00e8682 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 04:18:26,237 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 04:18:26,241 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 04:18:26,270 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 04:18:26,270 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 04:18:26,272 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 04:18:26,274 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 04:18:26,278 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 04:18:26,280 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 04:18:26,283 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 04:18:26,284 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 04:18:26,286 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 04:18:26,286 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 04:18:26,288 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 04:18:26,289 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 04:18:26,292 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 04:18:26,293 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 04:18:26,295 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 04:18:26,296 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 04:18:26,301 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 04:18:26,303 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 04:18:26,304 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 04:18:26,305 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 04:18:26,305 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 04:18:26,307 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 04:18:26,312 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 04:18:26,313 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 04:18:26,313 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 04:18:26,314 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 04:18:26,315 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 04:18:26,316 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 04:18:26,316 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 04:18:26,318 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 04:18:26,319 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 04:18:26,319 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 04:18:26,320 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 04:18:26,320 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 04:18:26,320 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 04:18:26,320 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 04:18:26,321 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 04:18:26,321 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 04:18:26,323 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 04:18:26,324 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-23 04:18:26,354 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 04:18:26,355 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 04:18:26,355 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 04:18:26,355 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 04:18:26,356 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 04:18:26,356 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 04:18:26,357 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 04:18:26,357 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 04:18:26,357 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 04:18:26,358 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 04:18:26,358 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 04:18:26,358 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 04:18:26,358 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-23 04:18:26,358 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 04:18:26,358 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-23 04:18:26,359 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-23 04:18:26,359 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 04:18:26,359 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-23 04:18:26,359 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 04:18:26,359 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 04:18:26,360 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 04:18:26,361 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 04:18:26,361 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 04:18:26,361 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 04:18:26,361 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-23 04:18:26,361 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 04:18:26,361 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-23 04:18:26,362 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-23 04:18:26,362 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-23 04:18:26,362 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-23 04:18:26,362 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 -> a88d6e7bf2b158373436b40548cbe71d2b3a1f454b281f07c3b1b175d00e8682 [2022-07-23 04:18:26,600 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 04:18:26,624 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 04:18:26,626 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 04:18:26,627 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 04:18:26,628 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 04:18:26,629 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--ethernet--amd--amd8111e.ko.cil.i [2022-07-23 04:18:26,696 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f4c54c84/4c6755a651a048799537e5b67e0e8767/FLAGdef0124fb [2022-07-23 04:18:27,430 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 04:18:27,431 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i [2022-07-23 04:18:27,477 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f4c54c84/4c6755a651a048799537e5b67e0e8767/FLAGdef0124fb [2022-07-23 04:18:27,985 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f4c54c84/4c6755a651a048799537e5b67e0e8767 [2022-07-23 04:18:27,987 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 04:18:27,988 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 04:18:27,990 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 04:18:27,990 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 04:18:27,992 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 04:18:27,993 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 04:18:27" (1/1) ... [2022-07-23 04:18:27,993 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@349042c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:18:27, skipping insertion in model container [2022-07-23 04:18:27,993 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 04:18:27" (1/1) ... [2022-07-23 04:18:27,998 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 04:18:28,091 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 04:18:30,728 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[410486,410499] [2022-07-23 04:18:30,730 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[410631,410644] [2022-07-23 04:18:30,730 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[410777,410790] [2022-07-23 04:18:30,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--ethernet--amd--amd8111e.ko.cil.i[410942,410955] [2022-07-23 04:18:30,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--ethernet--amd--amd8111e.ko.cil.i[411100,411113] [2022-07-23 04:18:30,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--ethernet--amd--amd8111e.ko.cil.i[411258,411271] [2022-07-23 04:18:30,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--ethernet--amd--amd8111e.ko.cil.i[411416,411429] [2022-07-23 04:18:30,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--ethernet--amd--amd8111e.ko.cil.i[411576,411589] [2022-07-23 04:18:30,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--ethernet--amd--amd8111e.ko.cil.i[411735,411748] [2022-07-23 04:18:30,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--ethernet--amd--amd8111e.ko.cil.i[411874,411887] [2022-07-23 04:18:30,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--ethernet--amd--amd8111e.ko.cil.i[412016,412029] [2022-07-23 04:18:30,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--ethernet--amd--amd8111e.ko.cil.i[412165,412178] [2022-07-23 04:18:30,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--ethernet--amd--amd8111e.ko.cil.i[412304,412317] [2022-07-23 04:18:30,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--ethernet--amd--amd8111e.ko.cil.i[412459,412472] [2022-07-23 04:18:30,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--ethernet--amd--amd8111e.ko.cil.i[412619,412632] [2022-07-23 04:18:30,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--ethernet--amd--amd8111e.ko.cil.i[412770,412783] [2022-07-23 04:18:30,735 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[412921,412934] [2022-07-23 04:18:30,735 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[413073,413086] [2022-07-23 04:18:30,735 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[413222,413235] [2022-07-23 04:18:30,736 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[413370,413383] [2022-07-23 04:18:30,736 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[413527,413540] [2022-07-23 04:18:30,736 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[413676,413689] [2022-07-23 04:18:30,736 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[413832,413845] [2022-07-23 04:18:30,737 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[413985,413998] [2022-07-23 04:18:30,737 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[414131,414144] [2022-07-23 04:18:30,737 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[414274,414287] [2022-07-23 04:18:30,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--ethernet--amd--amd8111e.ko.cil.i[414426,414439] [2022-07-23 04:18:30,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--ethernet--amd--amd8111e.ko.cil.i[414572,414585] [2022-07-23 04:18:30,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--ethernet--amd--amd8111e.ko.cil.i[414717,414730] [2022-07-23 04:18:30,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--ethernet--amd--amd8111e.ko.cil.i[414871,414884] [2022-07-23 04:18:30,739 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[415022,415035] [2022-07-23 04:18:30,739 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[415177,415190] [2022-07-23 04:18:30,739 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[415329,415342] [2022-07-23 04:18:30,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--ethernet--amd--amd8111e.ko.cil.i[415484,415497] [2022-07-23 04:18:30,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--ethernet--amd--amd8111e.ko.cil.i[415648,415661] [2022-07-23 04:18:30,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--ethernet--amd--amd8111e.ko.cil.i[415804,415817] [2022-07-23 04:18:30,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--ethernet--amd--amd8111e.ko.cil.i[415968,415981] [2022-07-23 04:18:30,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--ethernet--amd--amd8111e.ko.cil.i[416110,416123] [2022-07-23 04:18:30,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--ethernet--amd--amd8111e.ko.cil.i[416268,416281] [2022-07-23 04:18:30,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--ethernet--amd--amd8111e.ko.cil.i[416435,416448] [2022-07-23 04:18:30,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--ethernet--amd--amd8111e.ko.cil.i[416594,416607] [2022-07-23 04:18:30,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--ethernet--amd--amd8111e.ko.cil.i[416753,416766] [2022-07-23 04:18:30,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--ethernet--amd--amd8111e.ko.cil.i[416902,416915] [2022-07-23 04:18:30,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--ethernet--amd--amd8111e.ko.cil.i[417049,417062] [2022-07-23 04:18:30,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--ethernet--amd--amd8111e.ko.cil.i[417188,417201] [2022-07-23 04:18:30,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--ethernet--amd--amd8111e.ko.cil.i[417351,417364] [2022-07-23 04:18:30,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--ethernet--amd--amd8111e.ko.cil.i[417517,417530] [2022-07-23 04:18:30,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--ethernet--amd--amd8111e.ko.cil.i[417681,417694] [2022-07-23 04:18:30,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--ethernet--amd--amd8111e.ko.cil.i[417846,417859] [2022-07-23 04:18:30,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--ethernet--amd--amd8111e.ko.cil.i[418011,418024] [2022-07-23 04:18:30,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--ethernet--amd--amd8111e.ko.cil.i[418177,418190] [2022-07-23 04:18:30,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--ethernet--amd--amd8111e.ko.cil.i[418342,418355] [2022-07-23 04:18:30,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--ethernet--amd--amd8111e.ko.cil.i[418509,418522] [2022-07-23 04:18:30,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--ethernet--amd--amd8111e.ko.cil.i[418669,418682] [2022-07-23 04:18:30,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--ethernet--amd--amd8111e.ko.cil.i[418831,418844] [2022-07-23 04:18:30,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--ethernet--amd--amd8111e.ko.cil.i[418990,419003] [2022-07-23 04:18:30,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--ethernet--amd--amd8111e.ko.cil.i[419136,419149] [2022-07-23 04:18:30,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--ethernet--amd--amd8111e.ko.cil.i[419279,419292] [2022-07-23 04:18:30,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--ethernet--amd--amd8111e.ko.cil.i[419423,419436] [2022-07-23 04:18:30,747 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[419566,419579] [2022-07-23 04:18:30,747 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[419710,419723] [2022-07-23 04:18:30,747 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[419851,419864] [2022-07-23 04:18:30,747 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[419989,420002] [2022-07-23 04:18:30,748 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[420147,420160] [2022-07-23 04:18:30,748 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[420306,420319] [2022-07-23 04:18:30,748 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[420462,420475] [2022-07-23 04:18:30,749 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[420611,420624] [2022-07-23 04:18:30,749 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[420763,420776] [2022-07-23 04:18:30,749 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[420914,420927] [2022-07-23 04:18:30,749 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[421063,421076] [2022-07-23 04:18:30,750 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[421215,421228] [2022-07-23 04:18:30,750 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[421363,421376] [2022-07-23 04:18:30,750 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[421516,421529] [2022-07-23 04:18:30,750 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[421667,421680] [2022-07-23 04:18:30,751 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[421817,421830] [2022-07-23 04:18:30,751 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[421964,421977] [2022-07-23 04:18:30,751 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[422115,422128] [2022-07-23 04:18:30,751 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[422266,422279] [2022-07-23 04:18:30,752 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[422414,422427] [2022-07-23 04:18:30,752 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[422580,422593] [2022-07-23 04:18:30,752 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[422749,422762] [2022-07-23 04:18:30,753 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[422916,422929] [2022-07-23 04:18:30,753 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[423084,423097] [2022-07-23 04:18:30,753 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[423234,423247] [2022-07-23 04:18:30,753 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[423381,423394] [2022-07-23 04:18:30,754 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[423542,423555] [2022-07-23 04:18:30,754 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[423712,423725] [2022-07-23 04:18:30,754 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[423874,423887] [2022-07-23 04:18:30,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 04:18:30,784 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 04:18:30,989 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[410486,410499] [2022-07-23 04:18:30,991 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[410631,410644] [2022-07-23 04:18:30,991 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[410777,410790] [2022-07-23 04:18:30,991 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[410942,410955] [2022-07-23 04:18:30,992 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[411100,411113] [2022-07-23 04:18:30,995 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[411258,411271] [2022-07-23 04:18:30,996 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[411416,411429] [2022-07-23 04:18:30,997 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[411576,411589] [2022-07-23 04:18:30,997 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[411735,411748] [2022-07-23 04:18:30,998 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[411874,411887] [2022-07-23 04:18:30,998 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[412016,412029] [2022-07-23 04:18:30,998 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[412165,412178] [2022-07-23 04:18:30,999 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[412304,412317] [2022-07-23 04:18:30,999 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[412459,412472] [2022-07-23 04:18:30,999 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[412619,412632] [2022-07-23 04:18:30,999 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[412770,412783] [2022-07-23 04:18:31,000 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[412921,412934] [2022-07-23 04:18:31,000 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[413073,413086] [2022-07-23 04:18:31,000 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[413222,413235] [2022-07-23 04:18:31,000 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[413370,413383] [2022-07-23 04:18:31,001 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[413527,413540] [2022-07-23 04:18:31,001 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[413676,413689] [2022-07-23 04:18:31,001 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[413832,413845] [2022-07-23 04:18:31,001 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[413985,413998] [2022-07-23 04:18:31,002 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[414131,414144] [2022-07-23 04:18:31,002 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[414274,414287] [2022-07-23 04:18:31,003 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[414426,414439] [2022-07-23 04:18:31,003 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[414572,414585] [2022-07-23 04:18:31,004 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[414717,414730] [2022-07-23 04:18:31,004 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[414871,414884] [2022-07-23 04:18:31,004 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[415022,415035] [2022-07-23 04:18:31,004 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[415177,415190] [2022-07-23 04:18:31,005 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[415329,415342] [2022-07-23 04:18:31,005 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[415484,415497] [2022-07-23 04:18:31,005 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[415648,415661] [2022-07-23 04:18:31,006 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[415804,415817] [2022-07-23 04:18:31,006 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[415968,415981] [2022-07-23 04:18:31,006 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[416110,416123] [2022-07-23 04:18:31,006 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[416268,416281] [2022-07-23 04:18:31,007 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[416435,416448] [2022-07-23 04:18:31,008 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[416594,416607] [2022-07-23 04:18:31,008 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[416753,416766] [2022-07-23 04:18:31,008 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[416902,416915] [2022-07-23 04:18:31,008 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[417049,417062] [2022-07-23 04:18:31,009 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[417188,417201] [2022-07-23 04:18:31,009 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[417351,417364] [2022-07-23 04:18:31,009 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[417517,417530] [2022-07-23 04:18:31,010 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[417681,417694] [2022-07-23 04:18:31,010 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[417846,417859] [2022-07-23 04:18:31,010 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[418011,418024] [2022-07-23 04:18:31,010 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[418177,418190] [2022-07-23 04:18:31,010 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[418342,418355] [2022-07-23 04:18:31,011 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[418509,418522] [2022-07-23 04:18:31,012 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[418669,418682] [2022-07-23 04:18:31,012 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[418831,418844] [2022-07-23 04:18:31,012 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[418990,419003] [2022-07-23 04:18:31,012 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[419136,419149] [2022-07-23 04:18:31,013 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[419279,419292] [2022-07-23 04:18:31,013 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[419423,419436] [2022-07-23 04:18:31,013 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[419566,419579] [2022-07-23 04:18:31,013 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[419710,419723] [2022-07-23 04:18:31,014 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[419851,419864] [2022-07-23 04:18:31,015 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[419989,420002] [2022-07-23 04:18:31,017 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[420147,420160] [2022-07-23 04:18:31,017 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[420306,420319] [2022-07-23 04:18:31,018 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[420462,420475] [2022-07-23 04:18:31,018 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[420611,420624] [2022-07-23 04:18:31,019 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[420763,420776] [2022-07-23 04:18:31,022 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[420914,420927] [2022-07-23 04:18:31,023 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[421063,421076] [2022-07-23 04:18:31,023 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[421215,421228] [2022-07-23 04:18:31,023 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[421363,421376] [2022-07-23 04:18:31,027 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[421516,421529] [2022-07-23 04:18:31,027 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[421667,421680] [2022-07-23 04:18:31,027 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[421817,421830] [2022-07-23 04:18:31,028 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[421964,421977] [2022-07-23 04:18:31,028 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[422115,422128] [2022-07-23 04:18:31,028 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[422266,422279] [2022-07-23 04:18:31,029 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[422414,422427] [2022-07-23 04:18:31,029 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[422580,422593] [2022-07-23 04:18:31,030 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[422749,422762] [2022-07-23 04:18:31,033 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[422916,422929] [2022-07-23 04:18:31,033 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[423084,423097] [2022-07-23 04:18:31,033 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[423234,423247] [2022-07-23 04:18:31,034 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[423381,423394] [2022-07-23 04:18:31,034 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[423542,423555] [2022-07-23 04:18:31,034 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[423712,423725] [2022-07-23 04:18:31,034 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i[423874,423887] [2022-07-23 04:18:31,038 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 04:18:31,228 INFO L208 MainTranslator]: Completed translation [2022-07-23 04:18:31,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:18:31 WrapperNode [2022-07-23 04:18:31,229 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 04:18:31,230 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 04:18:31,230 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 04:18:31,230 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 04:18:31,234 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:18:31" (1/1) ... [2022-07-23 04:18:31,301 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:18:31" (1/1) ... [2022-07-23 04:18:31,476 INFO L137 Inliner]: procedures = 672, calls = 2071, calls flagged for inlining = 313, calls inlined = 225, statements flattened = 4926 [2022-07-23 04:18:31,476 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 04:18:31,477 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 04:18:31,477 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 04:18:31,477 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 04:18:31,483 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:18:31" (1/1) ... [2022-07-23 04:18:31,483 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:18:31" (1/1) ... [2022-07-23 04:18:31,497 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:18:31" (1/1) ... [2022-07-23 04:18:31,498 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:18:31" (1/1) ... [2022-07-23 04:18:31,551 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:18:31" (1/1) ... [2022-07-23 04:18:31,563 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:18:31" (1/1) ... [2022-07-23 04:18:31,600 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:18:31" (1/1) ... [2022-07-23 04:18:31,624 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 04:18:31,625 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 04:18:31,626 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 04:18:31,626 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 04:18:31,626 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:18:31" (1/1) ... [2022-07-23 04:18:31,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 04:18:31,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 04:18:31,648 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-23 04:18:31,674 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-23 04:18:31,686 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-07-23 04:18:31,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-07-23 04:18:31,686 INFO L130 BoogieDeclarations]: Found specification of procedure pci_release_regions [2022-07-23 04:18:31,686 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_release_regions [2022-07-23 04:18:31,687 INFO L130 BoogieDeclarations]: Found specification of procedure amd8111e_get_stats [2022-07-23 04:18:31,687 INFO L138 BoogieDeclarations]: Found implementation of procedure amd8111e_get_stats [2022-07-23 04:18:31,687 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_alloc_skb [2022-07-23 04:18:31,687 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_alloc_skb [2022-07-23 04:18:31,687 INFO L130 BoogieDeclarations]: Found specification of procedure netif_wake_queue [2022-07-23 04:18:31,687 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_wake_queue [2022-07-23 04:18:31,687 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-23 04:18:31,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-23 04:18:31,687 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-23 04:18:31,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-23 04:18:31,688 INFO L130 BoogieDeclarations]: Found specification of procedure free_irq [2022-07-23 04:18:31,688 INFO L138 BoogieDeclarations]: Found implementation of procedure free_irq [2022-07-23 04:18:31,688 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-23 04:18:31,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-23 04:18:31,688 INFO L130 BoogieDeclarations]: Found specification of procedure arch_local_irq_restore [2022-07-23 04:18:31,688 INFO L138 BoogieDeclarations]: Found implementation of procedure arch_local_irq_restore [2022-07-23 04:18:31,688 INFO L130 BoogieDeclarations]: Found specification of procedure valid_dma_direction [2022-07-23 04:18:31,688 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_dma_direction [2022-07-23 04:18:31,688 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-07-23 04:18:31,689 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-07-23 04:18:31,689 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-07-23 04:18:31,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-07-23 04:18:31,689 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_amd8111e_priv [2022-07-23 04:18:31,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_amd8111e_priv [2022-07-23 04:18:31,689 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-07-23 04:18:31,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-07-23 04:18:31,689 INFO L130 BoogieDeclarations]: Found specification of procedure pci_get_drvdata [2022-07-23 04:18:31,689 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_get_drvdata [2022-07-23 04:18:31,690 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-23 04:18:31,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-23 04:18:31,690 INFO L130 BoogieDeclarations]: Found specification of procedure strlcpy [2022-07-23 04:18:31,690 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcpy [2022-07-23 04:18:31,690 INFO L130 BoogieDeclarations]: Found specification of procedure eth_validate_addr [2022-07-23 04:18:31,690 INFO L138 BoogieDeclarations]: Found implementation of procedure eth_validate_addr [2022-07-23 04:18:31,690 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-23 04:18:31,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-23 04:18:31,690 INFO L130 BoogieDeclarations]: Found specification of procedure arch_irqs_disabled_flags [2022-07-23 04:18:31,690 INFO L138 BoogieDeclarations]: Found implementation of procedure arch_irqs_disabled_flags [2022-07-23 04:18:31,691 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-07-23 04:18:31,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-07-23 04:18:31,691 INFO L130 BoogieDeclarations]: Found specification of procedure pci_unmap_single [2022-07-23 04:18:31,691 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_unmap_single [2022-07-23 04:18:31,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 04:18:31,691 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_del_timer_sync [2022-07-23 04:18:31,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_del_timer_sync [2022-07-23 04:18:31,691 INFO L130 BoogieDeclarations]: Found specification of procedure amd8111e_tx_timeout [2022-07-23 04:18:31,691 INFO L138 BoogieDeclarations]: Found implementation of procedure amd8111e_tx_timeout [2022-07-23 04:18:31,691 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-07-23 04:18:31,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-07-23 04:18:31,692 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-07-23 04:18:31,692 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-07-23 04:18:31,692 INFO L130 BoogieDeclarations]: Found specification of procedure amd8111e_mdio_read [2022-07-23 04:18:31,692 INFO L138 BoogieDeclarations]: Found implementation of procedure amd8111e_mdio_read [2022-07-23 04:18:31,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-23 04:18:31,692 INFO L130 BoogieDeclarations]: Found specification of procedure amd8111e_nway_reset [2022-07-23 04:18:31,692 INFO L138 BoogieDeclarations]: Found implementation of procedure amd8111e_nway_reset [2022-07-23 04:18:31,692 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_ops [2022-07-23 04:18:31,692 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_ops [2022-07-23 04:18:31,693 INFO L130 BoogieDeclarations]: Found specification of procedure amd8111e_set_rx_buff_len [2022-07-23 04:18:31,693 INFO L138 BoogieDeclarations]: Found implementation of procedure amd8111e_set_rx_buff_len [2022-07-23 04:18:31,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-23 04:18:31,693 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2022-07-23 04:18:31,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2022-07-23 04:18:31,693 INFO L130 BoogieDeclarations]: Found specification of procedure amd8111e_open [2022-07-23 04:18:31,693 INFO L138 BoogieDeclarations]: Found implementation of procedure amd8111e_open [2022-07-23 04:18:31,693 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-23 04:18:31,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-23 04:18:31,694 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-23 04:18:31,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-23 04:18:31,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-23 04:18:31,694 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-07-23 04:18:31,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-07-23 04:18:31,694 INFO L130 BoogieDeclarations]: Found specification of procedure __phys_addr [2022-07-23 04:18:31,694 INFO L138 BoogieDeclarations]: Found implementation of procedure __phys_addr [2022-07-23 04:18:31,694 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-07-23 04:18:31,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-07-23 04:18:31,694 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_to_interrupt_context [2022-07-23 04:18:31,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_to_interrupt_context [2022-07-23 04:18:31,695 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2022-07-23 04:18:31,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2022-07-23 04:18:31,695 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-07-23 04:18:31,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-07-23 04:18:31,695 INFO L130 BoogieDeclarations]: Found specification of procedure pci_free_consistent [2022-07-23 04:18:31,695 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_free_consistent [2022-07-23 04:18:31,695 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-07-23 04:18:31,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-07-23 04:18:31,695 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irq_129 [2022-07-23 04:18:31,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irq_129 [2022-07-23 04:18:31,696 INFO L130 BoogieDeclarations]: Found specification of procedure pci_disable_device [2022-07-23 04:18:31,696 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_disable_device [2022-07-23 04:18:31,696 INFO L130 BoogieDeclarations]: Found specification of procedure amd8111e_write_phy [2022-07-23 04:18:31,696 INFO L138 BoogieDeclarations]: Found implementation of procedure amd8111e_write_phy [2022-07-23 04:18:31,696 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-23 04:18:31,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-23 04:18:31,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-23 04:18:31,696 INFO L130 BoogieDeclarations]: Found specification of procedure amd8111e_read_phy [2022-07-23 04:18:31,697 INFO L138 BoogieDeclarations]: Found implementation of procedure amd8111e_read_phy [2022-07-23 04:18:31,697 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mod_timer [2022-07-23 04:18:31,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mod_timer [2022-07-23 04:18:31,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 04:18:31,697 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-23 04:18:31,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-23 04:18:31,697 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2022-07-23 04:18:31,697 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2022-07-23 04:18:31,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-23 04:18:31,697 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-23 04:18:31,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-23 04:18:31,698 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2022-07-23 04:18:31,698 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2022-07-23 04:18:31,698 INFO L130 BoogieDeclarations]: Found specification of procedure amd8111e_remove_one [2022-07-23 04:18:31,698 INFO L138 BoogieDeclarations]: Found implementation of procedure amd8111e_remove_one [2022-07-23 04:18:31,698 INFO L130 BoogieDeclarations]: Found specification of procedure napi_disable [2022-07-23 04:18:31,698 INFO L138 BoogieDeclarations]: Found implementation of procedure napi_disable [2022-07-23 04:18:31,698 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-07-23 04:18:31,698 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-07-23 04:18:31,698 INFO L130 BoogieDeclarations]: Found specification of procedure amd8111e_free_skbs [2022-07-23 04:18:31,699 INFO L138 BoogieDeclarations]: Found implementation of procedure amd8111e_free_skbs [2022-07-23 04:18:31,699 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-07-23 04:18:31,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-07-23 04:18:31,699 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_netdev [2022-07-23 04:18:31,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_netdev [2022-07-23 04:18:31,699 INFO L130 BoogieDeclarations]: Found specification of procedure writel [2022-07-23 04:18:31,699 INFO L138 BoogieDeclarations]: Found implementation of procedure writel [2022-07-23 04:18:31,699 INFO L130 BoogieDeclarations]: Found specification of procedure writeb [2022-07-23 04:18:31,699 INFO L138 BoogieDeclarations]: Found implementation of procedure writeb [2022-07-23 04:18:31,699 INFO L130 BoogieDeclarations]: Found specification of procedure writew [2022-07-23 04:18:31,700 INFO L138 BoogieDeclarations]: Found implementation of procedure writew [2022-07-23 04:18:31,700 INFO L130 BoogieDeclarations]: Found specification of procedure arch_local_save_flags [2022-07-23 04:18:31,700 INFO L138 BoogieDeclarations]: Found implementation of procedure arch_local_save_flags [2022-07-23 04:18:31,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 04:18:31,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 04:18:31,700 INFO L130 BoogieDeclarations]: Found specification of procedure amd8111e_close [2022-07-23 04:18:31,700 INFO L138 BoogieDeclarations]: Found implementation of procedure amd8111e_close [2022-07-23 04:18:31,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-23 04:18:31,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-23 04:18:31,700 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-23 04:18:31,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-23 04:18:31,701 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-23 04:18:31,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-23 04:18:31,701 INFO L130 BoogieDeclarations]: Found specification of procedure netif_carrier_off [2022-07-23 04:18:31,701 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_carrier_off [2022-07-23 04:18:31,701 INFO L130 BoogieDeclarations]: Found specification of procedure amd8111e_mdio_write [2022-07-23 04:18:31,701 INFO L138 BoogieDeclarations]: Found implementation of procedure amd8111e_mdio_write [2022-07-23 04:18:31,701 INFO L130 BoogieDeclarations]: Found specification of procedure amd8111e_read_mib [2022-07-23 04:18:31,701 INFO L138 BoogieDeclarations]: Found implementation of procedure amd8111e_read_mib [2022-07-23 04:18:31,701 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_to_process_context [2022-07-23 04:18:31,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_to_process_context [2022-07-23 04:18:31,702 INFO L130 BoogieDeclarations]: Found specification of procedure amd8111e_interrupt [2022-07-23 04:18:31,702 INFO L138 BoogieDeclarations]: Found implementation of procedure amd8111e_interrupt [2022-07-23 04:18:31,702 INFO L130 BoogieDeclarations]: Found specification of procedure pci_map_single [2022-07-23 04:18:31,702 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_map_single [2022-07-23 04:18:31,702 INFO L130 BoogieDeclarations]: Found specification of procedure amd8111e_set_coalesce [2022-07-23 04:18:31,702 INFO L138 BoogieDeclarations]: Found implementation of procedure amd8111e_set_coalesce [2022-07-23 04:18:31,702 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-07-23 04:18:31,702 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-07-23 04:18:31,702 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_122 [2022-07-23 04:18:31,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_122 [2022-07-23 04:18:31,703 INFO L130 BoogieDeclarations]: Found specification of procedure pci_alloc_consistent [2022-07-23 04:18:31,703 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_alloc_consistent [2022-07-23 04:18:31,703 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-07-23 04:18:31,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-07-23 04:18:31,703 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-07-23 04:18:31,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-07-23 04:18:31,703 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2022-07-23 04:18:31,703 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2022-07-23 04:18:31,703 INFO L130 BoogieDeclarations]: Found specification of procedure netif_start_queue [2022-07-23 04:18:31,703 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_start_queue [2022-07-23 04:18:31,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-23 04:18:31,704 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-23 04:18:31,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-23 04:18:31,704 INFO L130 BoogieDeclarations]: Found specification of procedure trace_hardirqs_off [2022-07-23 04:18:31,704 INFO L138 BoogieDeclarations]: Found implementation of procedure trace_hardirqs_off [2022-07-23 04:18:31,704 INFO L130 BoogieDeclarations]: Found specification of procedure netif_running [2022-07-23 04:18:31,704 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_running [2022-07-23 04:18:31,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-23 04:18:31,704 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_lock_of_amd8111e_priv [2022-07-23 04:18:31,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_lock_of_amd8111e_priv [2022-07-23 04:18:31,704 INFO L130 BoogieDeclarations]: Found specification of procedure amd8111e_disable_interrupt [2022-07-23 04:18:31,705 INFO L138 BoogieDeclarations]: Found implementation of procedure amd8111e_disable_interrupt [2022-07-23 04:18:31,705 INFO L130 BoogieDeclarations]: Found specification of procedure pci_enable_wake [2022-07-23 04:18:31,705 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_enable_wake [2022-07-23 04:18:31,705 INFO L130 BoogieDeclarations]: Found specification of procedure amd8111e_set_multicast_list [2022-07-23 04:18:31,705 INFO L138 BoogieDeclarations]: Found implementation of procedure amd8111e_set_multicast_list [2022-07-23 04:18:31,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-23 04:18:31,705 INFO L130 BoogieDeclarations]: Found specification of procedure amd8111e_resume [2022-07-23 04:18:31,705 INFO L138 BoogieDeclarations]: Found implementation of procedure amd8111e_resume [2022-07-23 04:18:31,705 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-23 04:18:31,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-23 04:18:31,706 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-07-23 04:18:31,706 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-07-23 04:18:31,706 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-23 04:18:31,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-23 04:18:31,706 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_irq [2022-07-23 04:18:31,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_irq [2022-07-23 04:18:31,706 INFO L130 BoogieDeclarations]: Found specification of procedure amd8111e_restart [2022-07-23 04:18:31,706 INFO L138 BoogieDeclarations]: Found implementation of procedure amd8111e_restart [2022-07-23 04:18:31,706 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reserve [2022-07-23 04:18:31,706 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reserve [2022-07-23 04:18:31,707 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-23 04:18:31,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-23 04:18:31,707 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-07-23 04:18:31,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-07-23 04:18:31,707 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2022-07-23 04:18:31,707 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2022-07-23 04:18:31,707 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer_sync [2022-07-23 04:18:31,707 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer_sync [2022-07-23 04:18:31,707 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2022-07-23 04:18:31,707 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2022-07-23 04:18:31,708 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-07-23 04:18:31,708 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-07-23 04:18:31,708 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-23 04:18:31,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-23 04:18:31,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-23 04:18:31,708 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-23 04:18:31,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-23 04:18:31,708 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-23 04:18:31,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-23 04:18:31,708 INFO L130 BoogieDeclarations]: Found specification of procedure amd8111e_stop_chip [2022-07-23 04:18:31,709 INFO L138 BoogieDeclarations]: Found implementation of procedure amd8111e_stop_chip [2022-07-23 04:18:31,709 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-23 04:18:31,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-23 04:18:31,709 INFO L130 BoogieDeclarations]: Found specification of procedure amd8111e_poll [2022-07-23 04:18:31,709 INFO L138 BoogieDeclarations]: Found implementation of procedure amd8111e_poll [2022-07-23 04:18:31,709 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-23 04:18:31,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-23 04:18:31,709 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-23 04:18:31,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-23 04:18:31,709 INFO L130 BoogieDeclarations]: Found specification of procedure pci_set_power_state [2022-07-23 04:18:31,709 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_set_power_state [2022-07-23 04:18:31,710 INFO L130 BoogieDeclarations]: Found specification of procedure amd8111e_get_regs_len [2022-07-23 04:18:31,710 INFO L138 BoogieDeclarations]: Found implementation of procedure amd8111e_get_regs_len [2022-07-23 04:18:31,710 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_irq_127 [2022-07-23 04:18:31,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_irq_127 [2022-07-23 04:18:31,710 INFO L130 BoogieDeclarations]: Found specification of procedure readl [2022-07-23 04:18:31,710 INFO L138 BoogieDeclarations]: Found implementation of procedure readl [2022-07-23 04:18:31,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-23 04:18:32,366 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 04:18:32,369 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 04:18:32,942 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-23 04:18:34,488 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 04:18:34,499 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 04:18:34,499 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-23 04:18:34,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 04:18:34 BoogieIcfgContainer [2022-07-23 04:18:34,502 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 04:18:34,503 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 04:18:34,503 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 04:18:34,506 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 04:18:34,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 04:18:27" (1/3) ... [2022-07-23 04:18:34,506 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57da0d48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 04:18:34, skipping insertion in model container [2022-07-23 04:18:34,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:18:31" (2/3) ... [2022-07-23 04:18:34,507 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57da0d48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 04:18:34, skipping insertion in model container [2022-07-23 04:18:34,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 04:18:34" (3/3) ... [2022-07-23 04:18:34,508 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--net--ethernet--amd--amd8111e.ko.cil.i [2022-07-23 04:18:34,517 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 04:18:34,517 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 27 error locations. [2022-07-23 04:18:34,571 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 04:18:34,575 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@33f17301, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@486b71e1 [2022-07-23 04:18:34,575 INFO L358 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2022-07-23 04:18:34,583 INFO L276 IsEmpty]: Start isEmpty. Operand has 1881 states, 1230 states have (on average 1.283739837398374) internal successors, (1579), 1293 states have internal predecessors, (1579), 512 states have call successors, (512), 112 states have call predecessors, (512), 111 states have return successors, (508), 499 states have call predecessors, (508), 508 states have call successors, (508) [2022-07-23 04:18:34,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-23 04:18:34,590 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:18:34,591 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-23 04:18:34,591 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-23 04:18:34,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:18:34,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1030412295, now seen corresponding path program 1 times [2022-07-23 04:18:34,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:18:34,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110119499] [2022-07-23 04:18:34,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:18:34,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:18:34,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:35,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:18:35,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:35,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:18:35,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:35,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:18:35,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:35,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:18:35,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:35,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:18:35,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:35,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:18:35,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:35,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:18:35,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:35,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:18:35,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:35,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:18:35,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:35,131 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-23 04:18:35,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:18:35,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110119499] [2022-07-23 04:18:35,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110119499] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:18:35,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:18:35,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:18:35,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246558927] [2022-07-23 04:18:35,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:18:35,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:18:35,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:18:35,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:18:35,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:18:35,167 INFO L87 Difference]: Start difference. First operand has 1881 states, 1230 states have (on average 1.283739837398374) internal successors, (1579), 1293 states have internal predecessors, (1579), 512 states have call successors, (512), 112 states have call predecessors, (512), 111 states have return successors, (508), 499 states have call predecessors, (508), 508 states have call successors, (508) Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-23 04:18:38,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:18:38,539 INFO L93 Difference]: Finished difference Result 3729 states and 5275 transitions. [2022-07-23 04:18:38,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:18:38,542 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 64 [2022-07-23 04:18:38,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:18:38,560 INFO L225 Difference]: With dead ends: 3729 [2022-07-23 04:18:38,560 INFO L226 Difference]: Without dead ends: 1863 [2022-07-23 04:18:38,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 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-23 04:18:38,574 INFO L413 NwaCegarLoop]: 2195 mSDtfsCounter, 3760 mSDsluCounter, 1544 mSDsCounter, 0 mSdLazyCounter, 2579 mSolverCounterSat, 2314 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3937 SdHoareTripleChecker+Valid, 3739 SdHoareTripleChecker+Invalid, 4893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2314 IncrementalHoareTripleChecker+Valid, 2579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-07-23 04:18:38,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3937 Valid, 3739 Invalid, 4893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2314 Valid, 2579 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-07-23 04:18:38,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1863 states. [2022-07-23 04:18:38,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1863 to 1863. [2022-07-23 04:18:38,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1863 states, 1219 states have (on average 1.2223133716160788) internal successors, (1490), 1279 states have internal predecessors, (1490), 508 states have call successors, (508), 111 states have call predecessors, (508), 110 states have return successors, (506), 497 states have call predecessors, (506), 506 states have call successors, (506) [2022-07-23 04:18:38,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1863 states to 1863 states and 2504 transitions. [2022-07-23 04:18:38,691 INFO L78 Accepts]: Start accepts. Automaton has 1863 states and 2504 transitions. Word has length 64 [2022-07-23 04:18:38,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:18:38,692 INFO L495 AbstractCegarLoop]: Abstraction has 1863 states and 2504 transitions. [2022-07-23 04:18:38,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-23 04:18:38,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1863 states and 2504 transitions. [2022-07-23 04:18:38,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-23 04:18:38,695 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:18:38,695 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-23 04:18:38,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-23 04:18:38,696 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_linux_block_genhd_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-23 04:18:38,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:18:38,696 INFO L85 PathProgramCache]: Analyzing trace with hash -931920879, now seen corresponding path program 1 times [2022-07-23 04:18:38,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:18:38,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478619042] [2022-07-23 04:18:38,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:18:38,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:18:38,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:38,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:18:38,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:38,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:18:38,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:38,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:18:38,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:38,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:18:38,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:38,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:18:38,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:38,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:18:38,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:38,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:18:38,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:38,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:18:38,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:38,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:18:38,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:38,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:18:38,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:38,879 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-23 04:18:38,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:18:38,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478619042] [2022-07-23 04:18:38,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478619042] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:18:38,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:18:38,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:18:38,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480282757] [2022-07-23 04:18:38,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:18:38,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:18:38,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:18:38,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:18:38,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:18:38,882 INFO L87 Difference]: Start difference. First operand 1863 states and 2504 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 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-23 04:18:41,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:18:41,711 INFO L93 Difference]: Finished difference Result 1863 states and 2504 transitions. [2022-07-23 04:18:41,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:18:41,712 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 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 70 [2022-07-23 04:18:41,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:18:41,721 INFO L225 Difference]: With dead ends: 1863 [2022-07-23 04:18:41,722 INFO L226 Difference]: Without dead ends: 1861 [2022-07-23 04:18:41,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-23 04:18:41,724 INFO L413 NwaCegarLoop]: 2177 mSDtfsCounter, 3728 mSDsluCounter, 1528 mSDsCounter, 0 mSdLazyCounter, 2565 mSolverCounterSat, 2306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3902 SdHoareTripleChecker+Valid, 3705 SdHoareTripleChecker+Invalid, 4871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2306 IncrementalHoareTripleChecker+Valid, 2565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-07-23 04:18:41,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3902 Valid, 3705 Invalid, 4871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2306 Valid, 2565 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-07-23 04:18:41,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1861 states. [2022-07-23 04:18:41,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1861 to 1861. [2022-07-23 04:18:41,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1861 states, 1218 states have (on average 1.2216748768472907) internal successors, (1488), 1277 states have internal predecessors, (1488), 508 states have call successors, (508), 111 states have call predecessors, (508), 110 states have return successors, (506), 497 states have call predecessors, (506), 506 states have call successors, (506) [2022-07-23 04:18:41,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1861 states to 1861 states and 2502 transitions. [2022-07-23 04:18:41,788 INFO L78 Accepts]: Start accepts. Automaton has 1861 states and 2502 transitions. Word has length 70 [2022-07-23 04:18:41,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:18:41,788 INFO L495 AbstractCegarLoop]: Abstraction has 1861 states and 2502 transitions. [2022-07-23 04:18:41,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 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-23 04:18:41,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1861 states and 2502 transitions. [2022-07-23 04:18:41,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-23 04:18:41,790 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:18:41,790 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-23 04:18:41,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-23 04:18:41,791 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-23 04:18:41,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:18:41,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1623667506, now seen corresponding path program 1 times [2022-07-23 04:18:41,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:18:41,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133239147] [2022-07-23 04:18:41,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:18:41,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:18:41,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:41,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:18:41,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:41,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:18:41,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:41,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:18:41,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:41,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:18:41,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:41,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:18:41,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:41,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:18:41,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:42,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:18:42,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:42,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:18:42,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:42,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:18:42,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:42,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:18:42,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:42,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:18:42,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:42,061 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-23 04:18:42,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:18:42,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133239147] [2022-07-23 04:18:42,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133239147] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:18:42,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:18:42,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:18:42,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94719367] [2022-07-23 04:18:42,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:18:42,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:18:42,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:18:42,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:18:42,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:18:42,064 INFO L87 Difference]: Start difference. First operand 1861 states and 2502 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 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-23 04:18:45,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:18:45,295 INFO L93 Difference]: Finished difference Result 1861 states and 2502 transitions. [2022-07-23 04:18:45,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:18:45,295 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 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 76 [2022-07-23 04:18:45,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:18:45,305 INFO L225 Difference]: With dead ends: 1861 [2022-07-23 04:18:45,305 INFO L226 Difference]: Without dead ends: 1859 [2022-07-23 04:18:45,306 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-23 04:18:45,307 INFO L413 NwaCegarLoop]: 2175 mSDtfsCounter, 3722 mSDsluCounter, 1528 mSDsCounter, 0 mSdLazyCounter, 2563 mSolverCounterSat, 2306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3895 SdHoareTripleChecker+Valid, 3703 SdHoareTripleChecker+Invalid, 4869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2306 IncrementalHoareTripleChecker+Valid, 2563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-07-23 04:18:45,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3895 Valid, 3703 Invalid, 4869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2306 Valid, 2563 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-07-23 04:18:45,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1859 states. [2022-07-23 04:18:45,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1859 to 1859. [2022-07-23 04:18:45,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1859 states, 1217 states have (on average 1.221035332785538) internal successors, (1486), 1275 states have internal predecessors, (1486), 508 states have call successors, (508), 111 states have call predecessors, (508), 110 states have return successors, (506), 497 states have call predecessors, (506), 506 states have call successors, (506) [2022-07-23 04:18:45,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1859 states to 1859 states and 2500 transitions. [2022-07-23 04:18:45,424 INFO L78 Accepts]: Start accepts. Automaton has 1859 states and 2500 transitions. Word has length 76 [2022-07-23 04:18:45,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:18:45,425 INFO L495 AbstractCegarLoop]: Abstraction has 1859 states and 2500 transitions. [2022-07-23 04:18:45,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 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-23 04:18:45,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1859 states and 2500 transitions. [2022-07-23 04:18:45,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-23 04:18:45,426 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:18:45,426 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:18:45,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-23 04:18:45,426 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-23 04:18:45,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:18:45,427 INFO L85 PathProgramCache]: Analyzing trace with hash -556418011, now seen corresponding path program 1 times [2022-07-23 04:18:45,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:18:45,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058807788] [2022-07-23 04:18:45,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:18:45,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:18:45,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:45,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:18:45,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:45,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:18:45,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:45,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:18:45,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:45,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:18:45,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:45,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:18:45,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:45,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:18:45,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:45,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:18:45,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:45,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:18:45,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:45,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:18:45,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:45,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:18:45,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:45,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:18:45,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:45,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:18:45,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:45,620 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-23 04:18:45,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:18:45,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058807788] [2022-07-23 04:18:45,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058807788] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:18:45,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:18:45,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:18:45,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096788698] [2022-07-23 04:18:45,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:18:45,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:18:45,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:18:45,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:18:45,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:18:45,623 INFO L87 Difference]: Start difference. First operand 1859 states and 2500 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 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-23 04:18:48,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:18:48,573 INFO L93 Difference]: Finished difference Result 1859 states and 2500 transitions. [2022-07-23 04:18:48,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:18:48,574 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 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 82 [2022-07-23 04:18:48,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:18:48,582 INFO L225 Difference]: With dead ends: 1859 [2022-07-23 04:18:48,583 INFO L226 Difference]: Without dead ends: 1857 [2022-07-23 04:18:48,584 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-23 04:18:48,585 INFO L413 NwaCegarLoop]: 2173 mSDtfsCounter, 3716 mSDsluCounter, 1528 mSDsCounter, 0 mSdLazyCounter, 2561 mSolverCounterSat, 2306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3888 SdHoareTripleChecker+Valid, 3701 SdHoareTripleChecker+Invalid, 4867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2306 IncrementalHoareTripleChecker+Valid, 2561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-07-23 04:18:48,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3888 Valid, 3701 Invalid, 4867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2306 Valid, 2561 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-07-23 04:18:48,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1857 states. [2022-07-23 04:18:48,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1857 to 1857. [2022-07-23 04:18:48,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1857 states, 1216 states have (on average 1.2203947368421053) internal successors, (1484), 1273 states have internal predecessors, (1484), 508 states have call successors, (508), 111 states have call predecessors, (508), 110 states have return successors, (506), 497 states have call predecessors, (506), 506 states have call successors, (506) [2022-07-23 04:18:48,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1857 states to 1857 states and 2498 transitions. [2022-07-23 04:18:48,660 INFO L78 Accepts]: Start accepts. Automaton has 1857 states and 2498 transitions. Word has length 82 [2022-07-23 04:18:48,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:18:48,661 INFO L495 AbstractCegarLoop]: Abstraction has 1857 states and 2498 transitions. [2022-07-23 04:18:48,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 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-23 04:18:48,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1857 states and 2498 transitions. [2022-07-23 04:18:48,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-23 04:18:48,663 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:18:48,663 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-23 04:18:48,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-23 04:18:48,663 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-23 04:18:48,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:18:48,664 INFO L85 PathProgramCache]: Analyzing trace with hash -2061808673, now seen corresponding path program 1 times [2022-07-23 04:18:48,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:18:48,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950969089] [2022-07-23 04:18:48,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:18:48,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:18:48,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:48,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:18:48,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:48,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:18:48,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:48,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:18:48,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:48,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:18:48,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:48,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:18:48,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:48,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:18:48,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:48,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:18:48,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:48,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:18:48,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:48,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:18:48,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:48,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:18:48,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:48,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:18:48,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:48,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:18:48,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:48,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:18:48,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:48,940 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-23 04:18:48,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:18:48,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950969089] [2022-07-23 04:18:48,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950969089] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:18:48,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:18:48,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:18:48,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262737965] [2022-07-23 04:18:48,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:18:48,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:18:48,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:18:48,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:18:48,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:18:48,943 INFO L87 Difference]: Start difference. First operand 1857 states and 2498 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 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-23 04:18:51,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:18:51,922 INFO L93 Difference]: Finished difference Result 1857 states and 2498 transitions. [2022-07-23 04:18:51,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:18:51,923 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 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 88 [2022-07-23 04:18:51,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:18:51,931 INFO L225 Difference]: With dead ends: 1857 [2022-07-23 04:18:51,931 INFO L226 Difference]: Without dead ends: 1855 [2022-07-23 04:18:51,933 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-23 04:18:51,933 INFO L413 NwaCegarLoop]: 2171 mSDtfsCounter, 3710 mSDsluCounter, 1528 mSDsCounter, 0 mSdLazyCounter, 2559 mSolverCounterSat, 2306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3881 SdHoareTripleChecker+Valid, 3699 SdHoareTripleChecker+Invalid, 4865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2306 IncrementalHoareTripleChecker+Valid, 2559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-07-23 04:18:51,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3881 Valid, 3699 Invalid, 4865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2306 Valid, 2559 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-07-23 04:18:51,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1855 states. [2022-07-23 04:18:51,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1855 to 1855. [2022-07-23 04:18:51,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1855 states, 1215 states have (on average 1.219753086419753) internal successors, (1482), 1271 states have internal predecessors, (1482), 508 states have call successors, (508), 111 states have call predecessors, (508), 110 states have return successors, (506), 497 states have call predecessors, (506), 506 states have call successors, (506) [2022-07-23 04:18:51,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1855 states to 1855 states and 2496 transitions. [2022-07-23 04:18:51,992 INFO L78 Accepts]: Start accepts. Automaton has 1855 states and 2496 transitions. Word has length 88 [2022-07-23 04:18:51,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:18:51,993 INFO L495 AbstractCegarLoop]: Abstraction has 1855 states and 2496 transitions. [2022-07-23 04:18:51,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 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-23 04:18:51,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1855 states and 2496 transitions. [2022-07-23 04:18:51,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-23 04:18:51,994 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:18:51,994 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-23 04:18:51,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-23 04:18:51,994 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-23 04:18:51,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:18:51,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1388539049, now seen corresponding path program 1 times [2022-07-23 04:18:51,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:18:51,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693817603] [2022-07-23 04:18:51,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:18:51,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:18:52,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:52,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:18:52,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:52,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:18:52,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:52,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:18:52,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:52,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 04:18:52,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:52,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:18:52,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:52,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:18:52,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:52,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:18:52,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:52,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 04:18:52,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:52,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:18:52,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:52,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:18:52,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:52,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:18:52,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:52,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:18:52,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:52,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:18:52,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:52,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:18:52,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:52,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:18:52,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:52,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:18:52,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:52,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:18:52,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:52,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:18:52,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:52,185 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-23 04:18:52,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:18:52,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693817603] [2022-07-23 04:18:52,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693817603] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:18:52,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:18:52,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:18:52,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511247386] [2022-07-23 04:18:52,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:18:52,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:18:52,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:18:52,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:18:52,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:18:52,187 INFO L87 Difference]: Start difference. First operand 1855 states and 2496 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-23 04:18:57,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:18:57,686 INFO L93 Difference]: Finished difference Result 5088 states and 6882 transitions. [2022-07-23 04:18:57,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 04:18:57,687 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 110 [2022-07-23 04:18:57,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:18:57,703 INFO L225 Difference]: With dead ends: 5088 [2022-07-23 04:18:57,703 INFO L226 Difference]: Without dead ends: 3254 [2022-07-23 04:18:57,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-07-23 04:18:57,712 INFO L413 NwaCegarLoop]: 2611 mSDtfsCounter, 6266 mSDsluCounter, 2346 mSDsCounter, 0 mSdLazyCounter, 3817 mSolverCounterSat, 4445 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6455 SdHoareTripleChecker+Valid, 4957 SdHoareTripleChecker+Invalid, 8262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4445 IncrementalHoareTripleChecker+Valid, 3817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-07-23 04:18:57,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6455 Valid, 4957 Invalid, 8262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4445 Valid, 3817 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2022-07-23 04:18:57,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3254 states. [2022-07-23 04:18:57,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3254 to 3106. [2022-07-23 04:18:57,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3106 states, 2048 states have (on average 1.22314453125) internal successors, (2505), 2128 states have internal predecessors, (2505), 851 states have call successors, (851), 186 states have call predecessors, (851), 185 states have return successors, (849), 833 states have call predecessors, (849), 849 states have call successors, (849) [2022-07-23 04:18:57,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3106 states to 3106 states and 4205 transitions. [2022-07-23 04:18:57,837 INFO L78 Accepts]: Start accepts. Automaton has 3106 states and 4205 transitions. Word has length 110 [2022-07-23 04:18:57,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:18:57,838 INFO L495 AbstractCegarLoop]: Abstraction has 3106 states and 4205 transitions. [2022-07-23 04:18:57,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-23 04:18:57,838 INFO L276 IsEmpty]: Start isEmpty. Operand 3106 states and 4205 transitions. [2022-07-23 04:18:57,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-23 04:18:57,839 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:18:57,839 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-23 04:18:57,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-23 04:18:57,839 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-23 04:18:57,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:18:57,840 INFO L85 PathProgramCache]: Analyzing trace with hash 31811044, now seen corresponding path program 1 times [2022-07-23 04:18:57,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:18:57,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785302368] [2022-07-23 04:18:57,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:18:57,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:18:57,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:58,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:18:58,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:58,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:18:58,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:58,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:18:58,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:58,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:18:58,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:58,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:18:58,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:58,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:18:58,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:58,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:18:58,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:58,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:18:58,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:58,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:18:58,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:58,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:18:58,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:58,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:18:58,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:58,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:18:58,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:58,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:18:58,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:58,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:18:58,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:58,116 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-23 04:18:58,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:18:58,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785302368] [2022-07-23 04:18:58,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785302368] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:18:58,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:18:58,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:18:58,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290287997] [2022-07-23 04:18:58,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:18:58,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:18:58,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:18:58,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:18:58,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:18:58,118 INFO L87 Difference]: Start difference. First operand 3106 states and 4205 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 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-23 04:19:01,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:19:01,190 INFO L93 Difference]: Finished difference Result 3106 states and 4205 transitions. [2022-07-23 04:19:01,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:19:01,191 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 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 94 [2022-07-23 04:19:01,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:19:01,218 INFO L225 Difference]: With dead ends: 3106 [2022-07-23 04:19:01,218 INFO L226 Difference]: Without dead ends: 3104 [2022-07-23 04:19:01,221 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-23 04:19:01,221 INFO L413 NwaCegarLoop]: 2169 mSDtfsCounter, 3704 mSDsluCounter, 1528 mSDsCounter, 0 mSdLazyCounter, 2557 mSolverCounterSat, 2306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3874 SdHoareTripleChecker+Valid, 3697 SdHoareTripleChecker+Invalid, 4863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2306 IncrementalHoareTripleChecker+Valid, 2557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-07-23 04:19:01,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3874 Valid, 3697 Invalid, 4863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2306 Valid, 2557 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-07-23 04:19:01,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3104 states. [2022-07-23 04:19:01,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3104 to 3104. [2022-07-23 04:19:01,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3104 states, 2047 states have (on average 1.2227650219833903) internal successors, (2503), 2126 states have internal predecessors, (2503), 851 states have call successors, (851), 186 states have call predecessors, (851), 185 states have return successors, (849), 833 states have call predecessors, (849), 849 states have call successors, (849) [2022-07-23 04:19:01,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3104 states to 3104 states and 4203 transitions. [2022-07-23 04:19:01,352 INFO L78 Accepts]: Start accepts. Automaton has 3104 states and 4203 transitions. Word has length 94 [2022-07-23 04:19:01,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:19:01,353 INFO L495 AbstractCegarLoop]: Abstraction has 3104 states and 4203 transitions. [2022-07-23 04:19:01,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 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-23 04:19:01,353 INFO L276 IsEmpty]: Start isEmpty. Operand 3104 states and 4203 transitions. [2022-07-23 04:19:01,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-07-23 04:19:01,356 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:19:01,356 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 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] [2022-07-23 04:19:01,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-23 04:19:01,356 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-23 04:19:01,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:19:01,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1694689272, now seen corresponding path program 1 times [2022-07-23 04:19:01,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:19:01,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192658619] [2022-07-23 04:19:01,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:19:01,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:19:01,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:01,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:19:01,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:01,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:19:01,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:01,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:19:01,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:01,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 04:19:01,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:01,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:19:01,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:01,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:19:01,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:01,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:19:01,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:01,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 04:19:01,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:01,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:19:01,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:01,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:19:01,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:01,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:19:01,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:01,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:19:01,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:01,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:19:01,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:01,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:19:01,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:01,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:19:01,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:01,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:19:01,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:01,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:19:01,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:01,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:19:01,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:01,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-23 04:19:01,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:01,567 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2022-07-23 04:19:01,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:19:01,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192658619] [2022-07-23 04:19:01,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192658619] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 04:19:01,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809403724] [2022-07-23 04:19:01,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:19:01,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:19:01,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 04:19:01,570 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-23 04:19:01,571 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-23 04:19:02,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:02,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 1709 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 04:19:02,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 04:19:02,221 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-23 04:19:02,221 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 04:19:02,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1809403724] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:19:02,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 04:19:02,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2022-07-23 04:19:02,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522694101] [2022-07-23 04:19:02,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:19:02,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 04:19:02,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:19:02,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 04:19:02,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-23 04:19:02,223 INFO L87 Difference]: Start difference. First operand 3104 states and 4203 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-23 04:19:02,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:19:02,436 INFO L93 Difference]: Finished difference Result 6183 states and 8371 transitions. [2022-07-23 04:19:02,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 04:19:02,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 116 [2022-07-23 04:19:02,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:19:02,451 INFO L225 Difference]: With dead ends: 6183 [2022-07-23 04:19:02,451 INFO L226 Difference]: Without dead ends: 3100 [2022-07-23 04:19:02,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 150 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-23 04:19:02,463 INFO L413 NwaCegarLoop]: 2488 mSDtfsCounter, 2472 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2472 SdHoareTripleChecker+Valid, 2488 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 04:19:02,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2472 Valid, 2488 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 04:19:02,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3100 states. [2022-07-23 04:19:02,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3100 to 3100. [2022-07-23 04:19:02,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3100 states, 2044 states have (on average 1.2221135029354206) internal successors, (2498), 2122 states have internal predecessors, (2498), 851 states have call successors, (851), 186 states have call predecessors, (851), 185 states have return successors, (849), 833 states have call predecessors, (849), 849 states have call successors, (849) [2022-07-23 04:19:02,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3100 states to 3100 states and 4198 transitions. [2022-07-23 04:19:02,600 INFO L78 Accepts]: Start accepts. Automaton has 3100 states and 4198 transitions. Word has length 116 [2022-07-23 04:19:02,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:19:02,600 INFO L495 AbstractCegarLoop]: Abstraction has 3100 states and 4198 transitions. [2022-07-23 04:19:02,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-23 04:19:02,600 INFO L276 IsEmpty]: Start isEmpty. Operand 3100 states and 4198 transitions. [2022-07-23 04:19:02,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-23 04:19:02,603 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:19:02,603 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-23 04:19:02,640 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-23 04:19:02,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:19:02,826 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-23 04:19:02,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:19:02,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1132303691, now seen corresponding path program 1 times [2022-07-23 04:19:02,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:19:02,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625088289] [2022-07-23 04:19:02,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:19:02,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:19:02,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:02,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:19:02,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:02,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:19:02,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:02,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:19:02,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:02,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:19:02,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:02,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:19:02,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:02,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:19:02,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:02,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:19:02,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:02,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:19:02,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:02,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:19:02,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:02,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:19:02,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:02,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:19:02,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:02,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:19:02,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:03,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:19:03,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:03,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:19:03,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:03,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:19:03,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:03,034 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-23 04:19:03,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:19:03,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625088289] [2022-07-23 04:19:03,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625088289] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:19:03,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:19:03,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:19:03,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804662799] [2022-07-23 04:19:03,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:19:03,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:19:03,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:19:03,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:19:03,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:19:03,037 INFO L87 Difference]: Start difference. First operand 3100 states and 4198 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 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-23 04:19:06,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:19:06,245 INFO L93 Difference]: Finished difference Result 3100 states and 4198 transitions. [2022-07-23 04:19:06,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:19:06,246 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 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 100 [2022-07-23 04:19:06,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:19:06,261 INFO L225 Difference]: With dead ends: 3100 [2022-07-23 04:19:06,261 INFO L226 Difference]: Without dead ends: 3098 [2022-07-23 04:19:06,263 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-23 04:19:06,264 INFO L413 NwaCegarLoop]: 2162 mSDtfsCounter, 3693 mSDsluCounter, 1514 mSDsCounter, 0 mSdLazyCounter, 2554 mSolverCounterSat, 2306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3862 SdHoareTripleChecker+Valid, 3676 SdHoareTripleChecker+Invalid, 4860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2306 IncrementalHoareTripleChecker+Valid, 2554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-07-23 04:19:06,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3862 Valid, 3676 Invalid, 4860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2306 Valid, 2554 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-07-23 04:19:06,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3098 states. [2022-07-23 04:19:06,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3098 to 3098. [2022-07-23 04:19:06,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3098 states, 2043 states have (on average 1.2217327459618208) internal successors, (2496), 2120 states have internal predecessors, (2496), 851 states have call successors, (851), 186 states have call predecessors, (851), 185 states have return successors, (849), 833 states have call predecessors, (849), 849 states have call successors, (849) [2022-07-23 04:19:06,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3098 states to 3098 states and 4196 transitions. [2022-07-23 04:19:06,466 INFO L78 Accepts]: Start accepts. Automaton has 3098 states and 4196 transitions. Word has length 100 [2022-07-23 04:19:06,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:19:06,466 INFO L495 AbstractCegarLoop]: Abstraction has 3098 states and 4196 transitions. [2022-07-23 04:19:06,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 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-23 04:19:06,466 INFO L276 IsEmpty]: Start isEmpty. Operand 3098 states and 4196 transitions. [2022-07-23 04:19:06,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-23 04:19:06,468 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:19:06,468 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-23 04:19:06,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-23 04:19:06,469 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-23 04:19:06,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:19:06,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1737552029, now seen corresponding path program 1 times [2022-07-23 04:19:06,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:19:06,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437503996] [2022-07-23 04:19:06,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:19:06,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:19:06,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:06,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:19:06,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:06,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:19:06,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:06,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:19:06,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:06,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:19:06,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:06,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:19:06,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:06,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:19:06,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:06,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:19:06,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:06,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:19:06,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:06,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:19:06,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:06,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:19:06,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:06,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:19:06,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:06,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:19:06,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:06,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:19:06,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:06,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:19:06,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:06,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:19:06,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:06,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:19:06,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:06,647 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-23 04:19:06,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:19:06,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437503996] [2022-07-23 04:19:06,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437503996] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:19:06,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:19:06,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:19:06,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794786316] [2022-07-23 04:19:06,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:19:06,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:19:06,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:19:06,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:19:06,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:19:06,649 INFO L87 Difference]: Start difference. First operand 3098 states and 4196 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 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-23 04:19:09,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:19:09,184 INFO L93 Difference]: Finished difference Result 3098 states and 4196 transitions. [2022-07-23 04:19:09,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:19:09,184 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 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 106 [2022-07-23 04:19:09,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:19:09,196 INFO L225 Difference]: With dead ends: 3098 [2022-07-23 04:19:09,197 INFO L226 Difference]: Without dead ends: 3096 [2022-07-23 04:19:09,198 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-23 04:19:09,199 INFO L413 NwaCegarLoop]: 2160 mSDtfsCounter, 3691 mSDsluCounter, 1514 mSDsCounter, 0 mSdLazyCounter, 2548 mSolverCounterSat, 2306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3859 SdHoareTripleChecker+Valid, 3674 SdHoareTripleChecker+Invalid, 4854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2306 IncrementalHoareTripleChecker+Valid, 2548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-23 04:19:09,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3859 Valid, 3674 Invalid, 4854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2306 Valid, 2548 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-07-23 04:19:09,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3096 states. [2022-07-23 04:19:09,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3096 to 3096. [2022-07-23 04:19:09,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3096 states, 2042 states have (on average 1.2213516160626836) internal successors, (2494), 2118 states have internal predecessors, (2494), 851 states have call successors, (851), 186 states have call predecessors, (851), 185 states have return successors, (849), 833 states have call predecessors, (849), 849 states have call successors, (849) [2022-07-23 04:19:09,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3096 states to 3096 states and 4194 transitions. [2022-07-23 04:19:09,319 INFO L78 Accepts]: Start accepts. Automaton has 3096 states and 4194 transitions. Word has length 106 [2022-07-23 04:19:09,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:19:09,319 INFO L495 AbstractCegarLoop]: Abstraction has 3096 states and 4194 transitions. [2022-07-23 04:19:09,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 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-23 04:19:09,319 INFO L276 IsEmpty]: Start isEmpty. Operand 3096 states and 4194 transitions. [2022-07-23 04:19:09,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-23 04:19:09,320 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:19:09,320 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-23 04:19:09,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-23 04:19:09,321 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-23 04:19:09,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:19:09,321 INFO L85 PathProgramCache]: Analyzing trace with hash 954930630, now seen corresponding path program 1 times [2022-07-23 04:19:09,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:19:09,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691797798] [2022-07-23 04:19:09,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:19:09,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:19:09,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:09,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:19:09,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:09,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:19:09,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:09,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:19:09,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:09,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:19:09,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:09,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:19:09,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:09,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:19:09,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:09,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:19:09,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:09,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:19:09,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:09,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:19:09,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:09,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:19:09,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:09,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:19:09,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:09,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:19:09,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:09,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:19:09,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:09,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:19:09,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:09,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:19:09,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:09,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:19:09,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:09,523 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-23 04:19:09,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:19:09,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691797798] [2022-07-23 04:19:09,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691797798] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:19:09,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:19:09,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:19:09,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785466960] [2022-07-23 04:19:09,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:19:09,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:19:09,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:19:09,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:19:09,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:19:09,526 INFO L87 Difference]: Start difference. First operand 3096 states and 4194 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 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-23 04:19:12,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:19:12,740 INFO L93 Difference]: Finished difference Result 3096 states and 4194 transitions. [2022-07-23 04:19:12,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:19:12,741 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 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 108 [2022-07-23 04:19:12,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:19:12,795 INFO L225 Difference]: With dead ends: 3096 [2022-07-23 04:19:12,795 INFO L226 Difference]: Without dead ends: 3094 [2022-07-23 04:19:12,797 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-23 04:19:12,798 INFO L413 NwaCegarLoop]: 2158 mSDtfsCounter, 3679 mSDsluCounter, 1514 mSDsCounter, 0 mSdLazyCounter, 2550 mSolverCounterSat, 2306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3847 SdHoareTripleChecker+Valid, 3672 SdHoareTripleChecker+Invalid, 4856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2306 IncrementalHoareTripleChecker+Valid, 2550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-07-23 04:19:12,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3847 Valid, 3672 Invalid, 4856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2306 Valid, 2550 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-07-23 04:19:12,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3094 states. [2022-07-23 04:19:12,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3094 to 3094. [2022-07-23 04:19:12,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3094 states, 2041 states have (on average 1.220970112689858) internal successors, (2492), 2116 states have internal predecessors, (2492), 851 states have call successors, (851), 186 states have call predecessors, (851), 185 states have return successors, (849), 833 states have call predecessors, (849), 849 states have call successors, (849) [2022-07-23 04:19:12,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3094 states to 3094 states and 4192 transitions. [2022-07-23 04:19:12,914 INFO L78 Accepts]: Start accepts. Automaton has 3094 states and 4192 transitions. Word has length 108 [2022-07-23 04:19:12,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:19:12,916 INFO L495 AbstractCegarLoop]: Abstraction has 3094 states and 4192 transitions. [2022-07-23 04:19:12,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 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-23 04:19:12,916 INFO L276 IsEmpty]: Start isEmpty. Operand 3094 states and 4192 transitions. [2022-07-23 04:19:12,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-23 04:19:12,917 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:19:12,917 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-23 04:19:12,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-23 04:19:12,918 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_linux_kernel_module_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-23 04:19:12,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:19:12,918 INFO L85 PathProgramCache]: Analyzing trace with hash 109086248, now seen corresponding path program 1 times [2022-07-23 04:19:12,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:19:12,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688752723] [2022-07-23 04:19:12,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:19:12,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:19:12,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:12,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:19:13,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:13,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:19:13,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:13,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:19:13,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:13,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:19:13,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:13,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:19:13,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:13,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:19:13,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:13,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:19:13,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:13,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:19:13,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:13,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:19:13,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:13,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:19:13,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:13,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:19:13,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:13,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:19:13,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:13,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:19:13,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:13,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:19:13,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:13,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:19:13,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:13,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:19:13,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:13,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 04:19:13,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:13,085 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-23 04:19:13,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:19:13,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688752723] [2022-07-23 04:19:13,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688752723] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:19:13,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:19:13,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:19:13,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695498719] [2022-07-23 04:19:13,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:19:13,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:19:13,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:19:13,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:19:13,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:19:13,087 INFO L87 Difference]: Start difference. First operand 3094 states and 4192 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 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-23 04:19:16,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:19:16,328 INFO L93 Difference]: Finished difference Result 3094 states and 4192 transitions. [2022-07-23 04:19:16,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:19:16,328 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 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 114 [2022-07-23 04:19:16,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:19:16,338 INFO L225 Difference]: With dead ends: 3094 [2022-07-23 04:19:16,338 INFO L226 Difference]: Without dead ends: 3092 [2022-07-23 04:19:16,340 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-23 04:19:16,340 INFO L413 NwaCegarLoop]: 2156 mSDtfsCounter, 3675 mSDsluCounter, 1514 mSDsCounter, 0 mSdLazyCounter, 2548 mSolverCounterSat, 2306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3842 SdHoareTripleChecker+Valid, 3670 SdHoareTripleChecker+Invalid, 4854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2306 IncrementalHoareTripleChecker+Valid, 2548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-07-23 04:19:16,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3842 Valid, 3670 Invalid, 4854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2306 Valid, 2548 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-07-23 04:19:16,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3092 states. [2022-07-23 04:19:16,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3092 to 3092. [2022-07-23 04:19:16,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3092 states, 2040 states have (on average 1.2205882352941178) internal successors, (2490), 2114 states have internal predecessors, (2490), 851 states have call successors, (851), 186 states have call predecessors, (851), 185 states have return successors, (849), 833 states have call predecessors, (849), 849 states have call successors, (849) [2022-07-23 04:19:16,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3092 states to 3092 states and 4190 transitions. [2022-07-23 04:19:16,465 INFO L78 Accepts]: Start accepts. Automaton has 3092 states and 4190 transitions. Word has length 114 [2022-07-23 04:19:16,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:19:16,466 INFO L495 AbstractCegarLoop]: Abstraction has 3092 states and 4190 transitions. [2022-07-23 04:19:16,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 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-23 04:19:16,466 INFO L276 IsEmpty]: Start isEmpty. Operand 3092 states and 4190 transitions. [2022-07-23 04:19:16,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-23 04:19:16,467 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:19:16,467 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-23 04:19:16,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-23 04:19:16,467 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-23 04:19:16,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:19:16,468 INFO L85 PathProgramCache]: Analyzing trace with hash 401789871, now seen corresponding path program 1 times [2022-07-23 04:19:16,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:19:16,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826561237] [2022-07-23 04:19:16,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:19:16,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:19:16,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:16,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:19:16,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:16,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:19:16,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:16,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:19:16,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:16,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:19:16,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:16,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:19:16,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:16,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:19:16,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:16,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:19:16,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:16,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:19:16,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:16,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:19:16,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:16,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:19:16,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:16,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:19:16,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:16,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:19:16,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:16,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:19:16,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:16,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:19:16,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:16,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:19:16,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:16,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:19:16,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:16,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 04:19:16,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:16,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 04:19:16,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:16,673 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-23 04:19:16,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:19:16,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826561237] [2022-07-23 04:19:16,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826561237] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:19:16,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:19:16,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:19:16,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939015044] [2022-07-23 04:19:16,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:19:16,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:19:16,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:19:16,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:19:16,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:19:16,676 INFO L87 Difference]: Start difference. First operand 3092 states and 4190 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 4 states have internal predecessors, (72), 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-23 04:19:19,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:19:19,228 INFO L93 Difference]: Finished difference Result 3092 states and 4190 transitions. [2022-07-23 04:19:19,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:19:19,228 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 4 states have internal predecessors, (72), 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 120 [2022-07-23 04:19:19,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:19:19,236 INFO L225 Difference]: With dead ends: 3092 [2022-07-23 04:19:19,236 INFO L226 Difference]: Without dead ends: 3090 [2022-07-23 04:19:19,237 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-23 04:19:19,237 INFO L413 NwaCegarLoop]: 2154 mSDtfsCounter, 3669 mSDsluCounter, 1514 mSDsCounter, 0 mSdLazyCounter, 2546 mSolverCounterSat, 2306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3835 SdHoareTripleChecker+Valid, 3668 SdHoareTripleChecker+Invalid, 4852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2306 IncrementalHoareTripleChecker+Valid, 2546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-23 04:19:19,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3835 Valid, 3668 Invalid, 4852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2306 Valid, 2546 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-07-23 04:19:19,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3090 states. [2022-07-23 04:19:19,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3090 to 3090. [2022-07-23 04:19:19,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3090 states, 2039 states have (on average 1.2202059833251593) internal successors, (2488), 2112 states have internal predecessors, (2488), 851 states have call successors, (851), 186 states have call predecessors, (851), 185 states have return successors, (849), 833 states have call predecessors, (849), 849 states have call successors, (849) [2022-07-23 04:19:19,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3090 states to 3090 states and 4188 transitions. [2022-07-23 04:19:19,358 INFO L78 Accepts]: Start accepts. Automaton has 3090 states and 4188 transitions. Word has length 120 [2022-07-23 04:19:19,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:19:19,359 INFO L495 AbstractCegarLoop]: Abstraction has 3090 states and 4188 transitions. [2022-07-23 04:19:19,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 4 states have internal predecessors, (72), 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-23 04:19:19,359 INFO L276 IsEmpty]: Start isEmpty. Operand 3090 states and 4188 transitions. [2022-07-23 04:19:19,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-07-23 04:19:19,360 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:19:19,360 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-23 04:19:19,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-23 04:19:19,361 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-23 04:19:19,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:19:19,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1246102120, now seen corresponding path program 1 times [2022-07-23 04:19:19,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:19:19,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460393297] [2022-07-23 04:19:19,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:19:19,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:19:19,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:19,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:19:19,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:19,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:19:19,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:19,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:19:19,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:19,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:19:19,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:19,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:19:19,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:19,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:19:19,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:19,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:19:19,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:19,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:19:19,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:19,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:19:19,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:19,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:19:19,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:19,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:19:19,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:19,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:19:19,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:19,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:19:19,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:19,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:19:19,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:19,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:19:19,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:19,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:19:19,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:19,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 04:19:19,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:19,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 04:19:19,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:19,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:19:19,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:19,520 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-23 04:19:19,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:19:19,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460393297] [2022-07-23 04:19:19,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460393297] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:19:19,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:19:19,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:19:19,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907864984] [2022-07-23 04:19:19,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:19:19,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:19:19,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:19:19,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:19:19,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:19:19,522 INFO L87 Difference]: Start difference. First operand 3090 states and 4188 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 4 states have internal predecessors, (76), 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-23 04:19:22,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:19:22,819 INFO L93 Difference]: Finished difference Result 3090 states and 4188 transitions. [2022-07-23 04:19:22,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:19:22,820 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 4 states have internal predecessors, (76), 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 126 [2022-07-23 04:19:22,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:19:22,828 INFO L225 Difference]: With dead ends: 3090 [2022-07-23 04:19:22,828 INFO L226 Difference]: Without dead ends: 3088 [2022-07-23 04:19:22,829 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-23 04:19:22,829 INFO L413 NwaCegarLoop]: 2152 mSDtfsCounter, 3663 mSDsluCounter, 1514 mSDsCounter, 0 mSdLazyCounter, 2544 mSolverCounterSat, 2306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3828 SdHoareTripleChecker+Valid, 3666 SdHoareTripleChecker+Invalid, 4850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2306 IncrementalHoareTripleChecker+Valid, 2544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-07-23 04:19:22,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3828 Valid, 3666 Invalid, 4850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2306 Valid, 2544 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-07-23 04:19:22,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3088 states. [2022-07-23 04:19:22,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3088 to 3088. [2022-07-23 04:19:22,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3088 states, 2038 states have (on average 1.2198233562315997) internal successors, (2486), 2110 states have internal predecessors, (2486), 851 states have call successors, (851), 186 states have call predecessors, (851), 185 states have return successors, (849), 833 states have call predecessors, (849), 849 states have call successors, (849) [2022-07-23 04:19:22,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3088 states to 3088 states and 4186 transitions. [2022-07-23 04:19:22,954 INFO L78 Accepts]: Start accepts. Automaton has 3088 states and 4186 transitions. Word has length 126 [2022-07-23 04:19:22,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:19:22,954 INFO L495 AbstractCegarLoop]: Abstraction has 3088 states and 4186 transitions. [2022-07-23 04:19:22,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 4 states have internal predecessors, (76), 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-23 04:19:22,954 INFO L276 IsEmpty]: Start isEmpty. Operand 3088 states and 4186 transitions. [2022-07-23 04:19:22,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-07-23 04:19:22,956 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:19:22,956 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-23 04:19:22,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-23 04:19:22,956 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-23 04:19:22,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:19:22,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1745990219, now seen corresponding path program 1 times [2022-07-23 04:19:22,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:19:22,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136222459] [2022-07-23 04:19:22,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:19:22,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:19:22,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:23,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:19:23,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:23,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:19:23,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:23,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:19:23,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:23,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:19:23,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:23,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:19:23,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:23,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:19:23,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:23,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:19:23,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:23,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:19:23,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:23,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:19:23,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:23,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:19:23,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:23,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:19:23,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:23,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:19:23,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:23,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:19:23,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:23,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:19:23,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:23,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:19:23,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:23,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:19:23,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:23,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 04:19:23,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:23,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 04:19:23,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:23,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:19:23,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:23,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-23 04:19:23,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:23,141 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-23 04:19:23,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:19:23,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136222459] [2022-07-23 04:19:23,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136222459] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:19:23,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:19:23,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:19:23,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793619957] [2022-07-23 04:19:23,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:19:23,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:19:23,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:19:23,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:19:23,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:19:23,145 INFO L87 Difference]: Start difference. First operand 3088 states and 4186 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 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-23 04:19:26,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:19:26,402 INFO L93 Difference]: Finished difference Result 3088 states and 4186 transitions. [2022-07-23 04:19:26,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:19:26,403 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 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 132 [2022-07-23 04:19:26,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:19:26,411 INFO L225 Difference]: With dead ends: 3088 [2022-07-23 04:19:26,411 INFO L226 Difference]: Without dead ends: 3086 [2022-07-23 04:19:26,419 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-23 04:19:26,420 INFO L413 NwaCegarLoop]: 2150 mSDtfsCounter, 3657 mSDsluCounter, 1514 mSDsCounter, 0 mSdLazyCounter, 2542 mSolverCounterSat, 2306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3821 SdHoareTripleChecker+Valid, 3664 SdHoareTripleChecker+Invalid, 4848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2306 IncrementalHoareTripleChecker+Valid, 2542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-07-23 04:19:26,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3821 Valid, 3664 Invalid, 4848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2306 Valid, 2542 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-07-23 04:19:26,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3086 states. [2022-07-23 04:19:26,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3086 to 3086. [2022-07-23 04:19:26,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3086 states, 2037 states have (on average 1.2194403534609721) internal successors, (2484), 2108 states have internal predecessors, (2484), 851 states have call successors, (851), 186 states have call predecessors, (851), 185 states have return successors, (849), 833 states have call predecessors, (849), 849 states have call successors, (849) [2022-07-23 04:19:26,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3086 states to 3086 states and 4184 transitions. [2022-07-23 04:19:26,590 INFO L78 Accepts]: Start accepts. Automaton has 3086 states and 4184 transitions. Word has length 132 [2022-07-23 04:19:26,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:19:26,591 INFO L495 AbstractCegarLoop]: Abstraction has 3086 states and 4184 transitions. [2022-07-23 04:19:26,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 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-23 04:19:26,591 INFO L276 IsEmpty]: Start isEmpty. Operand 3086 states and 4184 transitions. [2022-07-23 04:19:26,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-23 04:19:26,593 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:19:26,593 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-23 04:19:26,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-23 04:19:26,593 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_linux_kernel_rcu_srcu_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-23 04:19:26,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:19:26,594 INFO L85 PathProgramCache]: Analyzing trace with hash -472580401, now seen corresponding path program 1 times [2022-07-23 04:19:26,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:19:26,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208406674] [2022-07-23 04:19:26,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:19:26,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:19:26,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:26,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:19:26,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:26,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:19:26,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:26,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:19:26,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:26,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:19:26,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:26,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:19:26,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:26,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:19:26,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:26,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:19:26,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:26,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:19:26,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:26,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:19:26,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:26,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:19:26,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:26,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:19:26,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:26,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:19:26,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:26,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:19:26,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:26,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:19:26,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:26,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:19:26,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:26,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:19:26,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:26,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 04:19:26,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:26,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 04:19:26,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:26,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:19:26,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:26,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-23 04:19:26,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:26,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-23 04:19:26,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:26,804 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-23 04:19:26,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:19:26,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208406674] [2022-07-23 04:19:26,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208406674] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:19:26,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:19:26,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:19:26,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014615715] [2022-07-23 04:19:26,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:19:26,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:19:26,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:19:26,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:19:26,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:19:26,806 INFO L87 Difference]: Start difference. First operand 3086 states and 4184 transitions. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 4 states have internal predecessors, (84), 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-23 04:19:29,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:19:29,674 INFO L93 Difference]: Finished difference Result 3086 states and 4184 transitions. [2022-07-23 04:19:29,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:19:29,674 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 4 states have internal predecessors, (84), 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 138 [2022-07-23 04:19:29,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:19:29,701 INFO L225 Difference]: With dead ends: 3086 [2022-07-23 04:19:29,715 INFO L226 Difference]: Without dead ends: 3084 [2022-07-23 04:19:29,718 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-23 04:19:29,719 INFO L413 NwaCegarLoop]: 2148 mSDtfsCounter, 3651 mSDsluCounter, 1514 mSDsCounter, 0 mSdLazyCounter, 2540 mSolverCounterSat, 2306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3814 SdHoareTripleChecker+Valid, 3662 SdHoareTripleChecker+Invalid, 4846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2306 IncrementalHoareTripleChecker+Valid, 2540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-07-23 04:19:29,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3814 Valid, 3662 Invalid, 4846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2306 Valid, 2540 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-07-23 04:19:29,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3084 states. [2022-07-23 04:19:29,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3084 to 3084. [2022-07-23 04:19:29,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3084 states, 2036 states have (on average 1.219056974459725) internal successors, (2482), 2106 states have internal predecessors, (2482), 851 states have call successors, (851), 186 states have call predecessors, (851), 185 states have return successors, (849), 833 states have call predecessors, (849), 849 states have call successors, (849) [2022-07-23 04:19:29,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3084 states to 3084 states and 4182 transitions. [2022-07-23 04:19:29,922 INFO L78 Accepts]: Start accepts. Automaton has 3084 states and 4182 transitions. Word has length 138 [2022-07-23 04:19:29,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:19:29,924 INFO L495 AbstractCegarLoop]: Abstraction has 3084 states and 4182 transitions. [2022-07-23 04:19:29,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 4 states have internal predecessors, (84), 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-23 04:19:29,924 INFO L276 IsEmpty]: Start isEmpty. Operand 3084 states and 4182 transitions. [2022-07-23 04:19:29,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-07-23 04:19:29,927 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:19:29,927 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-23 04:19:29,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-23 04:19:29,927 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_linux_lib_idr_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-23 04:19:29,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:19:29,928 INFO L85 PathProgramCache]: Analyzing trace with hash -2085611573, now seen corresponding path program 1 times [2022-07-23 04:19:29,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:19:29,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137389284] [2022-07-23 04:19:29,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:19:29,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:19:29,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:30,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:19:30,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:30,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:19:30,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:30,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:19:30,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:30,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:19:30,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:30,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:19:30,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:30,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:19:30,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:30,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:19:30,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:30,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:19:30,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:30,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:19:30,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:30,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:19:30,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:30,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:19:30,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:30,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:19:30,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:30,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:19:30,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:30,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:19:30,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:30,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:19:30,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:30,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:19:30,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:30,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 04:19:30,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:30,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 04:19:30,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:30,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:19:30,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:30,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-23 04:19:30,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:30,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-23 04:19:30,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:30,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-23 04:19:30,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:30,223 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-23 04:19:30,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:19:30,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137389284] [2022-07-23 04:19:30,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137389284] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:19:30,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:19:30,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:19:30,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678602627] [2022-07-23 04:19:30,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:19:30,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:19:30,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:19:30,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:19:30,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:19:30,225 INFO L87 Difference]: Start difference. First operand 3084 states and 4182 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 4 states have internal predecessors, (88), 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-23 04:19:33,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:19:33,273 INFO L93 Difference]: Finished difference Result 3084 states and 4182 transitions. [2022-07-23 04:19:33,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:19:33,273 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 4 states have internal predecessors, (88), 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 144 [2022-07-23 04:19:33,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:19:33,283 INFO L225 Difference]: With dead ends: 3084 [2022-07-23 04:19:33,283 INFO L226 Difference]: Without dead ends: 3082 [2022-07-23 04:19:33,285 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-23 04:19:33,285 INFO L413 NwaCegarLoop]: 2146 mSDtfsCounter, 3645 mSDsluCounter, 1514 mSDsCounter, 0 mSdLazyCounter, 2538 mSolverCounterSat, 2306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3807 SdHoareTripleChecker+Valid, 3660 SdHoareTripleChecker+Invalid, 4844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2306 IncrementalHoareTripleChecker+Valid, 2538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-07-23 04:19:33,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3807 Valid, 3660 Invalid, 4844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2306 Valid, 2538 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-07-23 04:19:33,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3082 states. [2022-07-23 04:19:33,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3082 to 3082. [2022-07-23 04:19:33,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3082 states, 2035 states have (on average 1.2186732186732188) internal successors, (2480), 2104 states have internal predecessors, (2480), 851 states have call successors, (851), 186 states have call predecessors, (851), 185 states have return successors, (849), 833 states have call predecessors, (849), 849 states have call successors, (849) [2022-07-23 04:19:33,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3082 states to 3082 states and 4180 transitions. [2022-07-23 04:19:33,424 INFO L78 Accepts]: Start accepts. Automaton has 3082 states and 4180 transitions. Word has length 144 [2022-07-23 04:19:33,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:19:33,424 INFO L495 AbstractCegarLoop]: Abstraction has 3082 states and 4180 transitions. [2022-07-23 04:19:33,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 4 states have internal predecessors, (88), 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-23 04:19:33,425 INFO L276 IsEmpty]: Start isEmpty. Operand 3082 states and 4180 transitions. [2022-07-23 04:19:33,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-07-23 04:19:33,427 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:19:33,427 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 3, 3, 3, 3, 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] [2022-07-23 04:19:33,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-23 04:19:33,428 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-23 04:19:33,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:19:33,428 INFO L85 PathProgramCache]: Analyzing trace with hash -916427719, now seen corresponding path program 1 times [2022-07-23 04:19:33,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:19:33,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833180301] [2022-07-23 04:19:33,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:19:33,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:19:33,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:33,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:19:33,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:33,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:19:33,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:33,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:19:33,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:33,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 04:19:33,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:33,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:19:33,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:33,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:19:33,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:33,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:19:33,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:33,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 04:19:33,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:33,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:19:33,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:33,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:19:33,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:33,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:19:33,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:33,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:19:33,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:33,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:19:33,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:33,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:19:33,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:33,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:19:33,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:33,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:19:33,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:33,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:19:33,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:33,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:19:33,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:33,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-23 04:19:33,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:33,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-23 04:19:33,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:33,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-23 04:19:33,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:33,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:19:33,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:33,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-23 04:19:33,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:33,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-23 04:19:33,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:33,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-23 04:19:33,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:33,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-23 04:19:33,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:33,669 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2022-07-23 04:19:33,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:19:33,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833180301] [2022-07-23 04:19:33,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833180301] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:19:33,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:19:33,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 04:19:33,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793242715] [2022-07-23 04:19:33,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:19:33,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 04:19:33,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:19:33,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 04:19:33,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-23 04:19:33,672 INFO L87 Difference]: Start difference. First operand 3082 states and 4180 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (25), 6 states have call predecessors, (25), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-23 04:19:39,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:19:39,385 INFO L93 Difference]: Finished difference Result 3451 states and 4628 transitions. [2022-07-23 04:19:39,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 04:19:39,386 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (25), 6 states have call predecessors, (25), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 173 [2022-07-23 04:19:39,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:19:39,403 INFO L225 Difference]: With dead ends: 3451 [2022-07-23 04:19:39,403 INFO L226 Difference]: Without dead ends: 3449 [2022-07-23 04:19:39,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-07-23 04:19:39,406 INFO L413 NwaCegarLoop]: 2169 mSDtfsCounter, 4095 mSDsluCounter, 2648 mSDsCounter, 0 mSdLazyCounter, 6571 mSolverCounterSat, 2962 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4221 SdHoareTripleChecker+Valid, 4817 SdHoareTripleChecker+Invalid, 9533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2962 IncrementalHoareTripleChecker+Valid, 6571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-07-23 04:19:39,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4221 Valid, 4817 Invalid, 9533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2962 Valid, 6571 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-07-23 04:19:39,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3449 states. [2022-07-23 04:19:39,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3449 to 3305. [2022-07-23 04:19:39,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3305 states, 2181 states have (on average 1.2104539202200826) internal successors, (2640), 2254 states have internal predecessors, (2640), 889 states have call successors, (889), 226 states have call predecessors, (889), 225 states have return successors, (887), 871 states have call predecessors, (887), 887 states have call successors, (887) [2022-07-23 04:19:39,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3305 states to 3305 states and 4416 transitions. [2022-07-23 04:19:39,570 INFO L78 Accepts]: Start accepts. Automaton has 3305 states and 4416 transitions. Word has length 173 [2022-07-23 04:19:39,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:19:39,570 INFO L495 AbstractCegarLoop]: Abstraction has 3305 states and 4416 transitions. [2022-07-23 04:19:39,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (25), 6 states have call predecessors, (25), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-23 04:19:39,570 INFO L276 IsEmpty]: Start isEmpty. Operand 3305 states and 4416 transitions. [2022-07-23 04:19:39,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-07-23 04:19:39,572 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:19:39,572 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-23 04:19:39,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-23 04:19:39,573 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-23 04:19:39,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:19:39,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1772980981, now seen corresponding path program 1 times [2022-07-23 04:19:39,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:19:39,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306635512] [2022-07-23 04:19:39,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:19:39,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:19:39,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:39,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:19:39,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:39,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:19:39,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:39,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:19:39,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:39,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:19:39,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:39,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:19:39,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:39,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:19:39,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:39,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:19:39,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:39,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:19:39,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:39,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:19:39,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:39,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:19:39,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:39,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:19:39,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:39,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:19:39,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:39,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:19:39,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:39,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:19:39,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:39,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:19:39,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:39,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:19:39,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:39,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 04:19:39,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:39,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 04:19:39,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:39,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:19:39,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:39,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-23 04:19:39,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:39,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-23 04:19:39,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:39,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-23 04:19:39,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:39,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-23 04:19:39,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:39,821 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-23 04:19:39,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:19:39,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306635512] [2022-07-23 04:19:39,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306635512] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:19:39,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:19:39,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:19:39,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134769316] [2022-07-23 04:19:39,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:19:39,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:19:39,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:19:39,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:19:39,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:19:39,824 INFO L87 Difference]: Start difference. First operand 3305 states and 4416 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 4 states have internal predecessors, (92), 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-23 04:19:42,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:19:42,780 INFO L93 Difference]: Finished difference Result 3305 states and 4416 transitions. [2022-07-23 04:19:42,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:19:42,780 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 4 states have internal predecessors, (92), 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 150 [2022-07-23 04:19:42,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:19:42,790 INFO L225 Difference]: With dead ends: 3305 [2022-07-23 04:19:42,790 INFO L226 Difference]: Without dead ends: 3303 [2022-07-23 04:19:42,792 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-23 04:19:42,792 INFO L413 NwaCegarLoop]: 2142 mSDtfsCounter, 3633 mSDsluCounter, 1514 mSDsCounter, 0 mSdLazyCounter, 2534 mSolverCounterSat, 2306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3794 SdHoareTripleChecker+Valid, 3656 SdHoareTripleChecker+Invalid, 4840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2306 IncrementalHoareTripleChecker+Valid, 2534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-07-23 04:19:42,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3794 Valid, 3656 Invalid, 4840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2306 Valid, 2534 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-07-23 04:19:42,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3303 states. [2022-07-23 04:19:42,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3303 to 3303. [2022-07-23 04:19:42,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3303 states, 2180 states have (on average 1.2100917431192661) internal successors, (2638), 2252 states have internal predecessors, (2638), 889 states have call successors, (889), 226 states have call predecessors, (889), 225 states have return successors, (887), 871 states have call predecessors, (887), 887 states have call successors, (887) [2022-07-23 04:19:42,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3303 states to 3303 states and 4414 transitions. [2022-07-23 04:19:42,938 INFO L78 Accepts]: Start accepts. Automaton has 3303 states and 4414 transitions. Word has length 150 [2022-07-23 04:19:42,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:19:42,938 INFO L495 AbstractCegarLoop]: Abstraction has 3303 states and 4414 transitions. [2022-07-23 04:19:42,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 4 states have internal predecessors, (92), 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-23 04:19:42,939 INFO L276 IsEmpty]: Start isEmpty. Operand 3303 states and 4414 transitions. [2022-07-23 04:19:42,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-07-23 04:19:42,940 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:19:42,941 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-23 04:19:42,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-23 04:19:42,941 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_linux_net_rtnetlink_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-23 04:19:42,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:19:42,941 INFO L85 PathProgramCache]: Analyzing trace with hash 634820414, now seen corresponding path program 1 times [2022-07-23 04:19:42,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:19:42,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790794582] [2022-07-23 04:19:42,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:19:42,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:19:42,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:43,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:19:43,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:43,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:19:43,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:43,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:19:43,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:43,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:19:43,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:43,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:19:43,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:43,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:19:43,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:43,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:19:43,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:43,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:19:43,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:43,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:19:43,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:43,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:19:43,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:43,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:19:43,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:43,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:19:43,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:43,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:19:43,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:43,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:19:43,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:43,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:19:43,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:43,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:19:43,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:43,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 04:19:43,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:43,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 04:19:43,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:43,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:19:43,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:43,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-23 04:19:43,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:43,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-23 04:19:43,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:43,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-23 04:19:43,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:43,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-23 04:19:43,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:43,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-23 04:19:43,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:43,118 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-23 04:19:43,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:19:43,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790794582] [2022-07-23 04:19:43,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790794582] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:19:43,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:19:43,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:19:43,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491994809] [2022-07-23 04:19:43,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:19:43,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:19:43,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:19:43,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:19:43,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:19:43,120 INFO L87 Difference]: Start difference. First operand 3303 states and 4414 transitions. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 4 states have internal predecessors, (96), 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-23 04:19:46,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:19:46,326 INFO L93 Difference]: Finished difference Result 3303 states and 4414 transitions. [2022-07-23 04:19:46,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:19:46,327 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 4 states have internal predecessors, (96), 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 156 [2022-07-23 04:19:46,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:19:46,340 INFO L225 Difference]: With dead ends: 3303 [2022-07-23 04:19:46,340 INFO L226 Difference]: Without dead ends: 3301 [2022-07-23 04:19:46,341 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-23 04:19:46,341 INFO L413 NwaCegarLoop]: 2140 mSDtfsCounter, 3627 mSDsluCounter, 1514 mSDsCounter, 0 mSdLazyCounter, 2532 mSolverCounterSat, 2306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3787 SdHoareTripleChecker+Valid, 3654 SdHoareTripleChecker+Invalid, 4838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2306 IncrementalHoareTripleChecker+Valid, 2532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-07-23 04:19:46,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3787 Valid, 3654 Invalid, 4838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2306 Valid, 2532 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-07-23 04:19:46,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3301 states. [2022-07-23 04:19:46,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3301 to 3301. [2022-07-23 04:19:46,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3301 states, 2179 states have (on average 1.2097292335933916) internal successors, (2636), 2250 states have internal predecessors, (2636), 889 states have call successors, (889), 226 states have call predecessors, (889), 225 states have return successors, (887), 871 states have call predecessors, (887), 887 states have call successors, (887) [2022-07-23 04:19:46,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3301 states to 3301 states and 4412 transitions. [2022-07-23 04:19:46,487 INFO L78 Accepts]: Start accepts. Automaton has 3301 states and 4412 transitions. Word has length 156 [2022-07-23 04:19:46,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:19:46,488 INFO L495 AbstractCegarLoop]: Abstraction has 3301 states and 4412 transitions. [2022-07-23 04:19:46,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 4 states have internal predecessors, (96), 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-23 04:19:46,488 INFO L276 IsEmpty]: Start isEmpty. Operand 3301 states and 4412 transitions. [2022-07-23 04:19:46,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-07-23 04:19:46,490 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:19:46,490 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-23 04:19:46,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-23 04:19:46,490 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_linux_net_sock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-23 04:19:46,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:19:46,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1970890977, now seen corresponding path program 1 times [2022-07-23 04:19:46,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:19:46,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860845619] [2022-07-23 04:19:46,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:19:46,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:19:46,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:46,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:19:46,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:46,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:19:46,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:46,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:19:46,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:46,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:19:46,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:46,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:19:46,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:46,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:19:46,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:46,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:19:46,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:46,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:19:46,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:46,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:19:46,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:46,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:19:46,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:46,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:19:46,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:46,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:19:46,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:46,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:19:46,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:46,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:19:46,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:46,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:19:46,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:46,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:19:46,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:46,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 04:19:46,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:46,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 04:19:46,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:46,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:19:46,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:46,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-23 04:19:46,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:46,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-23 04:19:46,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:46,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-23 04:19:46,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:46,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-23 04:19:46,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:46,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-23 04:19:46,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:46,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-23 04:19:46,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:46,694 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-23 04:19:46,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:19:46,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860845619] [2022-07-23 04:19:46,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860845619] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:19:46,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:19:46,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:19:46,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515267380] [2022-07-23 04:19:46,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:19:46,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:19:46,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:19:46,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:19:46,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:19:46,698 INFO L87 Difference]: Start difference. First operand 3301 states and 4412 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 4 states have internal predecessors, (100), 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-23 04:19:50,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:19:50,120 INFO L93 Difference]: Finished difference Result 3301 states and 4412 transitions. [2022-07-23 04:19:50,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:19:50,121 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 4 states have internal predecessors, (100), 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 162 [2022-07-23 04:19:50,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:19:50,133 INFO L225 Difference]: With dead ends: 3301 [2022-07-23 04:19:50,133 INFO L226 Difference]: Without dead ends: 3299 [2022-07-23 04:19:50,136 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-23 04:19:50,136 INFO L413 NwaCegarLoop]: 2138 mSDtfsCounter, 3621 mSDsluCounter, 1514 mSDsCounter, 0 mSdLazyCounter, 2530 mSolverCounterSat, 2306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3780 SdHoareTripleChecker+Valid, 3652 SdHoareTripleChecker+Invalid, 4836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2306 IncrementalHoareTripleChecker+Valid, 2530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-07-23 04:19:50,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3780 Valid, 3652 Invalid, 4836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2306 Valid, 2530 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-07-23 04:19:50,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3299 states. [2022-07-23 04:19:50,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3299 to 3299. [2022-07-23 04:19:50,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3299 states, 2178 states have (on average 1.209366391184573) internal successors, (2634), 2248 states have internal predecessors, (2634), 889 states have call successors, (889), 226 states have call predecessors, (889), 225 states have return successors, (887), 871 states have call predecessors, (887), 887 states have call successors, (887) [2022-07-23 04:19:50,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3299 states to 3299 states and 4410 transitions. [2022-07-23 04:19:50,348 INFO L78 Accepts]: Start accepts. Automaton has 3299 states and 4410 transitions. Word has length 162 [2022-07-23 04:19:50,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:19:50,348 INFO L495 AbstractCegarLoop]: Abstraction has 3299 states and 4410 transitions. [2022-07-23 04:19:50,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 4 states have internal predecessors, (100), 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-23 04:19:50,348 INFO L276 IsEmpty]: Start isEmpty. Operand 3299 states and 4410 transitions. [2022-07-23 04:19:50,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-07-23 04:19:50,351 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:19:50,351 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-23 04:19:50,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-23 04:19:50,351 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-23 04:19:50,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:19:50,351 INFO L85 PathProgramCache]: Analyzing trace with hash -356517854, now seen corresponding path program 1 times [2022-07-23 04:19:50,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:19:50,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803440609] [2022-07-23 04:19:50,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:19:50,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:19:50,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:50,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:19:50,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:50,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:19:50,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:50,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:19:50,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:50,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:19:50,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:50,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:19:50,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:50,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:19:50,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:50,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:19:50,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:50,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:19:50,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:50,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:19:50,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:50,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:19:50,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:50,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:19:50,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:50,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:19:50,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:50,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:19:50,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:50,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:19:50,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:50,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:19:50,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:50,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:19:50,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:50,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 04:19:50,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:50,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 04:19:50,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:50,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:19:50,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:50,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-23 04:19:50,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:50,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-23 04:19:50,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:50,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-23 04:19:50,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:50,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-23 04:19:50,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:50,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-23 04:19:50,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:50,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-23 04:19:50,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:50,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-23 04:19:50,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:50,581 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-23 04:19:50,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:19:50,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803440609] [2022-07-23 04:19:50,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803440609] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:19:50,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:19:50,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:19:50,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573969456] [2022-07-23 04:19:50,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:19:50,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:19:50,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:19:50,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:19:50,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:19:50,584 INFO L87 Difference]: Start difference. First operand 3299 states and 4410 transitions. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 4 states have internal predecessors, (104), 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-23 04:19:53,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:19:53,802 INFO L93 Difference]: Finished difference Result 3299 states and 4410 transitions. [2022-07-23 04:19:53,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:19:53,805 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 4 states have internal predecessors, (104), 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 168 [2022-07-23 04:19:53,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:19:53,829 INFO L225 Difference]: With dead ends: 3299 [2022-07-23 04:19:53,843 INFO L226 Difference]: Without dead ends: 3297 [2022-07-23 04:19:53,846 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-23 04:19:53,846 INFO L413 NwaCegarLoop]: 2136 mSDtfsCounter, 3615 mSDsluCounter, 1514 mSDsCounter, 0 mSdLazyCounter, 2528 mSolverCounterSat, 2306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3773 SdHoareTripleChecker+Valid, 3650 SdHoareTripleChecker+Invalid, 4834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2306 IncrementalHoareTripleChecker+Valid, 2528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-07-23 04:19:53,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3773 Valid, 3650 Invalid, 4834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2306 Valid, 2528 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-07-23 04:19:53,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3297 states. [2022-07-23 04:19:54,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3297 to 3297. [2022-07-23 04:19:54,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3297 states, 2177 states have (on average 1.2090032154340835) internal successors, (2632), 2246 states have internal predecessors, (2632), 889 states have call successors, (889), 226 states have call predecessors, (889), 225 states have return successors, (887), 871 states have call predecessors, (887), 887 states have call successors, (887) [2022-07-23 04:19:54,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3297 states to 3297 states and 4408 transitions. [2022-07-23 04:19:54,022 INFO L78 Accepts]: Start accepts. Automaton has 3297 states and 4408 transitions. Word has length 168 [2022-07-23 04:19:54,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:19:54,023 INFO L495 AbstractCegarLoop]: Abstraction has 3297 states and 4408 transitions. [2022-07-23 04:19:54,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 4 states have internal predecessors, (104), 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-23 04:19:54,023 INFO L276 IsEmpty]: Start isEmpty. Operand 3297 states and 4408 transitions. [2022-07-23 04:19:54,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-07-23 04:19:54,025 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:19:54,026 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:19:54,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-23 04:19:54,026 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-23 04:19:54,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:19:54,026 INFO L85 PathProgramCache]: Analyzing trace with hash -2019610945, now seen corresponding path program 1 times [2022-07-23 04:19:54,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:19:54,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953766581] [2022-07-23 04:19:54,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:19:54,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:19:54,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:54,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:19:54,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:54,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:19:54,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:54,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:19:54,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:54,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:19:54,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:54,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:19:54,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:54,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:19:54,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:54,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:19:54,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:54,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:19:54,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:54,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:19:54,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:54,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:19:54,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:54,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:19:54,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:54,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:19:54,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:54,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:19:54,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:54,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:19:54,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:54,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:19:54,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:54,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:19:54,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:54,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 04:19:54,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:54,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 04:19:54,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:54,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:19:54,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:54,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-23 04:19:54,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:54,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-23 04:19:54,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:54,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-23 04:19:54,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:54,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-23 04:19:54,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:54,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-23 04:19:54,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:54,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-23 04:19:54,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:54,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-23 04:19:54,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:54,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-23 04:19:54,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:54,262 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-23 04:19:54,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:19:54,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953766581] [2022-07-23 04:19:54,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953766581] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:19:54,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:19:54,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:19:54,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953538307] [2022-07-23 04:19:54,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:19:54,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:19:54,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:19:54,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:19:54,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:19:54,265 INFO L87 Difference]: Start difference. First operand 3297 states and 4408 transitions. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 4 states have internal predecessors, (108), 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-23 04:19:57,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:19:57,722 INFO L93 Difference]: Finished difference Result 3297 states and 4408 transitions. [2022-07-23 04:19:57,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:19:57,723 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 4 states have internal predecessors, (108), 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 174 [2022-07-23 04:19:57,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:19:57,732 INFO L225 Difference]: With dead ends: 3297 [2022-07-23 04:19:57,732 INFO L226 Difference]: Without dead ends: 3295 [2022-07-23 04:19:57,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-23 04:19:57,734 INFO L413 NwaCegarLoop]: 2134 mSDtfsCounter, 3609 mSDsluCounter, 1514 mSDsCounter, 0 mSdLazyCounter, 2526 mSolverCounterSat, 2306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3766 SdHoareTripleChecker+Valid, 3648 SdHoareTripleChecker+Invalid, 4832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2306 IncrementalHoareTripleChecker+Valid, 2526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-07-23 04:19:57,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3766 Valid, 3648 Invalid, 4832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2306 Valid, 2526 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-07-23 04:19:57,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3295 states. [2022-07-23 04:19:57,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3295 to 3295. [2022-07-23 04:19:57,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3295 states, 2176 states have (on average 1.208639705882353) internal successors, (2630), 2244 states have internal predecessors, (2630), 889 states have call successors, (889), 226 states have call predecessors, (889), 225 states have return successors, (887), 871 states have call predecessors, (887), 887 states have call successors, (887) [2022-07-23 04:19:57,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3295 states to 3295 states and 4406 transitions. [2022-07-23 04:19:57,897 INFO L78 Accepts]: Start accepts. Automaton has 3295 states and 4406 transitions. Word has length 174 [2022-07-23 04:19:57,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:19:57,898 INFO L495 AbstractCegarLoop]: Abstraction has 3295 states and 4406 transitions. [2022-07-23 04:19:57,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 4 states have internal predecessors, (108), 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-23 04:19:57,898 INFO L276 IsEmpty]: Start isEmpty. Operand 3295 states and 4406 transitions. [2022-07-23 04:19:57,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-07-23 04:19:57,902 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:19:57,902 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-23 04:19:57,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-23 04:19:57,902 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_linux_usb_urb_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-23 04:19:57,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:19:57,903 INFO L85 PathProgramCache]: Analyzing trace with hash -398535084, now seen corresponding path program 1 times [2022-07-23 04:19:57,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:19:57,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868707800] [2022-07-23 04:19:57,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:19:57,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:19:57,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:57,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:19:57,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:57,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:19:57,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:57,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:19:57,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:58,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:19:58,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:58,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:19:58,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:58,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:19:58,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:58,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:19:58,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:58,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:19:58,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:58,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:19:58,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:58,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:19:58,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:58,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:19:58,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:58,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:19:58,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:58,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:19:58,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:58,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:19:58,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:58,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:19:58,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:58,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:19:58,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:58,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 04:19:58,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:58,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 04:19:58,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:58,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:19:58,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:58,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-23 04:19:58,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:58,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-23 04:19:58,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:58,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-23 04:19:58,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:58,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-23 04:19:58,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:58,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-23 04:19:58,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:58,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-23 04:19:58,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:58,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-23 04:19:58,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:58,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-23 04:19:58,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:58,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-23 04:19:58,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:58,180 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-23 04:19:58,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:19:58,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868707800] [2022-07-23 04:19:58,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868707800] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:19:58,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:19:58,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:19:58,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331087018] [2022-07-23 04:19:58,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:19:58,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:19:58,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:19:58,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:19:58,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:19:58,182 INFO L87 Difference]: Start difference. First operand 3295 states and 4406 transitions. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 4 states have internal predecessors, (112), 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-23 04:20:00,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:20:00,664 INFO L93 Difference]: Finished difference Result 3295 states and 4406 transitions. [2022-07-23 04:20:00,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:20:00,664 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 4 states have internal predecessors, (112), 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 180 [2022-07-23 04:20:00,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:20:00,678 INFO L225 Difference]: With dead ends: 3295 [2022-07-23 04:20:00,678 INFO L226 Difference]: Without dead ends: 3123 [2022-07-23 04:20:00,681 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-23 04:20:00,681 INFO L413 NwaCegarLoop]: 2133 mSDtfsCounter, 3600 mSDsluCounter, 1514 mSDsCounter, 0 mSdLazyCounter, 2526 mSolverCounterSat, 2306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3756 SdHoareTripleChecker+Valid, 3647 SdHoareTripleChecker+Invalid, 4832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2306 IncrementalHoareTripleChecker+Valid, 2526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-23 04:20:00,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3756 Valid, 3647 Invalid, 4832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2306 Valid, 2526 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-07-23 04:20:00,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3123 states. [2022-07-23 04:20:00,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3123 to 3123. [2022-07-23 04:20:00,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3123 states, 2073 states have (on average 1.2175590931017848) internal successors, (2524), 2139 states have internal predecessors, (2524), 840 states have call successors, (840), 206 states have call predecessors, (840), 206 states have return successors, (840), 824 states have call predecessors, (840), 840 states have call successors, (840) [2022-07-23 04:20:00,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 4204 transitions. [2022-07-23 04:20:00,862 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 4204 transitions. Word has length 180 [2022-07-23 04:20:00,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:20:00,862 INFO L495 AbstractCegarLoop]: Abstraction has 3123 states and 4204 transitions. [2022-07-23 04:20:00,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 4 states have internal predecessors, (112), 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-23 04:20:00,863 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 4204 transitions. [2022-07-23 04:20:00,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2022-07-23 04:20:00,865 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:20:00,865 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 4, 4, 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] [2022-07-23 04:20:00,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-23 04:20:00,865 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-23 04:20:00,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:20:00,866 INFO L85 PathProgramCache]: Analyzing trace with hash 2021555018, now seen corresponding path program 1 times [2022-07-23 04:20:00,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:20:00,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715904127] [2022-07-23 04:20:00,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:20:00,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:20:00,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:00,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:20:00,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:00,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:20:00,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:00,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:20:00,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:00,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 04:20:00,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:00,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:00,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:00,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:20:00,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:00,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:20:00,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:00,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 04:20:00,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:00,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:00,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:01,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:20:01,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:01,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:20:01,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:01,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:20:01,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:01,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:01,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:01,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:20:01,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:01,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:20:01,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:01,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:20:01,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:01,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:20:01,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:01,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:20:01,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:01,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-23 04:20:01,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:01,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-23 04:20:01,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:01,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-23 04:20:01,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:01,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:01,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:01,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-23 04:20:01,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:01,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-23 04:20:01,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:01,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-23 04:20:01,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:01,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-23 04:20:01,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:01,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-23 04:20:01,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:01,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-23 04:20:01,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:01,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:01,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:01,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-23 04:20:01,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:01,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:01,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:01,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-23 04:20:01,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:01,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-23 04:20:01,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:01,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-23 04:20:01,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:01,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:01,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:01,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:20:01,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:01,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:20:01,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:01,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:20:01,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:01,127 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 283 trivial. 0 not checked. [2022-07-23 04:20:01,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:20:01,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715904127] [2022-07-23 04:20:01,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715904127] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:20:01,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:20:01,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-23 04:20:01,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24597096] [2022-07-23 04:20:01,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:20:01,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 04:20:01,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:20:01,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 04:20:01,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-23 04:20:01,129 INFO L87 Difference]: Start difference. First operand 3123 states and 4204 transitions. Second operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 4 states have internal predecessors, (91), 3 states have call successors, (35), 7 states have call predecessors, (35), 2 states have return successors, (32), 2 states have call predecessors, (32), 3 states have call successors, (32) [2022-07-23 04:20:06,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:20:06,729 INFO L93 Difference]: Finished difference Result 3353 states and 4537 transitions. [2022-07-23 04:20:06,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-23 04:20:06,729 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 4 states have internal predecessors, (91), 3 states have call successors, (35), 7 states have call predecessors, (35), 2 states have return successors, (32), 2 states have call predecessors, (32), 3 states have call successors, (32) Word has length 226 [2022-07-23 04:20:06,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:20:06,768 INFO L225 Difference]: With dead ends: 3353 [2022-07-23 04:20:06,769 INFO L226 Difference]: Without dead ends: 3351 [2022-07-23 04:20:06,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 80 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=130, Invalid=290, Unknown=0, NotChecked=0, Total=420 [2022-07-23 04:20:06,774 INFO L413 NwaCegarLoop]: 2045 mSDtfsCounter, 4153 mSDsluCounter, 3246 mSDsCounter, 0 mSdLazyCounter, 6622 mSolverCounterSat, 3770 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4167 SdHoareTripleChecker+Valid, 5291 SdHoareTripleChecker+Invalid, 10392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3770 IncrementalHoareTripleChecker+Valid, 6622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-07-23 04:20:06,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4167 Valid, 5291 Invalid, 10392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3770 Valid, 6622 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2022-07-23 04:20:06,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3351 states. [2022-07-23 04:20:06,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3351 to 3121. [2022-07-23 04:20:06,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3121 states, 2072 states have (on average 1.2166988416988418) internal successors, (2521), 2137 states have internal predecessors, (2521), 840 states have call successors, (840), 206 states have call predecessors, (840), 206 states have return successors, (840), 824 states have call predecessors, (840), 840 states have call successors, (840) [2022-07-23 04:20:06,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 4201 transitions. [2022-07-23 04:20:06,969 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 4201 transitions. Word has length 226 [2022-07-23 04:20:06,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:20:06,969 INFO L495 AbstractCegarLoop]: Abstraction has 3121 states and 4201 transitions. [2022-07-23 04:20:06,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 4 states have internal predecessors, (91), 3 states have call successors, (35), 7 states have call predecessors, (35), 2 states have return successors, (32), 2 states have call predecessors, (32), 3 states have call successors, (32) [2022-07-23 04:20:06,970 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 4201 transitions. [2022-07-23 04:20:06,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2022-07-23 04:20:06,973 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:20:06,973 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 7, 7, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:20:06,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-23 04:20:06,974 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-23 04:20:06,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:20:06,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1958435665, now seen corresponding path program 1 times [2022-07-23 04:20:06,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:20:06,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806448351] [2022-07-23 04:20:06,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:20:06,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:20:07,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:07,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:20:07,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:07,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:20:07,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:07,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:20:07,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:07,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 04:20:07,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:07,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:07,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:07,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:20:07,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:07,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:20:07,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:07,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 04:20:07,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:07,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:07,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:07,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:20:07,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:07,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:20:07,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:07,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:20:07,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:07,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:07,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:07,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:20:07,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:07,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:20:07,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:07,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:20:07,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:07,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:20:07,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:07,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:20:07,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:07,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:20:07,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:07,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:07,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:07,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-23 04:20:07,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:07,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-23 04:20:07,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:07,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-23 04:20:07,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:07,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:07,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:07,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-23 04:20:07,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:07,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-23 04:20:07,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:07,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:07,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:07,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-23 04:20:07,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:07,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-23 04:20:07,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:07,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-23 04:20:07,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:07,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-07-23 04:20:07,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:07,274 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2022-07-23 04:20:07,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:20:07,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806448351] [2022-07-23 04:20:07,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806448351] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:20:07,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:20:07,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 04:20:07,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754332481] [2022-07-23 04:20:07,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:20:07,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 04:20:07,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:20:07,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 04:20:07,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-23 04:20:07,277 INFO L87 Difference]: Start difference. First operand 3121 states and 4201 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (24), 5 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-23 04:20:11,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:20:11,513 INFO L93 Difference]: Finished difference Result 6551 states and 8854 transitions. [2022-07-23 04:20:11,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 04:20:11,514 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (24), 5 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 220 [2022-07-23 04:20:11,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:20:11,554 INFO L225 Difference]: With dead ends: 6551 [2022-07-23 04:20:11,555 INFO L226 Difference]: Without dead ends: 3449 [2022-07-23 04:20:11,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-07-23 04:20:11,581 INFO L413 NwaCegarLoop]: 1833 mSDtfsCounter, 3250 mSDsluCounter, 2103 mSDsCounter, 0 mSdLazyCounter, 4141 mSolverCounterSat, 3244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3250 SdHoareTripleChecker+Valid, 3936 SdHoareTripleChecker+Invalid, 7385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3244 IncrementalHoareTripleChecker+Valid, 4141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-07-23 04:20:11,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3250 Valid, 3936 Invalid, 7385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3244 Valid, 4141 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-07-23 04:20:11,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3449 states. [2022-07-23 04:20:11,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3449 to 3122. [2022-07-23 04:20:11,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3122 states, 2073 states have (on average 1.216594307766522) internal successors, (2522), 2138 states have internal predecessors, (2522), 840 states have call successors, (840), 206 states have call predecessors, (840), 206 states have return successors, (840), 824 states have call predecessors, (840), 840 states have call successors, (840) [2022-07-23 04:20:11,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 4202 transitions. [2022-07-23 04:20:11,814 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 4202 transitions. Word has length 220 [2022-07-23 04:20:11,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:20:11,815 INFO L495 AbstractCegarLoop]: Abstraction has 3122 states and 4202 transitions. [2022-07-23 04:20:11,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (24), 5 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-23 04:20:11,815 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 4202 transitions. [2022-07-23 04:20:11,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2022-07-23 04:20:11,818 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:20:11,818 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 7, 7, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:20:11,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-23 04:20:11,818 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-23 04:20:11,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:20:11,819 INFO L85 PathProgramCache]: Analyzing trace with hash 2115564295, now seen corresponding path program 1 times [2022-07-23 04:20:11,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:20:11,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074172927] [2022-07-23 04:20:11,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:20:11,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:20:11,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:11,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:20:11,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:11,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:20:11,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:11,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:20:11,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:11,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 04:20:11,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:11,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:11,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:12,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:20:12,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:12,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:20:12,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:12,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 04:20:12,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:12,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:12,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:12,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:20:12,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:12,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:20:12,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:12,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:20:12,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:12,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:12,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:12,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:20:12,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:12,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:20:12,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:12,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:20:12,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:12,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:20:12,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:12,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:20:12,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:12,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:20:12,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:12,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:12,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:12,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-23 04:20:12,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:12,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-23 04:20:12,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:12,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-23 04:20:12,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:12,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:12,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:12,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-23 04:20:12,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:12,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-23 04:20:12,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:12,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:12,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:12,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-23 04:20:12,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:12,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-07-23 04:20:12,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:12,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-23 04:20:12,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:12,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-07-23 04:20:12,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:12,110 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2022-07-23 04:20:12,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:20:12,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074172927] [2022-07-23 04:20:12,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074172927] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 04:20:12,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581792167] [2022-07-23 04:20:12,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:20:12,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:20:12,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 04:20:12,113 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-23 04:20:12,114 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-23 04:20:12,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:12,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 2622 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 04:20:12,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 04:20:12,848 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2022-07-23 04:20:12,850 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 04:20:12,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581792167] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:20:12,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 04:20:12,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2022-07-23 04:20:12,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190604674] [2022-07-23 04:20:12,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:20:12,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 04:20:12,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:20:12,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 04:20:12,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-23 04:20:12,852 INFO L87 Difference]: Start difference. First operand 3122 states and 4202 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-23 04:20:13,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:20:13,100 INFO L93 Difference]: Finished difference Result 6953 states and 9438 transitions. [2022-07-23 04:20:13,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 04:20:13,103 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 223 [2022-07-23 04:20:13,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:20:13,117 INFO L225 Difference]: With dead ends: 6953 [2022-07-23 04:20:13,118 INFO L226 Difference]: Without dead ends: 3850 [2022-07-23 04:20:13,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-23 04:20:13,130 INFO L413 NwaCegarLoop]: 2903 mSDtfsCounter, 403 mSDsluCounter, 2373 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 5276 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 04:20:13,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 5276 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 04:20:13,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3850 states. [2022-07-23 04:20:13,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3850 to 3123. [2022-07-23 04:20:13,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3123 states, 2074 states have (on average 1.2164898746383799) internal successors, (2523), 2139 states have internal predecessors, (2523), 840 states have call successors, (840), 206 states have call predecessors, (840), 206 states have return successors, (840), 824 states have call predecessors, (840), 840 states have call successors, (840) [2022-07-23 04:20:13,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 4203 transitions. [2022-07-23 04:20:13,331 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 4203 transitions. Word has length 223 [2022-07-23 04:20:13,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:20:13,331 INFO L495 AbstractCegarLoop]: Abstraction has 3123 states and 4203 transitions. [2022-07-23 04:20:13,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-23 04:20:13,331 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 4203 transitions. [2022-07-23 04:20:13,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2022-07-23 04:20:13,334 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:20:13,335 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 4, 4, 3, 3, 3, 3, 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] [2022-07-23 04:20:13,357 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-23 04:20:13,557 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,SelfDestructingSolverStorable26 [2022-07-23 04:20:13,557 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-23 04:20:13,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:20:13,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1887379189, now seen corresponding path program 1 times [2022-07-23 04:20:13,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:20:13,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710931999] [2022-07-23 04:20:13,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:20:13,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:20:13,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:13,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:20:13,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:13,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:20:13,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:13,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:20:13,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:13,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 04:20:13,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:13,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:13,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:13,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:20:13,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:13,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:20:13,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:13,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 04:20:13,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:13,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:13,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:13,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:20:13,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:13,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:20:13,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:13,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:20:13,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:13,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:13,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:13,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:20:13,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:13,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:20:13,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:13,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:20:13,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:13,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:20:13,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:13,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:20:13,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:13,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-23 04:20:13,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:13,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-23 04:20:13,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:13,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-23 04:20:13,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:13,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:13,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:13,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-23 04:20:13,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:13,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-23 04:20:13,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:13,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-23 04:20:13,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:13,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-23 04:20:13,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:13,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-23 04:20:13,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:13,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:13,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:13,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-23 04:20:13,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:13,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-23 04:20:13,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:13,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-23 04:20:13,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:13,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-23 04:20:13,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:13,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-07-23 04:20:13,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:13,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-07-23 04:20:13,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:13,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:13,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:13,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-07-23 04:20:13,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:13,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:13,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:13,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2022-07-23 04:20:13,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:13,833 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 307 trivial. 0 not checked. [2022-07-23 04:20:13,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:20:13,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710931999] [2022-07-23 04:20:13,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710931999] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:20:13,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:20:13,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 04:20:13,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885514629] [2022-07-23 04:20:13,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:20:13,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 04:20:13,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:20:13,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 04:20:13,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-23 04:20:13,835 INFO L87 Difference]: Start difference. First operand 3123 states and 4203 transitions. Second operand has 8 states, 8 states have (on average 12.75) internal successors, (102), 3 states have internal predecessors, (102), 3 states have call successors, (37), 7 states have call predecessors, (37), 2 states have return successors, (32), 2 states have call predecessors, (32), 3 states have call successors, (32) [2022-07-23 04:20:20,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:20:20,096 INFO L93 Difference]: Finished difference Result 6684 states and 9069 transitions. [2022-07-23 04:20:20,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-23 04:20:20,097 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 3 states have internal predecessors, (102), 3 states have call successors, (37), 7 states have call predecessors, (37), 2 states have return successors, (32), 2 states have call predecessors, (32), 3 states have call successors, (32) Word has length 243 [2022-07-23 04:20:20,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:20:20,116 INFO L225 Difference]: With dead ends: 6684 [2022-07-23 04:20:20,117 INFO L226 Difference]: Without dead ends: 3580 [2022-07-23 04:20:20,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2022-07-23 04:20:20,128 INFO L413 NwaCegarLoop]: 1835 mSDtfsCounter, 4072 mSDsluCounter, 2538 mSDsCounter, 0 mSdLazyCounter, 4802 mSolverCounterSat, 4153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4072 SdHoareTripleChecker+Valid, 4373 SdHoareTripleChecker+Invalid, 8955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4153 IncrementalHoareTripleChecker+Valid, 4802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-07-23 04:20:20,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4072 Valid, 4373 Invalid, 8955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4153 Valid, 4802 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2022-07-23 04:20:20,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3580 states. [2022-07-23 04:20:20,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3580 to 3127. [2022-07-23 04:20:20,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3127 states, 2078 states have (on average 1.216073147256978) internal successors, (2527), 2143 states have internal predecessors, (2527), 840 states have call successors, (840), 206 states have call predecessors, (840), 206 states have return successors, (840), 824 states have call predecessors, (840), 840 states have call successors, (840) [2022-07-23 04:20:20,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 4207 transitions. [2022-07-23 04:20:20,326 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 4207 transitions. Word has length 243 [2022-07-23 04:20:20,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:20:20,326 INFO L495 AbstractCegarLoop]: Abstraction has 3127 states and 4207 transitions. [2022-07-23 04:20:20,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 3 states have internal predecessors, (102), 3 states have call successors, (37), 7 states have call predecessors, (37), 2 states have return successors, (32), 2 states have call predecessors, (32), 3 states have call successors, (32) [2022-07-23 04:20:20,327 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 4207 transitions. [2022-07-23 04:20:20,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2022-07-23 04:20:20,331 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:20:20,331 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 4, 4, 3, 3, 3, 3, 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] [2022-07-23 04:20:20,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-23 04:20:20,331 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-23 04:20:20,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:20:20,332 INFO L85 PathProgramCache]: Analyzing trace with hash 2145367829, now seen corresponding path program 1 times [2022-07-23 04:20:20,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:20:20,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91077713] [2022-07-23 04:20:20,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:20:20,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:20:20,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:20,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:20:20,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:20,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:20:20,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:20,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:20:20,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:20,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 04:20:20,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:20,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:20,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:20,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:20:20,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:20,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:20:20,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:20,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 04:20:20,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:20,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:20,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:20,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:20:20,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:20,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:20:20,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:20,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:20:20,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:20,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:20,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:20,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:20:20,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:20,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:20:20,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:20,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:20:20,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:20,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:20:20,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:20,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:20:20,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:20,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-23 04:20:20,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:20,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-23 04:20:20,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:20,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-23 04:20:20,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:20,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:20,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:20,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-23 04:20:20,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:20,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-23 04:20:20,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:20,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-23 04:20:20,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:20,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-23 04:20:20,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:20,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-23 04:20:20,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:20,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:20,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:20,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-23 04:20:20,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:20,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-23 04:20:20,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:20,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-23 04:20:20,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:20,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-23 04:20:20,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:20,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-07-23 04:20:20,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:20,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-07-23 04:20:20,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:20,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:20,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:20,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-23 04:20:20,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:20,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:20,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:20,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2022-07-23 04:20:20,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:20,656 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2022-07-23 04:20:20,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:20:20,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91077713] [2022-07-23 04:20:20,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91077713] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 04:20:20,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021644928] [2022-07-23 04:20:20,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:20:20,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:20:20,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 04:20:20,666 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-23 04:20:20,668 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-23 04:20:21,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:21,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 2460 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 04:20:21,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 04:20:21,472 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2022-07-23 04:20:21,475 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 04:20:21,612 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2022-07-23 04:20:21,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1021644928] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 04:20:21,626 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 04:20:21,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4, 4] total 11 [2022-07-23 04:20:21,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800549849] [2022-07-23 04:20:21,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 04:20:21,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-23 04:20:21,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:20:21,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-23 04:20:21,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-07-23 04:20:21,628 INFO L87 Difference]: Start difference. First operand 3127 states and 4207 transitions. Second operand has 11 states, 11 states have (on average 11.818181818181818) internal successors, (130), 6 states have internal predecessors, (130), 3 states have call successors, (52), 7 states have call predecessors, (52), 2 states have return successors, (36), 2 states have call predecessors, (36), 3 states have call successors, (36) [2022-07-23 04:20:27,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:20:27,622 INFO L93 Difference]: Finished difference Result 6824 states and 9275 transitions. [2022-07-23 04:20:27,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-23 04:20:27,623 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 11.818181818181818) internal successors, (130), 6 states have internal predecessors, (130), 3 states have call successors, (52), 7 states have call predecessors, (52), 2 states have return successors, (36), 2 states have call predecessors, (36), 3 states have call successors, (36) Word has length 251 [2022-07-23 04:20:27,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:20:27,653 INFO L225 Difference]: With dead ends: 6824 [2022-07-23 04:20:27,653 INFO L226 Difference]: Without dead ends: 3716 [2022-07-23 04:20:27,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 603 GetRequests, 576 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=252, Invalid=560, Unknown=0, NotChecked=0, Total=812 [2022-07-23 04:20:27,666 INFO L413 NwaCegarLoop]: 1838 mSDtfsCounter, 4263 mSDsluCounter, 2538 mSDsCounter, 0 mSdLazyCounter, 4922 mSolverCounterSat, 4378 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4263 SdHoareTripleChecker+Valid, 4376 SdHoareTripleChecker+Invalid, 9300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4378 IncrementalHoareTripleChecker+Valid, 4922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-07-23 04:20:27,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4263 Valid, 4376 Invalid, 9300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4378 Valid, 4922 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-07-23 04:20:27,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3716 states. [2022-07-23 04:20:27,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3716 to 3223. [2022-07-23 04:20:27,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3223 states, 2150 states have (on average 1.2144186046511627) internal successors, (2611), 2215 states have internal predecessors, (2611), 864 states have call successors, (864), 206 states have call predecessors, (864), 206 states have return successors, (864), 848 states have call predecessors, (864), 864 states have call successors, (864) [2022-07-23 04:20:27,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3223 states to 3223 states and 4339 transitions. [2022-07-23 04:20:27,871 INFO L78 Accepts]: Start accepts. Automaton has 3223 states and 4339 transitions. Word has length 251 [2022-07-23 04:20:27,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:20:27,871 INFO L495 AbstractCegarLoop]: Abstraction has 3223 states and 4339 transitions. [2022-07-23 04:20:27,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.818181818181818) internal successors, (130), 6 states have internal predecessors, (130), 3 states have call successors, (52), 7 states have call predecessors, (52), 2 states have return successors, (36), 2 states have call predecessors, (36), 3 states have call successors, (36) [2022-07-23 04:20:27,872 INFO L276 IsEmpty]: Start isEmpty. Operand 3223 states and 4339 transitions. [2022-07-23 04:20:27,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2022-07-23 04:20:27,875 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:20:27,876 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 7, 7, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:20:27,899 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-23 04:20:28,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-07-23 04:20:28,092 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-23 04:20:28,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:20:28,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1941528660, now seen corresponding path program 1 times [2022-07-23 04:20:28,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:20:28,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215684722] [2022-07-23 04:20:28,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:20:28,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:20:28,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:28,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:20:28,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:28,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:20:28,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:28,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:20:28,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:28,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 04:20:28,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:28,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:28,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:28,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:20:28,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:28,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:20:28,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:28,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 04:20:28,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:28,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:28,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:28,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:20:28,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:28,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:20:28,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:28,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:20:28,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:28,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:28,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:28,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:20:28,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:28,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:20:28,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:28,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:20:28,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:28,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:20:28,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:28,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:20:28,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:28,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:20:28,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:28,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:28,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:28,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-23 04:20:28,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:28,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-23 04:20:28,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:28,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-23 04:20:28,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:28,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:28,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:28,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-23 04:20:28,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:28,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-23 04:20:28,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:28,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:28,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:28,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:20:28,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:28,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:20:28,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:28,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:20:28,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:28,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-07-23 04:20:28,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:28,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:28,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:28,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-07-23 04:20:28,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:28,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2022-07-23 04:20:28,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:28,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2022-07-23 04:20:28,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:28,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2022-07-23 04:20:28,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:28,388 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2022-07-23 04:20:28,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:20:28,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215684722] [2022-07-23 04:20:28,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215684722] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 04:20:28,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680576576] [2022-07-23 04:20:28,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:20:28,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:20:28,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 04:20:28,402 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-23 04:20:28,405 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-23 04:20:29,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:29,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 2747 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 04:20:29,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 04:20:29,218 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 68 proven. 1 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2022-07-23 04:20:29,218 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 04:20:29,333 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2022-07-23 04:20:29,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [680576576] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 04:20:29,334 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 04:20:29,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 11 [2022-07-23 04:20:29,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713468628] [2022-07-23 04:20:29,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 04:20:29,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-23 04:20:29,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:20:29,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-23 04:20:29,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-07-23 04:20:29,336 INFO L87 Difference]: Start difference. First operand 3223 states and 4339 transitions. Second operand has 11 states, 11 states have (on average 14.636363636363637) internal successors, (161), 7 states have internal predecessors, (161), 2 states have call successors, (50), 6 states have call predecessors, (50), 2 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2022-07-23 04:20:36,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:20:36,179 INFO L93 Difference]: Finished difference Result 6847 states and 9254 transitions. [2022-07-23 04:20:36,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-23 04:20:36,180 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 14.636363636363637) internal successors, (161), 7 states have internal predecessors, (161), 2 states have call successors, (50), 6 states have call predecessors, (50), 2 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) Word has length 253 [2022-07-23 04:20:36,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:20:36,197 INFO L225 Difference]: With dead ends: 6847 [2022-07-23 04:20:36,198 INFO L226 Difference]: Without dead ends: 3643 [2022-07-23 04:20:36,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 589 GetRequests, 574 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2022-07-23 04:20:36,213 INFO L413 NwaCegarLoop]: 1832 mSDtfsCounter, 3256 mSDsluCounter, 3203 mSDsCounter, 0 mSdLazyCounter, 7637 mSolverCounterSat, 3250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3256 SdHoareTripleChecker+Valid, 5035 SdHoareTripleChecker+Invalid, 10887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3250 IncrementalHoareTripleChecker+Valid, 7637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-07-23 04:20:36,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3256 Valid, 5035 Invalid, 10887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3250 Valid, 7637 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2022-07-23 04:20:36,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3643 states. [2022-07-23 04:20:36,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3643 to 3232. [2022-07-23 04:20:36,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3232 states, 2159 states have (on average 1.2135247799907365) internal successors, (2620), 2224 states have internal predecessors, (2620), 864 states have call successors, (864), 206 states have call predecessors, (864), 206 states have return successors, (864), 848 states have call predecessors, (864), 864 states have call successors, (864) [2022-07-23 04:20:36,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3232 states to 3232 states and 4348 transitions. [2022-07-23 04:20:36,516 INFO L78 Accepts]: Start accepts. Automaton has 3232 states and 4348 transitions. Word has length 253 [2022-07-23 04:20:36,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:20:36,517 INFO L495 AbstractCegarLoop]: Abstraction has 3232 states and 4348 transitions. [2022-07-23 04:20:36,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.636363636363637) internal successors, (161), 7 states have internal predecessors, (161), 2 states have call successors, (50), 6 states have call predecessors, (50), 2 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2022-07-23 04:20:36,517 INFO L276 IsEmpty]: Start isEmpty. Operand 3232 states and 4348 transitions. [2022-07-23 04:20:36,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2022-07-23 04:20:36,522 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:20:36,522 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 7, 7, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:20:36,575 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-23 04:20:36,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:20:36,748 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-23 04:20:36,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:20:36,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1240481108, now seen corresponding path program 2 times [2022-07-23 04:20:36,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:20:36,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722641861] [2022-07-23 04:20:36,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:20:36,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:20:36,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:36,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:20:36,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:36,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:20:36,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:36,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:20:36,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:36,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 04:20:36,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:36,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:36,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:36,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:20:36,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:36,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:20:36,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:36,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 04:20:36,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:36,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:36,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:36,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:20:36,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:36,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:20:36,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:36,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:20:36,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:36,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:36,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:36,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:20:36,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:36,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:20:36,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:36,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:20:36,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:37,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:20:37,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:37,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:20:37,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:37,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:20:37,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:37,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:37,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:37,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-23 04:20:37,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:37,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-23 04:20:37,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:37,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-23 04:20:37,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:37,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:37,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:37,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-23 04:20:37,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:37,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-23 04:20:37,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:37,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:37,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:37,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:20:37,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:37,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:20:37,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:37,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:20:37,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:37,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-07-23 04:20:37,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:37,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:37,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:37,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-23 04:20:37,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:37,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-23 04:20:37,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:37,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-07-23 04:20:37,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:37,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2022-07-23 04:20:37,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:37,186 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2022-07-23 04:20:37,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:20:37,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722641861] [2022-07-23 04:20:37,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722641861] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:20:37,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:20:37,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-23 04:20:37,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348746682] [2022-07-23 04:20:37,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:20:37,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 04:20:37,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:20:37,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 04:20:37,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-23 04:20:37,188 INFO L87 Difference]: Start difference. First operand 3232 states and 4348 transitions. Second operand has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 4 states have internal predecessors, (121), 2 states have call successors, (29), 5 states have call predecessors, (29), 2 states have return successors, (29), 3 states have call predecessors, (29), 2 states have call successors, (29) [2022-07-23 04:20:45,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:20:45,512 INFO L93 Difference]: Finished difference Result 7598 states and 10362 transitions. [2022-07-23 04:20:45,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-23 04:20:45,513 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 4 states have internal predecessors, (121), 2 states have call successors, (29), 5 states have call predecessors, (29), 2 states have return successors, (29), 3 states have call predecessors, (29), 2 states have call successors, (29) Word has length 262 [2022-07-23 04:20:45,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:20:45,526 INFO L225 Difference]: With dead ends: 7598 [2022-07-23 04:20:45,526 INFO L226 Difference]: Without dead ends: 4385 [2022-07-23 04:20:45,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2022-07-23 04:20:45,533 INFO L413 NwaCegarLoop]: 2488 mSDtfsCounter, 3654 mSDsluCounter, 5883 mSDsCounter, 0 mSdLazyCounter, 8517 mSolverCounterSat, 3246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3800 SdHoareTripleChecker+Valid, 8371 SdHoareTripleChecker+Invalid, 11763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3246 IncrementalHoareTripleChecker+Valid, 8517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2022-07-23 04:20:45,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3800 Valid, 8371 Invalid, 11763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3246 Valid, 8517 Invalid, 0 Unknown, 0 Unchecked, 7.7s Time] [2022-07-23 04:20:45,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4385 states. [2022-07-23 04:20:45,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4385 to 3236. [2022-07-23 04:20:45,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3236 states, 2162 states have (on average 1.2132284921369103) internal successors, (2623), 2227 states have internal predecessors, (2623), 864 states have call successors, (864), 206 states have call predecessors, (864), 207 states have return successors, (866), 849 states have call predecessors, (866), 864 states have call successors, (866) [2022-07-23 04:20:45,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3236 states to 3236 states and 4353 transitions. [2022-07-23 04:20:45,753 INFO L78 Accepts]: Start accepts. Automaton has 3236 states and 4353 transitions. Word has length 262 [2022-07-23 04:20:45,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:20:45,753 INFO L495 AbstractCegarLoop]: Abstraction has 3236 states and 4353 transitions. [2022-07-23 04:20:45,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 4 states have internal predecessors, (121), 2 states have call successors, (29), 5 states have call predecessors, (29), 2 states have return successors, (29), 3 states have call predecessors, (29), 2 states have call successors, (29) [2022-07-23 04:20:45,754 INFO L276 IsEmpty]: Start isEmpty. Operand 3236 states and 4353 transitions. [2022-07-23 04:20:45,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2022-07-23 04:20:45,758 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:20:45,758 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 7, 7, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:20:45,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-23 04:20:45,758 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-23 04:20:45,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:20:45,759 INFO L85 PathProgramCache]: Analyzing trace with hash -272250472, now seen corresponding path program 1 times [2022-07-23 04:20:45,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:20:45,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744810815] [2022-07-23 04:20:45,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:20:45,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:20:45,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:45,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:20:45,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:45,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:20:45,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:45,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:20:45,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:45,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 04:20:45,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:45,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:45,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:45,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:20:45,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:45,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:20:45,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:45,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 04:20:45,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:45,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:45,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:45,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:20:45,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:45,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:20:45,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:45,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:20:45,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:45,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:45,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:45,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:20:45,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:45,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:20:45,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:45,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:20:45,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:45,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:20:45,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:45,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:20:45,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:45,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:20:45,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:45,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:45,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:45,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-23 04:20:45,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:45,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-23 04:20:45,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:45,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-23 04:20:45,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:45,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:45,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:45,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-23 04:20:45,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:45,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-23 04:20:45,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:45,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:45,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:45,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:20:45,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:45,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:20:45,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:45,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:20:45,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:45,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-23 04:20:45,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:45,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:45,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:45,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-23 04:20:45,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:45,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2022-07-23 04:20:45,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:45,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-07-23 04:20:45,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:45,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-07-23 04:20:45,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:45,993 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2022-07-23 04:20:45,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:20:45,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744810815] [2022-07-23 04:20:45,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744810815] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 04:20:45,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975015265] [2022-07-23 04:20:45,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:20:45,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:20:45,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 04:20:45,995 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-23 04:20:45,996 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-23 04:20:46,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:46,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 2845 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-23 04:20:46,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 04:20:46,848 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 68 proven. 22 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2022-07-23 04:20:46,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 04:20:46,989 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2022-07-23 04:20:46,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1975015265] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 04:20:46,989 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 04:20:46,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-07-23 04:20:46,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911890928] [2022-07-23 04:20:46,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 04:20:46,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-23 04:20:46,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:20:46,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-23 04:20:46,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-07-23 04:20:46,991 INFO L87 Difference]: Start difference. First operand 3236 states and 4353 transitions. Second operand has 14 states, 14 states have (on average 13.142857142857142) internal successors, (184), 10 states have internal predecessors, (184), 3 states have call successors, (51), 6 states have call predecessors, (51), 2 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2022-07-23 04:20:57,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:20:57,061 INFO L93 Difference]: Finished difference Result 8359 states and 11486 transitions. [2022-07-23 04:20:57,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-23 04:20:57,061 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 13.142857142857142) internal successors, (184), 10 states have internal predecessors, (184), 3 states have call successors, (51), 6 states have call predecessors, (51), 2 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) Word has length 263 [2022-07-23 04:20:57,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:20:57,111 INFO L225 Difference]: With dead ends: 8359 [2022-07-23 04:20:57,127 INFO L226 Difference]: Without dead ends: 5142 [2022-07-23 04:20:57,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 621 GetRequests, 591 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=213, Invalid=779, Unknown=0, NotChecked=0, Total=992 [2022-07-23 04:20:57,157 INFO L413 NwaCegarLoop]: 2459 mSDtfsCounter, 4496 mSDsluCounter, 6380 mSDsCounter, 0 mSdLazyCounter, 11473 mSolverCounterSat, 3568 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4778 SdHoareTripleChecker+Valid, 8839 SdHoareTripleChecker+Invalid, 15041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3568 IncrementalHoareTripleChecker+Valid, 11473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2022-07-23 04:20:57,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4778 Valid, 8839 Invalid, 15041 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3568 Valid, 11473 Invalid, 0 Unknown, 0 Unchecked, 9.2s Time] [2022-07-23 04:20:57,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5142 states. [2022-07-23 04:20:57,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5142 to 3252. [2022-07-23 04:20:57,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3252 states, 2176 states have (on average 1.2127757352941178) internal successors, (2639), 2240 states have internal predecessors, (2639), 866 states have call successors, (866), 206 states have call predecessors, (866), 207 states have return successors, (870), 852 states have call predecessors, (870), 866 states have call successors, (870) [2022-07-23 04:20:57,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3252 states to 3252 states and 4375 transitions. [2022-07-23 04:20:57,593 INFO L78 Accepts]: Start accepts. Automaton has 3252 states and 4375 transitions. Word has length 263 [2022-07-23 04:20:57,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:20:57,593 INFO L495 AbstractCegarLoop]: Abstraction has 3252 states and 4375 transitions. [2022-07-23 04:20:57,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 13.142857142857142) internal successors, (184), 10 states have internal predecessors, (184), 3 states have call successors, (51), 6 states have call predecessors, (51), 2 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2022-07-23 04:20:57,594 INFO L276 IsEmpty]: Start isEmpty. Operand 3252 states and 4375 transitions. [2022-07-23 04:20:57,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2022-07-23 04:20:57,599 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:20:57,599 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 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] [2022-07-23 04:20:57,624 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-23 04:20:57,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:20:57,820 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-23 04:20:57,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:20:57,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1418467534, now seen corresponding path program 1 times [2022-07-23 04:20:57,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:20:57,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910458261] [2022-07-23 04:20:57,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:20:57,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:20:57,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:57,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:20:57,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:57,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:20:57,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:57,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:20:57,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:57,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 04:20:57,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:57,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:57,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:57,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:20:57,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:57,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:20:57,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:57,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 04:20:57,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:57,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:57,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:57,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:20:57,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:57,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:20:57,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:57,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:20:57,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:57,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:57,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:57,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:20:57,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:57,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:20:57,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:57,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:20:57,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:57,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:20:57,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:57,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:20:57,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:58,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-23 04:20:58,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:58,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-23 04:20:58,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:58,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-23 04:20:58,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:58,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:58,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:58,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-23 04:20:58,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:58,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-23 04:20:58,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:58,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-23 04:20:58,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:58,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-23 04:20:58,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:58,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-23 04:20:58,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:58,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-23 04:20:58,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:58,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:58,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:58,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-23 04:20:58,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:58,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:58,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:58,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:58,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:58,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-07-23 04:20:58,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:58,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:58,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:58,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:58,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:58,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-23 04:20:58,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:58,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-23 04:20:58,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:58,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-23 04:20:58,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:58,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:58,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:58,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2022-07-23 04:20:58,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:58,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2022-07-23 04:20:58,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:58,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2022-07-23 04:20:58,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:58,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2022-07-23 04:20:58,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:58,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:58,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:58,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-23 04:20:58,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:58,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-23 04:20:58,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:58,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2022-07-23 04:20:58,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:58,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2022-07-23 04:20:58,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:58,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2022-07-23 04:20:58,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:58,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 294 [2022-07-23 04:20:58,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:58,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:58,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:58,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2022-07-23 04:20:58,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:58,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:58,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:58,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 355 [2022-07-23 04:20:58,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:58,175 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2022-07-23 04:20:58,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:20:58,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910458261] [2022-07-23 04:20:58,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910458261] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:20:58,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:20:58,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 04:20:58,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232461784] [2022-07-23 04:20:58,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:20:58,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 04:20:58,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:20:58,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 04:20:58,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-23 04:20:58,177 INFO L87 Difference]: Start difference. First operand 3252 states and 4375 transitions. Second operand has 8 states, 8 states have (on average 17.5) internal successors, (140), 3 states have internal predecessors, (140), 3 states have call successors, (48), 7 states have call predecessors, (48), 1 states have return successors, (44), 2 states have call predecessors, (44), 3 states have call successors, (44) [2022-07-23 04:21:04,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:21:04,875 INFO L93 Difference]: Finished difference Result 7685 states and 10486 transitions. [2022-07-23 04:21:04,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-23 04:21:04,876 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 17.5) internal successors, (140), 3 states have internal predecessors, (140), 3 states have call successors, (48), 7 states have call predecessors, (48), 1 states have return successors, (44), 2 states have call predecessors, (44), 3 states have call successors, (44) Word has length 364 [2022-07-23 04:21:04,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:21:04,890 INFO L225 Difference]: With dead ends: 7685 [2022-07-23 04:21:04,890 INFO L226 Difference]: Without dead ends: 4452 [2022-07-23 04:21:04,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-07-23 04:21:04,899 INFO L413 NwaCegarLoop]: 2420 mSDtfsCounter, 4415 mSDsluCounter, 4350 mSDsCounter, 0 mSdLazyCounter, 5409 mSolverCounterSat, 4086 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4557 SdHoareTripleChecker+Valid, 6770 SdHoareTripleChecker+Invalid, 9495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4086 IncrementalHoareTripleChecker+Valid, 5409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-07-23 04:21:04,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4557 Valid, 6770 Invalid, 9495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4086 Valid, 5409 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2022-07-23 04:21:04,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4452 states. [2022-07-23 04:21:05,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4452 to 3253. [2022-07-23 04:21:05,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3253 states, 2177 states have (on average 1.2126779972439137) internal successors, (2640), 2241 states have internal predecessors, (2640), 866 states have call successors, (866), 206 states have call predecessors, (866), 207 states have return successors, (870), 852 states have call predecessors, (870), 866 states have call successors, (870) [2022-07-23 04:21:05,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3253 states to 3253 states and 4376 transitions. [2022-07-23 04:21:05,149 INFO L78 Accepts]: Start accepts. Automaton has 3253 states and 4376 transitions. Word has length 364 [2022-07-23 04:21:05,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:21:05,149 INFO L495 AbstractCegarLoop]: Abstraction has 3253 states and 4376 transitions. [2022-07-23 04:21:05,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.5) internal successors, (140), 3 states have internal predecessors, (140), 3 states have call successors, (48), 7 states have call predecessors, (48), 1 states have return successors, (44), 2 states have call predecessors, (44), 3 states have call successors, (44) [2022-07-23 04:21:05,150 INFO L276 IsEmpty]: Start isEmpty. Operand 3253 states and 4376 transitions. [2022-07-23 04:21:05,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2022-07-23 04:21:05,154 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:21:05,154 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 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] [2022-07-23 04:21:05,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-07-23 04:21:05,154 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-23 04:21:05,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:21:05,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1905541260, now seen corresponding path program 1 times [2022-07-23 04:21:05,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:21:05,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650911482] [2022-07-23 04:21:05,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:21:05,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:21:05,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:05,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:21:05,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:05,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:21:05,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:05,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:21:05,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:05,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 04:21:05,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:05,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:05,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:05,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:21:05,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:05,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:21:05,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:05,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 04:21:05,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:05,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:05,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:05,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:21:05,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:05,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:21:05,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:05,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:21:05,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:05,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:05,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:05,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:21:05,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:05,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:21:05,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:05,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:21:05,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:05,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:21:05,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:05,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:21:05,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:05,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-23 04:21:05,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:05,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-23 04:21:05,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:05,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-23 04:21:05,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:05,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:05,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:05,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-23 04:21:05,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:05,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-23 04:21:05,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:05,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-23 04:21:05,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:05,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-23 04:21:05,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:05,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-23 04:21:05,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:05,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-23 04:21:05,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:05,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:05,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:05,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-23 04:21:05,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:05,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:05,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:05,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:05,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:05,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-07-23 04:21:05,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:05,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:05,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:05,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:05,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:05,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-23 04:21:05,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:05,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-23 04:21:05,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:05,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-23 04:21:05,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:05,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:05,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:05,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2022-07-23 04:21:05,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:05,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2022-07-23 04:21:05,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:05,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2022-07-23 04:21:05,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:05,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2022-07-23 04:21:05,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:05,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:05,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:05,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-23 04:21:05,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:05,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-23 04:21:05,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:05,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2022-07-23 04:21:05,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:05,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2022-07-23 04:21:05,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:05,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2022-07-23 04:21:05,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:05,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 294 [2022-07-23 04:21:05,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:05,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:05,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:05,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2022-07-23 04:21:05,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:05,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:05,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:05,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 355 [2022-07-23 04:21:05,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:05,596 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 478 trivial. 0 not checked. [2022-07-23 04:21:05,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:21:05,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650911482] [2022-07-23 04:21:05,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650911482] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 04:21:05,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241700642] [2022-07-23 04:21:05,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:21:05,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:21:05,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 04:21:05,598 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-23 04:21:05,600 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-23 04:21:06,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:06,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 2936 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-23 04:21:06,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 04:21:06,512 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 15 proven. 28 refuted. 0 times theorem prover too weak. 463 trivial. 0 not checked. [2022-07-23 04:21:06,523 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 04:21:06,700 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 478 trivial. 0 not checked. [2022-07-23 04:21:06,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [241700642] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 04:21:06,701 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 04:21:06,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 17 [2022-07-23 04:21:06,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104442194] [2022-07-23 04:21:06,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 04:21:06,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-23 04:21:06,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:21:06,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-23 04:21:06,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2022-07-23 04:21:06,721 INFO L87 Difference]: Start difference. First operand 3253 states and 4376 transitions. Second operand has 17 states, 17 states have (on average 10.823529411764707) internal successors, (184), 12 states have internal predecessors, (184), 3 states have call successors, (63), 7 states have call predecessors, (63), 2 states have return successors, (48), 2 states have call predecessors, (48), 3 states have call successors, (48) [2022-07-23 04:21:14,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:21:14,645 INFO L93 Difference]: Finished difference Result 7364 states and 10033 transitions. [2022-07-23 04:21:14,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-07-23 04:21:14,645 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 10.823529411764707) internal successors, (184), 12 states have internal predecessors, (184), 3 states have call successors, (63), 7 states have call predecessors, (63), 2 states have return successors, (48), 2 states have call predecessors, (48), 3 states have call successors, (48) Word has length 364 [2022-07-23 04:21:14,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:21:14,666 INFO L225 Difference]: With dead ends: 7364 [2022-07-23 04:21:14,666 INFO L226 Difference]: Without dead ends: 4130 [2022-07-23 04:21:14,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 876 GetRequests, 831 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=678, Invalid=1484, Unknown=0, NotChecked=0, Total=2162 [2022-07-23 04:21:14,678 INFO L413 NwaCegarLoop]: 1836 mSDtfsCounter, 4833 mSDsluCounter, 3650 mSDsCounter, 0 mSdLazyCounter, 8634 mSolverCounterSat, 4992 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4833 SdHoareTripleChecker+Valid, 5486 SdHoareTripleChecker+Invalid, 13626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4992 IncrementalHoareTripleChecker+Valid, 8634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-07-23 04:21:14,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4833 Valid, 5486 Invalid, 13626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4992 Valid, 8634 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time] [2022-07-23 04:21:14,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4130 states. [2022-07-23 04:21:14,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4130 to 3445. [2022-07-23 04:21:14,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3445 states, 2321 states have (on average 1.2098233520034467) internal successors, (2808), 2385 states have internal predecessors, (2808), 914 states have call successors, (914), 206 states have call predecessors, (914), 207 states have return successors, (918), 900 states have call predecessors, (918), 914 states have call successors, (918) [2022-07-23 04:21:14,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3445 states to 3445 states and 4640 transitions. [2022-07-23 04:21:14,969 INFO L78 Accepts]: Start accepts. Automaton has 3445 states and 4640 transitions. Word has length 364 [2022-07-23 04:21:14,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:21:14,969 INFO L495 AbstractCegarLoop]: Abstraction has 3445 states and 4640 transitions. [2022-07-23 04:21:14,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 10.823529411764707) internal successors, (184), 12 states have internal predecessors, (184), 3 states have call successors, (63), 7 states have call predecessors, (63), 2 states have return successors, (48), 2 states have call predecessors, (48), 3 states have call successors, (48) [2022-07-23 04:21:14,970 INFO L276 IsEmpty]: Start isEmpty. Operand 3445 states and 4640 transitions. [2022-07-23 04:21:14,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2022-07-23 04:21:14,975 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:21:14,975 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-23 04:21:15,004 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-23 04:21:15,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:21:15,192 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-23 04:21:15,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:21:15,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1892735357, now seen corresponding path program 1 times [2022-07-23 04:21:15,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:21:15,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263077901] [2022-07-23 04:21:15,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:21:15,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:21:15,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:15,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:21:15,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:15,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:21:15,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:15,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:21:15,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:15,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 04:21:15,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:15,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:15,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:15,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:21:15,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:15,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:21:15,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:15,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 04:21:15,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:15,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:15,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:15,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:21:15,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:15,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:21:15,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:15,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:21:15,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:15,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:15,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:15,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:21:15,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:15,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:21:15,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:15,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:21:15,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:15,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:21:15,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:15,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:21:15,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:15,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-23 04:21:15,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:15,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-23 04:21:15,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:15,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-23 04:21:15,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:15,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:15,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:15,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-23 04:21:15,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:15,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-23 04:21:15,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:15,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-23 04:21:15,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:15,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-23 04:21:15,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:15,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-23 04:21:15,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:15,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:15,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:15,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-23 04:21:15,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:15,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-23 04:21:15,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:15,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-23 04:21:15,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:15,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-23 04:21:15,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:15,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-07-23 04:21:15,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:15,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-07-23 04:21:15,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:15,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-23 04:21:15,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:15,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:15,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:15,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-07-23 04:21:15,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:15,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-23 04:21:15,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:15,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:15,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:15,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2022-07-23 04:21:15,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:15,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:15,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:15,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2022-07-23 04:21:15,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:15,561 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2022-07-23 04:21:15,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:21:15,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263077901] [2022-07-23 04:21:15,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263077901] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 04:21:15,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499952041] [2022-07-23 04:21:15,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:21:15,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:21:15,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 04:21:15,564 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-23 04:21:15,565 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-23 04:21:16,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:16,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 2787 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 04:21:16,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 04:21:16,374 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2022-07-23 04:21:16,374 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 04:21:16,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499952041] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:21:16,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 04:21:16,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 9 [2022-07-23 04:21:16,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561551422] [2022-07-23 04:21:16,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:21:16,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 04:21:16,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:21:16,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 04:21:16,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-23 04:21:16,376 INFO L87 Difference]: Start difference. First operand 3445 states and 4640 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (36), 3 states have call predecessors, (36), 3 states have call successors, (36) [2022-07-23 04:21:16,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:21:16,631 INFO L93 Difference]: Finished difference Result 6803 states and 9173 transitions. [2022-07-23 04:21:16,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 04:21:16,632 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (36), 3 states have call predecessors, (36), 3 states have call successors, (36) Word has length 287 [2022-07-23 04:21:16,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:21:16,642 INFO L225 Difference]: With dead ends: 6803 [2022-07-23 04:21:16,643 INFO L226 Difference]: Without dead ends: 3357 [2022-07-23 04:21:16,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-23 04:21:16,651 INFO L413 NwaCegarLoop]: 2203 mSDtfsCounter, 3 mSDsluCounter, 2198 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 4401 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 04:21:16,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 4401 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 04:21:16,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3357 states. [2022-07-23 04:21:16,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3357 to 3357. [2022-07-23 04:21:16,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3357 states, 2241 states have (on average 1.2021419009370817) internal successors, (2694), 2305 states have internal predecessors, (2694), 908 states have call successors, (908), 204 states have call predecessors, (908), 205 states have return successors, (912), 894 states have call predecessors, (912), 908 states have call successors, (912) [2022-07-23 04:21:16,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3357 states to 3357 states and 4514 transitions. [2022-07-23 04:21:16,912 INFO L78 Accepts]: Start accepts. Automaton has 3357 states and 4514 transitions. Word has length 287 [2022-07-23 04:21:16,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:21:16,912 INFO L495 AbstractCegarLoop]: Abstraction has 3357 states and 4514 transitions. [2022-07-23 04:21:16,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (36), 3 states have call predecessors, (36), 3 states have call successors, (36) [2022-07-23 04:21:16,913 INFO L276 IsEmpty]: Start isEmpty. Operand 3357 states and 4514 transitions. [2022-07-23 04:21:16,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2022-07-23 04:21:16,916 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:21:16,917 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 7, 7, 6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-23 04:21:16,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-23 04:21:17,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:21:17,126 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-23 04:21:17,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:21:17,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1876269791, now seen corresponding path program 1 times [2022-07-23 04:21:17,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:21:17,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904206325] [2022-07-23 04:21:17,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:21:17,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:21:17,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:17,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:21:17,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:17,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:21:17,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:17,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:21:17,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:17,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 04:21:17,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:17,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:17,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:17,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:21:17,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:17,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:21:17,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:17,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 04:21:17,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:17,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:17,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:17,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:21:17,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:17,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:21:17,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:17,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:21:17,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:17,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:17,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:17,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:21:17,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:17,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:21:17,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:17,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:21:17,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:17,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:21:17,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:17,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:21:17,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:17,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:21:17,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:17,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:17,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:17,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-23 04:21:17,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:17,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-23 04:21:17,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:17,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-23 04:21:17,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:17,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:17,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:17,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-23 04:21:17,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:17,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-23 04:21:17,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:17,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:17,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:17,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:21:17,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:17,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:21:17,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:17,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:21:17,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:17,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-07-23 04:21:17,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:17,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:17,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:17,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:21:17,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:17,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:21:17,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:17,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:21:17,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:17,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2022-07-23 04:21:17,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:17,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:17,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:17,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2022-07-23 04:21:17,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:17,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-07-23 04:21:17,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:17,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-07-23 04:21:17,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:17,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-07-23 04:21:17,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:17,561 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 355 trivial. 0 not checked. [2022-07-23 04:21:17,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:21:17,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904206325] [2022-07-23 04:21:17,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904206325] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:21:17,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:21:17,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-23 04:21:17,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057824470] [2022-07-23 04:21:17,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:21:17,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-23 04:21:17,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:21:17,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-23 04:21:17,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-23 04:21:17,563 INFO L87 Difference]: Start difference. First operand 3357 states and 4514 transitions. Second operand has 11 states, 11 states have (on average 11.0) internal successors, (121), 7 states have internal predecessors, (121), 3 states have call successors, (30), 5 states have call predecessors, (30), 1 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2022-07-23 04:21:27,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:21:27,729 INFO L93 Difference]: Finished difference Result 8001 states and 10917 transitions. [2022-07-23 04:21:27,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-23 04:21:27,730 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 11.0) internal successors, (121), 7 states have internal predecessors, (121), 3 states have call successors, (30), 5 states have call predecessors, (30), 1 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) Word has length 294 [2022-07-23 04:21:27,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:21:27,748 INFO L225 Difference]: With dead ends: 8001 [2022-07-23 04:21:27,748 INFO L226 Difference]: Without dead ends: 4663 [2022-07-23 04:21:27,757 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2022-07-23 04:21:27,757 INFO L413 NwaCegarLoop]: 2277 mSDtfsCounter, 4227 mSDsluCounter, 6105 mSDsCounter, 0 mSdLazyCounter, 12804 mSolverCounterSat, 4249 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4416 SdHoareTripleChecker+Valid, 8382 SdHoareTripleChecker+Invalid, 17053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4249 IncrementalHoareTripleChecker+Valid, 12804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2022-07-23 04:21:27,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4416 Valid, 8382 Invalid, 17053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4249 Valid, 12804 Invalid, 0 Unknown, 0 Unchecked, 9.4s Time] [2022-07-23 04:21:27,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4663 states. [2022-07-23 04:21:28,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4663 to 3361. [2022-07-23 04:21:28,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3361 states, 2245 states have (on average 1.201781737193764) internal successors, (2698), 2308 states have internal predecessors, (2698), 908 states have call successors, (908), 204 states have call predecessors, (908), 205 states have return successors, (912), 895 states have call predecessors, (912), 908 states have call successors, (912) [2022-07-23 04:21:28,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3361 states to 3361 states and 4518 transitions. [2022-07-23 04:21:28,042 INFO L78 Accepts]: Start accepts. Automaton has 3361 states and 4518 transitions. Word has length 294 [2022-07-23 04:21:28,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:21:28,042 INFO L495 AbstractCegarLoop]: Abstraction has 3361 states and 4518 transitions. [2022-07-23 04:21:28,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.0) internal successors, (121), 7 states have internal predecessors, (121), 3 states have call successors, (30), 5 states have call predecessors, (30), 1 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2022-07-23 04:21:28,043 INFO L276 IsEmpty]: Start isEmpty. Operand 3361 states and 4518 transitions. [2022-07-23 04:21:28,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2022-07-23 04:21:28,047 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:21:28,047 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 7, 7, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-23 04:21:28,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-07-23 04:21:28,047 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-23 04:21:28,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:21:28,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1681141840, now seen corresponding path program 1 times [2022-07-23 04:21:28,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:21:28,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392954319] [2022-07-23 04:21:28,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:21:28,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:21:28,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:28,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:21:28,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:28,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:21:28,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:28,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:21:28,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:28,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 04:21:28,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:28,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:28,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:28,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:21:28,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:28,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:21:28,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:28,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 04:21:28,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:28,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:28,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:28,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:21:28,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:28,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:21:28,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:28,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:21:28,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:28,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:28,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:28,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:21:28,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:28,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:21:28,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:28,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:21:28,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:28,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:21:28,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:28,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:21:28,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:28,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:21:28,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:28,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:28,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:28,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-23 04:21:28,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:28,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-23 04:21:28,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:28,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-23 04:21:28,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:28,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:28,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:28,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-23 04:21:28,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:28,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-23 04:21:28,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:28,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:28,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:28,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:21:28,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:28,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:21:28,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:28,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:21:28,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:28,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-07-23 04:21:28,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:28,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:28,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:28,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:21:28,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:28,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:21:28,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:28,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:21:28,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:28,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2022-07-23 04:21:28,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:28,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:28,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:28,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2022-07-23 04:21:28,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:28,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-07-23 04:21:28,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:28,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-07-23 04:21:28,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:28,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2022-07-23 04:21:28,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:28,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2022-07-23 04:21:28,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:28,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:28,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:28,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2022-07-23 04:21:28,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:28,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 296 [2022-07-23 04:21:28,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:28,547 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2022-07-23 04:21:28,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:21:28,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392954319] [2022-07-23 04:21:28,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392954319] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:21:28,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:21:28,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-07-23 04:21:28,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412525583] [2022-07-23 04:21:28,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:21:28,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-23 04:21:28,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:21:28,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-23 04:21:28,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2022-07-23 04:21:28,552 INFO L87 Difference]: Start difference. First operand 3361 states and 4518 transitions. Second operand has 16 states, 16 states have (on average 7.9375) internal successors, (127), 11 states have internal predecessors, (127), 3 states have call successors, (34), 6 states have call predecessors, (34), 1 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) [2022-07-23 04:21:54,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:21:54,273 INFO L93 Difference]: Finished difference Result 8069 states and 11469 transitions. [2022-07-23 04:21:54,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-07-23 04:21:54,273 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.9375) internal successors, (127), 11 states have internal predecessors, (127), 3 states have call successors, (34), 6 states have call predecessors, (34), 1 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) Word has length 306 [2022-07-23 04:21:54,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:21:54,298 INFO L225 Difference]: With dead ends: 8069 [2022-07-23 04:21:54,298 INFO L226 Difference]: Without dead ends: 8067 [2022-07-23 04:21:54,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1443 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=833, Invalid=4423, Unknown=0, NotChecked=0, Total=5256 [2022-07-23 04:21:54,303 INFO L413 NwaCegarLoop]: 4242 mSDtfsCounter, 7002 mSDsluCounter, 23286 mSDsCounter, 0 mSdLazyCounter, 31851 mSolverCounterSat, 7187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7375 SdHoareTripleChecker+Valid, 27528 SdHoareTripleChecker+Invalid, 39038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 7187 IncrementalHoareTripleChecker+Valid, 31851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.4s IncrementalHoareTripleChecker+Time [2022-07-23 04:21:54,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7375 Valid, 27528 Invalid, 39038 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [7187 Valid, 31851 Invalid, 0 Unknown, 0 Unchecked, 23.4s Time] [2022-07-23 04:21:54,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8067 states. [2022-07-23 04:21:54,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8067 to 3372. [2022-07-23 04:21:54,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3372 states, 2252 states have (on average 1.2015985790408525) internal successors, (2706), 2315 states have internal predecessors, (2706), 912 states have call successors, (912), 204 states have call predecessors, (912), 205 states have return successors, (916), 899 states have call predecessors, (916), 912 states have call successors, (916) [2022-07-23 04:21:54,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3372 states to 3372 states and 4534 transitions. [2022-07-23 04:21:54,672 INFO L78 Accepts]: Start accepts. Automaton has 3372 states and 4534 transitions. Word has length 306 [2022-07-23 04:21:54,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:21:54,673 INFO L495 AbstractCegarLoop]: Abstraction has 3372 states and 4534 transitions. [2022-07-23 04:21:54,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.9375) internal successors, (127), 11 states have internal predecessors, (127), 3 states have call successors, (34), 6 states have call predecessors, (34), 1 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) [2022-07-23 04:21:54,673 INFO L276 IsEmpty]: Start isEmpty. Operand 3372 states and 4534 transitions. [2022-07-23 04:21:54,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2022-07-23 04:21:54,678 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:21:54,679 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 6, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-23 04:21:54,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-07-23 04:21:54,679 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-23 04:21:54,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:21:54,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1848139746, now seen corresponding path program 1 times [2022-07-23 04:21:54,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:21:54,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369646704] [2022-07-23 04:21:54,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:21:54,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:21:54,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:54,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:21:54,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:54,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:21:54,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:54,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:21:54,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:54,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 04:21:54,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:54,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:54,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:54,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:21:54,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:54,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:21:54,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:54,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 04:21:54,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:54,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:54,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:54,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:21:54,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:54,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:21:54,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:54,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:21:54,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:54,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:54,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:54,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:21:54,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:54,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:21:54,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:54,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:21:54,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:54,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:21:54,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:54,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:21:54,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:54,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:21:54,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:54,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:54,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:54,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-23 04:21:54,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:54,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-23 04:21:54,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:54,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-23 04:21:54,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:54,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:54,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:54,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-23 04:21:54,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:54,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-23 04:21:54,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:55,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:55,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:55,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:21:55,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:55,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:21:55,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:55,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:21:55,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:55,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-07-23 04:21:55,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:55,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:55,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:55,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:21:55,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:55,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:21:55,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:55,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:21:55,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:55,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2022-07-23 04:21:55,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:55,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:55,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:55,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2022-07-23 04:21:55,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:55,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-07-23 04:21:55,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:55,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-07-23 04:21:55,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:55,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2022-07-23 04:21:55,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:55,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:55,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:55,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2022-07-23 04:21:55,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:55,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-07-23 04:21:55,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:55,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 306 [2022-07-23 04:21:55,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:55,129 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2022-07-23 04:21:55,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:21:55,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369646704] [2022-07-23 04:21:55,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369646704] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:21:55,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:21:55,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-23 04:21:55,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744581308] [2022-07-23 04:21:55,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:21:55,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-23 04:21:55,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:21:55,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-23 04:21:55,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-07-23 04:21:55,131 INFO L87 Difference]: Start difference. First operand 3372 states and 4534 transitions. Second operand has 14 states, 14 states have (on average 9.285714285714286) internal successors, (130), 8 states have internal predecessors, (130), 3 states have call successors, (34), 6 states have call predecessors, (34), 2 states have return successors, (34), 4 states have call predecessors, (34), 3 states have call successors, (34) [2022-07-23 04:22:08,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:22:08,200 INFO L93 Difference]: Finished difference Result 8707 states and 11966 transitions. [2022-07-23 04:22:08,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-23 04:22:08,201 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 9.285714285714286) internal successors, (130), 8 states have internal predecessors, (130), 3 states have call successors, (34), 6 states have call predecessors, (34), 2 states have return successors, (34), 4 states have call predecessors, (34), 3 states have call successors, (34) Word has length 318 [2022-07-23 04:22:08,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:22:08,216 INFO L225 Difference]: With dead ends: 8707 [2022-07-23 04:22:08,216 INFO L226 Difference]: Without dead ends: 5354 [2022-07-23 04:22:08,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=132, Invalid=624, Unknown=0, NotChecked=0, Total=756 [2022-07-23 04:22:08,225 INFO L413 NwaCegarLoop]: 2410 mSDtfsCounter, 4828 mSDsluCounter, 8485 mSDsCounter, 0 mSdLazyCounter, 17363 mSolverCounterSat, 4348 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4950 SdHoareTripleChecker+Valid, 10895 SdHoareTripleChecker+Invalid, 21711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4348 IncrementalHoareTripleChecker+Valid, 17363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.8s IncrementalHoareTripleChecker+Time [2022-07-23 04:22:08,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4950 Valid, 10895 Invalid, 21711 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4348 Valid, 17363 Invalid, 0 Unknown, 0 Unchecked, 11.8s Time] [2022-07-23 04:22:08,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5354 states. [2022-07-23 04:22:08,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5354 to 3868. [2022-07-23 04:22:08,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3868 states, 2610 states have (on average 1.2061302681992336) internal successors, (3148), 2681 states have internal predecessors, (3148), 1048 states have call successors, (1048), 204 states have call predecessors, (1048), 207 states have return successors, (1055), 1037 states have call predecessors, (1055), 1048 states have call successors, (1055) [2022-07-23 04:22:08,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3868 states to 3868 states and 5251 transitions. [2022-07-23 04:22:08,760 INFO L78 Accepts]: Start accepts. Automaton has 3868 states and 5251 transitions. Word has length 318 [2022-07-23 04:22:08,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:22:08,761 INFO L495 AbstractCegarLoop]: Abstraction has 3868 states and 5251 transitions. [2022-07-23 04:22:08,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.285714285714286) internal successors, (130), 8 states have internal predecessors, (130), 3 states have call successors, (34), 6 states have call predecessors, (34), 2 states have return successors, (34), 4 states have call predecessors, (34), 3 states have call successors, (34) [2022-07-23 04:22:08,761 INFO L276 IsEmpty]: Start isEmpty. Operand 3868 states and 5251 transitions. [2022-07-23 04:22:08,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2022-07-23 04:22:08,766 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:22:08,767 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 6, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-23 04:22:08,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-07-23 04:22:08,768 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-23 04:22:08,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:22:08,768 INFO L85 PathProgramCache]: Analyzing trace with hash 386959571, now seen corresponding path program 1 times [2022-07-23 04:22:08,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:22:08,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658238396] [2022-07-23 04:22:08,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:22:08,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:22:08,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:08,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:22:08,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:08,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:22:08,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:08,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:22:08,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 04:22:09,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:22:09,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:22:09,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:22:09,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 04:22:09,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:22:09,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:22:09,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:22:09,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:22:09,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:22:09,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:22:09,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:22:09,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:22:09,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:22:09,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:22:09,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:22:09,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:22:09,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-23 04:22:09,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-23 04:22:09,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-23 04:22:09,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:22:09,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-23 04:22:09,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-23 04:22:09,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:22:09,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:22:09,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:22:09,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:22:09,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-07-23 04:22:09,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:22:09,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:22:09,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:22:09,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:22:09,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2022-07-23 04:22:09,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:22:09,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2022-07-23 04:22:09,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-07-23 04:22:09,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-07-23 04:22:09,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2022-07-23 04:22:09,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:22:09,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2022-07-23 04:22:09,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-07-23 04:22:09,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 303 [2022-07-23 04:22:09,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 307 [2022-07-23 04:22:09,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:22:09,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 316 [2022-07-23 04:22:09,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 320 [2022-07-23 04:22:09,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:09,315 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 409 trivial. 0 not checked. [2022-07-23 04:22:09,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:22:09,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658238396] [2022-07-23 04:22:09,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658238396] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:22:09,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:22:09,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-07-23 04:22:09,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990763913] [2022-07-23 04:22:09,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:22:09,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-23 04:22:09,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:22:09,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-23 04:22:09,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2022-07-23 04:22:09,317 INFO L87 Difference]: Start difference. First operand 3868 states and 5251 transitions. Second operand has 19 states, 19 states have (on average 7.157894736842105) internal successors, (136), 12 states have internal predecessors, (136), 3 states have call successors, (38), 7 states have call predecessors, (38), 2 states have return successors, (38), 4 states have call predecessors, (38), 3 states have call successors, (38)