./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--intel--igbvf--igbvf.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.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 70285c15c86f57662e9c7cfb124387828d40f8fb898978032ed6716b7a4d6009 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 17:03:00,398 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 17:03:00,422 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 17:03:00,464 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 17:03:00,468 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 17:03:00,469 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 17:03:00,473 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 17:03:00,477 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 17:03:00,479 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 17:03:00,481 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 17:03:00,482 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 17:03:00,484 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 17:03:00,485 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 17:03:00,488 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 17:03:00,489 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 17:03:00,491 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 17:03:00,493 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 17:03:00,493 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 17:03:00,495 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 17:03:00,497 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 17:03:00,501 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 17:03:00,502 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 17:03:00,503 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 17:03:00,504 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 17:03:00,505 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 17:03:00,510 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 17:03:00,513 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 17:03:00,513 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 17:03:00,514 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 17:03:00,515 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 17:03:00,515 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 17:03:00,516 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 17:03:00,517 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 17:03:00,518 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 17:03:00,519 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 17:03:00,520 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 17:03:00,520 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 17:03:00,521 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 17:03:00,521 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 17:03:00,521 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 17:03:00,522 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 17:03:00,524 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 17:03:00,525 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-12 17:03:00,552 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 17:03:00,552 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 17:03:00,553 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 17:03:00,553 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 17:03:00,553 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 17:03:00,554 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 17:03:00,554 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 17:03:00,554 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 17:03:00,555 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 17:03:00,555 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 17:03:00,556 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 17:03:00,556 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 17:03:00,556 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 17:03:00,556 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 17:03:00,557 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 17:03:00,557 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 17:03:00,557 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 17:03:00,557 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 17:03:00,557 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 17:03:00,558 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 17:03:00,559 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 17:03:00,559 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 17:03:00,559 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 17:03:00,559 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 17:03:00,559 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 17:03:00,560 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 17:03:00,560 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 17:03:00,560 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 17:03:00,560 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 17:03:00,560 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 17:03:00,561 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 -> 70285c15c86f57662e9c7cfb124387828d40f8fb898978032ed6716b7a4d6009 [2022-07-12 17:03:00,820 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 17:03:00,852 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 17:03:00,854 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 17:03:00,855 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 17:03:00,856 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 17:03:00,858 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--intel--igbvf--igbvf.ko.cil.i [2022-07-12 17:03:00,909 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab57befb6/77bde0b0284746acb8be9484b641c965/FLAG5d193fae5 [2022-07-12 17:03:01,767 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 17:03:01,768 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--intel--igbvf--igbvf.ko.cil.i [2022-07-12 17:03:01,835 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab57befb6/77bde0b0284746acb8be9484b641c965/FLAG5d193fae5 [2022-07-12 17:03:01,904 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab57befb6/77bde0b0284746acb8be9484b641c965 [2022-07-12 17:03:01,906 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 17:03:01,908 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 17:03:01,910 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 17:03:01,914 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 17:03:01,921 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 17:03:01,922 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 05:03:01" (1/1) ... [2022-07-12 17:03:01,922 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50e43ddd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:03:01, skipping insertion in model container [2022-07-12 17:03:01,923 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 05:03:01" (1/1) ... [2022-07-12 17:03:01,930 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 17:03:02,096 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 17:03:07,275 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[562820,562833] [2022-07-12 17:03:07,278 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[562965,562978] [2022-07-12 17:03:07,279 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[563111,563124] [2022-07-12 17:03:07,279 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[563276,563289] [2022-07-12 17:03:07,280 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[563434,563447] [2022-07-12 17:03:07,280 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[563592,563605] [2022-07-12 17:03:07,280 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[563750,563763] [2022-07-12 17:03:07,281 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[563910,563923] [2022-07-12 17:03:07,281 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[564069,564082] [2022-07-12 17:03:07,282 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[564208,564221] [2022-07-12 17:03:07,282 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[564350,564363] [2022-07-12 17:03:07,282 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[564499,564512] [2022-07-12 17:03:07,283 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[564638,564651] [2022-07-12 17:03:07,283 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[564793,564806] [2022-07-12 17:03:07,284 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[564953,564966] [2022-07-12 17:03:07,284 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[565104,565117] [2022-07-12 17:03:07,285 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[565255,565268] [2022-07-12 17:03:07,285 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[565407,565420] [2022-07-12 17:03:07,285 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[565556,565569] [2022-07-12 17:03:07,286 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[565704,565717] [2022-07-12 17:03:07,286 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[565861,565874] [2022-07-12 17:03:07,287 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[566010,566023] [2022-07-12 17:03:07,287 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[566166,566179] [2022-07-12 17:03:07,287 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[566319,566332] [2022-07-12 17:03:07,288 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[566465,566478] [2022-07-12 17:03:07,288 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[566608,566621] [2022-07-12 17:03:07,289 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[566760,566773] [2022-07-12 17:03:07,289 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[566906,566919] [2022-07-12 17:03:07,289 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[567051,567064] [2022-07-12 17:03:07,290 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[567205,567218] [2022-07-12 17:03:07,290 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[567356,567369] [2022-07-12 17:03:07,291 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[567511,567524] [2022-07-12 17:03:07,291 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[567663,567676] [2022-07-12 17:03:07,292 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[567818,567831] [2022-07-12 17:03:07,292 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[567982,567995] [2022-07-12 17:03:07,292 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[568138,568151] [2022-07-12 17:03:07,293 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[568302,568315] [2022-07-12 17:03:07,293 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[568444,568457] [2022-07-12 17:03:07,294 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[568602,568615] [2022-07-12 17:03:07,294 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[568769,568782] [2022-07-12 17:03:07,294 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[568928,568941] [2022-07-12 17:03:07,295 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[569087,569100] [2022-07-12 17:03:07,295 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[569236,569249] [2022-07-12 17:03:07,296 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[569383,569396] [2022-07-12 17:03:07,296 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[569522,569535] [2022-07-12 17:03:07,296 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[569685,569698] [2022-07-12 17:03:07,297 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[569851,569864] [2022-07-12 17:03:07,297 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[570015,570028] [2022-07-12 17:03:07,297 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[570180,570193] [2022-07-12 17:03:07,298 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[570345,570358] [2022-07-12 17:03:07,298 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[570511,570524] [2022-07-12 17:03:07,299 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[570676,570689] [2022-07-12 17:03:07,299 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[570843,570856] [2022-07-12 17:03:07,299 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[571003,571016] [2022-07-12 17:03:07,300 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[571165,571178] [2022-07-12 17:03:07,300 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[571324,571337] [2022-07-12 17:03:07,301 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[571470,571483] [2022-07-12 17:03:07,301 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[571613,571626] [2022-07-12 17:03:07,301 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[571757,571770] [2022-07-12 17:03:07,302 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[571900,571913] [2022-07-12 17:03:07,302 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[572044,572057] [2022-07-12 17:03:07,302 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[572185,572198] [2022-07-12 17:03:07,303 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[572323,572336] [2022-07-12 17:03:07,303 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[572481,572494] [2022-07-12 17:03:07,304 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[572640,572653] [2022-07-12 17:03:07,304 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[572796,572809] [2022-07-12 17:03:07,304 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[572945,572958] [2022-07-12 17:03:07,305 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[573097,573110] [2022-07-12 17:03:07,305 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[573248,573261] [2022-07-12 17:03:07,306 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[573397,573410] [2022-07-12 17:03:07,306 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[573549,573562] [2022-07-12 17:03:07,306 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[573697,573710] [2022-07-12 17:03:07,307 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[573850,573863] [2022-07-12 17:03:07,307 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[574001,574014] [2022-07-12 17:03:07,308 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[574151,574164] [2022-07-12 17:03:07,308 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[574298,574311] [2022-07-12 17:03:07,308 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[574449,574462] [2022-07-12 17:03:07,309 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[574600,574613] [2022-07-12 17:03:07,309 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[574748,574761] [2022-07-12 17:03:07,309 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[574914,574927] [2022-07-12 17:03:07,310 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[575083,575096] [2022-07-12 17:03:07,310 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[575250,575263] [2022-07-12 17:03:07,310 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[575418,575431] [2022-07-12 17:03:07,311 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[575568,575581] [2022-07-12 17:03:07,311 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[575715,575728] [2022-07-12 17:03:07,312 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[575876,575889] [2022-07-12 17:03:07,312 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[576046,576059] [2022-07-12 17:03:07,312 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[576208,576221] [2022-07-12 17:03:07,353 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 17:03:07,407 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 17:03:07,816 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[562820,562833] [2022-07-12 17:03:07,817 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[562965,562978] [2022-07-12 17:03:07,817 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[563111,563124] [2022-07-12 17:03:07,818 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[563276,563289] [2022-07-12 17:03:07,819 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[563434,563447] [2022-07-12 17:03:07,819 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[563592,563605] [2022-07-12 17:03:07,820 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[563750,563763] [2022-07-12 17:03:07,820 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[563910,563923] [2022-07-12 17:03:07,820 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[564069,564082] [2022-07-12 17:03:07,821 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[564208,564221] [2022-07-12 17:03:07,821 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[564350,564363] [2022-07-12 17:03:07,822 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[564499,564512] [2022-07-12 17:03:07,822 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[564638,564651] [2022-07-12 17:03:07,827 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[564793,564806] [2022-07-12 17:03:07,827 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[564953,564966] [2022-07-12 17:03:07,827 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[565104,565117] [2022-07-12 17:03:07,828 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[565255,565268] [2022-07-12 17:03:07,828 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[565407,565420] [2022-07-12 17:03:07,828 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[565556,565569] [2022-07-12 17:03:07,829 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[565704,565717] [2022-07-12 17:03:07,829 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[565861,565874] [2022-07-12 17:03:07,830 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[566010,566023] [2022-07-12 17:03:07,830 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[566166,566179] [2022-07-12 17:03:07,830 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[566319,566332] [2022-07-12 17:03:07,831 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[566465,566478] [2022-07-12 17:03:07,831 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[566608,566621] [2022-07-12 17:03:07,831 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[566760,566773] [2022-07-12 17:03:07,832 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[566906,566919] [2022-07-12 17:03:07,832 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[567051,567064] [2022-07-12 17:03:07,832 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[567205,567218] [2022-07-12 17:03:07,833 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[567356,567369] [2022-07-12 17:03:07,833 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[567511,567524] [2022-07-12 17:03:07,833 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[567663,567676] [2022-07-12 17:03:07,834 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[567818,567831] [2022-07-12 17:03:07,835 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[567982,567995] [2022-07-12 17:03:07,835 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[568138,568151] [2022-07-12 17:03:07,835 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[568302,568315] [2022-07-12 17:03:07,836 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[568444,568457] [2022-07-12 17:03:07,836 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[568602,568615] [2022-07-12 17:03:07,837 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[568769,568782] [2022-07-12 17:03:07,837 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[568928,568941] [2022-07-12 17:03:07,838 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[569087,569100] [2022-07-12 17:03:07,838 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[569236,569249] [2022-07-12 17:03:07,838 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[569383,569396] [2022-07-12 17:03:07,839 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[569522,569535] [2022-07-12 17:03:07,839 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[569685,569698] [2022-07-12 17:03:07,839 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[569851,569864] [2022-07-12 17:03:07,840 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[570015,570028] [2022-07-12 17:03:07,840 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[570180,570193] [2022-07-12 17:03:07,841 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[570345,570358] [2022-07-12 17:03:07,841 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[570511,570524] [2022-07-12 17:03:07,841 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[570676,570689] [2022-07-12 17:03:07,841 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[570843,570856] [2022-07-12 17:03:07,842 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[571003,571016] [2022-07-12 17:03:07,842 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[571165,571178] [2022-07-12 17:03:07,842 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[571324,571337] [2022-07-12 17:03:07,843 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[571470,571483] [2022-07-12 17:03:07,843 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[571613,571626] [2022-07-12 17:03:07,844 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[571757,571770] [2022-07-12 17:03:07,844 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[571900,571913] [2022-07-12 17:03:07,844 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[572044,572057] [2022-07-12 17:03:07,845 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[572185,572198] [2022-07-12 17:03:07,849 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[572323,572336] [2022-07-12 17:03:07,852 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[572481,572494] [2022-07-12 17:03:07,852 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[572640,572653] [2022-07-12 17:03:07,852 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[572796,572809] [2022-07-12 17:03:07,853 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[572945,572958] [2022-07-12 17:03:07,853 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[573097,573110] [2022-07-12 17:03:07,854 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[573248,573261] [2022-07-12 17:03:07,854 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[573397,573410] [2022-07-12 17:03:07,854 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[573549,573562] [2022-07-12 17:03:07,855 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[573697,573710] [2022-07-12 17:03:07,859 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[573850,573863] [2022-07-12 17:03:07,859 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[574001,574014] [2022-07-12 17:03:07,860 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[574151,574164] [2022-07-12 17:03:07,860 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[574298,574311] [2022-07-12 17:03:07,861 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[574449,574462] [2022-07-12 17:03:07,861 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[574600,574613] [2022-07-12 17:03:07,862 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[574748,574761] [2022-07-12 17:03:07,862 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[574914,574927] [2022-07-12 17:03:07,863 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[575083,575096] [2022-07-12 17:03:07,863 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[575250,575263] [2022-07-12 17:03:07,864 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[575418,575431] [2022-07-12 17:03:07,864 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[575568,575581] [2022-07-12 17:03:07,864 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[575715,575728] [2022-07-12 17:03:07,865 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[575876,575889] [2022-07-12 17:03:07,865 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[576046,576059] [2022-07-12 17:03:07,865 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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--intel--igbvf--igbvf.ko.cil.i[576208,576221] [2022-07-12 17:03:07,869 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 17:03:08,295 INFO L208 MainTranslator]: Completed translation [2022-07-12 17:03:08,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:03:08 WrapperNode [2022-07-12 17:03:08,296 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 17:03:08,297 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 17:03:08,297 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 17:03:08,297 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 17:03:08,303 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:03:08" (1/1) ... [2022-07-12 17:03:08,457 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:03:08" (1/1) ... [2022-07-12 17:03:08,855 INFO L137 Inliner]: procedures = 842, calls = 3789, calls flagged for inlining = 410, calls inlined = 310, statements flattened = 9245 [2022-07-12 17:03:08,857 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 17:03:08,858 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 17:03:08,858 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 17:03:08,858 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 17:03:08,866 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:03:08" (1/1) ... [2022-07-12 17:03:08,867 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:03:08" (1/1) ... [2022-07-12 17:03:08,916 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:03:08" (1/1) ... [2022-07-12 17:03:08,917 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:03:08" (1/1) ... [2022-07-12 17:03:09,069 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:03:08" (1/1) ... [2022-07-12 17:03:09,093 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:03:08" (1/1) ... [2022-07-12 17:03:09,202 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:03:08" (1/1) ... [2022-07-12 17:03:09,245 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 17:03:09,246 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 17:03:09,246 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 17:03:09,246 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 17:03:09,247 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:03:08" (1/1) ... [2022-07-12 17:03:09,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 17:03:09,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 17:03:09,329 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 17:03:09,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 17:03:09,425 INFO L130 BoogieDeclarations]: Found specification of procedure ipv6_hdr [2022-07-12 17:03:09,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ipv6_hdr [2022-07-12 17:03:09,426 INFO L130 BoogieDeclarations]: Found specification of procedure netif_wake_queue [2022-07-12 17:03:09,426 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_wake_queue [2022-07-12 17:03:09,426 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-12 17:03:09,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-12 17:03:09,426 INFO L130 BoogieDeclarations]: Found specification of procedure valid_dma_direction [2022-07-12 17:03:09,427 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_dma_direction [2022-07-12 17:03:09,427 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-07-12 17:03:09,427 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-07-12 17:03:09,427 INFO L130 BoogieDeclarations]: Found specification of procedure pci_name [2022-07-12 17:03:09,427 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_name [2022-07-12 17:03:09,427 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_maybe_stop_tx [2022-07-12 17:03:09,427 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_maybe_stop_tx [2022-07-12 17:03:09,427 INFO L130 BoogieDeclarations]: Found specification of procedure pci_get_drvdata [2022-07-12 17:03:09,428 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_get_drvdata [2022-07-12 17:03:09,428 INFO L130 BoogieDeclarations]: Found specification of procedure strlcpy [2022-07-12 17:03:09,428 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcpy [2022-07-12 17:03:09,428 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_suspend [2022-07-12 17:03:09,428 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_suspend [2022-07-12 17:03:09,428 INFO L130 BoogieDeclarations]: Found specification of procedure netif_device_detach [2022-07-12 17:03:09,428 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_device_detach [2022-07-12 17:03:09,429 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-07-12 17:03:09,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-07-12 17:03:09,429 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_assign_vector [2022-07-12 17:03:09,429 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_assign_vector [2022-07-12 17:03:09,429 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_ops [2022-07-12 17:03:09,429 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_ops [2022-07-12 17:03:09,429 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_desc_unused [2022-07-12 17:03:09,430 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_desc_unused [2022-07-12 17:03:09,430 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-12 17:03:09,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-12 17:03:09,430 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-12 17:03:09,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-12 17:03:09,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 17:03:09,430 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-07-12 17:03:09,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-07-12 17:03:09,431 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_netpoll [2022-07-12 17:03:09,431 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_netpoll [2022-07-12 17:03:09,431 INFO L130 BoogieDeclarations]: Found specification of procedure skb_headroom [2022-07-12 17:03:09,431 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_headroom [2022-07-12 17:03:09,431 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_reset_interrupt_capability [2022-07-12 17:03:09,431 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_reset_interrupt_capability [2022-07-12 17:03:09,431 INFO L130 BoogieDeclarations]: Found specification of procedure e1000_check_for_msg_vf [2022-07-12 17:03:09,455 INFO L138 BoogieDeclarations]: Found implementation of procedure e1000_check_for_msg_vf [2022-07-12 17:03:09,456 INFO L130 BoogieDeclarations]: Found specification of procedure skb_transport_header [2022-07-12 17:03:09,456 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_transport_header [2022-07-12 17:03:09,456 INFO L130 BoogieDeclarations]: Found specification of procedure skb_network_offset [2022-07-12 17:03:09,456 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_network_offset [2022-07-12 17:03:09,456 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2022-07-12 17:03:09,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2022-07-12 17:03:09,456 INFO L130 BoogieDeclarations]: Found specification of procedure pci_disable_device [2022-07-12 17:03:09,456 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_disable_device [2022-07-12 17:03:09,457 INFO L130 BoogieDeclarations]: Found specification of procedure napi_enable [2022-07-12 17:03:09,457 INFO L138 BoogieDeclarations]: Found implementation of procedure napi_enable [2022-07-12 17:03:09,457 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-12 17:03:09,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-12 17:03:09,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 17:03:09,457 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_calloc [2022-07-12 17:03:09,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_calloc [2022-07-12 17:03:09,457 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mod_timer [2022-07-12 17:03:09,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mod_timer [2022-07-12 17:03:09,458 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_configure_msix [2022-07-12 17:03:09,458 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_configure_msix [2022-07-12 17:03:09,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 17:03:09,458 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_open [2022-07-12 17:03:09,458 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_open [2022-07-12 17:03:09,458 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-12 17:03:09,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-12 17:03:09,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 17:03:09,459 INFO L130 BoogieDeclarations]: Found specification of procedure skb_headlen [2022-07-12 17:03:09,459 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_headlen [2022-07-12 17:03:09,459 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_nway_reset [2022-07-12 17:03:09,459 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_nway_reset [2022-07-12 17:03:09,459 INFO L130 BoogieDeclarations]: Found specification of procedure e1000_write_posted_mbx [2022-07-12 17:03:09,459 INFO L138 BoogieDeclarations]: Found implementation of procedure e1000_write_posted_mbx [2022-07-12 17:03:09,459 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2022-07-12 17:03:09,460 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2022-07-12 17:03:09,460 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_irq_enable [2022-07-12 17:03:09,460 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_irq_enable [2022-07-12 17:03:09,460 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-07-12 17:03:09,460 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-07-12 17:03:09,460 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_netdev [2022-07-12 17:03:09,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_netdev [2022-07-12 17:03:09,460 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_update_stats [2022-07-12 17:03:09,460 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_update_stats [2022-07-12 17:03:09,461 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ulong [2022-07-12 17:03:09,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ulong [2022-07-12 17:03:09,461 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2022-07-12 17:03:09,461 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2022-07-12 17:03:09,461 INFO L130 BoogieDeclarations]: Found specification of procedure e1000_check_for_bit_vf [2022-07-12 17:03:09,461 INFO L138 BoogieDeclarations]: Found implementation of procedure e1000_check_for_bit_vf [2022-07-12 17:03:09,461 INFO L130 BoogieDeclarations]: Found specification of procedure e1000_init_hw_vf [2022-07-12 17:03:09,461 INFO L138 BoogieDeclarations]: Found implementation of procedure e1000_init_hw_vf [2022-07-12 17:03:09,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 17:03:09,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 17:03:09,462 INFO L130 BoogieDeclarations]: Found specification of procedure e1000_poll_for_ack [2022-07-12 17:03:09,462 INFO L138 BoogieDeclarations]: Found implementation of procedure e1000_poll_for_ack [2022-07-12 17:03:09,462 INFO L130 BoogieDeclarations]: Found specification of procedure msleep [2022-07-12 17:03:09,462 INFO L138 BoogieDeclarations]: Found implementation of procedure msleep [2022-07-12 17:03:09,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-12 17:03:09,462 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~X~int~X~$Pointer$~TO~~dma_addr_t~0 [2022-07-12 17:03:09,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~X~int~X~$Pointer$~TO~~dma_addr_t~0 [2022-07-12 17:03:09,463 INFO L130 BoogieDeclarations]: Found specification of procedure e1000_rar_set_vf [2022-07-12 17:03:09,463 INFO L138 BoogieDeclarations]: Found implementation of procedure e1000_rar_set_vf [2022-07-12 17:03:09,463 INFO L130 BoogieDeclarations]: Found specification of procedure netif_carrier_off [2022-07-12 17:03:09,463 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_carrier_off [2022-07-12 17:03:09,463 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_down [2022-07-12 17:03:09,463 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_down [2022-07-12 17:03:09,463 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_to_process_context [2022-07-12 17:03:09,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_to_process_context [2022-07-12 17:03:09,464 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_free_irq [2022-07-12 17:03:09,464 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_free_irq [2022-07-12 17:03:09,464 INFO L130 BoogieDeclarations]: Found specification of procedure ip_hdr [2022-07-12 17:03:09,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ip_hdr [2022-07-12 17:03:09,464 INFO L130 BoogieDeclarations]: Found specification of procedure ethtool_cmd_speed_set [2022-07-12 17:03:09,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ethtool_cmd_speed_set [2022-07-12 17:03:09,464 INFO L130 BoogieDeclarations]: Found specification of procedure e1000_check_for_link_vf [2022-07-12 17:03:09,465 INFO L138 BoogieDeclarations]: Found implementation of procedure e1000_check_for_link_vf [2022-07-12 17:03:09,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-12 17:03:09,465 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-12 17:03:09,465 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_io_mem_unmap [2022-07-12 17:03:09,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_io_mem_unmap [2022-07-12 17:03:09,465 INFO L130 BoogieDeclarations]: Found specification of procedure e1000_read_v2p_mailbox [2022-07-12 17:03:09,465 INFO L138 BoogieDeclarations]: Found implementation of procedure e1000_read_v2p_mailbox [2022-07-12 17:03:09,465 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-07-12 17:03:09,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-07-12 17:03:09,466 INFO L130 BoogieDeclarations]: Found specification of procedure debug_dma_unmap_page [2022-07-12 17:03:09,466 INFO L138 BoogieDeclarations]: Found implementation of procedure debug_dma_unmap_page [2022-07-12 17:03:09,466 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-07-12 17:03:09,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-07-12 17:03:09,466 INFO L130 BoogieDeclarations]: Found specification of procedure dma_unmap_single_attrs [2022-07-12 17:03:09,466 INFO L138 BoogieDeclarations]: Found implementation of procedure dma_unmap_single_attrs [2022-07-12 17:03:09,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 17:03:09,466 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2022-07-12 17:03:09,467 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2022-07-12 17:03:09,467 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-12 17:03:09,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-12 17:03:09,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 17:03:09,467 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_setup_rx_resources [2022-07-12 17:03:09,467 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_setup_rx_resources [2022-07-12 17:03:09,467 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-12 17:03:09,467 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-12 17:03:09,468 INFO L130 BoogieDeclarations]: Found specification of procedure dma_mapping_error [2022-07-12 17:03:09,468 INFO L138 BoogieDeclarations]: Found implementation of procedure dma_mapping_error [2022-07-12 17:03:09,468 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-07-12 17:03:09,468 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-07-12 17:03:09,468 INFO L130 BoogieDeclarations]: Found specification of procedure lockdep_init_map [2022-07-12 17:03:09,468 INFO L138 BoogieDeclarations]: Found implementation of procedure lockdep_init_map [2022-07-12 17:03:09,468 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-12 17:03:09,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-12 17:03:09,468 INFO L130 BoogieDeclarations]: Found specification of procedure e1000_poll_for_msg [2022-07-12 17:03:09,469 INFO L138 BoogieDeclarations]: Found implementation of procedure e1000_poll_for_msg [2022-07-12 17:03:09,469 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-12 17:03:09,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-12 17:03:09,469 INFO L130 BoogieDeclarations]: Found specification of procedure dma_free_attrs [2022-07-12 17:03:09,469 INFO L138 BoogieDeclarations]: Found implementation of procedure dma_free_attrs [2022-07-12 17:03:09,469 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-07-12 17:03:09,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-07-12 17:03:09,469 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_nonatomic [2022-07-12 17:03:09,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_nonatomic [2022-07-12 17:03:09,470 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer_sync [2022-07-12 17:03:09,470 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer_sync [2022-07-12 17:03:09,470 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_shutdown [2022-07-12 17:03:09,470 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_shutdown [2022-07-12 17:03:09,470 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-07-12 17:03:09,470 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-07-12 17:03:09,470 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_get_eeprom_len [2022-07-12 17:03:09,470 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_get_eeprom_len [2022-07-12 17:03:09,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 17:03:09,471 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~u16~0~X~~bool~0~TO~~s32~0 [2022-07-12 17:03:09,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~u16~0~X~~bool~0~TO~~s32~0 [2022-07-12 17:03:09,471 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-12 17:03:09,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-12 17:03:09,471 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_io_resume [2022-07-12 17:03:09,471 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_io_resume [2022-07-12 17:03:09,471 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_tx_timeout [2022-07-12 17:03:09,472 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_tx_timeout [2022-07-12 17:03:09,472 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~dma_addr_t~0~X~int~X~int~X~$Pointer$~TO~VOID [2022-07-12 17:03:09,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~dma_addr_t~0~X~int~X~int~X~$Pointer$~TO~VOID [2022-07-12 17:03:09,472 INFO L130 BoogieDeclarations]: Found specification of procedure dma_alloc_attrs [2022-07-12 17:03:09,472 INFO L138 BoogieDeclarations]: Found implementation of procedure dma_alloc_attrs [2022-07-12 17:03:09,472 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_up [2022-07-12 17:03:09,472 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_up [2022-07-12 17:03:09,472 INFO L130 BoogieDeclarations]: Found specification of procedure dma_unmap_page [2022-07-12 17:03:09,472 INFO L138 BoogieDeclarations]: Found implementation of procedure dma_unmap_page [2022-07-12 17:03:09,473 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-07-12 17:03:09,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-07-12 17:03:09,473 INFO L130 BoogieDeclarations]: Found specification of procedure pci_release_regions [2022-07-12 17:03:09,473 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_release_regions [2022-07-12 17:03:09,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-12 17:03:09,473 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-12 17:03:09,473 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-12 17:03:09,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-12 17:03:09,474 INFO L130 BoogieDeclarations]: Found specification of procedure e1000_init_function_pointers_vf [2022-07-12 17:03:09,474 INFO L138 BoogieDeclarations]: Found implementation of procedure e1000_init_function_pointers_vf [2022-07-12 17:03:09,474 INFO L130 BoogieDeclarations]: Found specification of procedure dma_map_page [2022-07-12 17:03:09,474 INFO L138 BoogieDeclarations]: Found implementation of procedure dma_map_page [2022-07-12 17:03:09,474 INFO L130 BoogieDeclarations]: Found specification of procedure netif_carrier_ok [2022-07-12 17:03:09,474 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_carrier_ok [2022-07-12 17:03:09,474 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-07-12 17:03:09,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-07-12 17:03:09,474 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_alloc_rx_buffers [2022-07-12 17:03:09,475 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_alloc_rx_buffers [2022-07-12 17:03:09,475 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-07-12 17:03:09,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-07-12 17:03:09,475 INFO L130 BoogieDeclarations]: Found specification of procedure e1000_read_mac_addr_vf [2022-07-12 17:03:09,475 INFO L138 BoogieDeclarations]: Found implementation of procedure e1000_read_mac_addr_vf [2022-07-12 17:03:09,475 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_close [2022-07-12 17:03:09,475 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_close [2022-07-12 17:03:09,475 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-07-12 17:03:09,476 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-07-12 17:03:09,476 INFO L130 BoogieDeclarations]: Found specification of procedure e1000_reset_hw_vf [2022-07-12 17:03:09,476 INFO L138 BoogieDeclarations]: Found implementation of procedure e1000_reset_hw_vf [2022-07-12 17:03:09,476 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-12 17:03:09,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-12 17:03:09,476 INFO L130 BoogieDeclarations]: Found specification of procedure skb_end_pointer [2022-07-12 17:03:09,476 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_end_pointer [2022-07-12 17:03:09,476 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_clean_tx_irq [2022-07-12 17:03:09,476 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_clean_tx_irq [2022-07-12 17:03:09,477 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-12 17:03:09,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-12 17:03:09,477 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-07-12 17:03:09,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-07-12 17:03:09,477 INFO L130 BoogieDeclarations]: Found specification of procedure netif_device_attach [2022-07-12 17:03:09,477 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_device_attach [2022-07-12 17:03:09,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 17:03:09,477 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_del_timer_sync [2022-07-12 17:03:09,478 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_del_timer_sync [2022-07-12 17:03:09,478 INFO L130 BoogieDeclarations]: Found specification of procedure cancel_work_sync [2022-07-12 17:03:09,478 INFO L138 BoogieDeclarations]: Found implementation of procedure cancel_work_sync [2022-07-12 17:03:09,478 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-07-12 17:03:09,478 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-07-12 17:03:09,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-12 17:03:09,478 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-07-12 17:03:09,478 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-07-12 17:03:09,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-12 17:03:09,479 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2022-07-12 17:03:09,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2022-07-12 17:03:09,479 INFO L130 BoogieDeclarations]: Found specification of procedure __phys_addr [2022-07-12 17:03:09,479 INFO L138 BoogieDeclarations]: Found implementation of procedure __phys_addr [2022-07-12 17:03:09,479 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2022-07-12 17:03:09,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2022-07-12 17:03:09,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-12 17:03:09,480 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-12 17:03:09,480 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-07-12 17:03:09,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-07-12 17:03:09,480 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_to_interrupt_context [2022-07-12 17:03:09,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_to_interrupt_context [2022-07-12 17:03:09,480 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_free_tx_resources [2022-07-12 17:03:09,480 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_free_tx_resources [2022-07-12 17:03:09,480 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-07-12 17:03:09,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-07-12 17:03:09,481 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_interrupt_interrupt_instance_1 [2022-07-12 17:03:09,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_interrupt_interrupt_instance_1 [2022-07-12 17:03:09,481 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_interrupt_interrupt_instance_2 [2022-07-12 17:03:09,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_interrupt_interrupt_instance_2 [2022-07-12 17:03:09,481 INFO L130 BoogieDeclarations]: Found specification of procedure vfree [2022-07-12 17:03:09,481 INFO L138 BoogieDeclarations]: Found implementation of procedure vfree [2022-07-12 17:03:09,481 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-07-12 17:03:09,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-07-12 17:03:09,482 INFO L130 BoogieDeclarations]: Found specification of procedure __udelay [2022-07-12 17:03:09,482 INFO L138 BoogieDeclarations]: Found implementation of procedure __udelay [2022-07-12 17:03:09,482 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_interrupt_interrupt_instance_0 [2022-07-12 17:03:09,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_interrupt_interrupt_instance_0 [2022-07-12 17:03:09,482 INFO L130 BoogieDeclarations]: Found specification of procedure dma_map_single_attrs [2022-07-12 17:03:09,482 INFO L138 BoogieDeclarations]: Found implementation of procedure dma_map_single_attrs [2022-07-12 17:03:09,482 INFO L130 BoogieDeclarations]: Found specification of procedure is_valid_ether_addr [2022-07-12 17:03:09,482 INFO L138 BoogieDeclarations]: Found implementation of procedure is_valid_ether_addr [2022-07-12 17:03:09,482 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-12 17:03:09,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-12 17:03:09,483 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_reset [2022-07-12 17:03:09,483 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_reset [2022-07-12 17:03:09,483 INFO L130 BoogieDeclarations]: Found specification of procedure __init_work [2022-07-12 17:03:09,483 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_work [2022-07-12 17:03:09,483 INFO L130 BoogieDeclarations]: Found specification of procedure debug_dma_map_page [2022-07-12 17:03:09,483 INFO L138 BoogieDeclarations]: Found implementation of procedure debug_dma_map_page [2022-07-12 17:03:09,483 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_reinit_locked [2022-07-12 17:03:09,483 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_reinit_locked [2022-07-12 17:03:09,484 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-07-12 17:03:09,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-07-12 17:03:09,484 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_vlan_rx_add_vid [2022-07-12 17:03:09,484 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_vlan_rx_add_vid [2022-07-12 17:03:09,484 INFO L130 BoogieDeclarations]: Found specification of procedure writel [2022-07-12 17:03:09,484 INFO L138 BoogieDeclarations]: Found implementation of procedure writel [2022-07-12 17:03:09,484 INFO L130 BoogieDeclarations]: Found specification of procedure tcp_hdr [2022-07-12 17:03:09,484 INFO L138 BoogieDeclarations]: Found implementation of procedure tcp_hdr [2022-07-12 17:03:09,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-12 17:03:09,485 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-12 17:03:09,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-12 17:03:09,485 INFO L130 BoogieDeclarations]: Found specification of procedure request_irq [2022-07-12 17:03:09,485 INFO L138 BoogieDeclarations]: Found implementation of procedure request_irq [2022-07-12 17:03:09,485 INFO L130 BoogieDeclarations]: Found specification of procedure kmemcheck_mark_initialized [2022-07-12 17:03:09,485 INFO L138 BoogieDeclarations]: Found implementation of procedure kmemcheck_mark_initialized [2022-07-12 17:03:09,485 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_get_regs_len [2022-07-12 17:03:09,485 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_get_regs_len [2022-07-12 17:03:09,486 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_read [2022-07-12 17:03:09,486 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_read [2022-07-12 17:03:09,486 INFO L130 BoogieDeclarations]: Found specification of procedure kcalloc [2022-07-12 17:03:09,486 INFO L138 BoogieDeclarations]: Found implementation of procedure kcalloc [2022-07-12 17:03:09,486 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-07-12 17:03:09,486 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-07-12 17:03:09,486 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_clean_tx_ring [2022-07-12 17:03:09,486 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_clean_tx_ring [2022-07-12 17:03:09,487 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2022-07-12 17:03:09,487 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2022-07-12 17:03:09,487 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_remove [2022-07-12 17:03:09,487 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_remove [2022-07-12 17:03:09,487 INFO L130 BoogieDeclarations]: Found specification of procedure pci_set_master [2022-07-12 17:03:09,487 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_set_master [2022-07-12 17:03:09,487 INFO L130 BoogieDeclarations]: Found specification of procedure netif_running [2022-07-12 17:03:09,487 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_running [2022-07-12 17:03:09,488 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_irq_disable [2022-07-12 17:03:09,488 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_irq_disable [2022-07-12 17:03:09,488 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_configure [2022-07-12 17:03:09,488 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_configure [2022-07-12 17:03:09,488 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_clean_rx_ring [2022-07-12 17:03:09,488 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_clean_rx_ring [2022-07-12 17:03:09,488 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~~s32~0 [2022-07-12 17:03:09,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~~s32~0 [2022-07-12 17:03:09,488 INFO L130 BoogieDeclarations]: Found specification of procedure e1000_obtain_mbx_lock_vf [2022-07-12 17:03:09,489 INFO L138 BoogieDeclarations]: Found implementation of procedure e1000_obtain_mbx_lock_vf [2022-07-12 17:03:09,489 INFO L130 BoogieDeclarations]: Found specification of procedure is_zero_ether_addr [2022-07-12 17:03:09,489 INFO L138 BoogieDeclarations]: Found implementation of procedure is_zero_ether_addr [2022-07-12 17:03:09,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 17:03:09,489 INFO L130 BoogieDeclarations]: Found specification of procedure e1000_check_for_ack_vf [2022-07-12 17:03:09,489 INFO L138 BoogieDeclarations]: Found implementation of procedure e1000_check_for_ack_vf [2022-07-12 17:03:09,489 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-12 17:03:09,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-12 17:03:09,490 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_request_irq [2022-07-12 17:03:09,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_request_irq [2022-07-12 17:03:09,490 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_request_irq [2022-07-12 17:03:09,490 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_request_irq [2022-07-12 17:03:09,490 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_resume [2022-07-12 17:03:09,490 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_resume [2022-07-12 17:03:09,490 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-12 17:03:09,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-12 17:03:09,490 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_put_txbuf [2022-07-12 17:03:09,491 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_put_txbuf [2022-07-12 17:03:09,491 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~~u16~0~TO~~s32~0 [2022-07-12 17:03:09,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~~u16~0~TO~~s32~0 [2022-07-12 17:03:09,491 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2022-07-12 17:03:09,491 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2022-07-12 17:03:09,491 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-12 17:03:09,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-12 17:03:09,491 INFO L130 BoogieDeclarations]: Found specification of procedure skb_network_header [2022-07-12 17:03:09,492 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_network_header [2022-07-12 17:03:09,492 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_setup_tx_resources [2022-07-12 17:03:09,492 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_setup_tx_resources [2022-07-12 17:03:09,492 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-12 17:03:09,492 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-12 17:03:09,492 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-12 17:03:09,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-12 17:03:09,492 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~$Pointer$~TO~int [2022-07-12 17:03:09,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~$Pointer$~TO~int [2022-07-12 17:03:09,493 INFO L130 BoogieDeclarations]: Found specification of procedure pci_enable_device_mem [2022-07-12 17:03:09,493 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_enable_device_mem [2022-07-12 17:03:09,493 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-12 17:03:09,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-12 17:03:09,493 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2022-07-12 17:03:09,493 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2022-07-12 17:03:09,493 INFO L130 BoogieDeclarations]: Found specification of procedure dev_kfree_skb_any [2022-07-12 17:03:09,493 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_kfree_skb_any [2022-07-12 17:03:09,494 INFO L130 BoogieDeclarations]: Found specification of procedure dma_set_mask_and_coherent [2022-07-12 17:03:09,494 INFO L138 BoogieDeclarations]: Found implementation of procedure dma_set_mask_and_coherent [2022-07-12 17:03:09,494 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_free_rx_resources [2022-07-12 17:03:09,494 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_free_rx_resources [2022-07-12 17:03:09,494 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_set_multi [2022-07-12 17:03:09,494 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_set_multi [2022-07-12 17:03:09,494 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-12 17:03:09,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-12 17:03:09,494 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_work [2022-07-12 17:03:09,495 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_work [2022-07-12 17:03:09,495 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-12 17:03:09,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-12 17:03:09,495 INFO L130 BoogieDeclarations]: Found specification of procedure e1000_read_posted_mbx [2022-07-12 17:03:09,495 INFO L138 BoogieDeclarations]: Found implementation of procedure e1000_read_posted_mbx [2022-07-12 17:03:09,495 INFO L130 BoogieDeclarations]: Found specification of procedure readl [2022-07-12 17:03:09,495 INFO L138 BoogieDeclarations]: Found implementation of procedure readl [2022-07-12 17:03:09,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 17:03:09,496 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2022-07-12 17:03:10,672 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 17:03:10,675 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 17:03:10,767 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-12 17:03:16,177 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 17:03:16,203 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 17:03:16,203 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-12 17:03:16,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 05:03:16 BoogieIcfgContainer [2022-07-12 17:03:16,209 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 17:03:16,211 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 17:03:16,211 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 17:03:16,214 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 17:03:16,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 05:03:01" (1/3) ... [2022-07-12 17:03:16,215 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cf2e5b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 05:03:16, skipping insertion in model container [2022-07-12 17:03:16,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:03:08" (2/3) ... [2022-07-12 17:03:16,216 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cf2e5b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 05:03:16, skipping insertion in model container [2022-07-12 17:03:16,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 05:03:16" (3/3) ... [2022-07-12 17:03:16,220 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i [2022-07-12 17:03:16,236 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 17:03:16,238 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 29 error locations. [2022-07-12 17:03:16,353 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 17:03:16,359 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@57b6d271, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3e047d31 [2022-07-12 17:03:16,360 INFO L358 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2022-07-12 17:03:16,372 INFO L276 IsEmpty]: Start isEmpty. Operand has 3169 states, 2192 states have (on average 1.322536496350365) internal successors, (2899), 2278 states have internal predecessors, (2899), 766 states have call successors, (766), 182 states have call predecessors, (766), 181 states have return successors, (760), 743 states have call predecessors, (760), 760 states have call successors, (760) [2022-07-12 17:03:16,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-12 17:03:16,385 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:03:16,386 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-12 17:03:16,387 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_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:03:16,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:03:16,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1113729633, now seen corresponding path program 1 times [2022-07-12 17:03:16,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:03:16,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403555174] [2022-07-12 17:03:16,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:03:16,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:03:16,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:17,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:03:17,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:17,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:03:17,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:17,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:03:17,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:17,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:03:17,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:17,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:03:17,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:17,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:03:17,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:17,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:03:17,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:17,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:03:17,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:17,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:03:17,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:17,170 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-12 17:03:17,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:03:17,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403555174] [2022-07-12 17:03:17,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403555174] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:03:17,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:03:17,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:03:17,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104834516] [2022-07-12 17:03:17,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:03:17,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:03:17,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:03:17,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:03:17,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:03:17,208 INFO L87 Difference]: Start difference. First operand has 3169 states, 2192 states have (on average 1.322536496350365) internal successors, (2899), 2278 states have internal predecessors, (2899), 766 states have call successors, (766), 182 states have call predecessors, (766), 181 states have return successors, (760), 743 states have call predecessors, (760), 760 states have call successors, (760) 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-12 17:03:19,895 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:03:21,745 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:03:33,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:03:33,012 INFO L93 Difference]: Finished difference Result 9432 states and 13453 transitions. [2022-07-12 17:03:33,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 17:03:33,014 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-12 17:03:33,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:03:33,117 INFO L225 Difference]: With dead ends: 9432 [2022-07-12 17:03:33,117 INFO L226 Difference]: Without dead ends: 6263 [2022-07-12 17:03:33,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-07-12 17:03:33,144 INFO L413 NwaCegarLoop]: 6719 mSDtfsCounter, 7641 mSDsluCounter, 7937 mSDsCounter, 0 mSdLazyCounter, 10068 mSolverCounterSat, 4530 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7952 SdHoareTripleChecker+Valid, 14656 SdHoareTripleChecker+Invalid, 14598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4530 IncrementalHoareTripleChecker+Valid, 10068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.1s IncrementalHoareTripleChecker+Time [2022-07-12 17:03:33,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7952 Valid, 14656 Invalid, 14598 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4530 Valid, 10068 Invalid, 0 Unknown, 0 Unchecked, 15.1s Time] [2022-07-12 17:03:33,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6263 states. [2022-07-12 17:03:33,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6263 to 6068. [2022-07-12 17:03:33,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6068 states, 4232 states have (on average 1.2580340264650283) internal successors, (5324), 4369 states have internal predecessors, (5324), 1467 states have call successors, (1467), 342 states have call predecessors, (1467), 340 states have return successors, (1466), 1426 states have call predecessors, (1466), 1465 states have call successors, (1466) [2022-07-12 17:03:33,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6068 states to 6068 states and 8257 transitions. [2022-07-12 17:03:33,530 INFO L78 Accepts]: Start accepts. Automaton has 6068 states and 8257 transitions. Word has length 64 [2022-07-12 17:03:33,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:03:33,531 INFO L495 AbstractCegarLoop]: Abstraction has 6068 states and 8257 transitions. [2022-07-12 17:03:33,531 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-12 17:03:33,531 INFO L276 IsEmpty]: Start isEmpty. Operand 6068 states and 8257 transitions. [2022-07-12 17:03:33,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-12 17:03:33,534 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:03:33,534 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-12 17:03:33,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 17:03:33,535 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_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:03:33,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:03:33,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1268897674, now seen corresponding path program 1 times [2022-07-12 17:03:33,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:03:33,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757357935] [2022-07-12 17:03:33,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:03:33,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:03:33,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:33,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:03:33,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:33,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:03:33,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:33,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:03:33,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:33,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:03:33,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:33,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:03:33,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:33,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:03:33,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:33,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:03:33,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:33,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:03:33,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:33,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:03:33,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:33,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:03:33,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:33,964 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-12 17:03:33,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:03:33,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757357935] [2022-07-12 17:03:33,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757357935] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:03:33,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:03:33,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:03:33,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994051899] [2022-07-12 17:03:33,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:03:33,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:03:33,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:03:33,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:03:33,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:03:33,968 INFO L87 Difference]: Start difference. First operand 6068 states and 8257 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-12 17:03:40,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:03:40,145 INFO L93 Difference]: Finished difference Result 6068 states and 8257 transitions. [2022-07-12 17:03:40,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:03:40,151 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-12 17:03:40,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:03:40,182 INFO L225 Difference]: With dead ends: 6068 [2022-07-12 17:03:40,183 INFO L226 Difference]: Without dead ends: 6066 [2022-07-12 17:03:40,185 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-12 17:03:40,186 INFO L413 NwaCegarLoop]: 3816 mSDtfsCounter, 6399 mSDsluCounter, 3489 mSDsCounter, 0 mSdLazyCounter, 3963 mSolverCounterSat, 3270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6710 SdHoareTripleChecker+Valid, 7305 SdHoareTripleChecker+Invalid, 7233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3270 IncrementalHoareTripleChecker+Valid, 3963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-07-12 17:03:40,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6710 Valid, 7305 Invalid, 7233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3270 Valid, 3963 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2022-07-12 17:03:40,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6066 states. [2022-07-12 17:03:40,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6066 to 6066. [2022-07-12 17:03:40,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6066 states, 4231 states have (on average 1.257858662254786) internal successors, (5322), 4367 states have internal predecessors, (5322), 1467 states have call successors, (1467), 342 states have call predecessors, (1467), 340 states have return successors, (1466), 1426 states have call predecessors, (1466), 1465 states have call successors, (1466) [2022-07-12 17:03:40,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6066 states to 6066 states and 8255 transitions. [2022-07-12 17:03:40,393 INFO L78 Accepts]: Start accepts. Automaton has 6066 states and 8255 transitions. Word has length 70 [2022-07-12 17:03:40,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:03:40,394 INFO L495 AbstractCegarLoop]: Abstraction has 6066 states and 8255 transitions. [2022-07-12 17:03:40,394 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-12 17:03:40,394 INFO L276 IsEmpty]: Start isEmpty. Operand 6066 states and 8255 transitions. [2022-07-12 17:03:40,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-12 17:03:40,404 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:03:40,405 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-12 17:03:40,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 17:03:40,405 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_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:03:40,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:03:40,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1564621767, now seen corresponding path program 1 times [2022-07-12 17:03:40,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:03:40,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366984711] [2022-07-12 17:03:40,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:03:40,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:03:40,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:40,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:03:40,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:40,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:03:40,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:40,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:03:40,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:40,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:03:40,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:40,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:03:40,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:40,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:03:40,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:40,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:03:40,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:40,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:03:40,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:40,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:03:40,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:40,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:03:40,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:40,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:03:40,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:40,800 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-12 17:03:40,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:03:40,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366984711] [2022-07-12 17:03:40,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366984711] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:03:40,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:03:40,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:03:40,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447943861] [2022-07-12 17:03:40,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:03:40,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:03:40,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:03:40,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:03:40,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:03:40,803 INFO L87 Difference]: Start difference. First operand 6066 states and 8255 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-12 17:03:46,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:03:46,444 INFO L93 Difference]: Finished difference Result 6066 states and 8255 transitions. [2022-07-12 17:03:46,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:03:46,447 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-12 17:03:46,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:03:46,484 INFO L225 Difference]: With dead ends: 6066 [2022-07-12 17:03:46,484 INFO L226 Difference]: Without dead ends: 6064 [2022-07-12 17:03:46,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:03:46,493 INFO L413 NwaCegarLoop]: 3814 mSDtfsCounter, 6393 mSDsluCounter, 3489 mSDsCounter, 0 mSdLazyCounter, 3961 mSolverCounterSat, 3270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6703 SdHoareTripleChecker+Valid, 7303 SdHoareTripleChecker+Invalid, 7231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3270 IncrementalHoareTripleChecker+Valid, 3961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-07-12 17:03:46,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6703 Valid, 7303 Invalid, 7231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3270 Valid, 3961 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2022-07-12 17:03:46,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6064 states. [2022-07-12 17:03:46,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6064 to 6064. [2022-07-12 17:03:46,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6064 states, 4230 states have (on average 1.2576832151300237) internal successors, (5320), 4365 states have internal predecessors, (5320), 1467 states have call successors, (1467), 342 states have call predecessors, (1467), 340 states have return successors, (1466), 1426 states have call predecessors, (1466), 1465 states have call successors, (1466) [2022-07-12 17:03:46,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6064 states to 6064 states and 8253 transitions. [2022-07-12 17:03:46,765 INFO L78 Accepts]: Start accepts. Automaton has 6064 states and 8253 transitions. Word has length 76 [2022-07-12 17:03:46,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:03:46,766 INFO L495 AbstractCegarLoop]: Abstraction has 6064 states and 8253 transitions. [2022-07-12 17:03:46,767 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-12 17:03:46,767 INFO L276 IsEmpty]: Start isEmpty. Operand 6064 states and 8253 transitions. [2022-07-12 17:03:46,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-12 17:03:46,770 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:03:46,770 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-12 17:03:46,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 17:03:46,770 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_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:03:46,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:03:46,771 INFO L85 PathProgramCache]: Analyzing trace with hash -772956513, now seen corresponding path program 1 times [2022-07-12 17:03:46,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:03:46,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371543804] [2022-07-12 17:03:46,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:03:46,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:03:46,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:47,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:03:47,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:47,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:03:47,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:47,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:03:47,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:47,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:03:47,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:47,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:03:47,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:47,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:03:47,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:47,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:03:47,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:47,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:03:47,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:47,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:03:47,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:47,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:03:47,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:47,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:03:47,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:47,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:03:47,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:47,226 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-12 17:03:47,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:03:47,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371543804] [2022-07-12 17:03:47,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371543804] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:03:47,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:03:47,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:03:47,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958086982] [2022-07-12 17:03:47,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:03:47,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:03:47,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:03:47,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:03:47,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:03:47,228 INFO L87 Difference]: Start difference. First operand 6064 states and 8253 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-12 17:03:48,969 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:03:53,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:03:53,798 INFO L93 Difference]: Finished difference Result 6064 states and 8253 transitions. [2022-07-12 17:03:53,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:03:53,799 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-12 17:03:53,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:03:53,832 INFO L225 Difference]: With dead ends: 6064 [2022-07-12 17:03:53,832 INFO L226 Difference]: Without dead ends: 6062 [2022-07-12 17:03:53,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:03:53,839 INFO L413 NwaCegarLoop]: 3812 mSDtfsCounter, 6387 mSDsluCounter, 3489 mSDsCounter, 0 mSdLazyCounter, 3959 mSolverCounterSat, 3270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6696 SdHoareTripleChecker+Valid, 7301 SdHoareTripleChecker+Invalid, 7229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3270 IncrementalHoareTripleChecker+Valid, 3959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-07-12 17:03:53,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6696 Valid, 7301 Invalid, 7229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3270 Valid, 3959 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2022-07-12 17:03:53,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6062 states. [2022-07-12 17:03:54,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6062 to 6062. [2022-07-12 17:03:54,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6062 states, 4229 states have (on average 1.2575076850319225) internal successors, (5318), 4363 states have internal predecessors, (5318), 1467 states have call successors, (1467), 342 states have call predecessors, (1467), 340 states have return successors, (1466), 1426 states have call predecessors, (1466), 1465 states have call successors, (1466) [2022-07-12 17:03:54,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6062 states to 6062 states and 8251 transitions. [2022-07-12 17:03:54,147 INFO L78 Accepts]: Start accepts. Automaton has 6062 states and 8251 transitions. Word has length 82 [2022-07-12 17:03:54,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:03:54,148 INFO L495 AbstractCegarLoop]: Abstraction has 6062 states and 8251 transitions. [2022-07-12 17:03:54,148 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-12 17:03:54,148 INFO L276 IsEmpty]: Start isEmpty. Operand 6062 states and 8251 transitions. [2022-07-12 17:03:54,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-12 17:03:54,149 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:03:54,149 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-12 17:03:54,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 17:03:54,151 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_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:03:54,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:03:54,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1443109529, now seen corresponding path program 1 times [2022-07-12 17:03:54,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:03:54,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122795650] [2022-07-12 17:03:54,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:03:54,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:03:54,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:54,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:03:54,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:54,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:03:54,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:54,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:03:54,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:54,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:03:54,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:54,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:03:54,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:54,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:03:54,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:54,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:03:54,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:54,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:03:54,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:54,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:03:54,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:54,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:03:54,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:54,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:03:54,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:54,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:03:54,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:54,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 17:03:54,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:54,576 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-12 17:03:54,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:03:54,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122795650] [2022-07-12 17:03:54,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122795650] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:03:54,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:03:54,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:03:54,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502759204] [2022-07-12 17:03:54,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:03:54,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:03:54,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:03:54,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:03:54,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:03:54,579 INFO L87 Difference]: Start difference. First operand 6062 states and 8251 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-12 17:04:00,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:04:00,573 INFO L93 Difference]: Finished difference Result 6062 states and 8251 transitions. [2022-07-12 17:04:00,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:04:00,574 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-12 17:04:00,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:04:00,605 INFO L225 Difference]: With dead ends: 6062 [2022-07-12 17:04:00,606 INFO L226 Difference]: Without dead ends: 6060 [2022-07-12 17:04:00,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:04:00,611 INFO L413 NwaCegarLoop]: 3810 mSDtfsCounter, 6381 mSDsluCounter, 3489 mSDsCounter, 0 mSdLazyCounter, 3957 mSolverCounterSat, 3270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6689 SdHoareTripleChecker+Valid, 7299 SdHoareTripleChecker+Invalid, 7227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3270 IncrementalHoareTripleChecker+Valid, 3957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-07-12 17:04:00,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6689 Valid, 7299 Invalid, 7227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3270 Valid, 3957 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2022-07-12 17:04:00,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6060 states. [2022-07-12 17:04:00,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6060 to 6060. [2022-07-12 17:04:00,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6060 states, 4228 states have (on average 1.2573320719016083) internal successors, (5316), 4361 states have internal predecessors, (5316), 1467 states have call successors, (1467), 342 states have call predecessors, (1467), 340 states have return successors, (1466), 1426 states have call predecessors, (1466), 1465 states have call successors, (1466) [2022-07-12 17:04:00,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6060 states to 6060 states and 8249 transitions. [2022-07-12 17:04:00,888 INFO L78 Accepts]: Start accepts. Automaton has 6060 states and 8249 transitions. Word has length 88 [2022-07-12 17:04:00,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:04:00,889 INFO L495 AbstractCegarLoop]: Abstraction has 6060 states and 8249 transitions. [2022-07-12 17:04:00,889 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-12 17:04:00,889 INFO L276 IsEmpty]: Start isEmpty. Operand 6060 states and 8249 transitions. [2022-07-12 17:04:00,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-12 17:04:00,895 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:04:00,895 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, 1, 1, 1, 1] [2022-07-12 17:04:00,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 17:04:00,896 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:04:00,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:04:00,896 INFO L85 PathProgramCache]: Analyzing trace with hash -240102284, now seen corresponding path program 1 times [2022-07-12 17:04:00,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:04:00,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672683186] [2022-07-12 17:04:00,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:04:00,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:04:00,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:01,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:04:01,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:01,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:04:01,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:01,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:04:01,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:01,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 17:04:01,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:01,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:04:01,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:01,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:04:01,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:01,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:04:01,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:01,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 17:04:01,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:01,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:04:01,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:01,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:04:01,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:01,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:04:01,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:01,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 17:04:01,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:01,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:04:01,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:01,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:04:01,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:01,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:04:01,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:01,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 17:04:01,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:01,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 17:04:01,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:01,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:04:01,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:01,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 17:04:01,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:01,256 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-12 17:04:01,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:04:01,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672683186] [2022-07-12 17:04:01,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672683186] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:04:01,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:04:01,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:04:01,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576471541] [2022-07-12 17:04:01,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:04:01,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:04:01,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:04:01,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:04:01,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:04:01,259 INFO L87 Difference]: Start difference. First operand 6060 states and 8249 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (13), 4 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-12 17:04:12,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:04:12,557 INFO L93 Difference]: Finished difference Result 18663 states and 25715 transitions. [2022-07-12 17:04:12,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 17:04:12,558 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (13), 4 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 114 [2022-07-12 17:04:12,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:04:12,622 INFO L225 Difference]: With dead ends: 18663 [2022-07-12 17:04:12,623 INFO L226 Difference]: Without dead ends: 12624 [2022-07-12 17:04:12,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-07-12 17:04:12,656 INFO L413 NwaCegarLoop]: 4917 mSDtfsCounter, 13062 mSDsluCounter, 6449 mSDsCounter, 0 mSdLazyCounter, 6453 mSolverCounterSat, 7843 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13403 SdHoareTripleChecker+Valid, 11366 SdHoareTripleChecker+Invalid, 14296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 7843 IncrementalHoareTripleChecker+Valid, 6453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2022-07-12 17:04:12,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13403 Valid, 11366 Invalid, 14296 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [7843 Valid, 6453 Invalid, 0 Unknown, 0 Unchecked, 10.6s Time] [2022-07-12 17:04:12,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12624 states. [2022-07-12 17:04:13,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12624 to 10821. [2022-07-12 17:04:13,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10821 states, 7617 states have (on average 1.2606012865957725) internal successors, (9602), 7823 states have internal predecessors, (9602), 2566 states have call successors, (2566), 609 states have call predecessors, (2566), 613 states have return successors, (2588), 2505 states have call predecessors, (2588), 2564 states have call successors, (2588) [2022-07-12 17:04:13,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10821 states to 10821 states and 14756 transitions. [2022-07-12 17:04:13,240 INFO L78 Accepts]: Start accepts. Automaton has 10821 states and 14756 transitions. Word has length 114 [2022-07-12 17:04:13,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:04:13,241 INFO L495 AbstractCegarLoop]: Abstraction has 10821 states and 14756 transitions. [2022-07-12 17:04:13,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (13), 4 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-12 17:04:13,241 INFO L276 IsEmpty]: Start isEmpty. Operand 10821 states and 14756 transitions. [2022-07-12 17:04:13,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-12 17:04:13,243 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:04:13,243 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-12 17:04:13,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 17:04:13,244 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_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:04:13,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:04:13,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1210075495, now seen corresponding path program 1 times [2022-07-12 17:04:13,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:04:13,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485365485] [2022-07-12 17:04:13,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:04:13,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:04:13,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:13,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:04:13,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:13,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:04:13,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:13,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:04:13,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:13,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:04:13,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:13,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:04:13,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:13,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:04:13,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:13,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:04:13,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:13,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:04:13,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:13,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:04:13,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:13,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:04:13,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:13,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:04:13,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:13,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:04:13,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:13,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 17:04:13,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:13,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 17:04:13,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:13,609 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-12 17:04:13,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:04:13,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485365485] [2022-07-12 17:04:13,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485365485] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:04:13,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:04:13,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:04:13,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157907938] [2022-07-12 17:04:13,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:04:13,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:04:13,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:04:13,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:04:13,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:04:13,612 INFO L87 Difference]: Start difference. First operand 10821 states and 14756 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-12 17:04:16,074 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:04:21,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:04:21,157 INFO L93 Difference]: Finished difference Result 10821 states and 14756 transitions. [2022-07-12 17:04:21,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:04:21,158 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-12 17:04:21,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:04:21,204 INFO L225 Difference]: With dead ends: 10821 [2022-07-12 17:04:21,204 INFO L226 Difference]: Without dead ends: 10819 [2022-07-12 17:04:21,212 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:04:21,213 INFO L413 NwaCegarLoop]: 3808 mSDtfsCounter, 6375 mSDsluCounter, 3489 mSDsCounter, 0 mSdLazyCounter, 3954 mSolverCounterSat, 3270 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6682 SdHoareTripleChecker+Valid, 7297 SdHoareTripleChecker+Invalid, 7225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3270 IncrementalHoareTripleChecker+Valid, 3954 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-07-12 17:04:21,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6682 Valid, 7297 Invalid, 7225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3270 Valid, 3954 Invalid, 1 Unknown, 0 Unchecked, 7.2s Time] [2022-07-12 17:04:21,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10819 states. [2022-07-12 17:04:21,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10819 to 10819. [2022-07-12 17:04:21,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10819 states, 7616 states have (on average 1.2605042016806722) internal successors, (9600), 7821 states have internal predecessors, (9600), 2566 states have call successors, (2566), 609 states have call predecessors, (2566), 613 states have return successors, (2588), 2505 states have call predecessors, (2588), 2564 states have call successors, (2588) [2022-07-12 17:04:21,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10819 states to 10819 states and 14754 transitions. [2022-07-12 17:04:21,678 INFO L78 Accepts]: Start accepts. Automaton has 10819 states and 14754 transitions. Word has length 94 [2022-07-12 17:04:21,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:04:21,679 INFO L495 AbstractCegarLoop]: Abstraction has 10819 states and 14754 transitions. [2022-07-12 17:04:21,679 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-12 17:04:21,679 INFO L276 IsEmpty]: Start isEmpty. Operand 10819 states and 14754 transitions. [2022-07-12 17:04:21,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-12 17:04:21,681 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:04:21,681 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, 1, 1, 1, 1] [2022-07-12 17:04:21,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 17:04:21,682 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:04:21,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:04:21,683 INFO L85 PathProgramCache]: Analyzing trace with hash -2127157373, now seen corresponding path program 1 times [2022-07-12 17:04:21,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:04:21,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582528065] [2022-07-12 17:04:21,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:04:21,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:04:21,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:21,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:04:21,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:21,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:04:21,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:21,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:04:21,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:21,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 17:04:21,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:21,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:04:21,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:21,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:04:21,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:21,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:04:21,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:21,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 17:04:21,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:21,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:04:21,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:21,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:04:21,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:21,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:04:21,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:21,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 17:04:21,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:21,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:04:21,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:21,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:04:21,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:22,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:04:22,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:22,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 17:04:22,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:22,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 17:04:22,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:22,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:04:22,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:22,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 17:04:22,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:22,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-12 17:04:22,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:22,083 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-12 17:04:22,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:04:22,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582528065] [2022-07-12 17:04:22,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582528065] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 17:04:22,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163194850] [2022-07-12 17:04:22,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:04:22,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:04:22,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 17:04:22,087 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 17:04:22,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 17:04:23,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:23,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 3096 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 17:04:23,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:04:23,230 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-12 17:04:23,231 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:04:23,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163194850] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:04:23,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 17:04:23,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2022-07-12 17:04:23,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688506580] [2022-07-12 17:04:23,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:04:23,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 17:04:23,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:04:23,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 17:04:23,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:04:23,233 INFO L87 Difference]: Start difference. First operand 10819 states and 14754 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-12 17:04:23,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:04:23,746 INFO L93 Difference]: Finished difference Result 21611 states and 29470 transitions. [2022-07-12 17:04:23,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 17:04:23,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 120 [2022-07-12 17:04:23,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:04:23,795 INFO L225 Difference]: With dead ends: 21611 [2022-07-12 17:04:23,795 INFO L226 Difference]: Without dead ends: 10813 [2022-07-12 17:04:23,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:04:23,838 INFO L413 NwaCegarLoop]: 4242 mSDtfsCounter, 4222 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4222 SdHoareTripleChecker+Valid, 4242 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-12 17:04:23,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4222 Valid, 4242 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 17:04:23,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10813 states. [2022-07-12 17:04:24,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10813 to 10813. [2022-07-12 17:04:24,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10813 states, 7611 states have (on average 1.260149783208514) internal successors, (9591), 7815 states have internal predecessors, (9591), 2566 states have call successors, (2566), 609 states have call predecessors, (2566), 613 states have return successors, (2588), 2505 states have call predecessors, (2588), 2564 states have call successors, (2588) [2022-07-12 17:04:24,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10813 states to 10813 states and 14745 transitions. [2022-07-12 17:04:24,341 INFO L78 Accepts]: Start accepts. Automaton has 10813 states and 14745 transitions. Word has length 120 [2022-07-12 17:04:24,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:04:24,342 INFO L495 AbstractCegarLoop]: Abstraction has 10813 states and 14745 transitions. [2022-07-12 17:04:24,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-12 17:04:24,343 INFO L276 IsEmpty]: Start isEmpty. Operand 10813 states and 14745 transitions. [2022-07-12 17:04:24,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-12 17:04:24,344 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:04:24,345 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-12 17:04:24,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 17:04:24,566 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-12 17:04:24,566 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_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:04:24,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:04:24,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1466723574, now seen corresponding path program 1 times [2022-07-12 17:04:24,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:04:24,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346061099] [2022-07-12 17:04:24,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:04:24,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:04:24,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:24,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:04:24,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:24,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:04:24,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:24,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:04:24,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:24,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:04:24,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:24,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:04:24,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:24,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:04:24,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:24,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:04:24,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:24,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:04:24,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:24,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:04:24,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:24,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:04:24,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:24,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:04:24,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:24,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:04:24,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:24,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 17:04:24,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:24,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 17:04:24,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:24,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 17:04:24,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:24,945 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-12 17:04:24,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:04:24,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346061099] [2022-07-12 17:04:24,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346061099] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:04:24,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:04:24,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:04:24,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242613782] [2022-07-12 17:04:24,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:04:24,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:04:24,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:04:24,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:04:24,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:04:24,948 INFO L87 Difference]: Start difference. First operand 10813 states and 14745 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-12 17:04:30,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:04:30,887 INFO L93 Difference]: Finished difference Result 10813 states and 14745 transitions. [2022-07-12 17:04:30,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:04:30,888 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-12 17:04:30,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:04:30,941 INFO L225 Difference]: With dead ends: 10813 [2022-07-12 17:04:30,941 INFO L226 Difference]: Without dead ends: 10811 [2022-07-12 17:04:30,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:04:30,952 INFO L413 NwaCegarLoop]: 3801 mSDtfsCounter, 6364 mSDsluCounter, 3475 mSDsCounter, 0 mSdLazyCounter, 3952 mSolverCounterSat, 3270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6670 SdHoareTripleChecker+Valid, 7276 SdHoareTripleChecker+Invalid, 7222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3270 IncrementalHoareTripleChecker+Valid, 3952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-07-12 17:04:30,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6670 Valid, 7276 Invalid, 7222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3270 Valid, 3952 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-07-12 17:04:30,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10811 states. [2022-07-12 17:04:31,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10811 to 10811. [2022-07-12 17:04:31,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10811 states, 7610 states have (on average 1.2600525624178711) internal successors, (9589), 7813 states have internal predecessors, (9589), 2566 states have call successors, (2566), 609 states have call predecessors, (2566), 613 states have return successors, (2588), 2505 states have call predecessors, (2588), 2564 states have call successors, (2588) [2022-07-12 17:04:31,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10811 states to 10811 states and 14743 transitions. [2022-07-12 17:04:31,445 INFO L78 Accepts]: Start accepts. Automaton has 10811 states and 14743 transitions. Word has length 100 [2022-07-12 17:04:31,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:04:31,446 INFO L495 AbstractCegarLoop]: Abstraction has 10811 states and 14743 transitions. [2022-07-12 17:04:31,446 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-12 17:04:31,446 INFO L276 IsEmpty]: Start isEmpty. Operand 10811 states and 14743 transitions. [2022-07-12 17:04:31,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-12 17:04:31,449 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:04:31,449 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-12 17:04:31,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 17:04:31,450 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_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:04:31,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:04:31,450 INFO L85 PathProgramCache]: Analyzing trace with hash 235004216, now seen corresponding path program 1 times [2022-07-12 17:04:31,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:04:31,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680393446] [2022-07-12 17:04:31,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:04:31,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:04:31,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:31,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:04:31,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:31,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:04:31,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:31,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:04:31,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:31,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:04:31,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:31,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:04:31,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:31,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:04:31,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:31,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:04:31,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:31,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:04:31,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:31,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:04:31,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:31,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:04:31,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:31,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:04:31,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:31,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:04:31,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:31,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 17:04:31,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:31,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 17:04:31,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:31,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 17:04:31,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:31,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:04:31,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:31,798 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-12 17:04:31,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:04:31,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680393446] [2022-07-12 17:04:31,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680393446] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:04:31,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:04:31,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:04:31,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149815374] [2022-07-12 17:04:31,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:04:31,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:04:31,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:04:31,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:04:31,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:04:31,801 INFO L87 Difference]: Start difference. First operand 10811 states and 14743 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-12 17:04:37,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:04:37,836 INFO L93 Difference]: Finished difference Result 10811 states and 14743 transitions. [2022-07-12 17:04:37,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:04:37,836 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-12 17:04:37,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:04:37,891 INFO L225 Difference]: With dead ends: 10811 [2022-07-12 17:04:37,891 INFO L226 Difference]: Without dead ends: 10809 [2022-07-12 17:04:37,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:04:37,902 INFO L413 NwaCegarLoop]: 3799 mSDtfsCounter, 6362 mSDsluCounter, 3475 mSDsCounter, 0 mSdLazyCounter, 3946 mSolverCounterSat, 3270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6667 SdHoareTripleChecker+Valid, 7274 SdHoareTripleChecker+Invalid, 7216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3270 IncrementalHoareTripleChecker+Valid, 3946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-07-12 17:04:37,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6667 Valid, 7274 Invalid, 7216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3270 Valid, 3946 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2022-07-12 17:04:37,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10809 states. [2022-07-12 17:04:38,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10809 to 10809. [2022-07-12 17:04:38,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10809 states, 7609 states have (on average 1.2599553160730714) internal successors, (9587), 7811 states have internal predecessors, (9587), 2566 states have call successors, (2566), 609 states have call predecessors, (2566), 613 states have return successors, (2588), 2505 states have call predecessors, (2588), 2564 states have call successors, (2588) [2022-07-12 17:04:38,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10809 states to 10809 states and 14741 transitions. [2022-07-12 17:04:38,488 INFO L78 Accepts]: Start accepts. Automaton has 10809 states and 14741 transitions. Word has length 106 [2022-07-12 17:04:38,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:04:38,489 INFO L495 AbstractCegarLoop]: Abstraction has 10809 states and 14741 transitions. [2022-07-12 17:04:38,489 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-12 17:04:38,489 INFO L276 IsEmpty]: Start isEmpty. Operand 10809 states and 14741 transitions. [2022-07-12 17:04:38,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-12 17:04:38,491 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:04:38,491 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-12 17:04:38,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 17:04:38,491 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_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:04:38,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:04:38,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1794012517, now seen corresponding path program 1 times [2022-07-12 17:04:38,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:04:38,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979060144] [2022-07-12 17:04:38,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:04:38,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:04:38,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:38,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:04:38,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:38,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:04:38,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:38,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:04:38,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:38,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:04:38,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:38,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:04:38,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:38,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:04:38,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:38,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:04:38,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:38,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:04:38,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:38,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:04:38,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:38,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:04:38,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:38,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:04:38,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:38,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:04:38,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:38,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 17:04:38,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:38,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 17:04:38,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:38,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 17:04:38,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:38,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:04:38,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:38,827 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-12 17:04:38,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:04:38,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979060144] [2022-07-12 17:04:38,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979060144] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:04:38,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:04:38,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:04:38,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750620544] [2022-07-12 17:04:38,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:04:38,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:04:38,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:04:38,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:04:38,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:04:38,831 INFO L87 Difference]: Start difference. First operand 10809 states and 14741 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-12 17:04:44,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:04:44,643 INFO L93 Difference]: Finished difference Result 10809 states and 14741 transitions. [2022-07-12 17:04:44,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:04:44,643 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-12 17:04:44,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:04:44,685 INFO L225 Difference]: With dead ends: 10809 [2022-07-12 17:04:44,685 INFO L226 Difference]: Without dead ends: 10807 [2022-07-12 17:04:44,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:04:44,692 INFO L413 NwaCegarLoop]: 3797 mSDtfsCounter, 6350 mSDsluCounter, 3475 mSDsCounter, 0 mSdLazyCounter, 3948 mSolverCounterSat, 3270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6655 SdHoareTripleChecker+Valid, 7272 SdHoareTripleChecker+Invalid, 7218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3270 IncrementalHoareTripleChecker+Valid, 3948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-07-12 17:04:44,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6655 Valid, 7272 Invalid, 7218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3270 Valid, 3948 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-07-12 17:04:44,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10807 states. [2022-07-12 17:04:45,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10807 to 10807. [2022-07-12 17:04:45,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10807 states, 7608 states have (on average 1.259858044164038) internal successors, (9585), 7809 states have internal predecessors, (9585), 2566 states have call successors, (2566), 609 states have call predecessors, (2566), 613 states have return successors, (2588), 2505 states have call predecessors, (2588), 2564 states have call successors, (2588) [2022-07-12 17:04:45,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10807 states to 10807 states and 14739 transitions. [2022-07-12 17:04:45,177 INFO L78 Accepts]: Start accepts. Automaton has 10807 states and 14739 transitions. Word has length 108 [2022-07-12 17:04:45,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:04:45,177 INFO L495 AbstractCegarLoop]: Abstraction has 10807 states and 14739 transitions. [2022-07-12 17:04:45,177 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-12 17:04:45,178 INFO L276 IsEmpty]: Start isEmpty. Operand 10807 states and 14739 transitions. [2022-07-12 17:04:45,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-12 17:04:45,179 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:04:45,179 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-12 17:04:45,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 17:04:45,180 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_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:04:45,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:04:45,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1084745860, now seen corresponding path program 1 times [2022-07-12 17:04:45,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:04:45,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489341960] [2022-07-12 17:04:45,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:04:45,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:04:45,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:45,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:04:45,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:45,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:04:45,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:45,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:04:45,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:45,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:04:45,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:45,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:04:45,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:45,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:04:45,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:45,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:04:45,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:45,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:04:45,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:45,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:04:45,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:45,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:04:45,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:45,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:04:45,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:45,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:04:45,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:45,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 17:04:45,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:45,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 17:04:45,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:45,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 17:04:45,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:45,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:04:45,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:45,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 17:04:45,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:45,509 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-12 17:04:45,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:04:45,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489341960] [2022-07-12 17:04:45,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489341960] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:04:45,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:04:45,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:04:45,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94132013] [2022-07-12 17:04:45,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:04:45,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:04:45,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:04:45,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:04:45,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:04:45,511 INFO L87 Difference]: Start difference. First operand 10807 states and 14739 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-12 17:04:51,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:04:51,822 INFO L93 Difference]: Finished difference Result 10807 states and 14739 transitions. [2022-07-12 17:04:51,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:04:51,823 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-12 17:04:51,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:04:51,868 INFO L225 Difference]: With dead ends: 10807 [2022-07-12 17:04:51,869 INFO L226 Difference]: Without dead ends: 10805 [2022-07-12 17:04:51,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:04:51,878 INFO L413 NwaCegarLoop]: 3795 mSDtfsCounter, 6346 mSDsluCounter, 3475 mSDsCounter, 0 mSdLazyCounter, 3946 mSolverCounterSat, 3270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6650 SdHoareTripleChecker+Valid, 7270 SdHoareTripleChecker+Invalid, 7216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3270 IncrementalHoareTripleChecker+Valid, 3946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-07-12 17:04:51,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6650 Valid, 7270 Invalid, 7216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3270 Valid, 3946 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2022-07-12 17:04:51,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10805 states. [2022-07-12 17:04:52,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10805 to 10805. [2022-07-12 17:04:52,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10805 states, 7607 states have (on average 1.2597607466806888) internal successors, (9583), 7807 states have internal predecessors, (9583), 2566 states have call successors, (2566), 609 states have call predecessors, (2566), 613 states have return successors, (2588), 2505 states have call predecessors, (2588), 2564 states have call successors, (2588) [2022-07-12 17:04:52,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10805 states to 10805 states and 14737 transitions. [2022-07-12 17:04:52,386 INFO L78 Accepts]: Start accepts. Automaton has 10805 states and 14737 transitions. Word has length 114 [2022-07-12 17:04:52,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:04:52,387 INFO L495 AbstractCegarLoop]: Abstraction has 10805 states and 14737 transitions. [2022-07-12 17:04:52,387 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-12 17:04:52,387 INFO L276 IsEmpty]: Start isEmpty. Operand 10805 states and 14737 transitions. [2022-07-12 17:04:52,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-12 17:04:52,389 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:04:52,389 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-12 17:04:52,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 17:04:52,389 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_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:04:52,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:04:52,390 INFO L85 PathProgramCache]: Analyzing trace with hash 305349525, now seen corresponding path program 1 times [2022-07-12 17:04:52,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:04:52,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262467953] [2022-07-12 17:04:52,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:04:52,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:04:52,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:52,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:04:52,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:52,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:04:52,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:52,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:04:52,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:52,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:04:52,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:52,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:04:52,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:52,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:04:52,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:52,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:04:52,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:52,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:04:52,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:52,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:04:52,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:52,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:04:52,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:52,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:04:52,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:52,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:04:52,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:52,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 17:04:52,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:52,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 17:04:52,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:52,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 17:04:52,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:52,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:04:52,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:52,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 17:04:52,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:52,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 17:04:52,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:52,729 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-12 17:04:52,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:04:52,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262467953] [2022-07-12 17:04:52,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262467953] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:04:52,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:04:52,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:04:52,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813165926] [2022-07-12 17:04:52,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:04:52,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:04:52,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:04:52,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:04:52,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:04:52,732 INFO L87 Difference]: Start difference. First operand 10805 states and 14737 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-12 17:04:58,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:04:58,811 INFO L93 Difference]: Finished difference Result 10805 states and 14737 transitions. [2022-07-12 17:04:58,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:04:58,812 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-12 17:04:58,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:04:58,844 INFO L225 Difference]: With dead ends: 10805 [2022-07-12 17:04:58,844 INFO L226 Difference]: Without dead ends: 10803 [2022-07-12 17:04:58,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:04:58,852 INFO L413 NwaCegarLoop]: 3793 mSDtfsCounter, 6340 mSDsluCounter, 3475 mSDsCounter, 0 mSdLazyCounter, 3944 mSolverCounterSat, 3270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6643 SdHoareTripleChecker+Valid, 7268 SdHoareTripleChecker+Invalid, 7214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3270 IncrementalHoareTripleChecker+Valid, 3944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-07-12 17:04:58,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6643 Valid, 7268 Invalid, 7214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3270 Valid, 3944 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2022-07-12 17:04:58,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10803 states. [2022-07-12 17:04:59,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10803 to 10803. [2022-07-12 17:04:59,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10803 states, 7606 states have (on average 1.2596634236129371) internal successors, (9581), 7805 states have internal predecessors, (9581), 2566 states have call successors, (2566), 609 states have call predecessors, (2566), 613 states have return successors, (2588), 2505 states have call predecessors, (2588), 2564 states have call successors, (2588) [2022-07-12 17:04:59,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10803 states to 10803 states and 14735 transitions. [2022-07-12 17:04:59,355 INFO L78 Accepts]: Start accepts. Automaton has 10803 states and 14735 transitions. Word has length 120 [2022-07-12 17:04:59,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:04:59,356 INFO L495 AbstractCegarLoop]: Abstraction has 10803 states and 14735 transitions. [2022-07-12 17:04:59,356 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-12 17:04:59,356 INFO L276 IsEmpty]: Start isEmpty. Operand 10803 states and 14735 transitions. [2022-07-12 17:04:59,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-07-12 17:04:59,357 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:04:59,358 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-12 17:04:59,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 17:04:59,358 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_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:04:59,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:04:59,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1557366619, now seen corresponding path program 1 times [2022-07-12 17:04:59,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:04:59,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063406614] [2022-07-12 17:04:59,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:04:59,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:04:59,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:59,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:04:59,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:59,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:04:59,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:59,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:04:59,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:59,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:04:59,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:59,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:04:59,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:59,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:04:59,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:59,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:04:59,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:59,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:04:59,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:59,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:04:59,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:59,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:04:59,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:59,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:04:59,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:59,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:04:59,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:59,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 17:04:59,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:59,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 17:04:59,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:59,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 17:04:59,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:59,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:04:59,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:59,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 17:04:59,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:59,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 17:04:59,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:59,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:04:59,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:59,703 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-12 17:04:59,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:04:59,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063406614] [2022-07-12 17:04:59,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063406614] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:04:59,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:04:59,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:04:59,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308017425] [2022-07-12 17:04:59,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:04:59,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:04:59,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:04:59,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:04:59,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:04:59,706 INFO L87 Difference]: Start difference. First operand 10803 states and 14735 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-12 17:05:05,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:05:05,772 INFO L93 Difference]: Finished difference Result 10803 states and 14735 transitions. [2022-07-12 17:05:05,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:05:05,772 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-12 17:05:05,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:05:05,801 INFO L225 Difference]: With dead ends: 10803 [2022-07-12 17:05:05,801 INFO L226 Difference]: Without dead ends: 10801 [2022-07-12 17:05:05,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:05:05,805 INFO L413 NwaCegarLoop]: 3791 mSDtfsCounter, 6334 mSDsluCounter, 3475 mSDsCounter, 0 mSdLazyCounter, 3942 mSolverCounterSat, 3270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6636 SdHoareTripleChecker+Valid, 7266 SdHoareTripleChecker+Invalid, 7212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3270 IncrementalHoareTripleChecker+Valid, 3942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-07-12 17:05:05,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6636 Valid, 7266 Invalid, 7212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3270 Valid, 3942 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2022-07-12 17:05:05,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10801 states. [2022-07-12 17:05:06,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10801 to 10801. [2022-07-12 17:05:06,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10801 states, 7605 states have (on average 1.2595660749506903) internal successors, (9579), 7803 states have internal predecessors, (9579), 2566 states have call successors, (2566), 609 states have call predecessors, (2566), 613 states have return successors, (2588), 2505 states have call predecessors, (2588), 2564 states have call successors, (2588) [2022-07-12 17:05:06,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10801 states to 10801 states and 14733 transitions. [2022-07-12 17:05:06,227 INFO L78 Accepts]: Start accepts. Automaton has 10801 states and 14733 transitions. Word has length 126 [2022-07-12 17:05:06,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:05:06,227 INFO L495 AbstractCegarLoop]: Abstraction has 10801 states and 14733 transitions. [2022-07-12 17:05:06,227 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-12 17:05:06,228 INFO L276 IsEmpty]: Start isEmpty. Operand 10801 states and 14733 transitions. [2022-07-12 17:05:06,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-07-12 17:05:06,229 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:05:06,230 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-12 17:05:06,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 17:05:06,230 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_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:05:06,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:05:06,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1878397111, now seen corresponding path program 1 times [2022-07-12 17:05:06,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:05:06,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222502742] [2022-07-12 17:05:06,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:05:06,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:05:06,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:06,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:05:06,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:06,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:05:06,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:06,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:05:06,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:06,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:05:06,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:06,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:05:06,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:06,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:05:06,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:06,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:06,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:06,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:05:06,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:06,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:05:06,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:06,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:05:06,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:06,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:05:06,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:06,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:05:06,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:06,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 17:05:06,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:06,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 17:05:06,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:06,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 17:05:06,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:06,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:05:06,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:06,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 17:05:06,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:06,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 17:05:06,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:06,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:05:06,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:06,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 17:05:06,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:06,601 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-12 17:05:06,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:05:06,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222502742] [2022-07-12 17:05:06,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222502742] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:05:06,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:05:06,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:05:06,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078420304] [2022-07-12 17:05:06,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:05:06,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:05:06,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:05:06,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:05:06,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:05:06,605 INFO L87 Difference]: Start difference. First operand 10801 states and 14733 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-12 17:05:13,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:05:13,201 INFO L93 Difference]: Finished difference Result 10801 states and 14733 transitions. [2022-07-12 17:05:13,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:05:13,201 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-12 17:05:13,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:05:13,240 INFO L225 Difference]: With dead ends: 10801 [2022-07-12 17:05:13,240 INFO L226 Difference]: Without dead ends: 10799 [2022-07-12 17:05:13,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:05:13,248 INFO L413 NwaCegarLoop]: 3789 mSDtfsCounter, 6328 mSDsluCounter, 3475 mSDsCounter, 0 mSdLazyCounter, 3940 mSolverCounterSat, 3270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6629 SdHoareTripleChecker+Valid, 7264 SdHoareTripleChecker+Invalid, 7210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3270 IncrementalHoareTripleChecker+Valid, 3940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-07-12 17:05:13,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6629 Valid, 7264 Invalid, 7210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3270 Valid, 3940 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2022-07-12 17:05:13,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10799 states. [2022-07-12 17:05:13,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10799 to 10799. [2022-07-12 17:05:13,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10799 states, 7604 states have (on average 1.2594687006838505) internal successors, (9577), 7801 states have internal predecessors, (9577), 2566 states have call successors, (2566), 609 states have call predecessors, (2566), 613 states have return successors, (2588), 2505 states have call predecessors, (2588), 2564 states have call successors, (2588) [2022-07-12 17:05:13,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10799 states to 10799 states and 14731 transitions. [2022-07-12 17:05:13,691 INFO L78 Accepts]: Start accepts. Automaton has 10799 states and 14731 transitions. Word has length 132 [2022-07-12 17:05:13,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:05:13,691 INFO L495 AbstractCegarLoop]: Abstraction has 10799 states and 14731 transitions. [2022-07-12 17:05:13,692 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-12 17:05:13,692 INFO L276 IsEmpty]: Start isEmpty. Operand 10799 states and 14731 transitions. [2022-07-12 17:05:13,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-12 17:05:13,694 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:05:13,694 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-12 17:05:13,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 17:05:13,695 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_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:05:13,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:05:13,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1999329498, now seen corresponding path program 1 times [2022-07-12 17:05:13,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:05:13,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137143347] [2022-07-12 17:05:13,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:05:13,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:05:13,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:13,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:05:13,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:13,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:05:13,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:13,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:05:13,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:13,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:05:13,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:13,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:05:13,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:13,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:05:13,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:13,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:13,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:13,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:05:13,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:13,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:05:13,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:14,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:05:14,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:14,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:05:14,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:14,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:05:14,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:14,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 17:05:14,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:14,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 17:05:14,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:14,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 17:05:14,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:14,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:05:14,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:14,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 17:05:14,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:14,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 17:05:14,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:14,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:05:14,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:14,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 17:05:14,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:14,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 17:05:14,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:14,138 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-12 17:05:14,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:05:14,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137143347] [2022-07-12 17:05:14,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137143347] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:05:14,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:05:14,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:05:14,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057387621] [2022-07-12 17:05:14,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:05:14,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:05:14,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:05:14,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:05:14,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:05:14,141 INFO L87 Difference]: Start difference. First operand 10799 states and 14731 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-12 17:05:20,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:05:20,268 INFO L93 Difference]: Finished difference Result 10799 states and 14731 transitions. [2022-07-12 17:05:20,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:05:20,268 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-12 17:05:20,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:05:20,302 INFO L225 Difference]: With dead ends: 10799 [2022-07-12 17:05:20,302 INFO L226 Difference]: Without dead ends: 10797 [2022-07-12 17:05:20,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:05:20,310 INFO L413 NwaCegarLoop]: 3787 mSDtfsCounter, 6322 mSDsluCounter, 3475 mSDsCounter, 0 mSdLazyCounter, 3938 mSolverCounterSat, 3270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6622 SdHoareTripleChecker+Valid, 7262 SdHoareTripleChecker+Invalid, 7208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3270 IncrementalHoareTripleChecker+Valid, 3938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-07-12 17:05:20,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6622 Valid, 7262 Invalid, 7208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3270 Valid, 3938 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2022-07-12 17:05:20,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10797 states. [2022-07-12 17:05:20,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10797 to 10797. [2022-07-12 17:05:20,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10797 states, 7603 states have (on average 1.2593713008023149) internal successors, (9575), 7799 states have internal predecessors, (9575), 2566 states have call successors, (2566), 609 states have call predecessors, (2566), 613 states have return successors, (2588), 2505 states have call predecessors, (2588), 2564 states have call successors, (2588) [2022-07-12 17:05:20,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10797 states to 10797 states and 14729 transitions. [2022-07-12 17:05:20,752 INFO L78 Accepts]: Start accepts. Automaton has 10797 states and 14729 transitions. Word has length 138 [2022-07-12 17:05:20,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:05:20,752 INFO L495 AbstractCegarLoop]: Abstraction has 10797 states and 14729 transitions. [2022-07-12 17:05:20,753 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-12 17:05:20,753 INFO L276 IsEmpty]: Start isEmpty. Operand 10797 states and 14729 transitions. [2022-07-12 17:05:20,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-07-12 17:05:20,754 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:05:20,755 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-12 17:05:20,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 17:05:20,755 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_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:05:20,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:05:20,755 INFO L85 PathProgramCache]: Analyzing trace with hash -965668694, now seen corresponding path program 1 times [2022-07-12 17:05:20,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:05:20,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980308815] [2022-07-12 17:05:20,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:05:20,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:05:20,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:20,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:05:20,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:20,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:05:20,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:20,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:05:20,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:20,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:05:20,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:20,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:05:20,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:20,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:05:20,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:20,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:20,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:20,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:05:20,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:20,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:05:21,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:21,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:05:21,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:21,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:05:21,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:21,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:05:21,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:21,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 17:05:21,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:21,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 17:05:21,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:21,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 17:05:21,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:21,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:05:21,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:21,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 17:05:21,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:21,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 17:05:21,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:21,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:05:21,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:21,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 17:05:21,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:21,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 17:05:21,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:21,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-12 17:05:21,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:21,144 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-12 17:05:21,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:05:21,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980308815] [2022-07-12 17:05:21,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980308815] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:05:21,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:05:21,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:05:21,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345923164] [2022-07-12 17:05:21,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:05:21,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:05:21,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:05:21,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:05:21,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:05:21,147 INFO L87 Difference]: Start difference. First operand 10797 states and 14729 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-12 17:05:27,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:05:27,179 INFO L93 Difference]: Finished difference Result 10797 states and 14729 transitions. [2022-07-12 17:05:27,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:05:27,180 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-12 17:05:27,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:05:27,209 INFO L225 Difference]: With dead ends: 10797 [2022-07-12 17:05:27,209 INFO L226 Difference]: Without dead ends: 10795 [2022-07-12 17:05:27,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:05:27,215 INFO L413 NwaCegarLoop]: 3785 mSDtfsCounter, 6316 mSDsluCounter, 3475 mSDsCounter, 0 mSdLazyCounter, 3936 mSolverCounterSat, 3270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6615 SdHoareTripleChecker+Valid, 7260 SdHoareTripleChecker+Invalid, 7206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3270 IncrementalHoareTripleChecker+Valid, 3936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-07-12 17:05:27,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6615 Valid, 7260 Invalid, 7206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3270 Valid, 3936 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-07-12 17:05:27,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10795 states. [2022-07-12 17:05:27,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10795 to 10795. [2022-07-12 17:05:27,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10795 states, 7602 states have (on average 1.2592738752959747) internal successors, (9573), 7797 states have internal predecessors, (9573), 2566 states have call successors, (2566), 609 states have call predecessors, (2566), 613 states have return successors, (2588), 2505 states have call predecessors, (2588), 2564 states have call successors, (2588) [2022-07-12 17:05:27,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10795 states to 10795 states and 14727 transitions. [2022-07-12 17:05:27,641 INFO L78 Accepts]: Start accepts. Automaton has 10795 states and 14727 transitions. Word has length 144 [2022-07-12 17:05:27,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:05:27,642 INFO L495 AbstractCegarLoop]: Abstraction has 10795 states and 14727 transitions. [2022-07-12 17:05:27,642 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-12 17:05:27,642 INFO L276 IsEmpty]: Start isEmpty. Operand 10795 states and 14727 transitions. [2022-07-12 17:05:27,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-07-12 17:05:27,644 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:05:27,644 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-12 17:05:27,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-12 17:05:27,644 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:05:27,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:05:27,644 INFO L85 PathProgramCache]: Analyzing trace with hash -466485909, now seen corresponding path program 1 times [2022-07-12 17:05:27,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:05:27,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064957966] [2022-07-12 17:05:27,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:05:27,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:05:27,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:27,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:05:27,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:27,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:05:27,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:27,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:05:27,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:27,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:05:27,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:27,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:05:27,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:27,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:05:27,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:27,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:27,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:27,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:05:27,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:27,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:05:27,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:27,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:05:27,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:27,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:05:27,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:27,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:05:28,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:28,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 17:05:28,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:28,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 17:05:28,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:28,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 17:05:28,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:28,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:05:28,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:28,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 17:05:28,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:28,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 17:05:28,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:28,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:05:28,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:28,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 17:05:28,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:28,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 17:05:28,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:28,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-12 17:05:28,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:28,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-12 17:05:28,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:28,144 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-12 17:05:28,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:05:28,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064957966] [2022-07-12 17:05:28,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064957966] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:05:28,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:05:28,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:05:28,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184709793] [2022-07-12 17:05:28,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:05:28,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:05:28,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:05:28,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:05:28,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:05:28,147 INFO L87 Difference]: Start difference. First operand 10795 states and 14727 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-12 17:05:34,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:05:34,245 INFO L93 Difference]: Finished difference Result 10795 states and 14727 transitions. [2022-07-12 17:05:34,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:05:34,246 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-12 17:05:34,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:05:34,332 INFO L225 Difference]: With dead ends: 10795 [2022-07-12 17:05:34,332 INFO L226 Difference]: Without dead ends: 10793 [2022-07-12 17:05:34,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:05:34,335 INFO L413 NwaCegarLoop]: 3783 mSDtfsCounter, 6310 mSDsluCounter, 3475 mSDsCounter, 0 mSdLazyCounter, 3934 mSolverCounterSat, 3270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6608 SdHoareTripleChecker+Valid, 7258 SdHoareTripleChecker+Invalid, 7204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3270 IncrementalHoareTripleChecker+Valid, 3934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-07-12 17:05:34,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6608 Valid, 7258 Invalid, 7204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3270 Valid, 3934 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2022-07-12 17:05:34,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10793 states. [2022-07-12 17:05:34,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10793 to 10793. [2022-07-12 17:05:34,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10793 states, 7601 states have (on average 1.2591764241547165) internal successors, (9571), 7795 states have internal predecessors, (9571), 2566 states have call successors, (2566), 609 states have call predecessors, (2566), 613 states have return successors, (2588), 2505 states have call predecessors, (2588), 2564 states have call successors, (2588) [2022-07-12 17:05:34,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10793 states to 10793 states and 14725 transitions. [2022-07-12 17:05:34,742 INFO L78 Accepts]: Start accepts. Automaton has 10793 states and 14725 transitions. Word has length 150 [2022-07-12 17:05:34,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:05:34,742 INFO L495 AbstractCegarLoop]: Abstraction has 10793 states and 14725 transitions. [2022-07-12 17:05:34,742 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-12 17:05:34,742 INFO L276 IsEmpty]: Start isEmpty. Operand 10793 states and 14725 transitions. [2022-07-12 17:05:34,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-07-12 17:05:34,744 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:05:34,744 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-12 17:05:34,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-12 17:05:34,745 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_linux_net_rtnetlink_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:05:34,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:05:34,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1386346816, now seen corresponding path program 1 times [2022-07-12 17:05:34,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:05:34,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970655516] [2022-07-12 17:05:34,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:05:34,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:05:34,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:34,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:05:34,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:34,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:05:34,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:34,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:05:34,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:34,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:05:34,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:34,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:05:34,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:34,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:05:34,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:34,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:34,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:34,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:05:34,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:34,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:05:34,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:35,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:05:35,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:35,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:05:35,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:35,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:05:35,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:35,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 17:05:35,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:35,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 17:05:35,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:35,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 17:05:35,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:35,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:05:35,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:35,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 17:05:35,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:35,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 17:05:35,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:35,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:05:35,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:35,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 17:05:35,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:35,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 17:05:35,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:35,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-12 17:05:35,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:35,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-12 17:05:35,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:35,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-12 17:05:35,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:35,156 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-12 17:05:35,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:05:35,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970655516] [2022-07-12 17:05:35,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970655516] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:05:35,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:05:35,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:05:35,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239975611] [2022-07-12 17:05:35,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:05:35,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:05:35,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:05:35,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:05:35,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:05:35,161 INFO L87 Difference]: Start difference. First operand 10793 states and 14725 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-12 17:05:41,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:05:41,557 INFO L93 Difference]: Finished difference Result 10793 states and 14725 transitions. [2022-07-12 17:05:41,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:05:41,558 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-12 17:05:41,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:05:41,591 INFO L225 Difference]: With dead ends: 10793 [2022-07-12 17:05:41,591 INFO L226 Difference]: Without dead ends: 10791 [2022-07-12 17:05:41,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:05:41,599 INFO L413 NwaCegarLoop]: 3781 mSDtfsCounter, 6304 mSDsluCounter, 3475 mSDsCounter, 0 mSdLazyCounter, 3932 mSolverCounterSat, 3270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6601 SdHoareTripleChecker+Valid, 7256 SdHoareTripleChecker+Invalid, 7202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3270 IncrementalHoareTripleChecker+Valid, 3932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-07-12 17:05:41,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6601 Valid, 7256 Invalid, 7202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3270 Valid, 3932 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2022-07-12 17:05:41,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10791 states. [2022-07-12 17:05:42,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10791 to 10791. [2022-07-12 17:05:42,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10791 states, 7600 states have (on average 1.259078947368421) internal successors, (9569), 7793 states have internal predecessors, (9569), 2566 states have call successors, (2566), 609 states have call predecessors, (2566), 613 states have return successors, (2588), 2505 states have call predecessors, (2588), 2564 states have call successors, (2588) [2022-07-12 17:05:42,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10791 states to 10791 states and 14723 transitions. [2022-07-12 17:05:42,108 INFO L78 Accepts]: Start accepts. Automaton has 10791 states and 14723 transitions. Word has length 156 [2022-07-12 17:05:42,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:05:42,109 INFO L495 AbstractCegarLoop]: Abstraction has 10791 states and 14723 transitions. [2022-07-12 17:05:42,109 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-12 17:05:42,109 INFO L276 IsEmpty]: Start isEmpty. Operand 10791 states and 14723 transitions. [2022-07-12 17:05:42,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-07-12 17:05:42,111 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:05:42,111 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-12 17:05:42,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-12 17:05:42,112 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_linux_net_sock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:05:42,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:05:42,112 INFO L85 PathProgramCache]: Analyzing trace with hash 603439633, now seen corresponding path program 1 times [2022-07-12 17:05:42,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:05:42,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689862485] [2022-07-12 17:05:42,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:05:42,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:05:42,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:42,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:05:42,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:42,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:05:42,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:42,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:05:42,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:42,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:05:42,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:42,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:05:42,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:42,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:05:42,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:42,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:42,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:42,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:05:42,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:42,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:05:42,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:42,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:05:42,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:42,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:05:42,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:42,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:05:42,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:42,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 17:05:42,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:42,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 17:05:42,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:42,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 17:05:42,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:42,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:05:42,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:42,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 17:05:42,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:42,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 17:05:42,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:42,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:05:42,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:42,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 17:05:42,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:42,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 17:05:42,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:42,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-12 17:05:42,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:42,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-12 17:05:42,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:42,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-12 17:05:42,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:42,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-12 17:05:42,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:42,497 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-12 17:05:42,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:05:42,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689862485] [2022-07-12 17:05:42,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689862485] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:05:42,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:05:42,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:05:42,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580633573] [2022-07-12 17:05:42,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:05:42,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:05:42,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:05:42,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:05:42,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:05:42,500 INFO L87 Difference]: Start difference. First operand 10791 states and 14723 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-12 17:05:48,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:05:48,937 INFO L93 Difference]: Finished difference Result 10791 states and 14723 transitions. [2022-07-12 17:05:48,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:05:48,937 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-12 17:05:48,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:05:48,961 INFO L225 Difference]: With dead ends: 10791 [2022-07-12 17:05:48,961 INFO L226 Difference]: Without dead ends: 10789 [2022-07-12 17:05:48,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:05:48,965 INFO L413 NwaCegarLoop]: 3779 mSDtfsCounter, 6298 mSDsluCounter, 3475 mSDsCounter, 0 mSdLazyCounter, 3930 mSolverCounterSat, 3270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6594 SdHoareTripleChecker+Valid, 7254 SdHoareTripleChecker+Invalid, 7200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3270 IncrementalHoareTripleChecker+Valid, 3930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-07-12 17:05:48,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6594 Valid, 7254 Invalid, 7200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3270 Valid, 3930 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2022-07-12 17:05:48,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10789 states. [2022-07-12 17:05:49,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10789 to 10789. [2022-07-12 17:05:49,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10789 states, 7599 states have (on average 1.258981444926964) internal successors, (9567), 7791 states have internal predecessors, (9567), 2566 states have call successors, (2566), 609 states have call predecessors, (2566), 613 states have return successors, (2588), 2505 states have call predecessors, (2588), 2564 states have call successors, (2588) [2022-07-12 17:05:49,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10789 states to 10789 states and 14721 transitions. [2022-07-12 17:05:49,401 INFO L78 Accepts]: Start accepts. Automaton has 10789 states and 14721 transitions. Word has length 162 [2022-07-12 17:05:49,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:05:49,402 INFO L495 AbstractCegarLoop]: Abstraction has 10789 states and 14721 transitions. [2022-07-12 17:05:49,402 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-12 17:05:49,402 INFO L276 IsEmpty]: Start isEmpty. Operand 10789 states and 14721 transitions. [2022-07-12 17:05:49,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-07-12 17:05:49,405 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:05:49,405 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-12 17:05:49,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-12 17:05:49,406 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:05:49,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:05:49,406 INFO L85 PathProgramCache]: Analyzing trace with hash -956161991, now seen corresponding path program 1 times [2022-07-12 17:05:49,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:05:49,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165191521] [2022-07-12 17:05:49,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:05:49,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:05:49,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:49,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:05:49,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:49,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:05:49,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:49,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:05:49,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:49,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:05:49,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:49,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:05:49,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:49,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:05:49,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:49,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:49,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:49,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:05:49,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:49,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:05:49,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:49,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:05:49,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:49,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:05:49,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:49,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:05:49,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:49,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 17:05:49,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:49,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 17:05:49,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:49,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 17:05:49,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:49,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:05:49,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:49,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 17:05:49,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:49,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 17:05:49,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:49,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:05:49,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:49,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 17:05:49,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:49,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 17:05:49,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:49,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-12 17:05:49,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:49,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-12 17:05:49,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:49,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-12 17:05:49,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:49,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-12 17:05:49,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:49,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-12 17:05:49,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:49,815 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-12 17:05:49,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:05:49,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165191521] [2022-07-12 17:05:49,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165191521] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:05:49,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:05:49,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:05:49,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246134250] [2022-07-12 17:05:49,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:05:49,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:05:49,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:05:49,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:05:49,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:05:49,820 INFO L87 Difference]: Start difference. First operand 10789 states and 14721 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-12 17:05:56,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:05:56,199 INFO L93 Difference]: Finished difference Result 10789 states and 14721 transitions. [2022-07-12 17:05:56,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:05:56,199 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-12 17:05:56,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:05:56,232 INFO L225 Difference]: With dead ends: 10789 [2022-07-12 17:05:56,233 INFO L226 Difference]: Without dead ends: 10787 [2022-07-12 17:05:56,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:05:56,241 INFO L413 NwaCegarLoop]: 3777 mSDtfsCounter, 6292 mSDsluCounter, 3475 mSDsCounter, 0 mSdLazyCounter, 3928 mSolverCounterSat, 3270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6587 SdHoareTripleChecker+Valid, 7252 SdHoareTripleChecker+Invalid, 7198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3270 IncrementalHoareTripleChecker+Valid, 3928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-07-12 17:05:56,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6587 Valid, 7252 Invalid, 7198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3270 Valid, 3928 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2022-07-12 17:05:56,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10787 states. [2022-07-12 17:05:56,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10787 to 10787. [2022-07-12 17:05:56,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10787 states, 7598 states have (on average 1.258883916820216) internal successors, (9565), 7789 states have internal predecessors, (9565), 2566 states have call successors, (2566), 609 states have call predecessors, (2566), 613 states have return successors, (2588), 2505 states have call predecessors, (2588), 2564 states have call successors, (2588) [2022-07-12 17:05:56,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10787 states to 10787 states and 14719 transitions. [2022-07-12 17:05:56,773 INFO L78 Accepts]: Start accepts. Automaton has 10787 states and 14719 transitions. Word has length 168 [2022-07-12 17:05:56,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:05:56,774 INFO L495 AbstractCegarLoop]: Abstraction has 10787 states and 14719 transitions. [2022-07-12 17:05:56,774 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-12 17:05:56,774 INFO L276 IsEmpty]: Start isEmpty. Operand 10787 states and 14719 transitions. [2022-07-12 17:05:56,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2022-07-12 17:05:56,777 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:05:56,778 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 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] [2022-07-12 17:05:56,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-12 17:05:56,778 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_linux_arch_io_io_mem_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:05:56,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:05:56,778 INFO L85 PathProgramCache]: Analyzing trace with hash 2017162721, now seen corresponding path program 1 times [2022-07-12 17:05:56,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:05:56,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684155933] [2022-07-12 17:05:56,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:05:56,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:05:56,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:57,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:05:57,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:57,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:05:57,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:57,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:05:57,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:57,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 17:05:57,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:57,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:57,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:57,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:05:57,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:57,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:05:57,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:57,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 17:05:57,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:57,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:57,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:57,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:05:57,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:57,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:05:57,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:57,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 17:05:57,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:57,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:57,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:57,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:05:57,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:57,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:05:57,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:57,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 17:05:57,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:57,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 17:05:57,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:57,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:05:57,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:57,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 17:05:57,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:57,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 17:05:57,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:57,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-12 17:05:57,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:57,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-12 17:05:57,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:57,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:57,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:57,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-12 17:05:57,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:57,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-12 17:05:57,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:57,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-12 17:05:57,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:57,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:57,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:57,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-12 17:05:57,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:57,362 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2022-07-12 17:05:57,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:05:57,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684155933] [2022-07-12 17:05:57,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684155933] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:05:57,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:05:57,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-12 17:05:57,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309840855] [2022-07-12 17:05:57,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:05:57,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 17:05:57,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:05:57,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 17:05:57,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-07-12 17:05:57,365 INFO L87 Difference]: Start difference. First operand 10787 states and 14719 transitions. Second operand has 12 states, 12 states have (on average 7.5) internal successors, (90), 6 states have internal predecessors, (90), 2 states have call successors, (22), 7 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2022-07-12 17:06:02,102 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:06:03,373 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:06:04,526 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:06:07,338 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:06:28,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:06:28,862 INFO L93 Difference]: Finished difference Result 22801 states and 32626 transitions. [2022-07-12 17:06:28,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 17:06:28,863 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.5) internal successors, (90), 6 states have internal predecessors, (90), 2 states have call successors, (22), 7 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) Word has length 192 [2022-07-12 17:06:28,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:06:28,916 INFO L225 Difference]: With dead ends: 22801 [2022-07-12 17:06:28,917 INFO L226 Difference]: Without dead ends: 17281 [2022-07-12 17:06:28,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2022-07-12 17:06:28,940 INFO L413 NwaCegarLoop]: 5292 mSDtfsCounter, 8904 mSDsluCounter, 19353 mSDsCounter, 0 mSdLazyCounter, 24414 mSolverCounterSat, 7067 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9242 SdHoareTripleChecker+Valid, 24645 SdHoareTripleChecker+Invalid, 31482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 7067 IncrementalHoareTripleChecker+Valid, 24414 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.1s IncrementalHoareTripleChecker+Time [2022-07-12 17:06:28,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9242 Valid, 24645 Invalid, 31482 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [7067 Valid, 24414 Invalid, 1 Unknown, 0 Unchecked, 30.1s Time] [2022-07-12 17:06:28,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17281 states. [2022-07-12 17:06:29,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17281 to 10846. [2022-07-12 17:06:29,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10846 states, 7642 states have (on average 1.2589636220884586) internal successors, (9621), 7836 states have internal predecessors, (9621), 2573 states have call successors, (2573), 609 states have call predecessors, (2573), 621 states have return successors, (2677), 2517 states have call predecessors, (2677), 2571 states have call successors, (2677) [2022-07-12 17:06:29,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10846 states to 10846 states and 14871 transitions. [2022-07-12 17:06:29,687 INFO L78 Accepts]: Start accepts. Automaton has 10846 states and 14871 transitions. Word has length 192 [2022-07-12 17:06:29,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:06:29,688 INFO L495 AbstractCegarLoop]: Abstraction has 10846 states and 14871 transitions. [2022-07-12 17:06:29,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.5) internal successors, (90), 6 states have internal predecessors, (90), 2 states have call successors, (22), 7 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2022-07-12 17:06:29,688 INFO L276 IsEmpty]: Start isEmpty. Operand 10846 states and 14871 transitions. [2022-07-12 17:06:29,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2022-07-12 17:06:29,692 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:06:29,692 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 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] [2022-07-12 17:06:29,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-12 17:06:29,693 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_linux_arch_io_io_mem_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:06:29,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:06:29,693 INFO L85 PathProgramCache]: Analyzing trace with hash -646737710, now seen corresponding path program 1 times [2022-07-12 17:06:29,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:06:29,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633416832] [2022-07-12 17:06:29,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:06:29,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:06:29,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:29,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:06:29,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:29,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:06:29,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:29,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:06:29,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:29,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 17:06:29,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:29,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:29,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:29,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:06:29,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:29,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:06:29,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:29,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 17:06:29,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:29,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:29,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:29,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:06:29,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:29,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:06:29,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:30,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 17:06:30,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:30,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:30,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:30,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:06:30,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:30,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:06:30,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:30,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 17:06:30,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:30,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 17:06:30,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:30,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:06:30,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:30,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 17:06:30,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:30,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 17:06:30,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:30,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-12 17:06:30,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:30,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-12 17:06:30,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:30,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:30,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:30,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-12 17:06:30,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:30,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-12 17:06:30,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:30,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-12 17:06:30,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:30,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:30,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:30,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-12 17:06:30,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:30,289 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2022-07-12 17:06:30,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:06:30,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633416832] [2022-07-12 17:06:30,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633416832] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:06:30,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:06:30,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-12 17:06:30,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602976449] [2022-07-12 17:06:30,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:06:30,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 17:06:30,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:06:30,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 17:06:30,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-07-12 17:06:30,293 INFO L87 Difference]: Start difference. First operand 10846 states and 14871 transitions. Second operand has 12 states, 12 states have (on average 7.583333333333333) internal successors, (91), 6 states have internal predecessors, (91), 2 states have call successors, (22), 7 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21)