./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--block--skd.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0f8a17c6 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.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 b20f48966671566afed85875d0d94a6951898c9c2a2bdf71b35576aeaa27c268 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-17 12:22:26,910 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-17 12:22:26,912 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-17 12:22:26,958 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-17 12:22:26,963 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-17 12:22:26,967 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-17 12:22:26,969 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-17 12:22:26,976 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-17 12:22:26,980 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-17 12:22:26,984 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-17 12:22:26,985 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-17 12:22:26,987 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-17 12:22:26,987 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-17 12:22:26,989 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-17 12:22:26,991 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-17 12:22:26,996 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-17 12:22:26,997 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-17 12:22:26,998 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-17 12:22:27,002 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-17 12:22:27,007 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-17 12:22:27,008 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-17 12:22:27,009 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-17 12:22:27,011 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-17 12:22:27,011 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-17 12:22:27,017 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-17 12:22:27,018 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-17 12:22:27,018 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-17 12:22:27,020 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-17 12:22:27,020 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-17 12:22:27,021 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-17 12:22:27,021 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-17 12:22:27,022 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-17 12:22:27,024 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-17 12:22:27,025 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-17 12:22:27,026 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-17 12:22:27,026 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-17 12:22:27,027 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-17 12:22:27,027 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-17 12:22:27,028 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-17 12:22:27,029 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-17 12:22:27,029 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-17 12:22:27,030 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-17 12:22:27,061 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-17 12:22:27,062 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-17 12:22:27,062 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-17 12:22:27,063 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-17 12:22:27,064 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-17 12:22:27,064 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-17 12:22:27,065 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-17 12:22:27,065 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-17 12:22:27,065 INFO L138 SettingsManager]: * Use SBE=true [2021-11-17 12:22:27,065 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-17 12:22:27,066 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-17 12:22:27,066 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-17 12:22:27,067 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-17 12:22:27,067 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-17 12:22:27,067 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-17 12:22:27,067 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-17 12:22:27,067 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-17 12:22:27,068 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-17 12:22:27,068 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-17 12:22:27,068 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-17 12:22:27,068 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-17 12:22:27,069 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-17 12:22:27,069 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-17 12:22:27,069 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-17 12:22:27,069 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-17 12:22:27,069 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-17 12:22:27,070 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-17 12:22:27,070 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-17 12:22:27,070 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-17 12:22:27,070 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-17 12:22:27,071 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-17 12:22:27,071 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 -> b20f48966671566afed85875d0d94a6951898c9c2a2bdf71b35576aeaa27c268 [2021-11-17 12:22:27,306 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-17 12:22:27,336 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-17 12:22:27,338 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-17 12:22:27,340 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-17 12:22:27,341 INFO L275 PluginConnector]: CDTParser initialized [2021-11-17 12:22:27,342 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--block--skd.ko.cil.i [2021-11-17 12:22:27,391 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83d67e253/ea65b33101c84e24b9101cb02eaffbef/FLAGead719607 [2021-11-17 12:22:28,217 INFO L306 CDTParser]: Found 1 translation units. [2021-11-17 12:22:28,218 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i [2021-11-17 12:22:28,284 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83d67e253/ea65b33101c84e24b9101cb02eaffbef/FLAGead719607 [2021-11-17 12:22:28,698 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83d67e253/ea65b33101c84e24b9101cb02eaffbef [2021-11-17 12:22:28,700 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-17 12:22:28,701 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-17 12:22:28,702 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-17 12:22:28,702 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-17 12:22:28,709 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-17 12:22:28,710 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:22:28" (1/1) ... [2021-11-17 12:22:28,711 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f63e39f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:22:28, skipping insertion in model container [2021-11-17 12:22:28,711 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:22:28" (1/1) ... [2021-11-17 12:22:28,716 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-17 12:22:28,904 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-17 12:22:33,337 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[580060,580073] [2021-11-17 12:22:33,342 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[580205,580218] [2021-11-17 12:22:33,343 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[580351,580364] [2021-11-17 12:22:33,343 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[580516,580529] [2021-11-17 12:22:33,344 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[580674,580687] [2021-11-17 12:22:33,345 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[580832,580845] [2021-11-17 12:22:33,345 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[580990,581003] [2021-11-17 12:22:33,346 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[581150,581163] [2021-11-17 12:22:33,346 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[581309,581322] [2021-11-17 12:22:33,346 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[581448,581461] [2021-11-17 12:22:33,347 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[581590,581603] [2021-11-17 12:22:33,348 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[581739,581752] [2021-11-17 12:22:33,348 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[581878,581891] [2021-11-17 12:22:33,348 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[582033,582046] [2021-11-17 12:22:33,350 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[582193,582206] [2021-11-17 12:22:33,350 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[582344,582357] [2021-11-17 12:22:33,350 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[582495,582508] [2021-11-17 12:22:33,351 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[582647,582660] [2021-11-17 12:22:33,351 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[582796,582809] [2021-11-17 12:22:33,353 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[582944,582957] [2021-11-17 12:22:33,353 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[583101,583114] [2021-11-17 12:22:33,354 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[583250,583263] [2021-11-17 12:22:33,354 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[583406,583419] [2021-11-17 12:22:33,355 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[583559,583572] [2021-11-17 12:22:33,360 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[583705,583718] [2021-11-17 12:22:33,360 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[583848,583861] [2021-11-17 12:22:33,361 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[584000,584013] [2021-11-17 12:22:33,361 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[584146,584159] [2021-11-17 12:22:33,362 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[584291,584304] [2021-11-17 12:22:33,363 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[584445,584458] [2021-11-17 12:22:33,364 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[584596,584609] [2021-11-17 12:22:33,364 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[584751,584764] [2021-11-17 12:22:33,365 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[584903,584916] [2021-11-17 12:22:33,365 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[585058,585071] [2021-11-17 12:22:33,366 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[585222,585235] [2021-11-17 12:22:33,366 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[585378,585391] [2021-11-17 12:22:33,366 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[585542,585555] [2021-11-17 12:22:33,367 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[585684,585697] [2021-11-17 12:22:33,367 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[585842,585855] [2021-11-17 12:22:33,368 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[586009,586022] [2021-11-17 12:22:33,368 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[586168,586181] [2021-11-17 12:22:33,368 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[586327,586340] [2021-11-17 12:22:33,369 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[586476,586489] [2021-11-17 12:22:33,369 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[586623,586636] [2021-11-17 12:22:33,369 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[586762,586775] [2021-11-17 12:22:33,370 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[586925,586938] [2021-11-17 12:22:33,370 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[587091,587104] [2021-11-17 12:22:33,371 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[587255,587268] [2021-11-17 12:22:33,371 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[587420,587433] [2021-11-17 12:22:33,372 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[587585,587598] [2021-11-17 12:22:33,372 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[587751,587764] [2021-11-17 12:22:33,372 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[587916,587929] [2021-11-17 12:22:33,373 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[588083,588096] [2021-11-17 12:22:33,373 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[588243,588256] [2021-11-17 12:22:33,374 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[588405,588418] [2021-11-17 12:22:33,374 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[588564,588577] [2021-11-17 12:22:33,374 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[588710,588723] [2021-11-17 12:22:33,375 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[588853,588866] [2021-11-17 12:22:33,375 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[588997,589010] [2021-11-17 12:22:33,375 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[589140,589153] [2021-11-17 12:22:33,376 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[589284,589297] [2021-11-17 12:22:33,376 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[589425,589438] [2021-11-17 12:22:33,377 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[589563,589576] [2021-11-17 12:22:33,377 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[589721,589734] [2021-11-17 12:22:33,377 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[589880,589893] [2021-11-17 12:22:33,378 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[590036,590049] [2021-11-17 12:22:33,378 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[590185,590198] [2021-11-17 12:22:33,378 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[590337,590350] [2021-11-17 12:22:33,379 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[590488,590501] [2021-11-17 12:22:33,379 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[590637,590650] [2021-11-17 12:22:33,380 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[590789,590802] [2021-11-17 12:22:33,380 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[590937,590950] [2021-11-17 12:22:33,380 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[591090,591103] [2021-11-17 12:22:33,381 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[591241,591254] [2021-11-17 12:22:33,381 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[591391,591404] [2021-11-17 12:22:33,381 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[591538,591551] [2021-11-17 12:22:33,381 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[591689,591702] [2021-11-17 12:22:33,382 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[591840,591853] [2021-11-17 12:22:33,382 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[591988,592001] [2021-11-17 12:22:33,382 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[592154,592167] [2021-11-17 12:22:33,383 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[592323,592336] [2021-11-17 12:22:33,383 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[592490,592503] [2021-11-17 12:22:33,383 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[592658,592671] [2021-11-17 12:22:33,384 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[592808,592821] [2021-11-17 12:22:33,384 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[592955,592968] [2021-11-17 12:22:33,384 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[593116,593129] [2021-11-17 12:22:33,385 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[593286,593299] [2021-11-17 12:22:33,385 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[593448,593461] [2021-11-17 12:22:33,403 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-17 12:22:33,430 INFO L203 MainTranslator]: Completed pre-run [2021-11-17 12:22:33,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--block--skd.ko.cil.i[580060,580073] [2021-11-17 12:22:33,847 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[580205,580218] [2021-11-17 12:22:33,850 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[580351,580364] [2021-11-17 12:22:33,850 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[580516,580529] [2021-11-17 12:22:33,851 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[580674,580687] [2021-11-17 12:22:33,851 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[580832,580845] [2021-11-17 12:22:33,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--block--skd.ko.cil.i[580990,581003] [2021-11-17 12:22:33,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--block--skd.ko.cil.i[581150,581163] [2021-11-17 12:22:33,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--block--skd.ko.cil.i[581309,581322] [2021-11-17 12:22:33,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--block--skd.ko.cil.i[581448,581461] [2021-11-17 12:22:33,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--block--skd.ko.cil.i[581590,581603] [2021-11-17 12:22:33,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--block--skd.ko.cil.i[581739,581752] [2021-11-17 12:22:33,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--block--skd.ko.cil.i[581878,581891] [2021-11-17 12:22:33,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--block--skd.ko.cil.i[582033,582046] [2021-11-17 12:22:33,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--block--skd.ko.cil.i[582193,582206] [2021-11-17 12:22:33,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--block--skd.ko.cil.i[582344,582357] [2021-11-17 12:22:33,856 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[582495,582508] [2021-11-17 12:22:33,856 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[582647,582660] [2021-11-17 12:22:33,856 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[582796,582809] [2021-11-17 12:22:33,857 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[582944,582957] [2021-11-17 12:22:33,857 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[583101,583114] [2021-11-17 12:22:33,857 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[583250,583263] [2021-11-17 12:22:33,857 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[583406,583419] [2021-11-17 12:22:33,858 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[583559,583572] [2021-11-17 12:22:33,858 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[583705,583718] [2021-11-17 12:22:33,858 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[583848,583861] [2021-11-17 12:22:33,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--block--skd.ko.cil.i[584000,584013] [2021-11-17 12:22:33,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--block--skd.ko.cil.i[584146,584159] [2021-11-17 12:22:33,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--block--skd.ko.cil.i[584291,584304] [2021-11-17 12:22:33,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--block--skd.ko.cil.i[584445,584458] [2021-11-17 12:22:33,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--block--skd.ko.cil.i[584596,584609] [2021-11-17 12:22:33,866 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[584751,584764] [2021-11-17 12:22:33,866 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[584903,584916] [2021-11-17 12:22:33,866 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[585058,585071] [2021-11-17 12:22:33,867 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[585222,585235] [2021-11-17 12:22:33,867 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[585378,585391] [2021-11-17 12:22:33,867 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[585542,585555] [2021-11-17 12:22:33,868 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[585684,585697] [2021-11-17 12:22:33,868 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[585842,585855] [2021-11-17 12:22:33,868 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[586009,586022] [2021-11-17 12:22:33,869 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[586168,586181] [2021-11-17 12:22:33,870 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[586327,586340] [2021-11-17 12:22:33,870 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[586476,586489] [2021-11-17 12:22:33,870 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[586623,586636] [2021-11-17 12:22:33,871 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[586762,586775] [2021-11-17 12:22:33,871 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[586925,586938] [2021-11-17 12:22:33,871 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[587091,587104] [2021-11-17 12:22:33,872 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[587255,587268] [2021-11-17 12:22:33,872 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[587420,587433] [2021-11-17 12:22:33,872 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[587585,587598] [2021-11-17 12:22:33,873 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[587751,587764] [2021-11-17 12:22:33,873 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[587916,587929] [2021-11-17 12:22:33,873 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[588083,588096] [2021-11-17 12:22:33,874 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[588243,588256] [2021-11-17 12:22:33,874 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[588405,588418] [2021-11-17 12:22:33,874 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[588564,588577] [2021-11-17 12:22:33,875 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[588710,588723] [2021-11-17 12:22:33,875 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[588853,588866] [2021-11-17 12:22:33,875 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[588997,589010] [2021-11-17 12:22:33,876 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[589140,589153] [2021-11-17 12:22:33,876 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[589284,589297] [2021-11-17 12:22:33,877 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[589425,589438] [2021-11-17 12:22:33,878 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[589563,589576] [2021-11-17 12:22:33,878 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[589721,589734] [2021-11-17 12:22:33,878 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[589880,589893] [2021-11-17 12:22:33,878 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[590036,590049] [2021-11-17 12:22:33,879 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[590185,590198] [2021-11-17 12:22:33,879 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[590337,590350] [2021-11-17 12:22:33,879 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[590488,590501] [2021-11-17 12:22:33,879 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[590637,590650] [2021-11-17 12:22:33,880 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[590789,590802] [2021-11-17 12:22:33,880 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[590937,590950] [2021-11-17 12:22:33,880 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[591090,591103] [2021-11-17 12:22:33,880 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[591241,591254] [2021-11-17 12:22:33,881 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[591391,591404] [2021-11-17 12:22:33,881 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[591538,591551] [2021-11-17 12:22:33,881 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[591689,591702] [2021-11-17 12:22:33,881 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[591840,591853] [2021-11-17 12:22:33,882 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[591988,592001] [2021-11-17 12:22:33,882 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[592154,592167] [2021-11-17 12:22:33,882 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[592323,592336] [2021-11-17 12:22:33,883 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[592490,592503] [2021-11-17 12:22:33,883 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[592658,592671] [2021-11-17 12:22:33,883 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[592808,592821] [2021-11-17 12:22:33,884 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[592955,592968] [2021-11-17 12:22:33,884 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[593116,593129] [2021-11-17 12:22:33,884 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[593286,593299] [2021-11-17 12:22:33,884 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--skd.ko.cil.i[593448,593461] [2021-11-17 12:22:33,888 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-17 12:22:34,191 INFO L208 MainTranslator]: Completed translation [2021-11-17 12:22:34,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:22:34 WrapperNode [2021-11-17 12:22:34,192 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-17 12:22:34,193 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-17 12:22:34,193 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-17 12:22:34,193 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-17 12:22:34,205 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:22:34" (1/1) ... [2021-11-17 12:22:34,355 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:22:34" (1/1) ... [2021-11-17 12:22:34,701 INFO L137 Inliner]: procedures = 758, calls = 7229, calls flagged for inlining = 371, calls inlined = 290, statements flattened = 13756 [2021-11-17 12:22:34,702 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-17 12:22:34,703 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-17 12:22:34,703 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-17 12:22:34,703 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-17 12:22:34,710 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:22:34" (1/1) ... [2021-11-17 12:22:34,710 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:22:34" (1/1) ... [2021-11-17 12:22:34,799 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:22:34" (1/1) ... [2021-11-17 12:22:34,800 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:22:34" (1/1) ... [2021-11-17 12:22:35,089 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:22:34" (1/1) ... [2021-11-17 12:22:35,130 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:22:34" (1/1) ... [2021-11-17 12:22:35,208 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:22:34" (1/1) ... [2021-11-17 12:22:35,314 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-17 12:22:35,324 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-17 12:22:35,324 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-17 12:22:35,324 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-17 12:22:35,325 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:22:34" (1/1) ... [2021-11-17 12:22:35,344 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-17 12:22:35,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 12:22:35,389 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-17 12:22:35,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-17 12:22:35,471 INFO L130 BoogieDeclarations]: Found specification of procedure pci_enable_pcie_error_reporting [2021-11-17 12:22:35,472 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_enable_pcie_error_reporting [2021-11-17 12:22:35,472 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_98 [2021-11-17 12:22:35,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_98 [2021-11-17 12:22:35,472 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2021-11-17 12:22:35,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2021-11-17 12:22:35,472 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2021-11-17 12:22:35,472 INFO L130 BoogieDeclarations]: Found specification of procedure pci_release_regions [2021-11-17 12:22:35,473 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_release_regions [2021-11-17 12:22:35,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2021-11-17 12:22:35,473 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2021-11-17 12:22:35,473 INFO L130 BoogieDeclarations]: Found specification of procedure skd_quiesce_dev [2021-11-17 12:22:35,473 INFO L138 BoogieDeclarations]: Found implementation of procedure skd_quiesce_dev [2021-11-17 12:22:35,473 INFO L130 BoogieDeclarations]: Found specification of procedure lowmem_page_address [2021-11-17 12:22:35,473 INFO L138 BoogieDeclarations]: Found implementation of procedure lowmem_page_address [2021-11-17 12:22:35,473 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-11-17 12:22:35,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-11-17 12:22:35,474 INFO L130 BoogieDeclarations]: Found specification of procedure skd_cons_sg_list [2021-11-17 12:22:35,474 INFO L138 BoogieDeclarations]: Found implementation of procedure skd_cons_sg_list [2021-11-17 12:22:35,474 INFO L130 BoogieDeclarations]: Found specification of procedure pci_read_config_word [2021-11-17 12:22:35,474 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_read_config_word [2021-11-17 12:22:35,474 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2021-11-17 12:22:35,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2021-11-17 12:22:35,475 INFO L130 BoogieDeclarations]: Found specification of procedure __might_sleep [2021-11-17 12:22:35,475 INFO L138 BoogieDeclarations]: Found implementation of procedure __might_sleep [2021-11-17 12:22:35,475 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2021-11-17 12:22:35,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2021-11-17 12:22:35,475 INFO L130 BoogieDeclarations]: Found specification of procedure __clear_bit [2021-11-17 12:22:35,475 INFO L138 BoogieDeclarations]: Found implementation of procedure __clear_bit [2021-11-17 12:22:35,475 INFO L130 BoogieDeclarations]: Found specification of procedure valid_dma_direction [2021-11-17 12:22:35,476 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_dma_direction [2021-11-17 12:22:35,476 INFO L130 BoogieDeclarations]: Found specification of procedure queue_flag_set_unlocked [2021-11-17 12:22:35,476 INFO L138 BoogieDeclarations]: Found implementation of procedure queue_flag_set_unlocked [2021-11-17 12:22:35,476 INFO L130 BoogieDeclarations]: Found specification of procedure pci_disable_pcie_error_reporting [2021-11-17 12:22:35,476 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_disable_pcie_error_reporting [2021-11-17 12:22:35,476 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2021-11-17 12:22:35,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2021-11-17 12:22:35,477 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2021-11-17 12:22:35,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2021-11-17 12:22:35,477 INFO L130 BoogieDeclarations]: Found specification of procedure pci_name [2021-11-17 12:22:35,477 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_name [2021-11-17 12:22:35,477 INFO L130 BoogieDeclarations]: Found specification of procedure skd_pci_remove [2021-11-17 12:22:35,477 INFO L138 BoogieDeclarations]: Found implementation of procedure skd_pci_remove [2021-11-17 12:22:35,477 INFO L130 BoogieDeclarations]: Found specification of procedure skd_isr_fwstate [2021-11-17 12:22:35,478 INFO L138 BoogieDeclarations]: Found implementation of procedure skd_isr_fwstate [2021-11-17 12:22:35,478 INFO L130 BoogieDeclarations]: Found specification of procedure skd_drive_disappeared [2021-11-17 12:22:35,478 INFO L138 BoogieDeclarations]: Found implementation of procedure skd_drive_disappeared [2021-11-17 12:22:35,478 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_pages [2021-11-17 12:22:35,478 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_pages [2021-11-17 12:22:35,478 INFO L130 BoogieDeclarations]: Found specification of procedure skd_release_skreq [2021-11-17 12:22:35,478 INFO L138 BoogieDeclarations]: Found implementation of procedure skd_release_skreq [2021-11-17 12:22:35,478 INFO L130 BoogieDeclarations]: Found specification of procedure pci_get_drvdata [2021-11-17 12:22:35,479 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_get_drvdata [2021-11-17 12:22:35,479 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2021-11-17 12:22:35,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2021-11-17 12:22:35,479 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2021-11-17 12:22:35,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2021-11-17 12:22:35,480 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2021-11-17 12:22:35,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2021-11-17 12:22:35,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-17 12:22:35,480 INFO L130 BoogieDeclarations]: Found specification of procedure __chk_range_not_ok [2021-11-17 12:22:35,480 INFO L138 BoogieDeclarations]: Found implementation of procedure __chk_range_not_ok [2021-11-17 12:22:35,480 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2021-11-17 12:22:35,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2021-11-17 12:22:35,481 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_110 [2021-11-17 12:22:35,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_110 [2021-11-17 12:22:35,481 INFO L130 BoogieDeclarations]: Found specification of procedure pci_set_consistent_dma_mask [2021-11-17 12:22:35,481 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_set_consistent_dma_mask [2021-11-17 12:22:35,481 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-11-17 12:22:35,481 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2021-11-17 12:22:35,481 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2021-11-17 12:22:35,482 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_ops [2021-11-17 12:22:35,482 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_ops [2021-11-17 12:22:35,484 INFO L130 BoogieDeclarations]: Found specification of procedure sg_page [2021-11-17 12:22:35,484 INFO L138 BoogieDeclarations]: Found implementation of procedure sg_page [2021-11-17 12:22:35,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-17 12:22:35,485 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2021-11-17 12:22:35,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2021-11-17 12:22:35,486 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2021-11-17 12:22:35,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2021-11-17 12:22:35,486 INFO L130 BoogieDeclarations]: Found specification of procedure pci_zalloc_consistent [2021-11-17 12:22:35,486 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_zalloc_consistent [2021-11-17 12:22:35,492 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2021-11-17 12:22:35,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2021-11-17 12:22:35,493 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-17 12:22:35,493 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2021-11-17 12:22:35,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2021-11-17 12:22:35,493 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2021-11-17 12:22:35,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2021-11-17 12:22:35,493 INFO L130 BoogieDeclarations]: Found specification of procedure __copy_to_user [2021-11-17 12:22:35,493 INFO L138 BoogieDeclarations]: Found implementation of procedure __copy_to_user [2021-11-17 12:22:35,494 INFO L130 BoogieDeclarations]: Found specification of procedure skd_log_check_status [2021-11-17 12:22:35,494 INFO L138 BoogieDeclarations]: Found implementation of procedure skd_log_check_status [2021-11-17 12:22:35,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2021-11-17 12:22:35,494 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2021-11-17 12:22:35,494 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2021-11-17 12:22:35,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2021-11-17 12:22:35,494 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_to_interrupt_context [2021-11-17 12:22:35,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_to_interrupt_context [2021-11-17 12:22:35,495 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2021-11-17 12:22:35,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2021-11-17 12:22:35,495 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2021-11-17 12:22:35,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2021-11-17 12:22:35,495 INFO L130 BoogieDeclarations]: Found specification of procedure pci_set_dma_mask [2021-11-17 12:22:35,495 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_set_dma_mask [2021-11-17 12:22:35,495 INFO L130 BoogieDeclarations]: Found specification of procedure prepare_to_wait_event [2021-11-17 12:22:35,495 INFO L138 BoogieDeclarations]: Found implementation of procedure prepare_to_wait_event [2021-11-17 12:22:35,496 INFO L130 BoogieDeclarations]: Found specification of procedure blk_start_queue [2021-11-17 12:22:35,496 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_start_queue [2021-11-17 12:22:35,496 INFO L130 BoogieDeclarations]: Found specification of procedure pci_free_consistent [2021-11-17 12:22:35,496 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_free_consistent [2021-11-17 12:22:35,496 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2021-11-17 12:22:35,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2021-11-17 12:22:35,496 INFO L130 BoogieDeclarations]: Found specification of procedure pci_disable_device [2021-11-17 12:22:35,496 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_disable_device [2021-11-17 12:22:35,497 INFO L130 BoogieDeclarations]: Found specification of procedure pci_set_drvdata [2021-11-17 12:22:35,497 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_set_drvdata [2021-11-17 12:22:35,497 INFO L130 BoogieDeclarations]: Found specification of procedure pci_request_regions [2021-11-17 12:22:35,497 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_request_regions [2021-11-17 12:22:35,497 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2021-11-17 12:22:35,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2021-11-17 12:22:35,498 INFO L130 BoogieDeclarations]: Found specification of procedure skd_isr [2021-11-17 12:22:35,498 INFO L138 BoogieDeclarations]: Found implementation of procedure skd_isr [2021-11-17 12:22:35,498 INFO L130 BoogieDeclarations]: Found specification of procedure skd_release_irq [2021-11-17 12:22:35,498 INFO L138 BoogieDeclarations]: Found implementation of procedure skd_release_irq [2021-11-17 12:22:35,547 INFO L130 BoogieDeclarations]: Found specification of procedure skd_free_sg_list [2021-11-17 12:22:35,547 INFO L138 BoogieDeclarations]: Found implementation of procedure skd_free_sg_list [2021-11-17 12:22:35,547 INFO L130 BoogieDeclarations]: Found specification of procedure skd_destruct [2021-11-17 12:22:35,547 INFO L138 BoogieDeclarations]: Found implementation of procedure skd_destruct [2021-11-17 12:22:35,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-17 12:22:35,548 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mod_timer [2021-11-17 12:22:35,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mod_timer [2021-11-17 12:22:35,548 INFO L130 BoogieDeclarations]: Found specification of procedure blk_start_request [2021-11-17 12:22:35,548 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_start_request [2021-11-17 12:22:35,548 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-17 12:22:35,548 INFO L130 BoogieDeclarations]: Found specification of procedure skd_send_special_fitmsg [2021-11-17 12:22:35,548 INFO L138 BoogieDeclarations]: Found implementation of procedure skd_send_special_fitmsg [2021-11-17 12:22:35,548 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2021-11-17 12:22:35,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2021-11-17 12:22:35,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-17 12:22:35,548 INFO L130 BoogieDeclarations]: Found specification of procedure __blk_end_request_all [2021-11-17 12:22:35,548 INFO L138 BoogieDeclarations]: Found implementation of procedure __blk_end_request_all [2021-11-17 12:22:35,548 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2021-11-17 12:22:35,548 INFO L130 BoogieDeclarations]: Found specification of procedure skd_pci_resume [2021-11-17 12:22:35,548 INFO L138 BoogieDeclarations]: Found implementation of procedure skd_pci_resume [2021-11-17 12:22:35,548 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_lock_of_skd_device [2021-11-17 12:22:35,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_lock_of_skd_device [2021-11-17 12:22:35,549 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2021-11-17 12:22:35,549 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2021-11-17 12:22:35,549 INFO L130 BoogieDeclarations]: Found specification of procedure skd_release_msix [2021-11-17 12:22:35,549 INFO L138 BoogieDeclarations]: Found implementation of procedure skd_release_msix [2021-11-17 12:22:35,549 INFO L130 BoogieDeclarations]: Found specification of procedure skd_end_request [2021-11-17 12:22:35,549 INFO L138 BoogieDeclarations]: Found implementation of procedure skd_end_request [2021-11-17 12:22:35,549 INFO L130 BoogieDeclarations]: Found specification of procedure skd_recover_requests [2021-11-17 12:22:35,549 INFO L138 BoogieDeclarations]: Found implementation of procedure skd_recover_requests [2021-11-17 12:22:35,549 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2021-11-17 12:22:35,549 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2021-11-17 12:22:35,549 INFO L130 BoogieDeclarations]: Found specification of procedure __copy_from_user [2021-11-17 12:22:35,549 INFO L138 BoogieDeclarations]: Found implementation of procedure __copy_from_user [2021-11-17 12:22:35,549 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2021-11-17 12:22:35,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2021-11-17 12:22:35,549 INFO L130 BoogieDeclarations]: Found specification of procedure blk_peek_request [2021-11-17 12:22:35,549 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_peek_request [2021-11-17 12:22:35,549 INFO L130 BoogieDeclarations]: Found specification of procedure __init_waitqueue_head [2021-11-17 12:22:35,550 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_waitqueue_head [2021-11-17 12:22:35,550 INFO L130 BoogieDeclarations]: Found specification of procedure writel [2021-11-17 12:22:35,550 INFO L138 BoogieDeclarations]: Found implementation of procedure writel [2021-11-17 12:22:35,550 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_timeout [2021-11-17 12:22:35,550 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_timeout [2021-11-17 12:22:35,550 INFO L130 BoogieDeclarations]: Found specification of procedure skd_isr_msg_from_dev [2021-11-17 12:22:35,550 INFO L138 BoogieDeclarations]: Found implementation of procedure skd_isr_msg_from_dev [2021-11-17 12:22:35,550 INFO L130 BoogieDeclarations]: Found specification of procedure finish_wait [2021-11-17 12:22:35,550 INFO L138 BoogieDeclarations]: Found implementation of procedure finish_wait [2021-11-17 12:22:35,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-17 12:22:35,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-17 12:22:35,550 INFO L130 BoogieDeclarations]: Found specification of procedure writeq [2021-11-17 12:22:35,550 INFO L138 BoogieDeclarations]: Found implementation of procedure writeq [2021-11-17 12:22:35,550 INFO L130 BoogieDeclarations]: Found specification of procedure devm_request_irq [2021-11-17 12:22:35,550 INFO L138 BoogieDeclarations]: Found implementation of procedure devm_request_irq [2021-11-17 12:22:35,550 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2021-11-17 12:22:35,550 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2021-11-17 12:22:35,550 INFO L130 BoogieDeclarations]: Found specification of procedure blk_stop_queue [2021-11-17 12:22:35,550 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_stop_queue [2021-11-17 12:22:35,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-17 12:22:35,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-17 12:22:35,551 INFO L130 BoogieDeclarations]: Found specification of procedure skd_skdev_state_to_str [2021-11-17 12:22:35,551 INFO L138 BoogieDeclarations]: Found implementation of procedure skd_skdev_state_to_str [2021-11-17 12:22:35,551 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2021-11-17 12:22:35,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2021-11-17 12:22:35,551 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2021-11-17 12:22:35,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2021-11-17 12:22:35,551 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2021-11-17 12:22:35,551 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2021-11-17 12:22:35,551 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_skd_device [2021-11-17 12:22:35,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_skd_device [2021-11-17 12:22:35,551 INFO L130 BoogieDeclarations]: Found specification of procedure skd_start_device [2021-11-17 12:22:35,551 INFO L138 BoogieDeclarations]: Found implementation of procedure skd_start_device [2021-11-17 12:22:35,551 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_to_process_context [2021-11-17 12:22:35,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_to_process_context [2021-11-17 12:22:35,551 INFO L130 BoogieDeclarations]: Found specification of procedure skd_postop_sg_list [2021-11-17 12:22:35,553 INFO L138 BoogieDeclarations]: Found implementation of procedure skd_postop_sg_list [2021-11-17 12:22:35,554 INFO L130 BoogieDeclarations]: Found specification of procedure skd_request_fn [2021-11-17 12:22:35,554 INFO L138 BoogieDeclarations]: Found implementation of procedure skd_request_fn [2021-11-17 12:22:35,554 INFO L130 BoogieDeclarations]: Found specification of procedure put_unaligned_be16 [2021-11-17 12:22:35,554 INFO L138 BoogieDeclarations]: Found implementation of procedure put_unaligned_be16 [2021-11-17 12:22:35,554 INFO L130 BoogieDeclarations]: Found specification of procedure skd_send_fitmsg [2021-11-17 12:22:35,554 INFO L138 BoogieDeclarations]: Found implementation of procedure skd_send_fitmsg [2021-11-17 12:22:35,554 INFO L130 BoogieDeclarations]: Found specification of procedure set_capacity [2021-11-17 12:22:35,554 INFO L138 BoogieDeclarations]: Found implementation of procedure set_capacity [2021-11-17 12:22:35,554 INFO L130 BoogieDeclarations]: Found specification of procedure blk_rq_sectors [2021-11-17 12:22:35,554 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_rq_sectors [2021-11-17 12:22:35,554 INFO L130 BoogieDeclarations]: Found specification of procedure skd_log_skreq [2021-11-17 12:22:35,554 INFO L138 BoogieDeclarations]: Found implementation of procedure skd_log_skreq [2021-11-17 12:22:35,554 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2021-11-17 12:22:35,554 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2021-11-17 12:22:35,554 INFO L130 BoogieDeclarations]: Found specification of procedure skd_disable_interrupts [2021-11-17 12:22:35,554 INFO L138 BoogieDeclarations]: Found implementation of procedure skd_disable_interrupts [2021-11-17 12:22:35,554 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_io_mem_unmap [2021-11-17 12:22:35,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_io_mem_unmap [2021-11-17 12:22:35,555 INFO L130 BoogieDeclarations]: Found specification of procedure pci_alloc_consistent [2021-11-17 12:22:35,555 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_alloc_consistent [2021-11-17 12:22:35,555 INFO L130 BoogieDeclarations]: Found specification of procedure skd_drive_fault [2021-11-17 12:22:35,555 INFO L138 BoogieDeclarations]: Found implementation of procedure skd_drive_fault [2021-11-17 12:22:35,555 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2021-11-17 12:22:35,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2021-11-17 12:22:35,555 INFO L130 BoogieDeclarations]: Found specification of procedure skd_isr_completion_posted [2021-11-17 12:22:35,555 INFO L138 BoogieDeclarations]: Found implementation of procedure skd_isr_completion_posted [2021-11-17 12:22:35,555 INFO L130 BoogieDeclarations]: Found specification of procedure blk_rq_pos [2021-11-17 12:22:35,555 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_rq_pos [2021-11-17 12:22:35,555 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2021-11-17 12:22:35,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2021-11-17 12:22:35,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-17 12:22:35,555 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2021-11-17 12:22:35,555 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2021-11-17 12:22:35,555 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2021-11-17 12:22:35,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2021-11-17 12:22:35,556 INFO L130 BoogieDeclarations]: Found specification of procedure skd_sg_io_copy_buffer [2021-11-17 12:22:35,556 INFO L138 BoogieDeclarations]: Found implementation of procedure skd_sg_io_copy_buffer [2021-11-17 12:22:35,579 INFO L130 BoogieDeclarations]: Found specification of procedure pci_set_master [2021-11-17 12:22:35,579 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_set_master [2021-11-17 12:22:35,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-17 12:22:35,579 INFO L130 BoogieDeclarations]: Found specification of procedure skd_reg_write64 [2021-11-17 12:22:35,579 INFO L138 BoogieDeclarations]: Found implementation of procedure skd_reg_write64 [2021-11-17 12:22:35,579 INFO L130 BoogieDeclarations]: Found specification of procedure ioremap [2021-11-17 12:22:35,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ioremap [2021-11-17 12:22:35,580 INFO L130 BoogieDeclarations]: Found specification of procedure __free_pages [2021-11-17 12:22:35,580 INFO L138 BoogieDeclarations]: Found implementation of procedure __free_pages [2021-11-17 12:22:35,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-17 12:22:35,580 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2021-11-17 12:22:35,580 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2021-11-17 12:22:35,580 INFO L130 BoogieDeclarations]: Found specification of procedure strcat [2021-11-17 12:22:35,580 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2021-11-17 12:22:35,580 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2021-11-17 12:22:35,580 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2021-11-17 12:22:35,580 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2021-11-17 12:22:35,580 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2021-11-17 12:22:35,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2021-11-17 12:22:35,580 INFO L130 BoogieDeclarations]: Found specification of procedure skd_soft_reset [2021-11-17 12:22:35,581 INFO L138 BoogieDeclarations]: Found implementation of procedure skd_soft_reset [2021-11-17 12:22:35,581 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2021-11-17 12:22:35,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2021-11-17 12:22:35,581 INFO L130 BoogieDeclarations]: Found specification of procedure skd_start_timer [2021-11-17 12:22:35,581 INFO L138 BoogieDeclarations]: Found implementation of procedure skd_start_timer [2021-11-17 12:22:35,581 INFO L130 BoogieDeclarations]: Found specification of procedure skd_reg_write32 [2021-11-17 12:22:35,581 INFO L138 BoogieDeclarations]: Found implementation of procedure skd_reg_write32 [2021-11-17 12:22:35,581 INFO L130 BoogieDeclarations]: Found specification of procedure pci_find_capability [2021-11-17 12:22:35,581 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_find_capability [2021-11-17 12:22:35,581 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2021-11-17 12:22:35,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2021-11-17 12:22:35,581 INFO L130 BoogieDeclarations]: Found specification of procedure blk_requeue_request [2021-11-17 12:22:35,581 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_requeue_request [2021-11-17 12:22:35,581 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2021-11-17 12:22:35,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2021-11-17 12:22:35,582 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2021-11-17 12:22:35,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2021-11-17 12:22:35,582 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2021-11-17 12:22:35,582 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2021-11-17 12:22:35,582 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_devm_free_irq [2021-11-17 12:22:35,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_devm_free_irq [2021-11-17 12:22:35,582 INFO L130 BoogieDeclarations]: Found specification of procedure skd_reg_read32 [2021-11-17 12:22:35,582 INFO L138 BoogieDeclarations]: Found implementation of procedure skd_reg_read32 [2021-11-17 12:22:35,582 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2021-11-17 12:22:35,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2021-11-17 12:22:35,582 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2021-11-17 12:22:35,582 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2021-11-17 12:22:35,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-17 12:22:35,582 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2021-11-17 12:22:35,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2021-11-17 12:22:35,583 INFO L130 BoogieDeclarations]: Found specification of procedure skd_send_internal_skspcl [2021-11-17 12:22:35,583 INFO L138 BoogieDeclarations]: Found implementation of procedure skd_send_internal_skspcl [2021-11-17 12:22:35,583 INFO L130 BoogieDeclarations]: Found specification of procedure skd_release_special [2021-11-17 12:22:35,583 INFO L138 BoogieDeclarations]: Found implementation of procedure skd_release_special [2021-11-17 12:22:35,583 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2021-11-17 12:22:35,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2021-11-17 12:22:35,583 INFO L130 BoogieDeclarations]: Found specification of procedure copy_user_generic [2021-11-17 12:22:35,583 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_user_generic [2021-11-17 12:22:35,583 INFO L130 BoogieDeclarations]: Found specification of procedure skd_drive_state_to_str [2021-11-17 12:22:35,583 INFO L138 BoogieDeclarations]: Found implementation of procedure skd_drive_state_to_str [2021-11-17 12:22:35,583 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2021-11-17 12:22:35,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2021-11-17 12:22:35,583 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2021-11-17 12:22:35,583 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2021-11-17 12:22:35,584 INFO L130 BoogieDeclarations]: Found specification of procedure pci_enable_device [2021-11-17 12:22:35,584 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_enable_device [2021-11-17 12:22:35,584 INFO L130 BoogieDeclarations]: Found specification of procedure current_thread_info [2021-11-17 12:22:35,584 INFO L138 BoogieDeclarations]: Found implementation of procedure current_thread_info [2021-11-17 12:22:35,584 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab64 [2021-11-17 12:22:35,584 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab64 [2021-11-17 12:22:35,584 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2021-11-17 12:22:35,584 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2021-11-17 12:22:35,584 INFO L130 BoogieDeclarations]: Found specification of procedure skd_name [2021-11-17 12:22:35,584 INFO L138 BoogieDeclarations]: Found implementation of procedure skd_name [2021-11-17 12:22:35,584 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2021-11-17 12:22:35,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2021-11-17 12:22:35,584 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_work [2021-11-17 12:22:35,585 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_work [2021-11-17 12:22:35,585 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2021-11-17 12:22:35,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2021-11-17 12:22:35,585 INFO L130 BoogieDeclarations]: Found specification of procedure init_timer_key [2021-11-17 12:22:35,585 INFO L138 BoogieDeclarations]: Found implementation of procedure init_timer_key [2021-11-17 12:22:35,585 INFO L130 BoogieDeclarations]: Found specification of procedure pci_set_power_state [2021-11-17 12:22:35,585 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_set_power_state [2021-11-17 12:22:35,585 INFO L130 BoogieDeclarations]: Found specification of procedure devm_free_irq [2021-11-17 12:22:35,585 INFO L138 BoogieDeclarations]: Found implementation of procedure devm_free_irq [2021-11-17 12:22:35,585 INFO L130 BoogieDeclarations]: Found specification of procedure msecs_to_jiffies [2021-11-17 12:22:35,585 INFO L138 BoogieDeclarations]: Found implementation of procedure msecs_to_jiffies [2021-11-17 12:22:35,585 INFO L130 BoogieDeclarations]: Found specification of procedure pci_disable_msi [2021-11-17 12:22:35,585 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_disable_msi [2021-11-17 12:22:35,586 INFO L130 BoogieDeclarations]: Found specification of procedure sg_virt [2021-11-17 12:22:35,586 INFO L138 BoogieDeclarations]: Found implementation of procedure sg_virt [2021-11-17 12:22:35,586 INFO L130 BoogieDeclarations]: Found specification of procedure readl [2021-11-17 12:22:35,586 INFO L138 BoogieDeclarations]: Found implementation of procedure readl [2021-11-17 12:22:35,586 INFO L130 BoogieDeclarations]: Found specification of procedure skd_pci_shutdown [2021-11-17 12:22:35,586 INFO L138 BoogieDeclarations]: Found implementation of procedure skd_pci_shutdown [2021-11-17 12:22:35,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-17 12:22:35,586 INFO L130 BoogieDeclarations]: Found specification of procedure skd_stop_device [2021-11-17 12:22:35,586 INFO L138 BoogieDeclarations]: Found implementation of procedure skd_stop_device [2021-11-17 12:22:35,586 INFO L130 BoogieDeclarations]: Found specification of procedure skd_acquire_irq [2021-11-17 12:22:35,586 INFO L138 BoogieDeclarations]: Found implementation of procedure skd_acquire_irq [2021-11-17 12:22:35,586 INFO L130 BoogieDeclarations]: Found specification of procedure skd_log_skdev [2021-11-17 12:22:35,586 INFO L138 BoogieDeclarations]: Found implementation of procedure skd_log_skdev [2021-11-17 12:22:36,662 INFO L236 CfgBuilder]: Building ICFG [2021-11-17 12:22:36,665 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-17 12:22:36,824 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2021-11-17 12:22:36,963 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L6358: assume 0 != __copy_to_user_nocheck_~tmp___1~7#1;__copy_to_user_nocheck_#res#1 := __copy_to_user_nocheck_~ret~3#1; [2021-11-17 12:22:36,964 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L6358: assume !(0 != __copy_to_user_nocheck_~tmp___1~7#1);__copy_to_user_nocheck_#res#1 := __copy_to_user_nocheck_~ret~3#1; [2021-11-17 12:22:36,964 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L6321: SUMMARY for call __copy_to_user_nocheck_#t~ret279#1 := copy_user_generic(__copy_to_user_nocheck_~dst#1.base, __copy_to_user_nocheck_~dst#1.offset, __copy_to_user_nocheck_~src#1.base, __copy_to_user_nocheck_~src#1.offset, __copy_to_user_nocheck_~size#1); srcloc: null [2021-11-17 12:22:36,964 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L6317: assume 16 == __copy_to_user_nocheck_~size#1 % 4294967296; [2021-11-17 12:22:36,964 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L6317: assume !(16 == __copy_to_user_nocheck_~size#1 % 4294967296); [2021-11-17 12:22:36,964 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L6342: assume -9223372036854775808 <= __copy_to_user_nocheck_#t~ret277#1 && __copy_to_user_nocheck_#t~ret277#1 <= 9223372036854775807;__copy_to_user_nocheck_~tmp___0~11#1 := __copy_to_user_nocheck_#t~ret277#1;havoc __copy_to_user_nocheck_#t~ret277#1; [2021-11-17 12:22:36,964 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L6313: assume 10 == __copy_to_user_nocheck_~size#1 % 4294967296; [2021-11-17 12:22:36,965 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L6313: assume !(10 == __copy_to_user_nocheck_~size#1 % 4294967296); [2021-11-17 12:22:36,965 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L6309: assume 8 == __copy_to_user_nocheck_~size#1 % 4294967296; [2021-11-17 12:22:36,965 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L6309: assume !(8 == __copy_to_user_nocheck_~size#1 % 4294967296); [2021-11-17 12:22:36,965 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L6305: assume 4 == __copy_to_user_nocheck_~size#1 % 4294967296; [2021-11-17 12:22:36,965 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L6305: assume !(4 == __copy_to_user_nocheck_~size#1 % 4294967296); [2021-11-17 12:22:36,965 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L6301: assume 2 == __copy_to_user_nocheck_~size#1 % 4294967296; [2021-11-17 12:22:36,965 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L6301: assume !(2 == __copy_to_user_nocheck_~size#1 % 4294967296); [2021-11-17 12:22:36,966 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L6318: SUMMARY for call __copy_to_user_nocheck_#t~ret278#1 := ldv__builtin_expect((if 0 != __copy_to_user_nocheck_~ret~3#1 then 1 else 0), 0); srcloc: null [2021-11-17 12:22:36,966 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L6314: SUMMARY for call __copy_to_user_nocheck_#t~ret277#1 := ldv__builtin_expect((if 0 != __copy_to_user_nocheck_~ret~3#1 then 1 else 0), 0); srcloc: null [2021-11-17 12:22:36,966 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1: assume 1 == __copy_to_user_nocheck_~size#1 % 4294967296; [2021-11-17 12:22:36,966 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L6310: __copy_to_user_nocheck_#res#1 := __copy_to_user_nocheck_~ret~3#1; [2021-11-17 12:22:36,966 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L6306: __copy_to_user_nocheck_#res#1 := __copy_to_user_nocheck_~ret~3#1; [2021-11-17 12:22:36,966 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##2: assume !(1 == __copy_to_user_nocheck_~size#1 % 4294967296); [2021-11-17 12:22:36,967 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L6302: __copy_to_user_nocheck_#res#1 := __copy_to_user_nocheck_~ret~3#1; [2021-11-17 12:22:36,967 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L6368: __copy_to_user_nocheck_~tmp___2~2#1 := __copy_to_user_nocheck_#t~ret279#1;havoc __copy_to_user_nocheck_#t~ret279#1;__copy_to_user_nocheck_#res#1 := (if __copy_to_user_nocheck_~tmp___2~2#1 % 18446744073709551616 % 4294967296 <= 2147483647 then __copy_to_user_nocheck_~tmp___2~2#1 % 18446744073709551616 % 4294967296 else __copy_to_user_nocheck_~tmp___2~2#1 % 18446744073709551616 % 4294967296 - 4294967296); [2021-11-17 12:22:36,967 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L6298: __copy_to_user_nocheck_#res#1 := __copy_to_user_nocheck_~ret~3#1; [2021-11-17 12:22:36,967 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L6356: assume -9223372036854775808 <= __copy_to_user_nocheck_#t~ret278#1 && __copy_to_user_nocheck_#t~ret278#1 <= 9223372036854775807;__copy_to_user_nocheck_~tmp___1~7#1 := __copy_to_user_nocheck_#t~ret278#1;havoc __copy_to_user_nocheck_#t~ret278#1; [2021-11-17 12:22:36,967 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L6344: assume 0 != __copy_to_user_nocheck_~tmp___0~11#1;__copy_to_user_nocheck_#res#1 := __copy_to_user_nocheck_~ret~3#1; [2021-11-17 12:22:36,967 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L6344: assume !(0 != __copy_to_user_nocheck_~tmp___0~11#1);__copy_to_user_nocheck_#res#1 := __copy_to_user_nocheck_~ret~3#1; [2021-11-17 12:22:48,446 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L6208: assume 16 == __copy_from_user_nocheck_~size#1 % 4294967296; [2021-11-17 12:22:48,446 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L6208: assume !(16 == __copy_from_user_nocheck_~size#1 % 4294967296); [2021-11-17 12:22:48,446 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L6204: assume 10 == __copy_from_user_nocheck_~size#1 % 4294967296; [2021-11-17 12:22:48,446 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L6204: assume !(10 == __copy_from_user_nocheck_~size#1 % 4294967296); [2021-11-17 12:22:48,446 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L6200: assume 8 == __copy_from_user_nocheck_~size#1 % 4294967296; [2021-11-17 12:22:48,446 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L6200: assume !(8 == __copy_from_user_nocheck_~size#1 % 4294967296); [2021-11-17 12:22:48,446 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L6196: assume 4 == __copy_from_user_nocheck_~size#1 % 4294967296; [2021-11-17 12:22:48,446 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L6196: assume !(4 == __copy_from_user_nocheck_~size#1 % 4294967296); [2021-11-17 12:22:48,446 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L6192: assume 2 == __copy_from_user_nocheck_~size#1 % 4294967296; [2021-11-17 12:22:48,446 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L6192: assume !(2 == __copy_from_user_nocheck_~size#1 % 4294967296); [2021-11-17 12:22:48,447 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L6238: assume -9223372036854775808 <= __copy_from_user_nocheck_#t~ret272#1 && __copy_from_user_nocheck_#t~ret272#1 <= 9223372036854775807;__copy_from_user_nocheck_~tmp___0~10#1 := __copy_from_user_nocheck_#t~ret272#1;havoc __copy_from_user_nocheck_#t~ret272#1; [2021-11-17 12:22:48,447 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L6209: SUMMARY for call __copy_from_user_nocheck_#t~ret273#1 := ldv__builtin_expect((if 0 != __copy_from_user_nocheck_~ret~2#1 then 1 else 0), 0); srcloc: null [2021-11-17 12:22:48,447 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L6205: SUMMARY for call __copy_from_user_nocheck_#t~ret272#1 := ldv__builtin_expect((if 0 != __copy_from_user_nocheck_~ret~2#1 then 1 else 0), 0); srcloc: null [2021-11-17 12:22:48,447 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L6201: __copy_from_user_nocheck_#res#1 := __copy_from_user_nocheck_~ret~2#1; [2021-11-17 12:22:48,447 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L6197: __copy_from_user_nocheck_#res#1 := __copy_from_user_nocheck_~ret~2#1; [2021-11-17 12:22:48,447 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L6255: assume 0 != __copy_from_user_nocheck_~tmp___1~6#1;__copy_from_user_nocheck_#res#1 := __copy_from_user_nocheck_~ret~2#1; [2021-11-17 12:22:48,447 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L6255: assume !(0 != __copy_from_user_nocheck_~tmp___1~6#1);__copy_from_user_nocheck_#res#1 := __copy_from_user_nocheck_~ret~2#1; [2021-11-17 12:22:48,447 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L6193: __copy_from_user_nocheck_#res#1 := __copy_from_user_nocheck_~ret~2#1; [2021-11-17 12:22:48,447 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L6189: __copy_from_user_nocheck_#res#1 := __copy_from_user_nocheck_~ret~2#1; [2021-11-17 12:22:48,447 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1: assume 1 == __copy_from_user_nocheck_~size#1 % 4294967296; [2021-11-17 12:22:48,447 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##2: assume !(1 == __copy_from_user_nocheck_~size#1 % 4294967296); [2021-11-17 12:22:48,447 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L6240: assume 0 != __copy_from_user_nocheck_~tmp___0~10#1;__copy_from_user_nocheck_#res#1 := __copy_from_user_nocheck_~ret~2#1; [2021-11-17 12:22:48,447 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L6240: assume !(0 != __copy_from_user_nocheck_~tmp___0~10#1);__copy_from_user_nocheck_#res#1 := __copy_from_user_nocheck_~ret~2#1; [2021-11-17 12:22:48,448 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L6265: __copy_from_user_nocheck_~tmp___2~1#1 := __copy_from_user_nocheck_#t~ret274#1;havoc __copy_from_user_nocheck_#t~ret274#1;__copy_from_user_nocheck_#res#1 := (if __copy_from_user_nocheck_~tmp___2~1#1 % 18446744073709551616 % 4294967296 <= 2147483647 then __copy_from_user_nocheck_~tmp___2~1#1 % 18446744073709551616 % 4294967296 else __copy_from_user_nocheck_~tmp___2~1#1 % 18446744073709551616 % 4294967296 - 4294967296); [2021-11-17 12:22:48,448 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L6253: assume -9223372036854775808 <= __copy_from_user_nocheck_#t~ret273#1 && __copy_from_user_nocheck_#t~ret273#1 <= 9223372036854775807;__copy_from_user_nocheck_~tmp___1~6#1 := __copy_from_user_nocheck_#t~ret273#1;havoc __copy_from_user_nocheck_#t~ret273#1; [2021-11-17 12:22:48,448 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L6212: SUMMARY for call __copy_from_user_nocheck_#t~ret274#1 := copy_user_generic(__copy_from_user_nocheck_~dst#1.base, __copy_from_user_nocheck_~dst#1.offset, __copy_from_user_nocheck_~src#1.base, __copy_from_user_nocheck_~src#1.offset, __copy_from_user_nocheck_~size#1); srcloc: null [2021-11-17 12:22:57,673 INFO L277 CfgBuilder]: Performing block encoding [2021-11-17 12:22:57,692 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-17 12:22:57,693 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-17 12:22:57,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 12:22:57 BoogieIcfgContainer [2021-11-17 12:22:57,698 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-17 12:22:57,699 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-17 12:22:57,699 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-17 12:22:57,702 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-17 12:22:57,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:22:28" (1/3) ... [2021-11-17 12:22:57,703 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fb62516 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:22:57, skipping insertion in model container [2021-11-17 12:22:57,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:22:34" (2/3) ... [2021-11-17 12:22:57,703 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fb62516 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:22:57, skipping insertion in model container [2021-11-17 12:22:57,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 12:22:57" (3/3) ... [2021-11-17 12:22:57,704 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--block--skd.ko.cil.i [2021-11-17 12:22:57,708 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-17 12:22:57,708 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2021-11-17 12:22:57,757 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-17 12:22:57,762 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-17 12:22:57,763 INFO L340 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2021-11-17 12:22:57,831 INFO L276 IsEmpty]: Start isEmpty. Operand has 3667 states, 2574 states have (on average 1.3407148407148408) internal successors, (3451), 2692 states have internal predecessors, (3451), 899 states have call successors, (899), 161 states have call predecessors, (899), 160 states have return successors, (889), 855 states have call predecessors, (889), 889 states have call successors, (889) [2021-11-17 12:22:57,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-17 12:22:57,838 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:22:57,839 INFO L514 BasicCegarLoop]: 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] [2021-11-17 12:22:57,840 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 32 more)] === [2021-11-17 12:22:57,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:22:57,846 INFO L85 PathProgramCache]: Analyzing trace with hash 332852535, now seen corresponding path program 1 times [2021-11-17 12:22:57,853 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:22:57,854 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019330254] [2021-11-17 12:22:57,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:22:57,854 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:22:58,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:22:58,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:22:58,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:22:58,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-17 12:22:58,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:22:58,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-17 12:22:58,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:22:58,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-17 12:22:58,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:22:58,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-17 12:22:58,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:22:58,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-17 12:22:58,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:22:58,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:22:58,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:22:58,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-17 12:22:58,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:22:58,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-11-17 12:22:58,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:22:58,588 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-17 12:22:58,589 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:22:58,589 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019330254] [2021-11-17 12:22:58,589 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019330254] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:22:58,590 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:22:58,590 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-17 12:22:58,592 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403488431] [2021-11-17 12:22:58,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:22:58,597 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-17 12:22:58,597 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:22:58,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-17 12:22:58,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-17 12:22:58,631 INFO L87 Difference]: Start difference. First operand has 3667 states, 2574 states have (on average 1.3407148407148408) internal successors, (3451), 2692 states have internal predecessors, (3451), 899 states have call successors, (899), 161 states have call predecessors, (899), 160 states have return successors, (889), 855 states have call predecessors, (889), 889 states have call successors, (889) Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-11-17 12:23:00,738 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:23:02,822 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:23:08,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:23:08,777 INFO L93 Difference]: Finished difference Result 7306 states and 10598 transitions. [2021-11-17 12:23:08,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-17 12:23:08,779 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 72 [2021-11-17 12:23:08,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:23:08,824 INFO L225 Difference]: With dead ends: 7306 [2021-11-17 12:23:08,825 INFO L226 Difference]: Without dead ends: 3634 [2021-11-17 12:23:08,853 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-17 12:23:08,859 INFO L933 BasicCegarLoop]: 4631 mSDtfsCounter, 8522 mSDsluCounter, 1970 mSDsCounter, 0 mSdLazyCounter, 1256 mSolverCounterSat, 3901 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8880 SdHoareTripleChecker+Valid, 6601 SdHoareTripleChecker+Invalid, 5159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3901 IncrementalHoareTripleChecker+Valid, 1256 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2021-11-17 12:23:08,860 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8880 Valid, 6601 Invalid, 5159 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3901 Valid, 1256 Invalid, 2 Unknown, 0 Unchecked, 9.6s Time] [2021-11-17 12:23:08,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3634 states. [2021-11-17 12:23:09,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3634 to 3634. [2021-11-17 12:23:09,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3634 states, 2555 states have (on average 1.3162426614481408) internal successors, (3363), 2666 states have internal predecessors, (3363), 886 states have call successors, (886), 160 states have call predecessors, (886), 159 states have return successors, (884), 850 states have call predecessors, (884), 884 states have call successors, (884) [2021-11-17 12:23:09,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3634 states to 3634 states and 5133 transitions. [2021-11-17 12:23:09,130 INFO L78 Accepts]: Start accepts. Automaton has 3634 states and 5133 transitions. Word has length 72 [2021-11-17 12:23:09,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:23:09,133 INFO L470 AbstractCegarLoop]: Abstraction has 3634 states and 5133 transitions. [2021-11-17 12:23:09,133 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-11-17 12:23:09,134 INFO L276 IsEmpty]: Start isEmpty. Operand 3634 states and 5133 transitions. [2021-11-17 12:23:09,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-11-17 12:23:09,143 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:23:09,143 INFO L514 BasicCegarLoop]: 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] [2021-11-17 12:23:09,144 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-17 12:23:09,144 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 32 more)] === [2021-11-17 12:23:09,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:23:09,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1839687424, now seen corresponding path program 1 times [2021-11-17 12:23:09,145 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:23:09,145 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422015981] [2021-11-17 12:23:09,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:23:09,146 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:23:09,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:23:09,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:23:09,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:23:09,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-17 12:23:09,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:23:09,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-17 12:23:09,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:23:09,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-17 12:23:09,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:23:09,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-17 12:23:09,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:23:09,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-17 12:23:09,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:23:09,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:23:09,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:23:09,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-11-17 12:23:09,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:23:09,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-11-17 12:23:09,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:23:09,531 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-17 12:23:09,531 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:23:09,531 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422015981] [2021-11-17 12:23:09,531 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422015981] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:23:09,531 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:23:09,532 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-17 12:23:09,532 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752191667] [2021-11-17 12:23:09,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:23:09,533 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-17 12:23:09,533 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:23:09,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-17 12:23:09,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-17 12:23:09,534 INFO L87 Difference]: Start difference. First operand 3634 states and 5133 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-11-17 12:23:11,615 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:23:13,685 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:23:17,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:23:17,817 INFO L93 Difference]: Finished difference Result 7256 states and 10248 transitions. [2021-11-17 12:23:17,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-17 12:23:17,818 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 73 [2021-11-17 12:23:17,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:23:17,845 INFO L225 Difference]: With dead ends: 7256 [2021-11-17 12:23:17,845 INFO L226 Difference]: Without dead ends: 3634 [2021-11-17 12:23:17,860 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-17 12:23:17,861 INFO L933 BasicCegarLoop]: 4604 mSDtfsCounter, 8477 mSDsluCounter, 1952 mSDsCounter, 0 mSdLazyCounter, 1246 mSolverCounterSat, 3880 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8833 SdHoareTripleChecker+Valid, 6556 SdHoareTripleChecker+Invalid, 5128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3880 IncrementalHoareTripleChecker+Valid, 1246 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2021-11-17 12:23:17,864 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8833 Valid, 6556 Invalid, 5128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3880 Valid, 1246 Invalid, 2 Unknown, 0 Unchecked, 7.9s Time] [2021-11-17 12:23:17,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3634 states. [2021-11-17 12:23:17,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3634 to 3634. [2021-11-17 12:23:18,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3634 states, 2555 states have (on average 1.3158512720156557) internal successors, (3362), 2666 states have internal predecessors, (3362), 886 states have call successors, (886), 160 states have call predecessors, (886), 159 states have return successors, (884), 850 states have call predecessors, (884), 884 states have call successors, (884) [2021-11-17 12:23:18,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3634 states to 3634 states and 5132 transitions. [2021-11-17 12:23:18,020 INFO L78 Accepts]: Start accepts. Automaton has 3634 states and 5132 transitions. Word has length 73 [2021-11-17 12:23:18,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:23:18,021 INFO L470 AbstractCegarLoop]: Abstraction has 3634 states and 5132 transitions. [2021-11-17 12:23:18,021 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-11-17 12:23:18,021 INFO L276 IsEmpty]: Start isEmpty. Operand 3634 states and 5132 transitions. [2021-11-17 12:23:18,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-11-17 12:23:18,024 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:23:18,024 INFO L514 BasicCegarLoop]: 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] [2021-11-17 12:23:18,024 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-17 12:23:18,025 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 32 more)] === [2021-11-17 12:23:18,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:23:18,025 INFO L85 PathProgramCache]: Analyzing trace with hash -2021550786, now seen corresponding path program 1 times [2021-11-17 12:23:18,026 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:23:18,026 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719451640] [2021-11-17 12:23:18,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:23:18,026 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:23:18,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:23:18,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:23:18,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:23:18,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-17 12:23:18,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:23:18,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-17 12:23:18,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:23:18,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-17 12:23:18,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:23:18,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-17 12:23:18,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:23:18,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-17 12:23:18,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:23:18,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:23:18,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:23:18,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-11-17 12:23:18,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:23:18,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-11-17 12:23:18,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:23:18,474 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-17 12:23:18,474 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:23:18,474 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719451640] [2021-11-17 12:23:18,474 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719451640] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:23:18,474 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:23:18,475 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:23:18,475 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538014586] [2021-11-17 12:23:18,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:23:18,475 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:23:18,475 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:23:18,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:23:18,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:23:18,476 INFO L87 Difference]: Start difference. First operand 3634 states and 5132 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 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) [2021-11-17 12:23:20,555 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:23:22,620 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:23:30,035 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:23:34,018 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:23:38,277 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:23:44,408 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:23:46,439 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:23:49,940 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:23:51,973 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:23:55,573 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:23:57,606 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:23:58,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:23:58,887 INFO L93 Difference]: Finished difference Result 7232 states and 10219 transitions. [2021-11-17 12:23:58,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-17 12:23:58,892 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 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 73 [2021-11-17 12:23:58,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:23:58,936 INFO L225 Difference]: With dead ends: 7232 [2021-11-17 12:23:58,936 INFO L226 Difference]: Without dead ends: 7230 [2021-11-17 12:23:58,941 INFO L932 BasicCegarLoop]: 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 [2021-11-17 12:23:58,944 INFO L933 BasicCegarLoop]: 5346 mSDtfsCounter, 12682 mSDsluCounter, 6950 mSDsCounter, 0 mSdLazyCounter, 9080 mSolverCounterSat, 6533 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13025 SdHoareTripleChecker+Valid, 12296 SdHoareTripleChecker+Invalid, 15624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 6533 IncrementalHoareTripleChecker+Valid, 9080 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 39.6s IncrementalHoareTripleChecker+Time [2021-11-17 12:23:58,945 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13025 Valid, 12296 Invalid, 15624 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [6533 Valid, 9080 Invalid, 11 Unknown, 0 Unchecked, 39.6s Time] [2021-11-17 12:23:58,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7230 states. [2021-11-17 12:23:59,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7230 to 7025. [2021-11-17 12:23:59,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7025 states, 4970 states have (on average 1.3191146881287725) internal successors, (6556), 5159 states have internal predecessors, (6556), 1722 states have call successors, (1722), 300 states have call predecessors, (1722), 299 states have return successors, (1725), 1650 states have call predecessors, (1725), 1720 states have call successors, (1725) [2021-11-17 12:23:59,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7025 states to 7025 states and 10003 transitions. [2021-11-17 12:23:59,294 INFO L78 Accepts]: Start accepts. Automaton has 7025 states and 10003 transitions. Word has length 73 [2021-11-17 12:23:59,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:23:59,295 INFO L470 AbstractCegarLoop]: Abstraction has 7025 states and 10003 transitions. [2021-11-17 12:23:59,295 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 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) [2021-11-17 12:23:59,295 INFO L276 IsEmpty]: Start isEmpty. Operand 7025 states and 10003 transitions. [2021-11-17 12:23:59,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-11-17 12:23:59,297 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:23:59,297 INFO L514 BasicCegarLoop]: 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] [2021-11-17 12:23:59,297 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-17 12:23:59,298 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_linux_block_genhd_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 32 more)] === [2021-11-17 12:23:59,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:23:59,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1935965107, now seen corresponding path program 1 times [2021-11-17 12:23:59,298 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:23:59,299 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388194780] [2021-11-17 12:23:59,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:23:59,299 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:23:59,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:23:59,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:23:59,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:23:59,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-17 12:23:59,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:23:59,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-17 12:23:59,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:23:59,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-17 12:23:59,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:23:59,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-17 12:23:59,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:23:59,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-17 12:23:59,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:23:59,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:23:59,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:23:59,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-11-17 12:23:59,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:23:59,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-11-17 12:23:59,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:23:59,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-11-17 12:23:59,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:23:59,727 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-17 12:23:59,728 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:23:59,728 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388194780] [2021-11-17 12:23:59,728 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388194780] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:23:59,728 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:23:59,728 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:23:59,728 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129587384] [2021-11-17 12:23:59,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:23:59,730 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:23:59,730 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:23:59,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:23:59,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:23:59,731 INFO L87 Difference]: Start difference. First operand 7025 states and 10003 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-11-17 12:24:01,816 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:24:03,879 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:24:09,665 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:24:13,187 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:24:17,982 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:24:24,545 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:24:28,015 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:24:31,445 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:24:32,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:24:32,811 INFO L93 Difference]: Finished difference Result 14004 states and 19963 transitions. [2021-11-17 12:24:32,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-17 12:24:32,812 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 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 79 [2021-11-17 12:24:32,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:24:32,900 INFO L225 Difference]: With dead ends: 14004 [2021-11-17 12:24:32,900 INFO L226 Difference]: Without dead ends: 14002 [2021-11-17 12:24:32,911 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-11-17 12:24:32,912 INFO L933 BasicCegarLoop]: 5133 mSDtfsCounter, 12981 mSDsluCounter, 6836 mSDsCounter, 0 mSdLazyCounter, 8940 mSolverCounterSat, 6626 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13326 SdHoareTripleChecker+Valid, 11969 SdHoareTripleChecker+Invalid, 15574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 6626 IncrementalHoareTripleChecker+Valid, 8940 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.4s IncrementalHoareTripleChecker+Time [2021-11-17 12:24:32,912 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13326 Valid, 11969 Invalid, 15574 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [6626 Valid, 8940 Invalid, 8 Unknown, 0 Unchecked, 32.4s Time] [2021-11-17 12:24:32,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14002 states. [2021-11-17 12:24:33,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14002 to 13793. [2021-11-17 12:24:33,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13793 states, 9778 states have (on average 1.3209245244426262) internal successors, (12916), 10125 states have internal predecessors, (12916), 3400 states have call successors, (3400), 582 states have call predecessors, (3400), 581 states have return successors, (3426), 3254 states have call predecessors, (3426), 3398 states have call successors, (3426) [2021-11-17 12:24:33,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13793 states to 13793 states and 19742 transitions. [2021-11-17 12:24:33,708 INFO L78 Accepts]: Start accepts. Automaton has 13793 states and 19742 transitions. Word has length 79 [2021-11-17 12:24:33,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:24:33,709 INFO L470 AbstractCegarLoop]: Abstraction has 13793 states and 19742 transitions. [2021-11-17 12:24:33,709 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-11-17 12:24:33,709 INFO L276 IsEmpty]: Start isEmpty. Operand 13793 states and 19742 transitions. [2021-11-17 12:24:33,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-11-17 12:24:33,709 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:24:33,710 INFO L514 BasicCegarLoop]: 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] [2021-11-17 12:24:33,710 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-17 12:24:33,710 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 32 more)] === [2021-11-17 12:24:33,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:24:33,711 INFO L85 PathProgramCache]: Analyzing trace with hash 331485201, now seen corresponding path program 1 times [2021-11-17 12:24:33,711 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:24:33,711 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634783380] [2021-11-17 12:24:33,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:24:33,711 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:24:33,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:24:33,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:24:33,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:24:33,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-17 12:24:34,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:24:34,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-17 12:24:34,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:24:34,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-17 12:24:34,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:24:34,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-17 12:24:34,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:24:34,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-17 12:24:34,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:24:34,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:24:34,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:24:34,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-11-17 12:24:34,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:24:34,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-11-17 12:24:34,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:24:34,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-11-17 12:24:34,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:24:34,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-11-17 12:24:34,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:24:34,101 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-17 12:24:34,102 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:24:34,102 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634783380] [2021-11-17 12:24:34,102 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634783380] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:24:34,102 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:24:34,102 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:24:34,102 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127309186] [2021-11-17 12:24:34,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:24:34,103 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:24:34,103 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:24:34,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:24:34,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:24:34,104 INFO L87 Difference]: Start difference. First operand 13793 states and 19742 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2021-11-17 12:24:36,191 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:24:38,253 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:24:44,377 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:24:47,715 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:24:51,365 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:24:59,707 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:25:01,744 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:25:05,128 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:25:07,166 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:25:10,586 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:25:12,615 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:25:13,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:25:13,907 INFO L93 Difference]: Finished difference Result 27544 states and 39463 transitions. [2021-11-17 12:25:13,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-17 12:25:13,907 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 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 85 [2021-11-17 12:25:13,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:25:14,024 INFO L225 Difference]: With dead ends: 27544 [2021-11-17 12:25:14,025 INFO L226 Difference]: Without dead ends: 27542 [2021-11-17 12:25:14,040 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-11-17 12:25:14,041 INFO L933 BasicCegarLoop]: 4980 mSDtfsCounter, 13209 mSDsluCounter, 6758 mSDsCounter, 0 mSdLazyCounter, 8820 mSolverCounterSat, 6682 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13553 SdHoareTripleChecker+Valid, 11738 SdHoareTripleChecker+Invalid, 15513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 6682 IncrementalHoareTripleChecker+Valid, 8820 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 38.9s IncrementalHoareTripleChecker+Time [2021-11-17 12:25:14,042 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13553 Valid, 11738 Invalid, 15513 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [6682 Valid, 8820 Invalid, 11 Unknown, 0 Unchecked, 38.9s Time] [2021-11-17 12:25:14,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27542 states. [2021-11-17 12:25:15,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27542 to 27350. [2021-11-17 12:25:15,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27350 states, 19412 states have (on average 1.321811250772718) internal successors, (25659), 20073 states have internal predecessors, (25659), 6758 states have call successors, (6758), 1147 states have call predecessors, (6758), 1146 states have return successors, (6848), 6466 states have call predecessors, (6848), 6756 states have call successors, (6848) [2021-11-17 12:25:15,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27350 states to 27350 states and 39265 transitions. [2021-11-17 12:25:15,613 INFO L78 Accepts]: Start accepts. Automaton has 27350 states and 39265 transitions. Word has length 85 [2021-11-17 12:25:15,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:25:15,614 INFO L470 AbstractCegarLoop]: Abstraction has 27350 states and 39265 transitions. [2021-11-17 12:25:15,614 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2021-11-17 12:25:15,614 INFO L276 IsEmpty]: Start isEmpty. Operand 27350 states and 39265 transitions. [2021-11-17 12:25:15,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-11-17 12:25:15,615 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:25:15,616 INFO L514 BasicCegarLoop]: 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] [2021-11-17 12:25:15,616 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-17 12:25:15,616 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 32 more)] === [2021-11-17 12:25:15,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:25:15,617 INFO L85 PathProgramCache]: Analyzing trace with hash 213266737, now seen corresponding path program 1 times [2021-11-17 12:25:15,617 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:25:15,617 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555943311] [2021-11-17 12:25:15,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:25:15,617 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:25:15,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:15,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:25:15,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:15,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-17 12:25:15,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:15,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-17 12:25:15,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:15,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-17 12:25:15,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:15,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-17 12:25:15,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:15,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-17 12:25:15,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:15,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:25:15,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:15,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-11-17 12:25:15,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:15,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-11-17 12:25:15,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:15,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-11-17 12:25:15,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:15,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-11-17 12:25:15,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:15,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-11-17 12:25:15,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:16,000 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-17 12:25:16,000 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:25:16,000 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555943311] [2021-11-17 12:25:16,001 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555943311] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:25:16,001 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:25:16,001 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:25:16,001 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688165462] [2021-11-17 12:25:16,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:25:16,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:25:16,002 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:25:16,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:25:16,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:25:16,003 INFO L87 Difference]: Start difference. First operand 27350 states and 39265 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2021-11-17 12:25:18,087 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:25:20,155 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:25:26,445 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:25:29,834 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:25:33,377 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:25:35,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:25:35,506 INFO L93 Difference]: Finished difference Result 27350 states and 39265 transitions. [2021-11-17 12:25:35,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:25:35,506 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 4 states have internal predecessors, (55), 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 91 [2021-11-17 12:25:35,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:25:35,618 INFO L225 Difference]: With dead ends: 27350 [2021-11-17 12:25:35,619 INFO L226 Difference]: Without dead ends: 27348 [2021-11-17 12:25:35,636 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:25:35,637 INFO L933 BasicCegarLoop]: 4601 mSDtfsCounter, 8455 mSDsluCounter, 4174 mSDsCounter, 0 mSdLazyCounter, 4148 mSolverCounterSat, 3878 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8801 SdHoareTripleChecker+Valid, 8775 SdHoareTripleChecker+Invalid, 8031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3878 IncrementalHoareTripleChecker+Valid, 4148 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.8s IncrementalHoareTripleChecker+Time [2021-11-17 12:25:35,637 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8801 Valid, 8775 Invalid, 8031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3878 Valid, 4148 Invalid, 5 Unknown, 0 Unchecked, 18.8s Time] [2021-11-17 12:25:35,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27348 states. [2021-11-17 12:25:36,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27348 to 27348. [2021-11-17 12:25:36,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27348 states, 19411 states have (on average 1.3217763124001856) internal successors, (25657), 20071 states have internal predecessors, (25657), 6758 states have call successors, (6758), 1147 states have call predecessors, (6758), 1146 states have return successors, (6848), 6466 states have call predecessors, (6848), 6756 states have call successors, (6848) [2021-11-17 12:25:37,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27348 states to 27348 states and 39263 transitions. [2021-11-17 12:25:37,066 INFO L78 Accepts]: Start accepts. Automaton has 27348 states and 39263 transitions. Word has length 91 [2021-11-17 12:25:37,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:25:37,067 INFO L470 AbstractCegarLoop]: Abstraction has 27348 states and 39263 transitions. [2021-11-17 12:25:37,068 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2021-11-17 12:25:37,068 INFO L276 IsEmpty]: Start isEmpty. Operand 27348 states and 39263 transitions. [2021-11-17 12:25:37,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-11-17 12:25:37,069 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:25:37,069 INFO L514 BasicCegarLoop]: 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] [2021-11-17 12:25:37,069 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-17 12:25:37,070 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 32 more)] === [2021-11-17 12:25:37,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:25:37,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1639361368, now seen corresponding path program 1 times [2021-11-17 12:25:37,070 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:25:37,070 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155132611] [2021-11-17 12:25:37,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:25:37,071 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:25:37,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:37,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:25:37,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:37,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-17 12:25:37,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:37,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-17 12:25:37,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:37,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-17 12:25:37,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:37,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-17 12:25:37,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:37,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-17 12:25:37,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:37,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:25:37,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:37,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-11-17 12:25:37,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:37,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-11-17 12:25:37,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:37,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-11-17 12:25:37,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:37,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-11-17 12:25:37,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:37,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-11-17 12:25:37,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:37,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-11-17 12:25:37,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:37,404 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-17 12:25:37,405 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:25:37,405 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155132611] [2021-11-17 12:25:37,405 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155132611] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:25:37,405 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:25:37,405 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:25:37,405 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122185884] [2021-11-17 12:25:37,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:25:37,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:25:37,406 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:25:37,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:25:37,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:25:37,407 INFO L87 Difference]: Start difference. First operand 27348 states and 39263 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2021-11-17 12:25:39,493 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:25:41,561 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:25:46,735 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:25:50,127 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:25:53,705 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:25:55,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:25:55,979 INFO L93 Difference]: Finished difference Result 27348 states and 39263 transitions. [2021-11-17 12:25:55,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:25:55,980 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 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 97 [2021-11-17 12:25:55,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:25:56,072 INFO L225 Difference]: With dead ends: 27348 [2021-11-17 12:25:56,073 INFO L226 Difference]: Without dead ends: 27346 [2021-11-17 12:25:56,084 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:25:56,085 INFO L933 BasicCegarLoop]: 4599 mSDtfsCounter, 8449 mSDsluCounter, 4174 mSDsCounter, 0 mSdLazyCounter, 4146 mSolverCounterSat, 3878 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8794 SdHoareTripleChecker+Valid, 8773 SdHoareTripleChecker+Invalid, 8029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3878 IncrementalHoareTripleChecker+Valid, 4146 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.9s IncrementalHoareTripleChecker+Time [2021-11-17 12:25:56,085 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8794 Valid, 8773 Invalid, 8029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3878 Valid, 4146 Invalid, 5 Unknown, 0 Unchecked, 17.9s Time] [2021-11-17 12:25:56,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27346 states. [2021-11-17 12:25:57,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27346 to 27346. [2021-11-17 12:25:57,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27346 states, 19410 states have (on average 1.3217413704276146) internal successors, (25655), 20069 states have internal predecessors, (25655), 6758 states have call successors, (6758), 1147 states have call predecessors, (6758), 1146 states have return successors, (6848), 6466 states have call predecessors, (6848), 6756 states have call successors, (6848) [2021-11-17 12:25:57,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27346 states to 27346 states and 39261 transitions. [2021-11-17 12:25:57,362 INFO L78 Accepts]: Start accepts. Automaton has 27346 states and 39261 transitions. Word has length 97 [2021-11-17 12:25:57,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:25:57,363 INFO L470 AbstractCegarLoop]: Abstraction has 27346 states and 39261 transitions. [2021-11-17 12:25:57,363 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2021-11-17 12:25:57,363 INFO L276 IsEmpty]: Start isEmpty. Operand 27346 states and 39261 transitions. [2021-11-17 12:25:57,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-11-17 12:25:57,365 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:25:57,365 INFO L514 BasicCegarLoop]: 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] [2021-11-17 12:25:57,365 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-17 12:25:57,365 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 32 more)] === [2021-11-17 12:25:57,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:25:57,366 INFO L85 PathProgramCache]: Analyzing trace with hash -2024619521, now seen corresponding path program 1 times [2021-11-17 12:25:57,366 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:25:57,366 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479476469] [2021-11-17 12:25:57,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:25:57,367 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:25:57,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:57,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:25:57,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:57,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-17 12:25:57,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:57,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-17 12:25:57,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:57,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-17 12:25:57,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:57,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-17 12:25:57,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:57,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-17 12:25:57,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:57,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:25:57,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:57,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-11-17 12:25:57,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:57,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-11-17 12:25:57,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:57,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-11-17 12:25:57,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:57,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-11-17 12:25:57,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:57,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-11-17 12:25:57,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:57,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-11-17 12:25:57,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:57,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-11-17 12:25:57,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:57,702 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-17 12:25:57,703 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:25:57,703 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479476469] [2021-11-17 12:25:57,703 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479476469] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:25:57,703 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:25:57,703 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:25:57,703 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425199434] [2021-11-17 12:25:57,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:25:57,704 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:25:57,704 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:25:57,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:25:57,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:25:57,705 INFO L87 Difference]: Start difference. First operand 27346 states and 39261 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-17 12:25:59,786 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:26:01,845 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:26:07,936 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:26:11,530 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:26:15,466 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:26:17,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:26:17,916 INFO L93 Difference]: Finished difference Result 27346 states and 39261 transitions. [2021-11-17 12:26:17,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:26:17,917 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 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 103 [2021-11-17 12:26:17,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:26:18,044 INFO L225 Difference]: With dead ends: 27346 [2021-11-17 12:26:18,044 INFO L226 Difference]: Without dead ends: 27344 [2021-11-17 12:26:18,067 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:26:18,068 INFO L933 BasicCegarLoop]: 4597 mSDtfsCounter, 8443 mSDsluCounter, 4174 mSDsCounter, 0 mSdLazyCounter, 4144 mSolverCounterSat, 3878 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8787 SdHoareTripleChecker+Valid, 8771 SdHoareTripleChecker+Invalid, 8027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3878 IncrementalHoareTripleChecker+Valid, 4144 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.5s IncrementalHoareTripleChecker+Time [2021-11-17 12:26:18,069 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8787 Valid, 8771 Invalid, 8027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3878 Valid, 4144 Invalid, 5 Unknown, 0 Unchecked, 19.5s Time] [2021-11-17 12:26:18,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27344 states. [2021-11-17 12:26:19,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27344 to 27344. [2021-11-17 12:26:19,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27344 states, 19409 states have (on average 1.321706424854449) internal successors, (25653), 20067 states have internal predecessors, (25653), 6758 states have call successors, (6758), 1147 states have call predecessors, (6758), 1146 states have return successors, (6848), 6466 states have call predecessors, (6848), 6756 states have call successors, (6848) [2021-11-17 12:26:19,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27344 states to 27344 states and 39259 transitions. [2021-11-17 12:26:19,255 INFO L78 Accepts]: Start accepts. Automaton has 27344 states and 39259 transitions. Word has length 103 [2021-11-17 12:26:19,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:26:19,256 INFO L470 AbstractCegarLoop]: Abstraction has 27344 states and 39259 transitions. [2021-11-17 12:26:19,256 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-17 12:26:19,256 INFO L276 IsEmpty]: Start isEmpty. Operand 27344 states and 39259 transitions. [2021-11-17 12:26:19,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-11-17 12:26:19,258 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:26:19,258 INFO L514 BasicCegarLoop]: 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] [2021-11-17 12:26:19,258 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-17 12:26:19,258 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 32 more)] === [2021-11-17 12:26:19,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:26:19,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1974521303, now seen corresponding path program 1 times [2021-11-17 12:26:19,259 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:26:19,259 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361758635] [2021-11-17 12:26:19,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:26:19,259 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:26:19,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:19,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:26:19,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:19,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-17 12:26:19,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:19,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-17 12:26:19,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:19,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-17 12:26:19,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:19,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-17 12:26:19,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:19,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-17 12:26:19,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:19,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:26:19,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:19,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-11-17 12:26:19,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:19,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-11-17 12:26:19,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:19,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-11-17 12:26:19,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:19,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-11-17 12:26:19,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:19,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-11-17 12:26:19,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:19,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-11-17 12:26:19,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:19,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-11-17 12:26:19,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:19,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-11-17 12:26:19,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:19,608 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-17 12:26:19,609 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:26:19,609 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361758635] [2021-11-17 12:26:19,609 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361758635] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:26:19,609 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:26:19,609 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:26:19,609 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310988336] [2021-11-17 12:26:19,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:26:19,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:26:19,610 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:26:19,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:26:19,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:26:19,611 INFO L87 Difference]: Start difference. First operand 27344 states and 39259 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-17 12:26:21,701 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:26:23,763 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:26:29,672 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:26:33,383 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:26:37,264 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:26:39,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:26:39,959 INFO L93 Difference]: Finished difference Result 27344 states and 39259 transitions. [2021-11-17 12:26:39,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:26:39,960 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (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 109 [2021-11-17 12:26:39,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:26:40,064 INFO L225 Difference]: With dead ends: 27344 [2021-11-17 12:26:40,064 INFO L226 Difference]: Without dead ends: 27342 [2021-11-17 12:26:40,085 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:26:40,085 INFO L933 BasicCegarLoop]: 4595 mSDtfsCounter, 8437 mSDsluCounter, 4174 mSDsCounter, 0 mSdLazyCounter, 4142 mSolverCounterSat, 3878 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8780 SdHoareTripleChecker+Valid, 8769 SdHoareTripleChecker+Invalid, 8025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3878 IncrementalHoareTripleChecker+Valid, 4142 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.3s IncrementalHoareTripleChecker+Time [2021-11-17 12:26:40,086 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8780 Valid, 8769 Invalid, 8025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3878 Valid, 4142 Invalid, 5 Unknown, 0 Unchecked, 19.3s Time] [2021-11-17 12:26:40,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27342 states. [2021-11-17 12:26:41,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27342 to 27342. [2021-11-17 12:26:41,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27342 states, 19408 states have (on average 1.321671475680132) internal successors, (25651), 20065 states have internal predecessors, (25651), 6758 states have call successors, (6758), 1147 states have call predecessors, (6758), 1146 states have return successors, (6848), 6466 states have call predecessors, (6848), 6756 states have call successors, (6848) [2021-11-17 12:26:41,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27342 states to 27342 states and 39257 transitions. [2021-11-17 12:26:41,199 INFO L78 Accepts]: Start accepts. Automaton has 27342 states and 39257 transitions. Word has length 109 [2021-11-17 12:26:41,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:26:41,199 INFO L470 AbstractCegarLoop]: Abstraction has 27342 states and 39257 transitions. [2021-11-17 12:26:41,199 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-17 12:26:41,200 INFO L276 IsEmpty]: Start isEmpty. Operand 27342 states and 39257 transitions. [2021-11-17 12:26:41,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-11-17 12:26:41,201 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:26:41,202 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:26:41,202 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-17 12:26:41,202 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 32 more)] === [2021-11-17 12:26:41,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:26:41,202 INFO L85 PathProgramCache]: Analyzing trace with hash -528566890, now seen corresponding path program 1 times [2021-11-17 12:26:41,203 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:26:41,203 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878486975] [2021-11-17 12:26:41,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:26:41,203 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:26:41,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:41,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:26:41,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:41,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-17 12:26:41,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:41,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-17 12:26:41,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:41,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-11-17 12:26:41,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:41,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:26:41,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:41,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:26:41,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:41,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:26:41,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:41,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-11-17 12:26:41,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:41,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:26:41,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:41,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:26:41,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:41,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:26:41,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:41,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-11-17 12:26:41,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:41,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:26:41,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:41,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:26:41,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:41,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:26:41,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:41,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-17 12:26:41,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:41,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-11-17 12:26:41,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:41,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-17 12:26:41,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:41,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-11-17 12:26:41,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:41,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-11-17 12:26:41,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:41,711 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2021-11-17 12:26:41,711 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:26:41,711 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878486975] [2021-11-17 12:26:41,711 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878486975] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:26:41,711 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:26:41,711 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-17 12:26:41,712 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701056288] [2021-11-17 12:26:41,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:26:41,712 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-17 12:26:41,712 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:26:41,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-17 12:26:41,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-17 12:26:41,713 INFO L87 Difference]: Start difference. First operand 27342 states and 39257 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2021-11-17 12:26:43,801 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:26:45,859 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:26:47,930 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:26:51,167 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:26:56,689 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:27:00,204 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:27:04,936 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:27:07,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:27:07,816 INFO L93 Difference]: Finished difference Result 55220 states and 79484 transitions. [2021-11-17 12:27:07,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:27:07,816 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 130 [2021-11-17 12:27:07,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:27:08,024 INFO L225 Difference]: With dead ends: 55220 [2021-11-17 12:27:08,024 INFO L226 Difference]: Without dead ends: 27908 [2021-11-17 12:27:08,122 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-11-17 12:27:08,136 INFO L933 BasicCegarLoop]: 4204 mSDtfsCounter, 12316 mSDsluCounter, 2824 mSDsCounter, 0 mSdLazyCounter, 4221 mSolverCounterSat, 7693 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12316 SdHoareTripleChecker+Valid, 7028 SdHoareTripleChecker+Invalid, 11920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7693 IncrementalHoareTripleChecker+Valid, 4221 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.0s IncrementalHoareTripleChecker+Time [2021-11-17 12:27:08,137 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12316 Valid, 7028 Invalid, 11920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7693 Valid, 4221 Invalid, 6 Unknown, 0 Unchecked, 25.0s Time] [2021-11-17 12:27:08,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27908 states. [2021-11-17 12:27:09,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27908 to 27340. [2021-11-17 12:27:09,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27340 states, 19399 states have (on average 1.3209959276251353) internal successors, (25626), 20055 states have internal predecessors, (25626), 6758 states have call successors, (6758), 1147 states have call predecessors, (6758), 1154 states have return successors, (6856), 6466 states have call predecessors, (6856), 6756 states have call successors, (6856) [2021-11-17 12:27:09,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27340 states to 27340 states and 39240 transitions. [2021-11-17 12:27:09,814 INFO L78 Accepts]: Start accepts. Automaton has 27340 states and 39240 transitions. Word has length 130 [2021-11-17 12:27:09,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:27:09,815 INFO L470 AbstractCegarLoop]: Abstraction has 27340 states and 39240 transitions. [2021-11-17 12:27:09,815 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2021-11-17 12:27:09,815 INFO L276 IsEmpty]: Start isEmpty. Operand 27340 states and 39240 transitions. [2021-11-17 12:27:09,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-11-17 12:27:09,817 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:27:09,817 INFO L514 BasicCegarLoop]: 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] [2021-11-17 12:27:09,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-17 12:27:09,817 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 32 more)] === [2021-11-17 12:27:09,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:27:09,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1937919446, now seen corresponding path program 1 times [2021-11-17 12:27:09,818 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:27:09,818 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078396916] [2021-11-17 12:27:09,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:27:09,818 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:27:09,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:10,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:27:10,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:10,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-17 12:27:10,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:10,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-17 12:27:10,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:10,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-17 12:27:10,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:10,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-17 12:27:10,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:10,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-17 12:27:10,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:10,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:27:10,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:10,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-11-17 12:27:10,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:10,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-11-17 12:27:10,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:10,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-11-17 12:27:10,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:10,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-11-17 12:27:10,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:10,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-11-17 12:27:10,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:10,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-11-17 12:27:10,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:10,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-11-17 12:27:10,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:10,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-11-17 12:27:10,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:10,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-17 12:27:10,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:10,208 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-17 12:27:10,208 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:27:10,208 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078396916] [2021-11-17 12:27:10,208 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078396916] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:27:10,208 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:27:10,208 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:27:10,209 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301955247] [2021-11-17 12:27:10,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:27:10,209 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:27:10,209 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:27:10,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:27:10,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:27:10,210 INFO L87 Difference]: Start difference. First operand 27340 states and 39240 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-17 12:27:12,300 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:27:14,360 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:27:20,095 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:27:23,722 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:27:27,583 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:27:30,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:27:30,035 INFO L93 Difference]: Finished difference Result 27340 states and 39240 transitions. [2021-11-17 12:27:30,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:27:30,036 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (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 115 [2021-11-17 12:27:30,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:27:30,120 INFO L225 Difference]: With dead ends: 27340 [2021-11-17 12:27:30,121 INFO L226 Difference]: Without dead ends: 27338 [2021-11-17 12:27:30,134 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:27:30,135 INFO L933 BasicCegarLoop]: 4588 mSDtfsCounter, 8430 mSDsluCounter, 4160 mSDsCounter, 0 mSdLazyCounter, 4135 mSolverCounterSat, 3878 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8772 SdHoareTripleChecker+Valid, 8748 SdHoareTripleChecker+Invalid, 8018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3878 IncrementalHoareTripleChecker+Valid, 4135 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.8s IncrementalHoareTripleChecker+Time [2021-11-17 12:27:30,135 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8772 Valid, 8748 Invalid, 8018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3878 Valid, 4135 Invalid, 5 Unknown, 0 Unchecked, 18.8s Time] [2021-11-17 12:27:30,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27338 states. [2021-11-17 12:27:31,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27338 to 27338. [2021-11-17 12:27:31,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27338 states, 19398 states have (on average 1.320960923806578) internal successors, (25624), 20053 states have internal predecessors, (25624), 6758 states have call successors, (6758), 1147 states have call predecessors, (6758), 1154 states have return successors, (6856), 6466 states have call predecessors, (6856), 6756 states have call successors, (6856) [2021-11-17 12:27:31,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27338 states to 27338 states and 39238 transitions. [2021-11-17 12:27:31,236 INFO L78 Accepts]: Start accepts. Automaton has 27338 states and 39238 transitions. Word has length 115 [2021-11-17 12:27:31,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:27:31,237 INFO L470 AbstractCegarLoop]: Abstraction has 27338 states and 39238 transitions. [2021-11-17 12:27:31,237 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-17 12:27:31,237 INFO L276 IsEmpty]: Start isEmpty. Operand 27338 states and 39238 transitions. [2021-11-17 12:27:31,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-11-17 12:27:31,239 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:27:31,239 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:27:31,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-17 12:27:31,239 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 32 more)] === [2021-11-17 12:27:31,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:27:31,240 INFO L85 PathProgramCache]: Analyzing trace with hash -817323419, now seen corresponding path program 1 times [2021-11-17 12:27:31,240 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:27:31,240 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608282360] [2021-11-17 12:27:31,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:27:31,241 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:27:31,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:31,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:27:31,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:31,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-17 12:27:31,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:31,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-17 12:27:31,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:31,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-11-17 12:27:31,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:31,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:27:31,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:31,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:27:31,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:31,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:27:31,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:31,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-11-17 12:27:31,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:31,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:27:31,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:31,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:27:31,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:31,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:27:31,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:31,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-11-17 12:27:31,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:31,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:27:31,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:31,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:27:31,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:31,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:27:31,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:31,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-17 12:27:31,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:31,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-11-17 12:27:31,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:31,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-17 12:27:31,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:31,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-11-17 12:27:31,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:31,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-11-17 12:27:31,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:31,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-11-17 12:27:31,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:31,655 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2021-11-17 12:27:31,655 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:27:31,655 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608282360] [2021-11-17 12:27:31,655 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608282360] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:27:31,655 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:27:31,655 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-17 12:27:31,655 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253791297] [2021-11-17 12:27:31,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:27:31,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-17 12:27:31,656 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:27:31,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-17 12:27:31,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-17 12:27:31,657 INFO L87 Difference]: Start difference. First operand 27338 states and 39238 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2021-11-17 12:27:33,746 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:27:35,808 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:27:37,879 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:27:41,837 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:27:47,814 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:27:51,589 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:27:55,888 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:27:59,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:27:59,334 INFO L93 Difference]: Finished difference Result 55196 states and 79430 transitions. [2021-11-17 12:27:59,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:27:59,335 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 136 [2021-11-17 12:27:59,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:27:59,420 INFO L225 Difference]: With dead ends: 55196 [2021-11-17 12:27:59,421 INFO L226 Difference]: Without dead ends: 27888 [2021-11-17 12:27:59,490 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-11-17 12:27:59,491 INFO L933 BasicCegarLoop]: 4197 mSDtfsCounter, 15652 mSDsluCounter, 2810 mSDsCounter, 0 mSdLazyCounter, 4229 mSolverCounterSat, 9551 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15652 SdHoareTripleChecker+Valid, 7007 SdHoareTripleChecker+Invalid, 13787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9551 IncrementalHoareTripleChecker+Valid, 4229 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.3s IncrementalHoareTripleChecker+Time [2021-11-17 12:27:59,491 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15652 Valid, 7007 Invalid, 13787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9551 Valid, 4229 Invalid, 7 Unknown, 0 Unchecked, 26.3s Time] [2021-11-17 12:27:59,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27888 states. [2021-11-17 12:28:00,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27888 to 27320. [2021-11-17 12:28:00,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27320 states, 19381 states have (on average 1.320416903152572) internal successors, (25591), 20035 states have internal predecessors, (25591), 6758 states have call successors, (6758), 1147 states have call predecessors, (6758), 1154 states have return successors, (6856), 6466 states have call predecessors, (6856), 6756 states have call successors, (6856) [2021-11-17 12:28:00,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27320 states to 27320 states and 39205 transitions. [2021-11-17 12:28:00,585 INFO L78 Accepts]: Start accepts. Automaton has 27320 states and 39205 transitions. Word has length 136 [2021-11-17 12:28:00,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:28:00,586 INFO L470 AbstractCegarLoop]: Abstraction has 27320 states and 39205 transitions. [2021-11-17 12:28:00,586 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2021-11-17 12:28:00,586 INFO L276 IsEmpty]: Start isEmpty. Operand 27320 states and 39205 transitions. [2021-11-17 12:28:00,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-11-17 12:28:00,588 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:28:00,588 INFO L514 BasicCegarLoop]: 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] [2021-11-17 12:28:00,588 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-17 12:28:00,588 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 32 more)] === [2021-11-17 12:28:00,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:28:00,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1675068455, now seen corresponding path program 1 times [2021-11-17 12:28:00,589 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:28:00,589 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583541556] [2021-11-17 12:28:00,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:28:00,589 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:28:00,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:00,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:28:00,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:00,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-17 12:28:00,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:00,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-17 12:28:00,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:00,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-17 12:28:00,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:00,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-17 12:28:00,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:00,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-17 12:28:00,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:00,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:28:00,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:00,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-11-17 12:28:00,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:00,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-11-17 12:28:00,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:00,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-11-17 12:28:00,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:00,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-11-17 12:28:00,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:00,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-11-17 12:28:00,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:00,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-11-17 12:28:00,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:00,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-11-17 12:28:00,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:00,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-11-17 12:28:00,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:00,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-17 12:28:00,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:00,920 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-17 12:28:00,920 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:28:00,920 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583541556] [2021-11-17 12:28:00,920 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583541556] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:28:00,921 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:28:00,921 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:28:00,921 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798166379] [2021-11-17 12:28:00,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:28:00,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:28:00,922 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:28:00,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:28:00,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:28:00,922 INFO L87 Difference]: Start difference. First operand 27320 states and 39205 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-17 12:28:03,007 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:28:05,076 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:28:10,625 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:28:14,313 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:28:18,174 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:28:20,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:28:20,537 INFO L93 Difference]: Finished difference Result 27320 states and 39205 transitions. [2021-11-17 12:28:20,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:28:20,538 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 4 states have internal predecessors, (73), 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 117 [2021-11-17 12:28:20,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:28:20,627 INFO L225 Difference]: With dead ends: 27320 [2021-11-17 12:28:20,627 INFO L226 Difference]: Without dead ends: 27318 [2021-11-17 12:28:20,647 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:28:20,648 INFO L933 BasicCegarLoop]: 4581 mSDtfsCounter, 8413 mSDsluCounter, 4146 mSDsCounter, 0 mSdLazyCounter, 4136 mSolverCounterSat, 3878 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8755 SdHoareTripleChecker+Valid, 8727 SdHoareTripleChecker+Invalid, 8019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3878 IncrementalHoareTripleChecker+Valid, 4136 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.8s IncrementalHoareTripleChecker+Time [2021-11-17 12:28:20,648 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8755 Valid, 8727 Invalid, 8019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3878 Valid, 4136 Invalid, 5 Unknown, 0 Unchecked, 18.8s Time] [2021-11-17 12:28:20,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27318 states. [2021-11-17 12:28:21,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27318 to 27318. [2021-11-17 12:28:21,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27318 states, 19380 states have (on average 1.3203818369453044) internal successors, (25589), 20033 states have internal predecessors, (25589), 6758 states have call successors, (6758), 1147 states have call predecessors, (6758), 1154 states have return successors, (6856), 6466 states have call predecessors, (6856), 6756 states have call successors, (6856) [2021-11-17 12:28:21,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27318 states to 27318 states and 39203 transitions. [2021-11-17 12:28:21,946 INFO L78 Accepts]: Start accepts. Automaton has 27318 states and 39203 transitions. Word has length 117 [2021-11-17 12:28:21,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:28:21,946 INFO L470 AbstractCegarLoop]: Abstraction has 27318 states and 39203 transitions. [2021-11-17 12:28:21,947 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-17 12:28:21,947 INFO L276 IsEmpty]: Start isEmpty. Operand 27318 states and 39203 transitions. [2021-11-17 12:28:21,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-11-17 12:28:21,948 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:28:21,949 INFO L514 BasicCegarLoop]: 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] [2021-11-17 12:28:21,949 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-17 12:28:21,949 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_linux_kernel_module_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 32 more)] === [2021-11-17 12:28:21,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:28:21,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1637936111, now seen corresponding path program 1 times [2021-11-17 12:28:21,950 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:28:21,950 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193854750] [2021-11-17 12:28:21,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:28:21,950 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:28:22,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:22,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:28:22,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:22,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-17 12:28:22,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:22,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-17 12:28:22,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:22,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-17 12:28:22,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:22,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-17 12:28:22,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:22,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-17 12:28:22,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:22,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:28:22,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:22,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-11-17 12:28:22,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:22,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-11-17 12:28:22,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:22,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-11-17 12:28:22,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:22,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-11-17 12:28:22,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:22,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-11-17 12:28:22,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:22,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-11-17 12:28:22,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:22,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-11-17 12:28:22,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:22,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-11-17 12:28:22,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:22,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-17 12:28:22,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:22,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-11-17 12:28:22,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:22,317 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-17 12:28:22,317 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:28:22,317 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193854750] [2021-11-17 12:28:22,317 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193854750] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:28:22,317 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:28:22,317 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:28:22,318 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259687462] [2021-11-17 12:28:22,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:28:22,318 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:28:22,318 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:28:22,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:28:22,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:28:22,319 INFO L87 Difference]: Start difference. First operand 27318 states and 39203 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2021-11-17 12:28:24,405 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:28:26,473 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:28:32,368 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:28:35,885 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:28:39,725 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:28:42,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:28:42,289 INFO L93 Difference]: Finished difference Result 27318 states and 39203 transitions. [2021-11-17 12:28:42,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:28:42,290 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 4 states have internal predecessors, (77), 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 123 [2021-11-17 12:28:42,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:28:42,374 INFO L225 Difference]: With dead ends: 27318 [2021-11-17 12:28:42,374 INFO L226 Difference]: Without dead ends: 27316 [2021-11-17 12:28:42,392 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:28:42,393 INFO L933 BasicCegarLoop]: 4579 mSDtfsCounter, 8409 mSDsluCounter, 4146 mSDsCounter, 0 mSdLazyCounter, 4134 mSolverCounterSat, 3878 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8750 SdHoareTripleChecker+Valid, 8725 SdHoareTripleChecker+Invalid, 8017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3878 IncrementalHoareTripleChecker+Valid, 4134 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.1s IncrementalHoareTripleChecker+Time [2021-11-17 12:28:42,393 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8750 Valid, 8725 Invalid, 8017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3878 Valid, 4134 Invalid, 5 Unknown, 0 Unchecked, 19.1s Time] [2021-11-17 12:28:42,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27316 states. [2021-11-17 12:28:43,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27316 to 27316. [2021-11-17 12:28:43,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27316 states, 19379 states have (on average 1.3203467671190463) internal successors, (25587), 20031 states have internal predecessors, (25587), 6758 states have call successors, (6758), 1147 states have call predecessors, (6758), 1154 states have return successors, (6856), 6466 states have call predecessors, (6856), 6756 states have call successors, (6856) [2021-11-17 12:28:43,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27316 states to 27316 states and 39201 transitions. [2021-11-17 12:28:43,680 INFO L78 Accepts]: Start accepts. Automaton has 27316 states and 39201 transitions. Word has length 123 [2021-11-17 12:28:43,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:28:43,680 INFO L470 AbstractCegarLoop]: Abstraction has 27316 states and 39201 transitions. [2021-11-17 12:28:43,681 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2021-11-17 12:28:43,681 INFO L276 IsEmpty]: Start isEmpty. Operand 27316 states and 39201 transitions. [2021-11-17 12:28:43,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2021-11-17 12:28:43,682 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:28:43,682 INFO L514 BasicCegarLoop]: 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] [2021-11-17 12:28:43,682 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-17 12:28:43,683 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 32 more)] === [2021-11-17 12:28:43,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:28:43,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1871806180, now seen corresponding path program 1 times [2021-11-17 12:28:43,683 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:28:43,683 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823323717] [2021-11-17 12:28:43,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:28:43,683 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:28:43,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:43,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:28:43,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:43,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-17 12:28:43,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:43,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-17 12:28:43,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:43,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-17 12:28:43,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:43,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-17 12:28:43,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:43,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-17 12:28:43,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:43,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:28:43,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:43,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-11-17 12:28:43,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:43,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-11-17 12:28:43,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:43,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-11-17 12:28:43,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:43,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-11-17 12:28:44,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:44,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-11-17 12:28:44,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:44,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-11-17 12:28:44,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:44,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-11-17 12:28:44,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:44,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-11-17 12:28:44,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:44,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-17 12:28:44,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:44,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-11-17 12:28:44,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:44,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-11-17 12:28:44,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:44,061 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-17 12:28:44,061 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:28:44,062 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823323717] [2021-11-17 12:28:44,062 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823323717] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:28:44,062 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:28:44,062 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:28:44,062 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522276309] [2021-11-17 12:28:44,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:28:44,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:28:44,063 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:28:44,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:28:44,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:28:44,064 INFO L87 Difference]: Start difference. First operand 27316 states and 39201 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2021-11-17 12:28:46,158 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:28:48,225 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:28:53,609 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:28:57,462 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:29:02,011 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:29:04,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:29:04,835 INFO L93 Difference]: Finished difference Result 27316 states and 39201 transitions. [2021-11-17 12:29:04,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:29:04,835 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 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 129 [2021-11-17 12:29:04,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:29:04,908 INFO L225 Difference]: With dead ends: 27316 [2021-11-17 12:29:04,909 INFO L226 Difference]: Without dead ends: 27314 [2021-11-17 12:29:04,918 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:29:04,919 INFO L933 BasicCegarLoop]: 4577 mSDtfsCounter, 8403 mSDsluCounter, 4146 mSDsCounter, 0 mSdLazyCounter, 4132 mSolverCounterSat, 3878 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8743 SdHoareTripleChecker+Valid, 8723 SdHoareTripleChecker+Invalid, 8015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3878 IncrementalHoareTripleChecker+Valid, 4132 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.7s IncrementalHoareTripleChecker+Time [2021-11-17 12:29:04,919 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8743 Valid, 8723 Invalid, 8015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3878 Valid, 4132 Invalid, 5 Unknown, 0 Unchecked, 19.7s Time] [2021-11-17 12:29:04,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27314 states. [2021-11-17 12:29:05,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27314 to 27314. [2021-11-17 12:29:05,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27314 states, 19378 states have (on average 1.3203116936732378) internal successors, (25585), 20029 states have internal predecessors, (25585), 6758 states have call successors, (6758), 1147 states have call predecessors, (6758), 1154 states have return successors, (6856), 6466 states have call predecessors, (6856), 6756 states have call successors, (6856) [2021-11-17 12:29:06,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27314 states to 27314 states and 39199 transitions. [2021-11-17 12:29:06,107 INFO L78 Accepts]: Start accepts. Automaton has 27314 states and 39199 transitions. Word has length 129 [2021-11-17 12:29:06,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:29:06,107 INFO L470 AbstractCegarLoop]: Abstraction has 27314 states and 39199 transitions. [2021-11-17 12:29:06,107 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2021-11-17 12:29:06,107 INFO L276 IsEmpty]: Start isEmpty. Operand 27314 states and 39199 transitions. [2021-11-17 12:29:06,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-11-17 12:29:06,109 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:29:06,110 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 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] [2021-11-17 12:29:06,110 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-17 12:29:06,110 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 32 more)] === [2021-11-17 12:29:06,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:29:06,110 INFO L85 PathProgramCache]: Analyzing trace with hash -780101456, now seen corresponding path program 1 times [2021-11-17 12:29:06,111 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:29:06,111 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244756573] [2021-11-17 12:29:06,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:29:06,111 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:29:06,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:06,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:29:06,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:06,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-17 12:29:06,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:06,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-17 12:29:06,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:06,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-17 12:29:06,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:06,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-17 12:29:06,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:06,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-17 12:29:06,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:06,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:29:06,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:06,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-11-17 12:29:06,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:06,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-11-17 12:29:06,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:06,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-11-17 12:29:06,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:06,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-11-17 12:29:06,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:06,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:29:06,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:06,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:29:06,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:06,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:29:06,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:06,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-17 12:29:06,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:06,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 12:29:06,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:06,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-11-17 12:29:06,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:06,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-11-17 12:29:06,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:06,582 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2021-11-17 12:29:06,583 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:29:06,583 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244756573] [2021-11-17 12:29:06,585 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244756573] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:29:06,585 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:29:06,585 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-17 12:29:06,585 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305807360] [2021-11-17 12:29:06,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:29:06,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-17 12:29:06,586 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:29:06,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-17 12:29:06,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-17 12:29:06,587 INFO L87 Difference]: Start difference. First operand 27314 states and 39199 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (20), 7 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2021-11-17 12:29:08,692 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:29:10,746 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:29:12,811 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:29:14,874 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:29:19,800 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:29:27,068 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:29:30,847 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:29:32,882 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:29:34,923 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:29:36,957 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:29:39,001 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:29:43,942 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:29:45,982 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:29:48,027 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:29:50,076 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:29:52,119 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:30:01,860 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:30:03,891 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:30:05,925 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:30:07,962 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:30:09,988 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:30:19,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:30:19,289 INFO L93 Difference]: Finished difference Result 30630 states and 44761 transitions. [2021-11-17 12:30:19,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-17 12:30:19,290 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (20), 7 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 140 [2021-11-17 12:30:19,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:30:19,387 INFO L225 Difference]: With dead ends: 30630 [2021-11-17 12:30:19,388 INFO L226 Difference]: Without dead ends: 30628 [2021-11-17 12:30:19,407 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=290, Unknown=0, NotChecked=0, Total=420 [2021-11-17 12:30:19,407 INFO L933 BasicCegarLoop]: 4465 mSDtfsCounter, 9081 mSDsluCounter, 8658 mSDsCounter, 0 mSdLazyCounter, 14911 mSolverCounterSat, 6172 mSolverCounterUnsat, 19 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 66.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9386 SdHoareTripleChecker+Valid, 13123 SdHoareTripleChecker+Invalid, 21102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 6172 IncrementalHoareTripleChecker+Valid, 14911 IncrementalHoareTripleChecker+Invalid, 19 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 71.2s IncrementalHoareTripleChecker+Time [2021-11-17 12:30:19,408 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9386 Valid, 13123 Invalid, 21102 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [6172 Valid, 14911 Invalid, 19 Unknown, 0 Unchecked, 71.2s Time] [2021-11-17 12:30:19,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30628 states. [2021-11-17 12:30:20,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30628 to 28740. [2021-11-17 12:30:20,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28740 states, 20369 states have (on average 1.3133683538710785) internal successors, (26752), 21031 states have internal predecessors, (26752), 6974 states have call successors, (6974), 1355 states have call predecessors, (6974), 1374 states have return successors, (7104), 6682 states have call predecessors, (7104), 6972 states have call successors, (7104) [2021-11-17 12:30:20,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28740 states to 28740 states and 40830 transitions. [2021-11-17 12:30:20,806 INFO L78 Accepts]: Start accepts. Automaton has 28740 states and 40830 transitions. Word has length 140 [2021-11-17 12:30:20,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:30:20,807 INFO L470 AbstractCegarLoop]: Abstraction has 28740 states and 40830 transitions. [2021-11-17 12:30:20,807 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (20), 7 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2021-11-17 12:30:20,807 INFO L276 IsEmpty]: Start isEmpty. Operand 28740 states and 40830 transitions. [2021-11-17 12:30:20,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-11-17 12:30:20,809 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:30:20,809 INFO L514 BasicCegarLoop]: 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] [2021-11-17 12:30:20,809 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-17 12:30:20,809 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 32 more)] === [2021-11-17 12:30:20,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:30:20,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1678071087, now seen corresponding path program 1 times [2021-11-17 12:30:20,810 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:30:20,810 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374700280] [2021-11-17 12:30:20,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:30:20,810 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:30:20,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:21,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:30:21,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:21,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-17 12:30:21,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:21,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-17 12:30:21,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:21,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-17 12:30:21,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:21,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-17 12:30:21,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:21,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-17 12:30:21,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:21,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:30:21,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:21,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-11-17 12:30:21,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:21,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-11-17 12:30:21,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:21,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-11-17 12:30:21,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:21,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-11-17 12:30:21,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:21,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-11-17 12:30:21,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:21,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-11-17 12:30:21,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:21,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-11-17 12:30:21,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:21,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-11-17 12:30:21,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:21,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-17 12:30:21,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:21,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-11-17 12:30:21,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:21,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-11-17 12:30:21,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:21,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2021-11-17 12:30:21,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:21,154 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-17 12:30:21,155 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:30:21,155 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374700280] [2021-11-17 12:30:21,155 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374700280] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:30:21,155 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:30:21,155 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:30:21,155 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724530633] [2021-11-17 12:30:21,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:30:21,156 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:30:21,157 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:30:21,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:30:21,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:30:21,157 INFO L87 Difference]: Start difference. First operand 28740 states and 40830 transitions. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2021-11-17 12:30:23,244 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:30:25,305 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:30:30,406 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:30:34,498 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:30:38,740 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:30:42,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:30:42,305 INFO L93 Difference]: Finished difference Result 28740 states and 40830 transitions. [2021-11-17 12:30:42,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:30:42,306 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 4 states have internal predecessors, (85), 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 135 [2021-11-17 12:30:42,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:30:42,397 INFO L225 Difference]: With dead ends: 28740 [2021-11-17 12:30:42,397 INFO L226 Difference]: Without dead ends: 28738 [2021-11-17 12:30:42,417 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:30:42,417 INFO L933 BasicCegarLoop]: 4573 mSDtfsCounter, 8391 mSDsluCounter, 4146 mSDsCounter, 0 mSdLazyCounter, 4128 mSolverCounterSat, 3878 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8730 SdHoareTripleChecker+Valid, 8719 SdHoareTripleChecker+Invalid, 8011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3878 IncrementalHoareTripleChecker+Valid, 4128 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.1s IncrementalHoareTripleChecker+Time [2021-11-17 12:30:42,418 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8730 Valid, 8719 Invalid, 8011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3878 Valid, 4128 Invalid, 5 Unknown, 0 Unchecked, 20.1s Time] [2021-11-17 12:30:42,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28738 states. [2021-11-17 12:30:43,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28738 to 28738. [2021-11-17 12:30:43,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28738 states, 20368 states have (on average 1.3133346425765908) internal successors, (26750), 21029 states have internal predecessors, (26750), 6974 states have call successors, (6974), 1355 states have call predecessors, (6974), 1374 states have return successors, (7104), 6682 states have call predecessors, (7104), 6972 states have call successors, (7104) [2021-11-17 12:30:43,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28738 states to 28738 states and 40828 transitions. [2021-11-17 12:30:43,713 INFO L78 Accepts]: Start accepts. Automaton has 28738 states and 40828 transitions. Word has length 135 [2021-11-17 12:30:43,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:30:43,714 INFO L470 AbstractCegarLoop]: Abstraction has 28738 states and 40828 transitions. [2021-11-17 12:30:43,714 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2021-11-17 12:30:43,714 INFO L276 IsEmpty]: Start isEmpty. Operand 28738 states and 40828 transitions. [2021-11-17 12:30:43,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-11-17 12:30:43,716 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:30:43,717 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-11-17 12:30:43,717 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-17 12:30:43,717 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 32 more)] === [2021-11-17 12:30:43,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:30:43,717 INFO L85 PathProgramCache]: Analyzing trace with hash -3169796, now seen corresponding path program 1 times [2021-11-17 12:30:43,718 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:30:43,718 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456209493] [2021-11-17 12:30:43,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:30:43,718 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:30:43,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:43,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:30:43,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:43,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-17 12:30:43,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:43,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-17 12:30:43,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:43,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-11-17 12:30:44,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:44,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:30:44,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:44,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:30:44,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:44,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:30:44,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:44,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-11-17 12:30:44,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:44,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:30:44,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:44,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:30:44,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:44,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:30:44,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:44,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-11-17 12:30:44,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:44,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:30:44,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:44,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:30:44,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:44,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:30:44,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:44,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-17 12:30:44,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:44,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-11-17 12:30:44,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:44,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-17 12:30:44,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:44,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-11-17 12:30:44,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:44,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-11-17 12:30:44,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:44,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2021-11-17 12:30:44,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:44,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2021-11-17 12:30:44,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:44,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2021-11-17 12:30:44,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:44,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2021-11-17 12:30:44,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:44,141 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2021-11-17 12:30:44,141 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:30:44,141 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456209493] [2021-11-17 12:30:44,141 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456209493] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:30:44,141 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:30:44,142 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:30:44,142 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462170489] [2021-11-17 12:30:44,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:30:44,143 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:30:44,143 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:30:44,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:30:44,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:30:44,144 INFO L87 Difference]: Start difference. First operand 28738 states and 40828 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2021-11-17 12:30:46,234 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:30:48,296 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:30:50,364 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:30:54,249 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:30:56,281 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:31:00,756 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:31:04,240 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:31:08,233 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:31:12,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:31:12,288 INFO L93 Difference]: Finished difference Result 58076 states and 82702 transitions. [2021-11-17 12:31:12,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:31:12,289 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 160 [2021-11-17 12:31:12,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:31:12,373 INFO L225 Difference]: With dead ends: 58076 [2021-11-17 12:31:12,373 INFO L226 Difference]: Without dead ends: 29346 [2021-11-17 12:31:12,433 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:31:12,433 INFO L933 BasicCegarLoop]: 4546 mSDtfsCounter, 9245 mSDsluCounter, 2878 mSDsCounter, 0 mSdLazyCounter, 3799 mSolverCounterSat, 5095 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9618 SdHoareTripleChecker+Valid, 7424 SdHoareTripleChecker+Invalid, 8902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5095 IncrementalHoareTripleChecker+Valid, 3799 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.7s IncrementalHoareTripleChecker+Time [2021-11-17 12:31:12,434 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9618 Valid, 7424 Invalid, 8902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5095 Valid, 3799 Invalid, 8 Unknown, 0 Unchecked, 26.7s Time] [2021-11-17 12:31:12,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29346 states. [2021-11-17 12:31:13,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29346 to 28738. [2021-11-17 12:31:13,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28738 states, 20368 states have (on average 1.3132855459544384) internal successors, (26749), 21029 states have internal predecessors, (26749), 6974 states have call successors, (6974), 1355 states have call predecessors, (6974), 1374 states have return successors, (7104), 6682 states have call predecessors, (7104), 6972 states have call successors, (7104) [2021-11-17 12:31:13,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28738 states to 28738 states and 40827 transitions. [2021-11-17 12:31:13,875 INFO L78 Accepts]: Start accepts. Automaton has 28738 states and 40827 transitions. Word has length 160 [2021-11-17 12:31:13,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:31:13,876 INFO L470 AbstractCegarLoop]: Abstraction has 28738 states and 40827 transitions. [2021-11-17 12:31:13,876 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2021-11-17 12:31:13,876 INFO L276 IsEmpty]: Start isEmpty. Operand 28738 states and 40827 transitions. [2021-11-17 12:31:13,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-11-17 12:31:13,877 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:31:13,878 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-11-17 12:31:13,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-17 12:31:13,878 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 32 more)] === [2021-11-17 12:31:13,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:31:13,878 INFO L85 PathProgramCache]: Analyzing trace with hash 382692606, now seen corresponding path program 1 times [2021-11-17 12:31:13,878 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:31:13,878 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538893630] [2021-11-17 12:31:13,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:31:13,878 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:31:14,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:14,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:31:14,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:14,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-17 12:31:14,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:14,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-17 12:31:14,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:14,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-11-17 12:31:14,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:14,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:31:14,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:14,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:31:14,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:14,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:31:14,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:14,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-11-17 12:31:14,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:14,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:31:14,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:14,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:31:14,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:14,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:31:14,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:14,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-11-17 12:31:14,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:14,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:31:14,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:14,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:31:14,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:14,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:31:14,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:14,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-17 12:31:14,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:14,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-11-17 12:31:14,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:14,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-17 12:31:14,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:14,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-11-17 12:31:14,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:14,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-11-17 12:31:14,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:14,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2021-11-17 12:31:14,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:14,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2021-11-17 12:31:14,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:14,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2021-11-17 12:31:14,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:14,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2021-11-17 12:31:14,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:14,290 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2021-11-17 12:31:14,290 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:31:14,290 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538893630] [2021-11-17 12:31:14,291 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538893630] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:31:14,291 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:31:14,291 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:31:14,291 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949753729] [2021-11-17 12:31:14,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:31:14,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:31:14,293 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:31:14,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:31:14,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:31:14,294 INFO L87 Difference]: Start difference. First operand 28738 states and 40827 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2021-11-17 12:31:16,388 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:31:18,436 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:31:20,500 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:31:25,665 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:31:29,903 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:31:34,257 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:31:38,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:31:38,552 INFO L93 Difference]: Finished difference Result 58075 states and 82699 transitions. [2021-11-17 12:31:38,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:31:38,553 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 160 [2021-11-17 12:31:38,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:31:38,666 INFO L225 Difference]: With dead ends: 58075 [2021-11-17 12:31:38,666 INFO L226 Difference]: Without dead ends: 29346 [2021-11-17 12:31:38,739 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:31:38,739 INFO L933 BasicCegarLoop]: 4545 mSDtfsCounter, 9243 mSDsluCounter, 2877 mSDsCounter, 0 mSdLazyCounter, 3791 mSolverCounterSat, 5101 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9617 SdHoareTripleChecker+Valid, 7422 SdHoareTripleChecker+Invalid, 8898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5101 IncrementalHoareTripleChecker+Valid, 3791 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.7s IncrementalHoareTripleChecker+Time [2021-11-17 12:31:38,739 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9617 Valid, 7422 Invalid, 8898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5101 Valid, 3791 Invalid, 6 Unknown, 0 Unchecked, 22.7s Time] [2021-11-17 12:31:38,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29346 states. [2021-11-17 12:31:40,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29346 to 28738. [2021-11-17 12:31:40,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28738 states, 20368 states have (on average 1.313236449332286) internal successors, (26748), 21029 states have internal predecessors, (26748), 6974 states have call successors, (6974), 1355 states have call predecessors, (6974), 1374 states have return successors, (7104), 6682 states have call predecessors, (7104), 6972 states have call successors, (7104) [2021-11-17 12:31:40,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28738 states to 28738 states and 40826 transitions. [2021-11-17 12:31:40,203 INFO L78 Accepts]: Start accepts. Automaton has 28738 states and 40826 transitions. Word has length 160 [2021-11-17 12:31:40,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:31:40,203 INFO L470 AbstractCegarLoop]: Abstraction has 28738 states and 40826 transitions. [2021-11-17 12:31:40,204 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2021-11-17 12:31:40,204 INFO L276 IsEmpty]: Start isEmpty. Operand 28738 states and 40826 transitions. [2021-11-17 12:31:40,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-11-17 12:31:40,206 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:31:40,206 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-11-17 12:31:40,206 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-17 12:31:40,206 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 32 more)] === [2021-11-17 12:31:40,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:31:40,207 INFO L85 PathProgramCache]: Analyzing trace with hash 118045116, now seen corresponding path program 1 times [2021-11-17 12:31:40,207 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:31:40,207 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28561709] [2021-11-17 12:31:40,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:31:40,207 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:31:40,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:40,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:31:40,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:40,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-17 12:31:40,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:40,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-17 12:31:40,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:40,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-11-17 12:31:40,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:40,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:31:40,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:40,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:31:40,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:40,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:31:40,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:40,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-11-17 12:31:40,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:40,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:31:40,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:40,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:31:40,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:40,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:31:40,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:40,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-11-17 12:31:40,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:40,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:31:40,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:40,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:31:40,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:40,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:31:40,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:40,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-17 12:31:40,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:40,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-11-17 12:31:40,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:40,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-17 12:31:40,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:40,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-11-17 12:31:40,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:40,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-11-17 12:31:40,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:40,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2021-11-17 12:31:40,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:40,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2021-11-17 12:31:40,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:40,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2021-11-17 12:31:40,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:40,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2021-11-17 12:31:40,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:40,560 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2021-11-17 12:31:40,560 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:31:40,560 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28561709] [2021-11-17 12:31:40,560 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28561709] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:31:40,560 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:31:40,561 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:31:40,561 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709363992] [2021-11-17 12:31:40,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:31:40,561 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:31:40,561 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:31:40,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:31:40,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:31:40,562 INFO L87 Difference]: Start difference. First operand 28738 states and 40826 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2021-11-17 12:31:42,635 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:31:44,707 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:31:46,771 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:31:49,400 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:31:50,949 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:31:55,795 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:31:59,603 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:32:03,931 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:32:08,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:32:08,317 INFO L93 Difference]: Finished difference Result 58073 states and 82694 transitions. [2021-11-17 12:32:08,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:32:08,317 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 160 [2021-11-17 12:32:08,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:32:08,395 INFO L225 Difference]: With dead ends: 58073 [2021-11-17 12:32:08,395 INFO L226 Difference]: Without dead ends: 29346 [2021-11-17 12:32:08,449 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:32:08,450 INFO L933 BasicCegarLoop]: 4547 mSDtfsCounter, 9240 mSDsluCounter, 2874 mSDsCounter, 0 mSdLazyCounter, 3798 mSolverCounterSat, 5104 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9611 SdHoareTripleChecker+Valid, 7421 SdHoareTripleChecker+Invalid, 8908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5104 IncrementalHoareTripleChecker+Valid, 3798 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.2s IncrementalHoareTripleChecker+Time [2021-11-17 12:32:08,450 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9611 Valid, 7421 Invalid, 8908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5104 Valid, 3798 Invalid, 6 Unknown, 0 Unchecked, 26.2s Time] [2021-11-17 12:32:08,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29346 states. [2021-11-17 12:32:09,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29346 to 28738. [2021-11-17 12:32:09,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28738 states, 20368 states have (on average 1.3131873527101336) internal successors, (26747), 21029 states have internal predecessors, (26747), 6974 states have call successors, (6974), 1355 states have call predecessors, (6974), 1374 states have return successors, (7104), 6682 states have call predecessors, (7104), 6972 states have call successors, (7104) [2021-11-17 12:32:09,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28738 states to 28738 states and 40825 transitions. [2021-11-17 12:32:09,940 INFO L78 Accepts]: Start accepts. Automaton has 28738 states and 40825 transitions. Word has length 160 [2021-11-17 12:32:09,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:32:09,941 INFO L470 AbstractCegarLoop]: Abstraction has 28738 states and 40825 transitions. [2021-11-17 12:32:09,941 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2021-11-17 12:32:09,941 INFO L276 IsEmpty]: Start isEmpty. Operand 28738 states and 40825 transitions. [2021-11-17 12:32:09,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-11-17 12:32:09,943 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:32:09,943 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-11-17 12:32:09,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-17 12:32:09,943 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 32 more)] === [2021-11-17 12:32:09,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:32:09,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1205133830, now seen corresponding path program 1 times [2021-11-17 12:32:09,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:32:09,944 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795649270] [2021-11-17 12:32:09,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:32:09,944 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:32:10,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:10,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:32:10,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:10,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-17 12:32:10,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:10,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-17 12:32:10,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:10,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-11-17 12:32:10,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:10,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:32:10,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:10,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:32:10,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:10,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:32:10,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:10,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-11-17 12:32:10,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:10,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:32:10,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:10,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:32:10,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:10,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:32:10,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:10,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-11-17 12:32:10,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:10,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:32:10,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:10,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:32:10,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:10,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:32:10,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:10,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-17 12:32:10,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:10,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-11-17 12:32:10,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:10,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-17 12:32:10,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:10,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-11-17 12:32:10,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:10,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-11-17 12:32:10,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:10,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2021-11-17 12:32:10,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:10,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2021-11-17 12:32:10,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:10,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2021-11-17 12:32:10,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:10,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2021-11-17 12:32:10,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:10,348 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2021-11-17 12:32:10,348 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:32:10,348 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795649270] [2021-11-17 12:32:10,348 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795649270] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:32:10,349 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:32:10,349 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:32:10,349 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134333746] [2021-11-17 12:32:10,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:32:10,350 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:32:10,350 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:32:10,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:32:10,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:32:10,351 INFO L87 Difference]: Start difference. First operand 28738 states and 40825 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2021-11-17 12:32:12,443 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:32:14,502 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:32:16,568 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:32:19,494 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:32:24,780 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:32:27,979 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:32:32,263 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:32:36,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:32:36,651 INFO L93 Difference]: Finished difference Result 58071 states and 82690 transitions. [2021-11-17 12:32:36,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:32:36,652 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 160 [2021-11-17 12:32:36,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:32:36,745 INFO L225 Difference]: With dead ends: 58071 [2021-11-17 12:32:36,745 INFO L226 Difference]: Without dead ends: 29346 [2021-11-17 12:32:36,815 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:32:36,815 INFO L933 BasicCegarLoop]: 4543 mSDtfsCounter, 9237 mSDsluCounter, 2868 mSDsCounter, 0 mSdLazyCounter, 3794 mSolverCounterSat, 5101 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9611 SdHoareTripleChecker+Valid, 7411 SdHoareTripleChecker+Invalid, 8901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5101 IncrementalHoareTripleChecker+Valid, 3794 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.5s IncrementalHoareTripleChecker+Time [2021-11-17 12:32:36,816 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9611 Valid, 7411 Invalid, 8901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5101 Valid, 3794 Invalid, 6 Unknown, 0 Unchecked, 24.5s Time] [2021-11-17 12:32:36,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29346 states. [2021-11-17 12:32:38,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29346 to 28738. [2021-11-17 12:32:38,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28738 states, 20368 states have (on average 1.3131382560879812) internal successors, (26746), 21029 states have internal predecessors, (26746), 6974 states have call successors, (6974), 1355 states have call predecessors, (6974), 1374 states have return successors, (7104), 6682 states have call predecessors, (7104), 6972 states have call successors, (7104) [2021-11-17 12:32:38,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28738 states to 28738 states and 40824 transitions. [2021-11-17 12:32:38,411 INFO L78 Accepts]: Start accepts. Automaton has 28738 states and 40824 transitions. Word has length 160 [2021-11-17 12:32:38,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:32:38,411 INFO L470 AbstractCegarLoop]: Abstraction has 28738 states and 40824 transitions. [2021-11-17 12:32:38,411 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2021-11-17 12:32:38,412 INFO L276 IsEmpty]: Start isEmpty. Operand 28738 states and 40824 transitions. [2021-11-17 12:32:38,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-11-17 12:32:38,413 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:32:38,413 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-11-17 12:32:38,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-17 12:32:38,414 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 32 more)] === [2021-11-17 12:32:38,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:32:38,414 INFO L85 PathProgramCache]: Analyzing trace with hash -866846280, now seen corresponding path program 1 times [2021-11-17 12:32:38,414 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:32:38,414 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424785385] [2021-11-17 12:32:38,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:32:38,414 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:32:38,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:38,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:32:38,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:38,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-17 12:32:38,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:38,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-17 12:32:38,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:38,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-11-17 12:32:38,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:38,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:32:38,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:38,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:32:38,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:38,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:32:38,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:38,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-11-17 12:32:38,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:38,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:32:38,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:38,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:32:38,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:38,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:32:38,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:38,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-11-17 12:32:38,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:38,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:32:38,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:38,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:32:38,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:38,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:32:38,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:38,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-17 12:32:38,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:38,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-11-17 12:32:38,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:38,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-17 12:32:38,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:38,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-11-17 12:32:38,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:38,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-11-17 12:32:38,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:38,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2021-11-17 12:32:38,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:38,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2021-11-17 12:32:38,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:38,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2021-11-17 12:32:38,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:38,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2021-11-17 12:32:38,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:38,919 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2021-11-17 12:32:38,919 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:32:38,919 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424785385] [2021-11-17 12:32:38,919 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424785385] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:32:38,920 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:32:38,920 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:32:38,920 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308040360] [2021-11-17 12:32:38,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:32:38,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:32:38,921 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:32:38,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:32:38,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:32:38,921 INFO L87 Difference]: Start difference. First operand 28738 states and 40824 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2021-11-17 12:32:41,015 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:32:43,064 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:32:45,128 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:32:54,570 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:32:57,871 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:33:02,673 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:33:04,269 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:33:11,266 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:33:14,550 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:33:19,158 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:33:23,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:33:23,064 INFO L93 Difference]: Finished difference Result 71451 states and 101624 transitions. [2021-11-17 12:33:23,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-17 12:33:23,066 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 160 [2021-11-17 12:33:23,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:33:23,211 INFO L225 Difference]: With dead ends: 71451 [2021-11-17 12:33:23,211 INFO L226 Difference]: Without dead ends: 42743 [2021-11-17 12:33:23,291 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-11-17 12:33:23,291 INFO L933 BasicCegarLoop]: 5690 mSDtfsCounter, 12626 mSDsluCounter, 5237 mSDsCounter, 0 mSdLazyCounter, 8894 mSolverCounterSat, 8102 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12902 SdHoareTripleChecker+Valid, 10927 SdHoareTripleChecker+Invalid, 17005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 8102 IncrementalHoareTripleChecker+Valid, 8894 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 41.7s IncrementalHoareTripleChecker+Time [2021-11-17 12:33:23,292 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12902 Valid, 10927 Invalid, 17005 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [8102 Valid, 8894 Invalid, 9 Unknown, 0 Unchecked, 41.7s Time] [2021-11-17 12:33:23,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42743 states. [2021-11-17 12:33:25,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42743 to 41620. [2021-11-17 12:33:25,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41620 states, 29460 states have (on average 1.3133740665308893) internal successors, (38692), 30427 states have internal predecessors, (38692), 10120 states have call successors, (10120), 1989 states have call predecessors, (10120), 2018 states have return successors, (10280), 9684 states have call predecessors, (10280), 10118 states have call successors, (10280) [2021-11-17 12:33:25,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41620 states to 41620 states and 59092 transitions. [2021-11-17 12:33:25,563 INFO L78 Accepts]: Start accepts. Automaton has 41620 states and 59092 transitions. Word has length 160 [2021-11-17 12:33:25,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:33:25,563 INFO L470 AbstractCegarLoop]: Abstraction has 41620 states and 59092 transitions. [2021-11-17 12:33:25,564 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2021-11-17 12:33:25,564 INFO L276 IsEmpty]: Start isEmpty. Operand 41620 states and 59092 transitions. [2021-11-17 12:33:25,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-11-17 12:33:25,566 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:33:25,566 INFO L514 BasicCegarLoop]: 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] [2021-11-17 12:33:25,566 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-17 12:33:25,566 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 32 more)] === [2021-11-17 12:33:25,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:33:25,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1755760970, now seen corresponding path program 1 times [2021-11-17 12:33:25,567 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:33:25,567 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730572642] [2021-11-17 12:33:25,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:33:25,567 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:33:25,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:25,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:33:25,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:25,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-17 12:33:25,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:25,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-17 12:33:25,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:25,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-17 12:33:25,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:25,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-17 12:33:25,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:25,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-17 12:33:25,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:25,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:33:25,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:25,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-11-17 12:33:25,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:25,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-11-17 12:33:25,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:25,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-11-17 12:33:25,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:25,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-11-17 12:33:25,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:25,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-11-17 12:33:25,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:25,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-11-17 12:33:25,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:25,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-11-17 12:33:25,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:25,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-11-17 12:33:25,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:25,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-17 12:33:25,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:25,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-11-17 12:33:25,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:25,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-11-17 12:33:25,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:25,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2021-11-17 12:33:25,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:25,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2021-11-17 12:33:25,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:25,930 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-17 12:33:25,930 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:33:25,930 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730572642] [2021-11-17 12:33:25,930 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730572642] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:33:25,931 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:33:25,931 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:33:25,932 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061890063] [2021-11-17 12:33:25,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:33:25,933 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:33:25,933 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:33:25,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:33:25,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:33:25,934 INFO L87 Difference]: Start difference. First operand 41620 states and 59092 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2021-11-17 12:33:28,024 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:33:30,088 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:33:36,867 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:33:39,979 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:33:44,101 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:33:48,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:33:48,487 INFO L93 Difference]: Finished difference Result 41620 states and 59092 transitions. [2021-11-17 12:33:48,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:33:48,488 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 4 states have internal predecessors, (89), 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 141 [2021-11-17 12:33:48,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:33:48,632 INFO L225 Difference]: With dead ends: 41620 [2021-11-17 12:33:48,632 INFO L226 Difference]: Without dead ends: 41618 [2021-11-17 12:33:48,658 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:33:48,659 INFO L933 BasicCegarLoop]: 4567 mSDtfsCounter, 8381 mSDsluCounter, 4134 mSDsCounter, 0 mSdLazyCounter, 4126 mSolverCounterSat, 3878 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8719 SdHoareTripleChecker+Valid, 8701 SdHoareTripleChecker+Invalid, 8009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3878 IncrementalHoareTripleChecker+Valid, 4126 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.7s IncrementalHoareTripleChecker+Time [2021-11-17 12:33:48,659 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8719 Valid, 8701 Invalid, 8009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3878 Valid, 4126 Invalid, 5 Unknown, 0 Unchecked, 20.7s Time] [2021-11-17 12:33:48,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41618 states. [2021-11-17 12:33:50,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41618 to 41618. [2021-11-17 12:33:50,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41618 states, 29459 states have (on average 1.3133507586815574) internal successors, (38690), 30425 states have internal predecessors, (38690), 10120 states have call successors, (10120), 1989 states have call predecessors, (10120), 2018 states have return successors, (10280), 9684 states have call predecessors, (10280), 10118 states have call successors, (10280) [2021-11-17 12:33:51,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41618 states to 41618 states and 59090 transitions. [2021-11-17 12:33:51,032 INFO L78 Accepts]: Start accepts. Automaton has 41618 states and 59090 transitions. Word has length 141 [2021-11-17 12:33:51,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:33:51,032 INFO L470 AbstractCegarLoop]: Abstraction has 41618 states and 59090 transitions. [2021-11-17 12:33:51,032 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2021-11-17 12:33:51,032 INFO L276 IsEmpty]: Start isEmpty. Operand 41618 states and 59090 transitions. [2021-11-17 12:33:51,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-11-17 12:33:51,034 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:33:51,034 INFO L514 BasicCegarLoop]: 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] [2021-11-17 12:33:51,034 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-17 12:33:51,034 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_linux_kernel_rcu_srcu_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 32 more)] === [2021-11-17 12:33:51,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:33:51,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1036032108, now seen corresponding path program 1 times [2021-11-17 12:33:51,034 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:33:51,035 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40851549] [2021-11-17 12:33:51,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:33:51,035 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:33:51,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:51,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:33:51,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:51,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-17 12:33:51,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:51,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-17 12:33:51,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:51,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-17 12:33:51,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:51,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-17 12:33:51,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:51,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-17 12:33:51,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:51,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:33:51,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:51,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-11-17 12:33:51,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:51,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-11-17 12:33:51,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:51,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-11-17 12:33:51,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:51,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-11-17 12:33:51,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:51,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-11-17 12:33:51,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:51,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-11-17 12:33:51,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:51,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-11-17 12:33:51,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:51,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-11-17 12:33:51,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:51,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-17 12:33:51,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:51,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-11-17 12:33:51,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:51,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-11-17 12:33:51,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:51,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2021-11-17 12:33:51,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:51,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2021-11-17 12:33:51,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:51,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-11-17 12:33:51,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:51,352 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-17 12:33:51,352 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:33:51,352 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40851549] [2021-11-17 12:33:51,352 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40851549] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:33:51,352 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:33:51,352 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:33:51,352 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869988586] [2021-11-17 12:33:51,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:33:51,353 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:33:51,353 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:33:51,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:33:51,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:33:51,354 INFO L87 Difference]: Start difference. First operand 41618 states and 59090 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2021-11-17 12:33:53,426 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:33:55,496 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:34:02,121 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:34:05,142 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:34:09,457 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:34:13,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:34:13,427 INFO L93 Difference]: Finished difference Result 41618 states and 59090 transitions. [2021-11-17 12:34:13,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:34:13,428 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 4 states have internal predecessors, (93), 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 147 [2021-11-17 12:34:13,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:34:13,563 INFO L225 Difference]: With dead ends: 41618 [2021-11-17 12:34:13,564 INFO L226 Difference]: Without dead ends: 41616 [2021-11-17 12:34:13,587 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:34:13,587 INFO L933 BasicCegarLoop]: 4565 mSDtfsCounter, 8375 mSDsluCounter, 4134 mSDsCounter, 0 mSdLazyCounter, 4124 mSolverCounterSat, 3878 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8712 SdHoareTripleChecker+Valid, 8699 SdHoareTripleChecker+Invalid, 8007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3878 IncrementalHoareTripleChecker+Valid, 4124 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.3s IncrementalHoareTripleChecker+Time [2021-11-17 12:34:13,588 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8712 Valid, 8699 Invalid, 8007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3878 Valid, 4124 Invalid, 5 Unknown, 0 Unchecked, 20.3s Time] [2021-11-17 12:34:13,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41616 states. [2021-11-17 12:34:15,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41616 to 41616. [2021-11-17 12:34:15,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41616 states, 29458 states have (on average 1.3133274492497793) internal successors, (38688), 30423 states have internal predecessors, (38688), 10120 states have call successors, (10120), 1989 states have call predecessors, (10120), 2018 states have return successors, (10280), 9684 states have call predecessors, (10280), 10118 states have call successors, (10280) [2021-11-17 12:34:15,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41616 states to 41616 states and 59088 transitions. [2021-11-17 12:34:15,867 INFO L78 Accepts]: Start accepts. Automaton has 41616 states and 59088 transitions. Word has length 147 [2021-11-17 12:34:15,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:34:15,867 INFO L470 AbstractCegarLoop]: Abstraction has 41616 states and 59088 transitions. [2021-11-17 12:34:15,867 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2021-11-17 12:34:15,868 INFO L276 IsEmpty]: Start isEmpty. Operand 41616 states and 59088 transitions. [2021-11-17 12:34:16,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-11-17 12:34:16,006 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:34:16,006 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-11-17 12:34:16,006 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-17 12:34:16,007 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 32 more)] === [2021-11-17 12:34:16,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:34:16,007 INFO L85 PathProgramCache]: Analyzing trace with hash 118915850, now seen corresponding path program 1 times [2021-11-17 12:34:16,007 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:34:16,007 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866907994] [2021-11-17 12:34:16,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:34:16,007 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:34:16,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:16,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:34:16,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:16,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-17 12:34:16,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:16,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-17 12:34:16,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:16,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-11-17 12:34:16,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:16,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:34:16,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:16,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:34:16,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:16,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:34:16,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:16,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-11-17 12:34:16,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:16,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:34:16,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:16,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:34:16,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:16,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:34:16,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:16,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-11-17 12:34:16,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:16,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:34:16,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:16,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:34:16,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:16,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:34:16,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:16,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-17 12:34:16,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:16,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-11-17 12:34:16,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:16,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-17 12:34:16,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:16,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-11-17 12:34:16,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:16,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-11-17 12:34:16,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:16,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2021-11-17 12:34:16,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:16,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2021-11-17 12:34:16,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:16,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2021-11-17 12:34:16,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:16,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2021-11-17 12:34:16,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:16,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2021-11-17 12:34:16,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:16,449 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2021-11-17 12:34:16,449 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:34:16,449 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866907994] [2021-11-17 12:34:16,450 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866907994] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:34:16,450 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:34:16,450 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-17 12:34:16,450 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691531985] [2021-11-17 12:34:16,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:34:16,451 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-17 12:34:16,451 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:34:16,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-17 12:34:16,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-17 12:34:16,452 INFO L87 Difference]: Start difference. First operand 41616 states and 59088 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (21), 5 states have call predecessors, (21), 2 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2021-11-17 12:34:18,524 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:34:20,588 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:34:22,659 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:34:24,728 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:34:38,369 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:34:40,391 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:34:42,441 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:34:44,486 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:34:48,714 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:34:50,762 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:34:52,820 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:34:54,877 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:35:02,544 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:35:04,585 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:35:06,626 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:35:08,663 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:35:17,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:35:17,859 INFO L93 Difference]: Finished difference Result 84098 states and 119933 transitions. [2021-11-17 12:35:17,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-17 12:35:17,860 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (21), 5 states have call predecessors, (21), 2 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) Word has length 169 [2021-11-17 12:35:17,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:35:18,050 INFO L225 Difference]: With dead ends: 84098 [2021-11-17 12:35:18,050 INFO L226 Difference]: Without dead ends: 42512 [2021-11-17 12:35:18,184 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2021-11-17 12:35:18,184 INFO L933 BasicCegarLoop]: 4536 mSDtfsCounter, 9186 mSDsluCounter, 8255 mSDsCounter, 0 mSdLazyCounter, 13699 mSolverCounterSat, 5107 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 53.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9544 SdHoareTripleChecker+Valid, 12791 SdHoareTripleChecker+Invalid, 18822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 5107 IncrementalHoareTripleChecker+Valid, 13699 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 58.5s IncrementalHoareTripleChecker+Time [2021-11-17 12:35:18,185 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9544 Valid, 12791 Invalid, 18822 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [5107 Valid, 13699 Invalid, 16 Unknown, 0 Unchecked, 58.5s Time] [2021-11-17 12:35:18,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42512 states. [2021-11-17 12:35:20,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42512 to 41616. [2021-11-17 12:35:20,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41616 states, 29458 states have (on average 1.3125127299884582) internal successors, (38664), 30423 states have internal predecessors, (38664), 10120 states have call successors, (10120), 1989 states have call predecessors, (10120), 2018 states have return successors, (10280), 9684 states have call predecessors, (10280), 10118 states have call successors, (10280) [2021-11-17 12:35:20,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41616 states to 41616 states and 59064 transitions. [2021-11-17 12:35:20,545 INFO L78 Accepts]: Start accepts. Automaton has 41616 states and 59064 transitions. Word has length 169 [2021-11-17 12:35:20,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:35:20,546 INFO L470 AbstractCegarLoop]: Abstraction has 41616 states and 59064 transitions. [2021-11-17 12:35:20,546 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (21), 5 states have call predecessors, (21), 2 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2021-11-17 12:35:20,547 INFO L276 IsEmpty]: Start isEmpty. Operand 41616 states and 59064 transitions. [2021-11-17 12:35:20,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-11-17 12:35:20,549 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:35:20,549 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-11-17 12:35:20,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-17 12:35:20,549 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 32 more)] === [2021-11-17 12:35:20,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:35:20,550 INFO L85 PathProgramCache]: Analyzing trace with hash 118975432, now seen corresponding path program 1 times [2021-11-17 12:35:20,550 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:35:20,550 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935965667] [2021-11-17 12:35:20,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:35:20,551 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:35:20,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:35:20,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:35:20,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:35:20,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-17 12:35:20,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:35:20,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-17 12:35:20,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:35:20,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-11-17 12:35:20,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:35:20,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:35:20,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:35:20,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:35:20,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:35:20,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:35:20,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:35:20,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-11-17 12:35:20,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:35:20,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:35:20,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:35:20,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:35:20,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:35:20,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:35:20,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:35:20,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-11-17 12:35:20,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:35:20,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:35:20,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:35:20,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:35:20,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:35:20,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:35:20,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:35:20,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-17 12:35:20,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:35:21,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-11-17 12:35:21,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:35:21,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-17 12:35:21,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:35:21,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-11-17 12:35:21,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:35:21,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-11-17 12:35:21,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:35:21,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2021-11-17 12:35:21,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:35:21,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2021-11-17 12:35:21,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:35:21,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2021-11-17 12:35:21,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:35:21,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2021-11-17 12:35:21,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:35:21,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2021-11-17 12:35:21,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:35:21,050 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2021-11-17 12:35:21,050 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:35:21,050 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935965667] [2021-11-17 12:35:21,050 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935965667] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:35:21,050 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:35:21,050 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-17 12:35:21,051 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356351288] [2021-11-17 12:35:21,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:35:21,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-17 12:35:21,052 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:35:21,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-17 12:35:21,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-17 12:35:21,053 INFO L87 Difference]: Start difference. First operand 41616 states and 59064 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Killed by 15