./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.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---net--netfilter--nf_tables.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 a13fc36e99ff93768df6870e14394ac7910ba35cb39dc0d4df8c772787857673 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-17 13:32:52,845 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-17 13:32:52,867 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-17 13:32:52,898 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-17 13:32:52,898 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-17 13:32:52,900 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-17 13:32:52,902 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-17 13:32:52,906 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-17 13:32:52,907 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-17 13:32:52,910 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-17 13:32:52,911 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-17 13:32:52,912 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-17 13:32:52,912 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-17 13:32:52,914 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-17 13:32:52,915 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-17 13:32:52,918 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-17 13:32:52,919 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-17 13:32:52,920 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-17 13:32:52,923 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-17 13:32:52,927 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-17 13:32:52,928 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-17 13:32:52,929 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-17 13:32:52,930 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-17 13:32:52,930 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-17 13:32:52,935 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-17 13:32:52,935 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-17 13:32:52,935 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-17 13:32:52,936 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-17 13:32:52,937 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-17 13:32:52,937 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-17 13:32:52,938 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-17 13:32:52,938 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-17 13:32:52,940 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-17 13:32:52,940 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-17 13:32:52,941 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-17 13:32:52,941 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-17 13:32:52,942 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-17 13:32:52,942 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-17 13:32:52,943 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-17 13:32:52,943 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-17 13:32:52,944 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-17 13:32:52,944 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-17 13:32:52,974 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-17 13:32:52,977 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-17 13:32:52,977 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-17 13:32:52,978 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-17 13:32:52,978 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-17 13:32:52,979 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-17 13:32:52,979 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-17 13:32:52,979 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-17 13:32:52,979 INFO L138 SettingsManager]: * Use SBE=true [2021-11-17 13:32:52,979 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-17 13:32:52,980 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-17 13:32:52,980 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-17 13:32:52,980 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-17 13:32:52,981 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-17 13:32:52,981 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-17 13:32:52,981 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-17 13:32:52,981 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-17 13:32:52,981 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-17 13:32:52,981 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-17 13:32:52,981 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-17 13:32:52,982 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-17 13:32:52,982 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-17 13:32:52,982 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-17 13:32:52,982 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-17 13:32:52,982 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-17 13:32:52,982 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-17 13:32:52,983 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-17 13:32:52,983 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-17 13:32:52,983 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-17 13:32:52,983 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-17 13:32:52,983 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-17 13:32:52,983 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 -> a13fc36e99ff93768df6870e14394ac7910ba35cb39dc0d4df8c772787857673 [2021-11-17 13:32:53,150 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-17 13:32:53,170 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-17 13:32:53,172 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-17 13:32:53,173 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-17 13:32:53,176 INFO L275 PluginConnector]: CDTParser initialized [2021-11-17 13:32:53,176 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---net--netfilter--nf_tables.ko.cil.i [2021-11-17 13:32:53,221 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/374a6111c/cebffb4599964e18b815502cb2e0fa49/FLAGc9189fcde [2021-11-17 13:32:53,989 INFO L306 CDTParser]: Found 1 translation units. [2021-11-17 13:32:53,990 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i [2021-11-17 13:32:54,045 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/374a6111c/cebffb4599964e18b815502cb2e0fa49/FLAGc9189fcde [2021-11-17 13:32:54,253 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/374a6111c/cebffb4599964e18b815502cb2e0fa49 [2021-11-17 13:32:54,254 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-17 13:32:54,256 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-17 13:32:54,257 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-17 13:32:54,257 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-17 13:32:54,259 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-17 13:32:54,260 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 01:32:54" (1/1) ... [2021-11-17 13:32:54,261 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20c60457 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:32:54, skipping insertion in model container [2021-11-17 13:32:54,261 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 01:32:54" (1/1) ... [2021-11-17 13:32:54,265 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-17 13:32:54,427 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-17 13:33:01,059 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[874998,875011] [2021-11-17 13:33:01,062 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[875143,875156] [2021-11-17 13:33:01,062 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[875289,875302] [2021-11-17 13:33:01,063 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[875454,875467] [2021-11-17 13:33:01,063 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[875612,875625] [2021-11-17 13:33:01,063 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[875770,875783] [2021-11-17 13:33:01,064 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[875928,875941] [2021-11-17 13:33:01,064 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[876088,876101] [2021-11-17 13:33:01,064 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[876247,876260] [2021-11-17 13:33:01,065 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[876386,876399] [2021-11-17 13:33:01,065 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[876528,876541] [2021-11-17 13:33:01,065 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[876677,876690] [2021-11-17 13:33:01,065 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[876816,876829] [2021-11-17 13:33:01,066 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[876971,876984] [2021-11-17 13:33:01,066 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[877131,877144] [2021-11-17 13:33:01,066 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[877282,877295] [2021-11-17 13:33:01,067 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[877433,877446] [2021-11-17 13:33:01,067 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[877585,877598] [2021-11-17 13:33:01,067 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[877734,877747] [2021-11-17 13:33:01,068 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[877882,877895] [2021-11-17 13:33:01,068 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[878039,878052] [2021-11-17 13:33:01,068 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[878188,878201] [2021-11-17 13:33:01,068 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[878344,878357] [2021-11-17 13:33:01,069 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[878497,878510] [2021-11-17 13:33:01,069 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[878643,878656] [2021-11-17 13:33:01,069 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[878786,878799] [2021-11-17 13:33:01,070 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[878938,878951] [2021-11-17 13:33:01,070 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[879084,879097] [2021-11-17 13:33:01,070 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[879229,879242] [2021-11-17 13:33:01,070 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[879383,879396] [2021-11-17 13:33:01,071 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[879534,879547] [2021-11-17 13:33:01,071 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[879689,879702] [2021-11-17 13:33:01,071 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[879841,879854] [2021-11-17 13:33:01,072 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[879996,880009] [2021-11-17 13:33:01,072 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[880160,880173] [2021-11-17 13:33:01,072 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[880316,880329] [2021-11-17 13:33:01,073 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[880480,880493] [2021-11-17 13:33:01,073 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[880622,880635] [2021-11-17 13:33:01,073 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[880780,880793] [2021-11-17 13:33:01,073 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[880947,880960] [2021-11-17 13:33:01,074 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[881106,881119] [2021-11-17 13:33:01,074 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[881265,881278] [2021-11-17 13:33:01,074 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[881414,881427] [2021-11-17 13:33:01,075 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[881561,881574] [2021-11-17 13:33:01,075 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[881700,881713] [2021-11-17 13:33:01,075 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[881863,881876] [2021-11-17 13:33:01,075 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[882029,882042] [2021-11-17 13:33:01,076 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[882193,882206] [2021-11-17 13:33:01,076 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[882358,882371] [2021-11-17 13:33:01,076 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[882523,882536] [2021-11-17 13:33:01,077 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[882689,882702] [2021-11-17 13:33:01,077 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[882854,882867] [2021-11-17 13:33:01,077 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[883021,883034] [2021-11-17 13:33:01,084 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[883181,883194] [2021-11-17 13:33:01,084 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[883343,883356] [2021-11-17 13:33:01,085 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[883502,883515] [2021-11-17 13:33:01,085 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[883648,883661] [2021-11-17 13:33:01,085 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[883791,883804] [2021-11-17 13:33:01,086 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[883935,883948] [2021-11-17 13:33:01,086 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[884078,884091] [2021-11-17 13:33:01,086 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[884222,884235] [2021-11-17 13:33:01,086 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[884363,884376] [2021-11-17 13:33:01,087 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[884501,884514] [2021-11-17 13:33:01,087 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[884659,884672] [2021-11-17 13:33:01,087 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[884818,884831] [2021-11-17 13:33:01,088 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[884974,884987] [2021-11-17 13:33:01,088 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[885123,885136] [2021-11-17 13:33:01,088 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[885275,885288] [2021-11-17 13:33:01,088 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[885426,885439] [2021-11-17 13:33:01,089 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[885575,885588] [2021-11-17 13:33:01,089 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[885727,885740] [2021-11-17 13:33:01,089 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[885875,885888] [2021-11-17 13:33:01,089 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[886028,886041] [2021-11-17 13:33:01,090 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[886179,886192] [2021-11-17 13:33:01,090 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[886329,886342] [2021-11-17 13:33:01,090 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[886476,886489] [2021-11-17 13:33:01,091 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[886627,886640] [2021-11-17 13:33:01,091 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[886778,886791] [2021-11-17 13:33:01,091 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[886926,886939] [2021-11-17 13:33:01,091 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[887092,887105] [2021-11-17 13:33:01,092 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[887261,887274] [2021-11-17 13:33:01,092 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[887428,887441] [2021-11-17 13:33:01,092 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[887596,887609] [2021-11-17 13:33:01,093 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[887746,887759] [2021-11-17 13:33:01,093 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[887893,887906] [2021-11-17 13:33:01,093 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[888054,888067] [2021-11-17 13:33:01,093 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[888224,888237] [2021-11-17 13:33:01,094 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[888386,888399] [2021-11-17 13:33:01,096 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-17 13:33:01,126 INFO L203 MainTranslator]: Completed pre-run [2021-11-17 13:33:01,663 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[874998,875011] [2021-11-17 13:33:01,664 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[875143,875156] [2021-11-17 13:33:01,665 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[875289,875302] [2021-11-17 13:33:01,665 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[875454,875467] [2021-11-17 13:33:01,666 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[875612,875625] [2021-11-17 13:33:01,666 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[875770,875783] [2021-11-17 13:33:01,667 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[875928,875941] [2021-11-17 13:33:01,667 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[876088,876101] [2021-11-17 13:33:01,668 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[876247,876260] [2021-11-17 13:33:01,669 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[876386,876399] [2021-11-17 13:33:01,669 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[876528,876541] [2021-11-17 13:33:01,669 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[876677,876690] [2021-11-17 13:33:01,670 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[876816,876829] [2021-11-17 13:33:01,671 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[876971,876984] [2021-11-17 13:33:01,671 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[877131,877144] [2021-11-17 13:33:01,671 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[877282,877295] [2021-11-17 13:33:01,671 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[877433,877446] [2021-11-17 13:33:01,672 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[877585,877598] [2021-11-17 13:33:01,672 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[877734,877747] [2021-11-17 13:33:01,672 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[877882,877895] [2021-11-17 13:33:01,672 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[878039,878052] [2021-11-17 13:33:01,673 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[878188,878201] [2021-11-17 13:33:01,673 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[878344,878357] [2021-11-17 13:33:01,674 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[878497,878510] [2021-11-17 13:33:01,674 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[878643,878656] [2021-11-17 13:33:01,674 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[878786,878799] [2021-11-17 13:33:01,674 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[878938,878951] [2021-11-17 13:33:01,675 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[879084,879097] [2021-11-17 13:33:01,675 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[879229,879242] [2021-11-17 13:33:01,675 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[879383,879396] [2021-11-17 13:33:01,675 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[879534,879547] [2021-11-17 13:33:01,676 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[879689,879702] [2021-11-17 13:33:01,676 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[879841,879854] [2021-11-17 13:33:01,677 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[879996,880009] [2021-11-17 13:33:01,677 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[880160,880173] [2021-11-17 13:33:01,677 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[880316,880329] [2021-11-17 13:33:01,677 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[880480,880493] [2021-11-17 13:33:01,678 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[880622,880635] [2021-11-17 13:33:01,679 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[880780,880793] [2021-11-17 13:33:01,679 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[880947,880960] [2021-11-17 13:33:01,680 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[881106,881119] [2021-11-17 13:33:01,680 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[881265,881278] [2021-11-17 13:33:01,680 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[881414,881427] [2021-11-17 13:33:01,681 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[881561,881574] [2021-11-17 13:33:01,681 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[881700,881713] [2021-11-17 13:33:01,682 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[881863,881876] [2021-11-17 13:33:01,682 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[882029,882042] [2021-11-17 13:33:01,682 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[882193,882206] [2021-11-17 13:33:01,683 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[882358,882371] [2021-11-17 13:33:01,683 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[882523,882536] [2021-11-17 13:33:01,683 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[882689,882702] [2021-11-17 13:33:01,684 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[882854,882867] [2021-11-17 13:33:01,684 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[883021,883034] [2021-11-17 13:33:01,684 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[883181,883194] [2021-11-17 13:33:01,685 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[883343,883356] [2021-11-17 13:33:01,688 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[883502,883515] [2021-11-17 13:33:01,688 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[883648,883661] [2021-11-17 13:33:01,688 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[883791,883804] [2021-11-17 13:33:01,688 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[883935,883948] [2021-11-17 13:33:01,689 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[884078,884091] [2021-11-17 13:33:01,689 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[884222,884235] [2021-11-17 13:33:01,689 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[884363,884376] [2021-11-17 13:33:01,690 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[884501,884514] [2021-11-17 13:33:01,692 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[884659,884672] [2021-11-17 13:33:01,692 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[884818,884831] [2021-11-17 13:33:01,692 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[884974,884987] [2021-11-17 13:33:01,693 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[885123,885136] [2021-11-17 13:33:01,693 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[885275,885288] [2021-11-17 13:33:01,694 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[885426,885439] [2021-11-17 13:33:01,694 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[885575,885588] [2021-11-17 13:33:01,694 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[885727,885740] [2021-11-17 13:33:01,694 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[885875,885888] [2021-11-17 13:33:01,698 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[886028,886041] [2021-11-17 13:33:01,698 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[886179,886192] [2021-11-17 13:33:01,699 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[886329,886342] [2021-11-17 13:33:01,699 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[886476,886489] [2021-11-17 13:33:01,699 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[886627,886640] [2021-11-17 13:33:01,699 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[886778,886791] [2021-11-17 13:33:01,700 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[886926,886939] [2021-11-17 13:33:01,701 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[887092,887105] [2021-11-17 13:33:01,701 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[887261,887274] [2021-11-17 13:33:01,702 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[887428,887441] [2021-11-17 13:33:01,702 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[887596,887609] [2021-11-17 13:33:01,703 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[887746,887759] [2021-11-17 13:33:01,703 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[887893,887906] [2021-11-17 13:33:01,703 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[888054,888067] [2021-11-17 13:33:01,703 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[888224,888237] [2021-11-17 13:33:01,704 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i[888386,888399] [2021-11-17 13:33:01,707 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-17 13:33:02,001 INFO L208 MainTranslator]: Completed translation [2021-11-17 13:33:02,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:33:02 WrapperNode [2021-11-17 13:33:02,002 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-17 13:33:02,003 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-17 13:33:02,003 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-17 13:33:02,003 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-17 13:33:02,008 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:33:02" (1/1) ... [2021-11-17 13:33:02,153 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:33:02" (1/1) ... [2021-11-17 13:33:02,428 INFO L137 Inliner]: procedures = 964, calls = 5511, calls flagged for inlining = 500, calls inlined = 431, statements flattened = 15901 [2021-11-17 13:33:02,429 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-17 13:33:02,430 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-17 13:33:02,430 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-17 13:33:02,430 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-17 13:33:02,437 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:33:02" (1/1) ... [2021-11-17 13:33:02,438 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:33:02" (1/1) ... [2021-11-17 13:33:02,484 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:33:02" (1/1) ... [2021-11-17 13:33:02,485 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:33:02" (1/1) ... [2021-11-17 13:33:02,725 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:33:02" (1/1) ... [2021-11-17 13:33:02,755 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:33:02" (1/1) ... [2021-11-17 13:33:02,815 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:33:02" (1/1) ... [2021-11-17 13:33:02,950 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-17 13:33:02,951 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-17 13:33:02,951 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-17 13:33:02,952 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-17 13:33:02,952 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:33:02" (1/1) ... [2021-11-17 13:33:02,957 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-17 13:33:02,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 13:33:02,984 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-17 13:33:03,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-17 13:33:03,080 INFO L130 BoogieDeclarations]: Found specification of procedure nlmsg_total_size [2021-11-17 13:33:03,080 INFO L138 BoogieDeclarations]: Found implementation of procedure nlmsg_total_size [2021-11-17 13:33:03,080 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_skb [2021-11-17 13:33:03,080 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_skb [2021-11-17 13:33:03,081 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2021-11-17 13:33:03,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2021-11-17 13:33:03,081 INFO L130 BoogieDeclarations]: Found specification of procedure nft_lookup_dump [2021-11-17 13:33:03,081 INFO L138 BoogieDeclarations]: Found implementation of procedure nft_lookup_dump [2021-11-17 13:33:03,081 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~$Pointer$~TO~int [2021-11-17 13:33:03,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~$Pointer$~TO~int [2021-11-17 13:33:03,081 INFO L130 BoogieDeclarations]: Found specification of procedure free_percpu [2021-11-17 13:33:03,081 INFO L138 BoogieDeclarations]: Found implementation of procedure free_percpu [2021-11-17 13:33:03,082 INFO L130 BoogieDeclarations]: Found specification of procedure __nf_tables_rule_lookup [2021-11-17 13:33:03,082 INFO L138 BoogieDeclarations]: Found implementation of procedure __nf_tables_rule_lookup [2021-11-17 13:33:03,082 INFO L130 BoogieDeclarations]: Found specification of procedure netlink_dump_start [2021-11-17 13:33:03,082 INFO L138 BoogieDeclarations]: Found implementation of procedure netlink_dump_start [2021-11-17 13:33:03,082 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-11-17 13:33:03,082 INFO L130 BoogieDeclarations]: Found specification of procedure nft_rule_is_active_next [2021-11-17 13:33:03,083 INFO L138 BoogieDeclarations]: Found implementation of procedure nft_rule_is_active_next [2021-11-17 13:33:03,083 INFO L130 BoogieDeclarations]: Found specification of procedure nf_tables_fill_rule_info [2021-11-17 13:33:03,084 INFO L138 BoogieDeclarations]: Found implementation of procedure nf_tables_fill_rule_info [2021-11-17 13:33:03,084 INFO L130 BoogieDeclarations]: Found specification of procedure nft_payload_select_ops [2021-11-17 13:33:03,084 INFO L138 BoogieDeclarations]: Found implementation of procedure nft_payload_select_ops [2021-11-17 13:33:03,084 INFO L130 BoogieDeclarations]: Found specification of procedure nft_cmp_fast_init [2021-11-17 13:33:03,084 INFO L138 BoogieDeclarations]: Found implementation of procedure nft_cmp_fast_init [2021-11-17 13:33:03,085 INFO L130 BoogieDeclarations]: Found specification of procedure nft_byteorder_init [2021-11-17 13:33:03,085 INFO L138 BoogieDeclarations]: Found implementation of procedure nft_byteorder_init [2021-11-17 13:33:03,085 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2021-11-17 13:33:03,085 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2021-11-17 13:33:03,085 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2021-11-17 13:33:03,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2021-11-17 13:33:03,085 INFO L130 BoogieDeclarations]: Found specification of procedure nft_lookup_destroy [2021-11-17 13:33:03,085 INFO L138 BoogieDeclarations]: Found implementation of procedure nft_lookup_destroy [2021-11-17 13:33:03,085 INFO L130 BoogieDeclarations]: Found specification of procedure nft_data_dump [2021-11-17 13:33:03,085 INFO L138 BoogieDeclarations]: Found implementation of procedure nft_data_dump [2021-11-17 13:33:03,086 INFO L130 BoogieDeclarations]: Found specification of procedure nlmsg_new [2021-11-17 13:33:03,086 INFO L138 BoogieDeclarations]: Found implementation of procedure nlmsg_new [2021-11-17 13:33:03,086 INFO L130 BoogieDeclarations]: Found specification of procedure nla_ok [2021-11-17 13:33:03,086 INFO L138 BoogieDeclarations]: Found implementation of procedure nla_ok [2021-11-17 13:33:03,086 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2021-11-17 13:33:03,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2021-11-17 13:33:03,086 INFO L130 BoogieDeclarations]: Found specification of procedure nf_tables_chain_notify [2021-11-17 13:33:03,086 INFO L138 BoogieDeclarations]: Found implementation of procedure nf_tables_chain_notify [2021-11-17 13:33:03,086 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2021-11-17 13:33:03,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2021-11-17 13:33:03,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-17 13:33:03,087 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2021-11-17 13:33:03,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2021-11-17 13:33:03,087 INFO L130 BoogieDeclarations]: Found specification of procedure nft_cmp_fast_mask [2021-11-17 13:33:03,087 INFO L138 BoogieDeclarations]: Found implementation of procedure nft_cmp_fast_mask [2021-11-17 13:33:03,087 INFO L130 BoogieDeclarations]: Found specification of procedure nlmsg_hdr [2021-11-17 13:33:03,087 INFO L138 BoogieDeclarations]: Found implementation of procedure nlmsg_hdr [2021-11-17 13:33:03,095 INFO L130 BoogieDeclarations]: Found specification of procedure nlmsg_put [2021-11-17 13:33:03,095 INFO L138 BoogieDeclarations]: Found implementation of procedure nlmsg_put [2021-11-17 13:33:03,095 INFO L130 BoogieDeclarations]: Found specification of procedure nft_userdata [2021-11-17 13:33:03,095 INFO L138 BoogieDeclarations]: Found implementation of procedure nft_userdata [2021-11-17 13:33:03,095 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2021-11-17 13:33:03,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2021-11-17 13:33:03,095 INFO L130 BoogieDeclarations]: Found specification of procedure rcu_read_lock [2021-11-17 13:33:03,095 INFO L138 BoogieDeclarations]: Found implementation of procedure rcu_read_lock [2021-11-17 13:33:03,095 INFO L130 BoogieDeclarations]: Found specification of procedure nfnl_unlock [2021-11-17 13:33:03,095 INFO L138 BoogieDeclarations]: Found implementation of procedure nfnl_unlock [2021-11-17 13:33:03,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-17 13:33:03,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-17 13:33:03,096 INFO L130 BoogieDeclarations]: Found specification of procedure nf_tables_fill_set [2021-11-17 13:33:03,096 INFO L138 BoogieDeclarations]: Found implementation of procedure nf_tables_fill_set [2021-11-17 13:33:03,096 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2021-11-17 13:33:03,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2021-11-17 13:33:03,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-17 13:33:03,096 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2021-11-17 13:33:03,096 INFO L130 BoogieDeclarations]: Found specification of procedure nla_next [2021-11-17 13:33:03,096 INFO L138 BoogieDeclarations]: Found implementation of procedure nla_next [2021-11-17 13:33:03,096 INFO L130 BoogieDeclarations]: Found specification of procedure nf_tables_table_notify [2021-11-17 13:33:03,096 INFO L138 BoogieDeclarations]: Found implementation of procedure nf_tables_table_notify [2021-11-17 13:33:03,096 INFO L130 BoogieDeclarations]: Found specification of procedure nft_bitwise_init [2021-11-17 13:33:03,096 INFO L138 BoogieDeclarations]: Found implementation of procedure nft_bitwise_init [2021-11-17 13:33:03,096 INFO L130 BoogieDeclarations]: Found specification of procedure nft_type_to_reg [2021-11-17 13:33:03,096 INFO L138 BoogieDeclarations]: Found implementation of procedure nft_type_to_reg [2021-11-17 13:33:03,096 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2021-11-17 13:33:03,096 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2021-11-17 13:33:03,096 INFO L130 BoogieDeclarations]: Found specification of procedure nf_tables_table_disable [2021-11-17 13:33:03,096 INFO L138 BoogieDeclarations]: Found implementation of procedure nf_tables_table_disable [2021-11-17 13:33:03,096 INFO L130 BoogieDeclarations]: Found specification of procedure nft_payload_init [2021-11-17 13:33:03,096 INFO L138 BoogieDeclarations]: Found implementation of procedure nft_payload_init [2021-11-17 13:33:03,096 INFO L130 BoogieDeclarations]: Found specification of procedure nf_tables_dump_rules [2021-11-17 13:33:03,096 INFO L138 BoogieDeclarations]: Found implementation of procedure nf_tables_dump_rules [2021-11-17 13:33:03,097 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ulong [2021-11-17 13:33:03,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ulong [2021-11-17 13:33:03,097 INFO L130 BoogieDeclarations]: Found specification of procedure nft_rule_clear [2021-11-17 13:33:03,097 INFO L138 BoogieDeclarations]: Found implementation of procedure nft_rule_clear [2021-11-17 13:33:03,097 INFO L130 BoogieDeclarations]: Found specification of procedure nft_cmp_eval [2021-11-17 13:33:03,097 INFO L138 BoogieDeclarations]: Found implementation of procedure nft_cmp_eval [2021-11-17 13:33:03,097 INFO L130 BoogieDeclarations]: Found specification of procedure nft_lookup_eval [2021-11-17 13:33:03,097 INFO L138 BoogieDeclarations]: Found implementation of procedure nft_lookup_eval [2021-11-17 13:33:03,097 INFO L130 BoogieDeclarations]: Found specification of procedure nft_ctx_init [2021-11-17 13:33:03,097 INFO L138 BoogieDeclarations]: Found implementation of procedure nft_ctx_init [2021-11-17 13:33:03,097 INFO L130 BoogieDeclarations]: Found specification of procedure skb_tail_pointer [2021-11-17 13:33:03,097 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_tail_pointer [2021-11-17 13:33:03,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-17 13:33:03,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-17 13:33:03,097 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2021-11-17 13:33:03,097 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2021-11-17 13:33:03,097 INFO L130 BoogieDeclarations]: Found specification of procedure nf_tables_check_loops [2021-11-17 13:33:03,097 INFO L138 BoogieDeclarations]: Found implementation of procedure nf_tables_check_loops [2021-11-17 13:33:03,097 INFO L130 BoogieDeclarations]: Found specification of procedure nft_set_destroy [2021-11-17 13:33:03,097 INFO L138 BoogieDeclarations]: Found implementation of procedure nft_set_destroy [2021-11-17 13:33:03,097 INFO L130 BoogieDeclarations]: Found specification of procedure nf_tables_core_module_exit [2021-11-17 13:33:03,097 INFO L138 BoogieDeclarations]: Found implementation of procedure nf_tables_core_module_exit [2021-11-17 13:33:03,097 INFO L130 BoogieDeclarations]: Found specification of procedure nlmsg_trim [2021-11-17 13:33:03,097 INFO L138 BoogieDeclarations]: Found implementation of procedure nlmsg_trim [2021-11-17 13:33:03,097 INFO L130 BoogieDeclarations]: Found specification of procedure nla_get_be64 [2021-11-17 13:33:03,098 INFO L138 BoogieDeclarations]: Found implementation of procedure nla_get_be64 [2021-11-17 13:33:03,098 INFO L130 BoogieDeclarations]: Found specification of procedure nft_register_expr [2021-11-17 13:33:03,098 INFO L138 BoogieDeclarations]: Found implementation of procedure nft_register_expr [2021-11-17 13:33:03,098 INFO L130 BoogieDeclarations]: Found specification of procedure list_del_rcu [2021-11-17 13:33:03,098 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del_rcu [2021-11-17 13:33:03,098 INFO L130 BoogieDeclarations]: Found specification of procedure nf_tables_alloc_handle [2021-11-17 13:33:03,098 INFO L138 BoogieDeclarations]: Found implementation of procedure nf_tables_alloc_handle [2021-11-17 13:33:03,098 INFO L130 BoogieDeclarations]: Found specification of procedure nla_get_be32 [2021-11-17 13:33:03,098 INFO L138 BoogieDeclarations]: Found implementation of procedure nla_get_be32 [2021-11-17 13:33:03,098 INFO L130 BoogieDeclarations]: Found specification of procedure sock_net [2021-11-17 13:33:03,098 INFO L138 BoogieDeclarations]: Found implementation of procedure sock_net [2021-11-17 13:33:03,098 INFO L130 BoogieDeclarations]: Found specification of procedure nf_tables_fill_setelem [2021-11-17 13:33:03,098 INFO L138 BoogieDeclarations]: Found implementation of procedure nf_tables_fill_setelem [2021-11-17 13:33:03,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2021-11-17 13:33:03,098 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2021-11-17 13:33:03,098 INFO L130 BoogieDeclarations]: Found specification of procedure nft_stats_alloc [2021-11-17 13:33:03,098 INFO L138 BoogieDeclarations]: Found implementation of procedure nft_stats_alloc [2021-11-17 13:33:03,098 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2021-11-17 13:33:03,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2021-11-17 13:33:03,098 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_for_read_section [2021-11-17 13:33:03,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_for_read_section [2021-11-17 13:33:03,098 INFO L130 BoogieDeclarations]: Found specification of procedure nft_flush_table [2021-11-17 13:33:03,098 INFO L138 BoogieDeclarations]: Found implementation of procedure nft_flush_table [2021-11-17 13:33:03,098 INFO L130 BoogieDeclarations]: Found specification of procedure ERR_PTR [2021-11-17 13:33:03,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ERR_PTR [2021-11-17 13:33:03,098 INFO L130 BoogieDeclarations]: Found specification of procedure nla_len [2021-11-17 13:33:03,099 INFO L138 BoogieDeclarations]: Found implementation of procedure nla_len [2021-11-17 13:33:03,099 INFO L130 BoogieDeclarations]: Found specification of procedure nf_tables_set_lookup [2021-11-17 13:33:03,099 INFO L138 BoogieDeclarations]: Found implementation of procedure nf_tables_set_lookup [2021-11-17 13:33:03,099 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2021-11-17 13:33:03,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2021-11-17 13:33:03,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-17 13:33:03,099 INFO L130 BoogieDeclarations]: Found specification of procedure nf_tables_getchain [2021-11-17 13:33:03,099 INFO L138 BoogieDeclarations]: Found implementation of procedure nf_tables_getchain [2021-11-17 13:33:03,099 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2021-11-17 13:33:03,099 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2021-11-17 13:33:03,099 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2021-11-17 13:33:03,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2021-11-17 13:33:03,099 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_try_module_get [2021-11-17 13:33:03,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_try_module_get [2021-11-17 13:33:03,099 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~$Pointer$~TO~VOID [2021-11-17 13:33:03,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~$Pointer$~TO~VOID [2021-11-17 13:33:03,099 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-17 13:33:03,099 INFO L130 BoogieDeclarations]: Found specification of procedure nf_tables_newtable [2021-11-17 13:33:03,099 INFO L138 BoogieDeclarations]: Found implementation of procedure nf_tables_newtable [2021-11-17 13:33:03,099 INFO L130 BoogieDeclarations]: Found specification of procedure nf_tables_fill_table_info [2021-11-17 13:33:03,099 INFO L138 BoogieDeclarations]: Found implementation of procedure nf_tables_fill_table_info [2021-11-17 13:33:03,099 INFO L130 BoogieDeclarations]: Found specification of procedure nft_expr_priv [2021-11-17 13:33:03,099 INFO L138 BoogieDeclarations]: Found implementation of procedure nft_expr_priv [2021-11-17 13:33:03,099 INFO L130 BoogieDeclarations]: Found specification of procedure nf_tables_table_lookup [2021-11-17 13:33:03,100 INFO L138 BoogieDeclarations]: Found implementation of procedure nf_tables_table_lookup [2021-11-17 13:33:03,100 INFO L130 BoogieDeclarations]: Found specification of procedure nft_bitwise_module_exit [2021-11-17 13:33:03,100 INFO L138 BoogieDeclarations]: Found implementation of procedure nft_bitwise_module_exit [2021-11-17 13:33:03,100 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_module_put [2021-11-17 13:33:03,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_module_put [2021-11-17 13:33:03,100 INFO L130 BoogieDeclarations]: Found specification of procedure nla_data [2021-11-17 13:33:03,100 INFO L138 BoogieDeclarations]: Found implementation of procedure nla_data [2021-11-17 13:33:03,100 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2021-11-17 13:33:03,100 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2021-11-17 13:33:03,100 INFO L130 BoogieDeclarations]: Found specification of procedure nft_ctx_init_from_setattr [2021-11-17 13:33:03,100 INFO L138 BoogieDeclarations]: Found implementation of procedure nft_ctx_init_from_setattr [2021-11-17 13:33:03,100 INFO L130 BoogieDeclarations]: Found specification of procedure nft_ctx_init_from_elemattr [2021-11-17 13:33:03,100 INFO L138 BoogieDeclarations]: Found implementation of procedure nft_ctx_init_from_elemattr [2021-11-17 13:33:03,100 INFO L130 BoogieDeclarations]: Found specification of procedure nft_expr_last [2021-11-17 13:33:03,100 INFO L138 BoogieDeclarations]: Found implementation of procedure nft_expr_last [2021-11-17 13:33:03,100 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2021-11-17 13:33:03,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2021-11-17 13:33:03,100 INFO L130 BoogieDeclarations]: Found specification of procedure list_empty [2021-11-17 13:33:03,100 INFO L138 BoogieDeclarations]: Found implementation of procedure list_empty [2021-11-17 13:33:03,100 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2021-11-17 13:33:03,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2021-11-17 13:33:03,100 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2021-11-17 13:33:03,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2021-11-17 13:33:03,100 INFO L130 BoogieDeclarations]: Found specification of procedure nla_parse_nested [2021-11-17 13:33:03,100 INFO L138 BoogieDeclarations]: Found implementation of procedure nla_parse_nested [2021-11-17 13:33:03,100 INFO L130 BoogieDeclarations]: Found specification of procedure nft_immediate_module_exit [2021-11-17 13:33:03,101 INFO L138 BoogieDeclarations]: Found implementation of procedure nft_immediate_module_exit [2021-11-17 13:33:03,101 INFO L130 BoogieDeclarations]: Found specification of procedure nfnetlink_set_err [2021-11-17 13:33:03,101 INFO L138 BoogieDeclarations]: Found implementation of procedure nfnetlink_set_err [2021-11-17 13:33:03,101 INFO L130 BoogieDeclarations]: Found specification of procedure synchronize_rcu [2021-11-17 13:33:03,101 INFO L138 BoogieDeclarations]: Found implementation of procedure synchronize_rcu [2021-11-17 13:33:03,101 INFO L130 BoogieDeclarations]: Found specification of procedure rcu_read_lock_held [2021-11-17 13:33:03,101 INFO L138 BoogieDeclarations]: Found implementation of procedure rcu_read_lock_held [2021-11-17 13:33:03,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-17 13:33:03,101 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2021-11-17 13:33:03,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2021-11-17 13:33:03,101 INFO L130 BoogieDeclarations]: Found specification of procedure nft_validate_data_load [2021-11-17 13:33:03,101 INFO L138 BoogieDeclarations]: Found implementation of procedure nft_validate_data_load [2021-11-17 13:33:03,101 INFO L130 BoogieDeclarations]: Found specification of procedure nft_immediate_init [2021-11-17 13:33:03,101 INFO L138 BoogieDeclarations]: Found implementation of procedure nft_immediate_init [2021-11-17 13:33:03,101 INFO L130 BoogieDeclarations]: Found specification of procedure nl_dump_check_consistent [2021-11-17 13:33:03,101 INFO L138 BoogieDeclarations]: Found implementation of procedure nl_dump_check_consistent [2021-11-17 13:33:03,101 INFO L130 BoogieDeclarations]: Found specification of procedure nf_tables_commit [2021-11-17 13:33:03,101 INFO L138 BoogieDeclarations]: Found implementation of procedure nf_tables_commit [2021-11-17 13:33:03,101 INFO L130 BoogieDeclarations]: Found specification of procedure cpumask_next [2021-11-17 13:33:03,101 INFO L138 BoogieDeclarations]: Found implementation of procedure cpumask_next [2021-11-17 13:33:03,101 INFO L130 BoogieDeclarations]: Found specification of procedure nla_put [2021-11-17 13:33:03,101 INFO L138 BoogieDeclarations]: Found implementation of procedure nla_put [2021-11-17 13:33:03,101 INFO L130 BoogieDeclarations]: Found specification of procedure nf_tables_table_destroy [2021-11-17 13:33:03,101 INFO L138 BoogieDeclarations]: Found implementation of procedure nf_tables_table_destroy [2021-11-17 13:33:03,101 INFO L130 BoogieDeclarations]: Found specification of procedure nft_base_chain [2021-11-17 13:33:03,102 INFO L138 BoogieDeclarations]: Found implementation of procedure nft_base_chain [2021-11-17 13:33:03,102 INFO L130 BoogieDeclarations]: Found specification of procedure nfnl_lock [2021-11-17 13:33:03,102 INFO L138 BoogieDeclarations]: Found implementation of procedure nfnl_lock [2021-11-17 13:33:03,102 INFO L130 BoogieDeclarations]: Found specification of procedure nft_data_uninit [2021-11-17 13:33:03,102 INFO L138 BoogieDeclarations]: Found implementation of procedure nft_data_uninit [2021-11-17 13:33:03,102 INFO L130 BoogieDeclarations]: Found specification of procedure nft_byteorder_dump [2021-11-17 13:33:03,102 INFO L138 BoogieDeclarations]: Found implementation of procedure nft_byteorder_dump [2021-11-17 13:33:03,102 INFO L130 BoogieDeclarations]: Found specification of procedure __nft_expr_type_get [2021-11-17 13:33:03,115 INFO L138 BoogieDeclarations]: Found implementation of procedure __nft_expr_type_get [2021-11-17 13:33:03,115 INFO L130 BoogieDeclarations]: Found specification of procedure nft_validate_output_register [2021-11-17 13:33:03,115 INFO L138 BoogieDeclarations]: Found implementation of procedure nft_validate_output_register [2021-11-17 13:33:03,115 INFO L130 BoogieDeclarations]: Found specification of procedure nf_tables_delchain [2021-11-17 13:33:03,116 INFO L138 BoogieDeclarations]: Found implementation of procedure nf_tables_delchain [2021-11-17 13:33:03,116 INFO L130 BoogieDeclarations]: Found specification of procedure nf_tables_rule_notify [2021-11-17 13:33:03,116 INFO L138 BoogieDeclarations]: Found implementation of procedure nf_tables_rule_notify [2021-11-17 13:33:03,116 INFO L130 BoogieDeclarations]: Found specification of procedure nla_strcmp [2021-11-17 13:33:03,116 INFO L138 BoogieDeclarations]: Found implementation of procedure nla_strcmp [2021-11-17 13:33:03,116 INFO L130 BoogieDeclarations]: Found specification of procedure nla_put_string [2021-11-17 13:33:03,116 INFO L138 BoogieDeclarations]: Found implementation of procedure nla_put_string [2021-11-17 13:33:03,116 INFO L130 BoogieDeclarations]: Found specification of procedure nft_immediate_dump [2021-11-17 13:33:03,116 INFO L138 BoogieDeclarations]: Found implementation of procedure nft_immediate_dump [2021-11-17 13:33:03,116 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2021-11-17 13:33:03,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2021-11-17 13:33:03,117 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2021-11-17 13:33:03,117 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2021-11-17 13:33:03,117 INFO L130 BoogieDeclarations]: Found specification of procedure nf_tables_rule_destroy [2021-11-17 13:33:03,117 INFO L138 BoogieDeclarations]: Found implementation of procedure nf_tables_rule_destroy [2021-11-17 13:33:03,117 INFO L130 BoogieDeclarations]: Found specification of procedure nf_tables_set_notify [2021-11-17 13:33:03,117 INFO L138 BoogieDeclarations]: Found implementation of procedure nf_tables_set_notify [2021-11-17 13:33:03,117 INFO L130 BoogieDeclarations]: Found specification of procedure nft_cmp_fast_dump [2021-11-17 13:33:03,117 INFO L138 BoogieDeclarations]: Found implementation of procedure nft_cmp_fast_dump [2021-11-17 13:33:03,117 INFO L130 BoogieDeclarations]: Found specification of procedure debug_lockdep_rcu_enabled [2021-11-17 13:33:03,117 INFO L138 BoogieDeclarations]: Found implementation of procedure debug_lockdep_rcu_enabled [2021-11-17 13:33:03,118 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-11-17 13:33:03,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-11-17 13:33:03,118 INFO L130 BoogieDeclarations]: Found specification of procedure nla_put_be32 [2021-11-17 13:33:03,118 INFO L138 BoogieDeclarations]: Found implementation of procedure nla_put_be32 [2021-11-17 13:33:03,118 INFO L130 BoogieDeclarations]: Found specification of procedure nft_delchain [2021-11-17 13:33:03,118 INFO L138 BoogieDeclarations]: Found implementation of procedure nft_delchain [2021-11-17 13:33:03,118 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2021-11-17 13:33:03,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2021-11-17 13:33:03,119 INFO L130 BoogieDeclarations]: Found specification of procedure nlmsg_unicast [2021-11-17 13:33:03,119 INFO L138 BoogieDeclarations]: Found implementation of procedure nlmsg_unicast [2021-11-17 13:33:03,119 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2021-11-17 13:33:03,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2021-11-17 13:33:03,119 INFO L130 BoogieDeclarations]: Found specification of procedure nft_byteorder_module_exit [2021-11-17 13:33:03,119 INFO L138 BoogieDeclarations]: Found implementation of procedure nft_byteorder_module_exit [2021-11-17 13:33:03,119 INFO L130 BoogieDeclarations]: Found specification of procedure nft_trans_destroy [2021-11-17 13:33:03,119 INFO L138 BoogieDeclarations]: Found implementation of procedure nft_trans_destroy [2021-11-17 13:33:03,119 INFO L130 BoogieDeclarations]: Found specification of procedure nft_rule_deactivate_next [2021-11-17 13:33:03,119 INFO L138 BoogieDeclarations]: Found implementation of procedure nft_rule_deactivate_next [2021-11-17 13:33:03,120 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2021-11-17 13:33:03,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2021-11-17 13:33:03,120 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2021-11-17 13:33:03,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2021-11-17 13:33:03,120 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2021-11-17 13:33:03,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2021-11-17 13:33:03,120 INFO L130 BoogieDeclarations]: Found specification of procedure nft_unregister_expr [2021-11-17 13:33:03,120 INFO L138 BoogieDeclarations]: Found implementation of procedure nft_unregister_expr [2021-11-17 13:33:03,120 INFO L130 BoogieDeclarations]: Found specification of procedure nft_payload_dump [2021-11-17 13:33:03,120 INFO L138 BoogieDeclarations]: Found implementation of procedure nft_payload_dump [2021-11-17 13:33:03,120 INFO L130 BoogieDeclarations]: Found specification of procedure nla_nest_end [2021-11-17 13:33:03,121 INFO L138 BoogieDeclarations]: Found implementation of procedure nla_nest_end [2021-11-17 13:33:03,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-17 13:33:03,121 INFO L130 BoogieDeclarations]: Found specification of procedure __nf_tables_chain_type_lookup [2021-11-17 13:33:03,121 INFO L138 BoogieDeclarations]: Found implementation of procedure __nf_tables_chain_type_lookup [2021-11-17 13:33:03,121 INFO L130 BoogieDeclarations]: Found specification of procedure nf_register_hooks [2021-11-17 13:33:03,121 INFO L138 BoogieDeclarations]: Found implementation of procedure nf_register_hooks [2021-11-17 13:33:03,121 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2021-11-17 13:33:03,121 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2021-11-17 13:33:03,121 INFO L130 BoogieDeclarations]: Found specification of procedure nla_memcpy [2021-11-17 13:33:03,121 INFO L138 BoogieDeclarations]: Found implementation of procedure nla_memcpy [2021-11-17 13:33:03,121 INFO L130 BoogieDeclarations]: Found specification of procedure nf_tables_rule_lookup [2021-11-17 13:33:03,122 INFO L138 BoogieDeclarations]: Found implementation of procedure nf_tables_rule_lookup [2021-11-17 13:33:03,122 INFO L130 BoogieDeclarations]: Found specification of procedure nf_tables_fill_gen_info [2021-11-17 13:33:03,122 INFO L138 BoogieDeclarations]: Found implementation of procedure nf_tables_fill_gen_info [2021-11-17 13:33:03,122 INFO L130 BoogieDeclarations]: Found specification of procedure nla_put_be64 [2021-11-17 13:33:03,122 INFO L138 BoogieDeclarations]: Found implementation of procedure nla_put_be64 [2021-11-17 13:33:03,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-17 13:33:03,122 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2021-11-17 13:33:03,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2021-11-17 13:33:03,122 INFO L130 BoogieDeclarations]: Found specification of procedure nft_expr_next [2021-11-17 13:33:03,122 INFO L138 BoogieDeclarations]: Found implementation of procedure nft_expr_next [2021-11-17 13:33:03,122 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2021-11-17 13:33:03,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2021-11-17 13:33:03,123 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2021-11-17 13:33:03,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2021-11-17 13:33:03,123 INFO L130 BoogieDeclarations]: Found specification of procedure nft_cmp_select_ops [2021-11-17 13:33:03,123 INFO L138 BoogieDeclarations]: Found implementation of procedure nft_cmp_select_ops [2021-11-17 13:33:03,123 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2021-11-17 13:33:03,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2021-11-17 13:33:03,123 INFO L130 BoogieDeclarations]: Found specification of procedure nft_trans_rule_add [2021-11-17 13:33:03,123 INFO L138 BoogieDeclarations]: Found implementation of procedure nft_trans_rule_add [2021-11-17 13:33:03,123 INFO L130 BoogieDeclarations]: Found specification of procedure nft_trans_set_add [2021-11-17 13:33:03,123 INFO L138 BoogieDeclarations]: Found implementation of procedure nft_trans_set_add [2021-11-17 13:33:03,124 INFO L130 BoogieDeclarations]: Found specification of procedure nft_cmp_init [2021-11-17 13:33:03,124 INFO L138 BoogieDeclarations]: Found implementation of procedure nft_cmp_init [2021-11-17 13:33:03,124 INFO L130 BoogieDeclarations]: Found specification of procedure nft_payload_eval [2021-11-17 13:33:03,124 INFO L138 BoogieDeclarations]: Found implementation of procedure nft_payload_eval [2021-11-17 13:33:03,124 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2021-11-17 13:33:03,124 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2021-11-17 13:33:03,124 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2021-11-17 13:33:03,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2021-11-17 13:33:03,124 INFO L130 BoogieDeclarations]: Found specification of procedure nft_byteorder_eval [2021-11-17 13:33:03,124 INFO L138 BoogieDeclarations]: Found implementation of procedure nft_byteorder_eval [2021-11-17 13:33:03,125 INFO L130 BoogieDeclarations]: Found specification of procedure nft_lookup_init [2021-11-17 13:33:03,125 INFO L138 BoogieDeclarations]: Found implementation of procedure nft_lookup_init [2021-11-17 13:33:03,125 INFO L130 BoogieDeclarations]: Found specification of procedure nft_delrule [2021-11-17 13:33:03,125 INFO L138 BoogieDeclarations]: Found implementation of procedure nft_delrule [2021-11-17 13:33:03,125 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2021-11-17 13:33:03,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2021-11-17 13:33:03,125 INFO L130 BoogieDeclarations]: Found specification of procedure read_pnet [2021-11-17 13:33:03,125 INFO L138 BoogieDeclarations]: Found implementation of procedure read_pnet [2021-11-17 13:33:03,125 INFO L130 BoogieDeclarations]: Found specification of procedure nft_trace_packet [2021-11-17 13:33:03,125 INFO L138 BoogieDeclarations]: Found implementation of procedure nft_trace_packet [2021-11-17 13:33:03,125 INFO L130 BoogieDeclarations]: Found specification of procedure nla_parse [2021-11-17 13:33:03,126 INFO L138 BoogieDeclarations]: Found implementation of procedure nla_parse [2021-11-17 13:33:03,126 INFO L130 BoogieDeclarations]: Found specification of procedure nfnetlink_has_listeners [2021-11-17 13:33:03,126 INFO L138 BoogieDeclarations]: Found implementation of procedure nfnetlink_has_listeners [2021-11-17 13:33:03,126 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2021-11-17 13:33:03,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2021-11-17 13:33:03,126 INFO L130 BoogieDeclarations]: Found specification of procedure nft_trans_alloc [2021-11-17 13:33:03,126 INFO L138 BoogieDeclarations]: Found implementation of procedure nft_trans_alloc [2021-11-17 13:33:03,126 INFO L130 BoogieDeclarations]: Found specification of procedure nlmsg_report [2021-11-17 13:33:03,126 INFO L138 BoogieDeclarations]: Found implementation of procedure nlmsg_report [2021-11-17 13:33:03,126 INFO L130 BoogieDeclarations]: Found specification of procedure nlmsg_msg_size [2021-11-17 13:33:03,126 INFO L138 BoogieDeclarations]: Found implementation of procedure nlmsg_msg_size [2021-11-17 13:33:03,127 INFO L130 BoogieDeclarations]: Found specification of procedure nf_tables_set_lookup_byid [2021-11-17 13:33:03,127 INFO L138 BoogieDeclarations]: Found implementation of procedure nf_tables_set_lookup_byid [2021-11-17 13:33:03,127 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_rcu [2021-11-17 13:33:03,127 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_rcu [2021-11-17 13:33:03,127 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2021-11-17 13:33:03,127 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2021-11-17 13:33:03,127 INFO L130 BoogieDeclarations]: Found specification of procedure nla_strlcpy [2021-11-17 13:33:03,127 INFO L138 BoogieDeclarations]: Found implementation of procedure nla_strlcpy [2021-11-17 13:33:03,127 INFO L130 BoogieDeclarations]: Found specification of procedure nf_tables_unregister_hooks [2021-11-17 13:33:03,127 INFO L138 BoogieDeclarations]: Found implementation of procedure nf_tables_unregister_hooks [2021-11-17 13:33:03,127 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2021-11-17 13:33:03,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2021-11-17 13:33:03,128 INFO L130 BoogieDeclarations]: Found specification of procedure nft_trans_elem_alloc [2021-11-17 13:33:03,128 INFO L138 BoogieDeclarations]: Found implementation of procedure nft_trans_elem_alloc [2021-11-17 13:33:03,128 INFO L130 BoogieDeclarations]: Found specification of procedure nft_afinfo_lookup [2021-11-17 13:33:03,129 INFO L138 BoogieDeclarations]: Found implementation of procedure nft_afinfo_lookup [2021-11-17 13:33:03,129 INFO L130 BoogieDeclarations]: Found specification of procedure nft_trans_table_add [2021-11-17 13:33:03,129 INFO L138 BoogieDeclarations]: Found implementation of procedure nft_trans_table_add [2021-11-17 13:33:03,129 INFO L130 BoogieDeclarations]: Found specification of procedure gencursor_next [2021-11-17 13:33:03,129 INFO L138 BoogieDeclarations]: Found implementation of procedure gencursor_next [2021-11-17 13:33:03,129 INFO L130 BoogieDeclarations]: Found specification of procedure u64_stats_update_begin [2021-11-17 13:33:03,129 INFO L138 BoogieDeclarations]: Found implementation of procedure u64_stats_update_begin [2021-11-17 13:33:03,129 INFO L130 BoogieDeclarations]: Found specification of procedure __alloc_percpu [2021-11-17 13:33:03,129 INFO L138 BoogieDeclarations]: Found implementation of procedure __alloc_percpu [2021-11-17 13:33:03,129 INFO L130 BoogieDeclarations]: Found specification of procedure nft_lookup_module_exit [2021-11-17 13:33:03,132 INFO L138 BoogieDeclarations]: Found implementation of procedure nft_lookup_module_exit [2021-11-17 13:33:03,132 INFO L130 BoogieDeclarations]: Found specification of procedure nf_tables_afinfo_lookup [2021-11-17 13:33:03,132 INFO L138 BoogieDeclarations]: Found implementation of procedure nf_tables_afinfo_lookup [2021-11-17 13:33:03,132 INFO L130 BoogieDeclarations]: Found specification of procedure nft_delrule_by_chain [2021-11-17 13:33:03,132 INFO L138 BoogieDeclarations]: Found implementation of procedure nft_delrule_by_chain [2021-11-17 13:33:03,132 INFO L130 BoogieDeclarations]: Found specification of procedure nla_nest_start [2021-11-17 13:33:03,132 INFO L138 BoogieDeclarations]: Found implementation of procedure nla_nest_start [2021-11-17 13:33:03,133 INFO L130 BoogieDeclarations]: Found specification of procedure nlmsg_data [2021-11-17 13:33:03,133 INFO L138 BoogieDeclarations]: Found implementation of procedure nlmsg_data [2021-11-17 13:33:03,133 INFO L130 BoogieDeclarations]: Found specification of procedure nft_expr_first [2021-11-17 13:33:03,133 INFO L138 BoogieDeclarations]: Found implementation of procedure nft_expr_first [2021-11-17 13:33:03,133 INFO L130 BoogieDeclarations]: Found specification of procedure nft_cmp_module_exit [2021-11-17 13:33:03,133 INFO L138 BoogieDeclarations]: Found implementation of procedure nft_cmp_module_exit [2021-11-17 13:33:03,133 INFO L130 BoogieDeclarations]: Found specification of procedure nft_cmp_dump [2021-11-17 13:33:03,133 INFO L138 BoogieDeclarations]: Found implementation of procedure nft_cmp_dump [2021-11-17 13:33:03,133 INFO L130 BoogieDeclarations]: Found specification of procedure nf_tables_fill_expr_info [2021-11-17 13:33:03,133 INFO L138 BoogieDeclarations]: Found implementation of procedure nf_tables_fill_expr_info [2021-11-17 13:33:03,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-17 13:33:03,134 INFO L130 BoogieDeclarations]: Found specification of procedure kfree_skb [2021-11-17 13:33:03,134 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree_skb [2021-11-17 13:33:03,134 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2021-11-17 13:33:03,134 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2021-11-17 13:33:03,134 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2021-11-17 13:33:03,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2021-11-17 13:33:03,134 INFO L130 BoogieDeclarations]: Found specification of procedure nf_unregister_hooks [2021-11-17 13:33:03,134 INFO L138 BoogieDeclarations]: Found implementation of procedure nf_unregister_hooks [2021-11-17 13:33:03,134 INFO L130 BoogieDeclarations]: Found specification of procedure nft_trans_chain_add [2021-11-17 13:33:03,134 INFO L138 BoogieDeclarations]: Found implementation of procedure nft_trans_chain_add [2021-11-17 13:33:03,135 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2021-11-17 13:33:03,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2021-11-17 13:33:03,135 INFO L130 BoogieDeclarations]: Found specification of procedure nft_delset [2021-11-17 13:33:03,135 INFO L138 BoogieDeclarations]: Found implementation of procedure nft_delset [2021-11-17 13:33:03,135 INFO L130 BoogieDeclarations]: Found specification of procedure nft_validate_input_register [2021-11-17 13:33:03,135 INFO L138 BoogieDeclarations]: Found implementation of procedure nft_validate_input_register [2021-11-17 13:33:03,135 INFO L130 BoogieDeclarations]: Found specification of procedure nlmsg_end [2021-11-17 13:33:03,135 INFO L138 BoogieDeclarations]: Found implementation of procedure nlmsg_end [2021-11-17 13:33:03,135 INFO L130 BoogieDeclarations]: Found specification of procedure nft_immediate_destroy [2021-11-17 13:33:03,135 INFO L138 BoogieDeclarations]: Found implementation of procedure nft_immediate_destroy [2021-11-17 13:33:03,136 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2021-11-17 13:33:03,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2021-11-17 13:33:03,136 INFO L130 BoogieDeclarations]: Found specification of procedure skb_network_header [2021-11-17 13:33:03,136 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_network_header [2021-11-17 13:33:03,136 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2021-11-17 13:33:03,136 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2021-11-17 13:33:03,136 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2021-11-17 13:33:03,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2021-11-17 13:33:03,136 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2021-11-17 13:33:03,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2021-11-17 13:33:03,136 INFO L130 BoogieDeclarations]: Found specification of procedure nft_immediate_validate [2021-11-17 13:33:03,137 INFO L138 BoogieDeclarations]: Found implementation of procedure nft_immediate_validate [2021-11-17 13:33:03,137 INFO L130 BoogieDeclarations]: Found specification of procedure nft_data_init [2021-11-17 13:33:03,137 INFO L138 BoogieDeclarations]: Found implementation of procedure nft_data_init [2021-11-17 13:33:03,137 INFO L130 BoogieDeclarations]: Found specification of procedure nf_tables_fill_chain_info [2021-11-17 13:33:03,137 INFO L138 BoogieDeclarations]: Found implementation of procedure nf_tables_fill_chain_info [2021-11-17 13:33:03,137 INFO L130 BoogieDeclarations]: Found specification of procedure lockdep_rcu_suspicious [2021-11-17 13:33:03,139 INFO L138 BoogieDeclarations]: Found implementation of procedure lockdep_rcu_suspicious [2021-11-17 13:33:03,140 INFO L130 BoogieDeclarations]: Found specification of procedure nf_tables_set_destroy [2021-11-17 13:33:03,140 INFO L138 BoogieDeclarations]: Found implementation of procedure nf_tables_set_destroy [2021-11-17 13:33:03,140 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab64 [2021-11-17 13:33:03,140 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab64 [2021-11-17 13:33:03,140 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2021-11-17 13:33:03,140 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2021-11-17 13:33:03,140 INFO L130 BoogieDeclarations]: Found specification of procedure nf_tables_abort [2021-11-17 13:33:03,140 INFO L138 BoogieDeclarations]: Found implementation of procedure nf_tables_abort [2021-11-17 13:33:03,140 INFO L130 BoogieDeclarations]: Found specification of procedure nf_tables_init_net [2021-11-17 13:33:03,140 INFO L138 BoogieDeclarations]: Found implementation of procedure nf_tables_init_net [2021-11-17 13:33:03,141 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2021-11-17 13:33:03,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2021-11-17 13:33:03,141 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2021-11-17 13:33:03,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2021-11-17 13:33:03,141 INFO L130 BoogieDeclarations]: Found specification of procedure nf_tables_chain_destroy [2021-11-17 13:33:03,141 INFO L138 BoogieDeclarations]: Found implementation of procedure nf_tables_chain_destroy [2021-11-17 13:33:03,141 INFO L130 BoogieDeclarations]: Found specification of procedure nft_immediate_eval [2021-11-17 13:33:03,141 INFO L138 BoogieDeclarations]: Found implementation of procedure nft_immediate_eval [2021-11-17 13:33:03,141 INFO L130 BoogieDeclarations]: Found specification of procedure nf_tables_setelem_notify [2021-11-17 13:33:03,141 INFO L138 BoogieDeclarations]: Found implementation of procedure nf_tables_setelem_notify [2021-11-17 13:33:03,141 INFO L130 BoogieDeclarations]: Found specification of procedure rcu_read_unlock [2021-11-17 13:33:03,142 INFO L138 BoogieDeclarations]: Found implementation of procedure rcu_read_unlock [2021-11-17 13:33:03,142 INFO L130 BoogieDeclarations]: Found specification of procedure nf_tables_chain_lookup [2021-11-17 13:33:03,142 INFO L138 BoogieDeclarations]: Found implementation of procedure nf_tables_chain_lookup [2021-11-17 13:33:03,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-17 13:33:03,142 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~VOID [2021-11-17 13:33:03,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~VOID [2021-11-17 13:33:03,142 INFO L130 BoogieDeclarations]: Found specification of procedure nfnetlink_send [2021-11-17 13:33:03,142 INFO L138 BoogieDeclarations]: Found implementation of procedure nfnetlink_send [2021-11-17 13:33:04,703 INFO L236 CfgBuilder]: Building ICFG [2021-11-17 13:33:04,706 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-17 13:33:04,944 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2021-11-17 13:33:16,019 INFO L277 CfgBuilder]: Performing block encoding [2021-11-17 13:33:16,044 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-17 13:33:16,045 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-11-17 13:33:16,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 01:33:16 BoogieIcfgContainer [2021-11-17 13:33:16,049 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-17 13:33:16,050 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-17 13:33:16,050 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-17 13:33:16,052 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-17 13:33:16,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 01:32:54" (1/3) ... [2021-11-17 13:33:16,053 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e599c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 01:33:16, skipping insertion in model container [2021-11-17 13:33:16,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:33:02" (2/3) ... [2021-11-17 13:33:16,053 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e599c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 01:33:16, skipping insertion in model container [2021-11-17 13:33:16,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 01:33:16" (3/3) ... [2021-11-17 13:33:16,054 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---net--netfilter--nf_tables.ko.cil.i [2021-11-17 13:33:16,057 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-17 13:33:16,057 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 31 error locations. [2021-11-17 13:33:16,096 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-17 13:33:16,100 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-17 13:33:16,100 INFO L340 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2021-11-17 13:33:16,255 INFO L276 IsEmpty]: Start isEmpty. Operand has 5655 states, 3897 states have (on average 1.3189633051064922) internal successors, (5140), 4017 states have internal predecessors, (5140), 1510 states have call successors, (1510), 217 states have call predecessors, (1510), 216 states have return successors, (1487), 1463 states have call predecessors, (1487), 1487 states have call successors, (1487) [2021-11-17 13:33:16,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-17 13:33:16,259 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:33:16,259 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:33:16,260 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2021-11-17 13:33:16,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:33:16,265 INFO L85 PathProgramCache]: Analyzing trace with hash 265404038, now seen corresponding path program 1 times [2021-11-17 13:33:16,270 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:33:16,270 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378871457] [2021-11-17 13:33:16,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:33:16,271 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:33:16,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:33:16,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:33:16,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:33:16,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-17 13:33:16,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:33:16,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-17 13:33:16,839 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:33:16,839 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378871457] [2021-11-17 13:33:16,840 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378871457] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:33:16,840 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:33:16,840 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 13:33:16,841 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796133880] [2021-11-17 13:33:16,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:33:16,844 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 13:33:16,845 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:33:16,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 13:33:16,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 13:33:16,883 INFO L87 Difference]: Start difference. First operand has 5655 states, 3897 states have (on average 1.3189633051064922) internal successors, (5140), 4017 states have internal predecessors, (5140), 1510 states have call successors, (1510), 217 states have call predecessors, (1510), 216 states have return successors, (1487), 1463 states have call predecessors, (1487), 1487 states have call successors, (1487) Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-17 13:33:18,072 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:33:23,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:33:23,085 INFO L93 Difference]: Finished difference Result 11280 states and 16603 transitions. [2021-11-17 13:33:23,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-17 13:33:23,088 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2021-11-17 13:33:23,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:33:23,137 INFO L225 Difference]: With dead ends: 11280 [2021-11-17 13:33:23,137 INFO L226 Difference]: Without dead ends: 5604 [2021-11-17 13:33:23,183 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-17 13:33:23,186 INFO L933 BasicCegarLoop]: 8056 mSDtfsCounter, 8060 mSDsluCounter, 21152 mSDsCounter, 0 mSdLazyCounter, 3009 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8064 SdHoareTripleChecker+Valid, 29208 SdHoareTripleChecker+Invalid, 3010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2021-11-17 13:33:23,188 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8064 Valid, 29208 Invalid, 3010 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1 Valid, 3009 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2021-11-17 13:33:23,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5604 states. [2021-11-17 13:33:23,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5604 to 5604. [2021-11-17 13:33:23,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5604 states, 3871 states have (on average 1.299922500645828) internal successors, (5032), 3969 states have internal predecessors, (5032), 1487 states have call successors, (1487), 216 states have call predecessors, (1487), 215 states have return successors, (1485), 1461 states have call predecessors, (1485), 1485 states have call successors, (1485) [2021-11-17 13:33:23,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5604 states to 5604 states and 8004 transitions. [2021-11-17 13:33:23,624 INFO L78 Accepts]: Start accepts. Automaton has 5604 states and 8004 transitions. Word has length 22 [2021-11-17 13:33:23,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:33:23,626 INFO L470 AbstractCegarLoop]: Abstraction has 5604 states and 8004 transitions. [2021-11-17 13:33:23,626 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-17 13:33:23,626 INFO L276 IsEmpty]: Start isEmpty. Operand 5604 states and 8004 transitions. [2021-11-17 13:33:23,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-17 13:33:23,627 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:33:23,627 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:33:23,627 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-17 13:33:23,627 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2021-11-17 13:33:23,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:33:23,630 INFO L85 PathProgramCache]: Analyzing trace with hash 265463620, now seen corresponding path program 1 times [2021-11-17 13:33:23,630 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:33:23,630 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602889666] [2021-11-17 13:33:23,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:33:23,630 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:33:23,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:33:23,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:33:23,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:33:23,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-17 13:33:23,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:33:23,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-17 13:33:23,825 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:33:23,825 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602889666] [2021-11-17 13:33:23,825 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602889666] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:33:23,825 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:33:23,825 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-17 13:33:23,825 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310947698] [2021-11-17 13:33:23,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:33:23,826 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-17 13:33:23,827 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:33:23,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-17 13:33:23,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-17 13:33:23,828 INFO L87 Difference]: Start difference. First operand 5604 states and 8004 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-17 13:33:23,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:33:23,991 INFO L93 Difference]: Finished difference Result 5604 states and 8004 transitions. [2021-11-17 13:33:23,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-17 13:33:23,991 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2021-11-17 13:33:23,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:33:24,020 INFO L225 Difference]: With dead ends: 5604 [2021-11-17 13:33:24,021 INFO L226 Difference]: Without dead ends: 5602 [2021-11-17 13:33:24,029 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-17 13:33:24,030 INFO L933 BasicCegarLoop]: 8000 mSDtfsCounter, 23 mSDsluCounter, 15978 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 23978 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-17 13:33:24,032 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 23978 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-17 13:33:24,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5602 states. [2021-11-17 13:33:24,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5602 to 5602. [2021-11-17 13:33:24,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5602 states, 3870 states have (on average 1.2997416020671835) internal successors, (5030), 3967 states have internal predecessors, (5030), 1487 states have call successors, (1487), 216 states have call predecessors, (1487), 215 states have return successors, (1485), 1461 states have call predecessors, (1485), 1485 states have call successors, (1485) [2021-11-17 13:33:24,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5602 states to 5602 states and 8002 transitions. [2021-11-17 13:33:24,221 INFO L78 Accepts]: Start accepts. Automaton has 5602 states and 8002 transitions. Word has length 22 [2021-11-17 13:33:24,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:33:24,222 INFO L470 AbstractCegarLoop]: Abstraction has 5602 states and 8002 transitions. [2021-11-17 13:33:24,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-17 13:33:24,223 INFO L276 IsEmpty]: Start isEmpty. Operand 5602 states and 8002 transitions. [2021-11-17 13:33:24,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-17 13:33:24,223 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:33:24,224 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:33:24,224 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-17 13:33:24,224 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_check_alloc_flagsErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2021-11-17 13:33:24,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:33:24,225 INFO L85 PathProgramCache]: Analyzing trace with hash 402452810, now seen corresponding path program 1 times [2021-11-17 13:33:24,225 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:33:24,225 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054315772] [2021-11-17 13:33:24,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:33:24,225 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:33:24,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:33:24,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:33:24,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:33:24,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-17 13:33:24,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:33:24,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-17 13:33:24,418 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:33:24,418 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054315772] [2021-11-17 13:33:24,418 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054315772] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:33:24,419 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:33:24,419 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-17 13:33:24,419 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128078485] [2021-11-17 13:33:24,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:33:24,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-17 13:33:24,419 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:33:24,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-17 13:33:24,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-17 13:33:24,420 INFO L87 Difference]: Start difference. First operand 5602 states and 8002 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-17 13:33:24,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:33:24,610 INFO L93 Difference]: Finished difference Result 11194 states and 16186 transitions. [2021-11-17 13:33:24,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-17 13:33:24,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2021-11-17 13:33:24,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:33:24,640 INFO L225 Difference]: With dead ends: 11194 [2021-11-17 13:33:24,641 INFO L226 Difference]: Without dead ends: 5598 [2021-11-17 13:33:24,672 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-17 13:33:24,674 INFO L933 BasicCegarLoop]: 7996 mSDtfsCounter, 7981 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7981 SdHoareTripleChecker+Valid, 7996 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-17 13:33:24,674 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7981 Valid, 7996 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-17 13:33:24,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5598 states. [2021-11-17 13:33:24,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5598 to 5598. [2021-11-17 13:33:24,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5598 states, 3867 states have (on average 1.2994569433669512) internal successors, (5025), 3963 states have internal predecessors, (5025), 1487 states have call successors, (1487), 216 states have call predecessors, (1487), 215 states have return successors, (1485), 1461 states have call predecessors, (1485), 1485 states have call successors, (1485) [2021-11-17 13:33:24,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5598 states to 5598 states and 7997 transitions. [2021-11-17 13:33:24,855 INFO L78 Accepts]: Start accepts. Automaton has 5598 states and 7997 transitions. Word has length 26 [2021-11-17 13:33:24,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:33:24,856 INFO L470 AbstractCegarLoop]: Abstraction has 5598 states and 7997 transitions. [2021-11-17 13:33:24,856 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-17 13:33:24,856 INFO L276 IsEmpty]: Start isEmpty. Operand 5598 states and 7997 transitions. [2021-11-17 13:33:24,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-11-17 13:33:24,858 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:33:24,859 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:33:24,859 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-17 13:33:24,860 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_check_for_read_sectionErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2021-11-17 13:33:24,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:33:24,860 INFO L85 PathProgramCache]: Analyzing trace with hash -784364465, now seen corresponding path program 1 times [2021-11-17 13:33:24,860 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:33:24,861 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862530535] [2021-11-17 13:33:24,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:33:24,861 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:33:24,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:33:25,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:33:25,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:33:25,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 13:33:25,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:33:25,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:33:25,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:33:25,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:33:25,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:33:25,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:33:25,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:33:25,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:33:25,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:33:25,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-11-17 13:33:25,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:33:25,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-11-17 13:33:25,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:33:25,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-17 13:33:25,259 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:33:25,259 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862530535] [2021-11-17 13:33:25,259 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862530535] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:33:25,259 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:33:25,260 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-17 13:33:25,260 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112475611] [2021-11-17 13:33:25,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:33:25,260 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-17 13:33:25,260 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:33:25,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-17 13:33:25,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-17 13:33:25,261 INFO L87 Difference]: Start difference. First operand 5598 states and 7997 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-17 13:33:27,301 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:33:41,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:33:41,445 INFO L93 Difference]: Finished difference Result 12356 states and 18146 transitions. [2021-11-17 13:33:41,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 13:33:41,446 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 61 [2021-11-17 13:33:41,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:33:41,513 INFO L225 Difference]: With dead ends: 12356 [2021-11-17 13:33:41,513 INFO L226 Difference]: Without dead ends: 12354 [2021-11-17 13:33:41,525 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-17 13:33:41,526 INFO L933 BasicCegarLoop]: 9145 mSDtfsCounter, 10405 mSDsluCounter, 19414 mSDsCounter, 0 mSdLazyCounter, 6457 mSolverCounterSat, 4559 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11694 SdHoareTripleChecker+Valid, 28559 SdHoareTripleChecker+Invalid, 11017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4559 IncrementalHoareTripleChecker+Valid, 6457 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.3s IncrementalHoareTripleChecker+Time [2021-11-17 13:33:41,527 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11694 Valid, 28559 Invalid, 11017 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4559 Valid, 6457 Invalid, 1 Unknown, 0 Unchecked, 15.3s Time] [2021-11-17 13:33:41,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12354 states. [2021-11-17 13:33:41,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12354 to 11240. [2021-11-17 13:33:41,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11240 states, 7790 states have (on average 1.3023106546854941) internal successors, (10145), 7955 states have internal predecessors, (10145), 2977 states have call successors, (2977), 427 states have call predecessors, (2977), 444 states have return successors, (3145), 2939 states have call predecessors, (3145), 2975 states have call successors, (3145) [2021-11-17 13:33:41,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11240 states to 11240 states and 16267 transitions. [2021-11-17 13:33:41,939 INFO L78 Accepts]: Start accepts. Automaton has 11240 states and 16267 transitions. Word has length 61 [2021-11-17 13:33:41,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:33:41,939 INFO L470 AbstractCegarLoop]: Abstraction has 11240 states and 16267 transitions. [2021-11-17 13:33:41,939 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-17 13:33:41,940 INFO L276 IsEmpty]: Start isEmpty. Operand 11240 states and 16267 transitions. [2021-11-17 13:33:41,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-17 13:33:41,941 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:33:41,942 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:33:41,942 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-17 13:33:41,942 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_check_for_read_sectionErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2021-11-17 13:33:41,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:33:41,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1920072173, now seen corresponding path program 1 times [2021-11-17 13:33:41,942 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:33:41,942 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492489306] [2021-11-17 13:33:41,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:33:41,942 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:33:42,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:33:42,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:33:42,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:33:42,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 13:33:42,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:33:42,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:33:42,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:33:42,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:33:42,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:33:42,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:33:42,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:33:42,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:33:42,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:33:42,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-11-17 13:33:42,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:33:42,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-11-17 13:33:42,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:33:42,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-17 13:33:42,204 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:33:42,205 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492489306] [2021-11-17 13:33:42,205 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492489306] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:33:42,205 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:33:42,205 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-17 13:33:42,205 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926025713] [2021-11-17 13:33:42,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:33:42,206 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-17 13:33:42,206 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:33:42,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-17 13:33:42,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-17 13:33:42,206 INFO L87 Difference]: Start difference. First operand 11240 states and 16267 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-17 13:33:44,250 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:33:51,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:33:51,839 INFO L93 Difference]: Finished difference Result 12296 states and 18113 transitions. [2021-11-17 13:33:51,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-17 13:33:51,839 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 64 [2021-11-17 13:33:51,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:33:51,894 INFO L225 Difference]: With dead ends: 12296 [2021-11-17 13:33:51,894 INFO L226 Difference]: Without dead ends: 12294 [2021-11-17 13:33:51,908 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-17 13:33:51,908 INFO L933 BasicCegarLoop]: 7825 mSDtfsCounter, 8776 mSDsluCounter, 10823 mSDsCounter, 0 mSdLazyCounter, 3266 mSolverCounterSat, 2894 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9779 SdHoareTripleChecker+Valid, 18648 SdHoareTripleChecker+Invalid, 6161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2894 IncrementalHoareTripleChecker+Valid, 3266 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2021-11-17 13:33:51,908 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9779 Valid, 18648 Invalid, 6161 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2894 Valid, 3266 Invalid, 1 Unknown, 0 Unchecked, 9.0s Time] [2021-11-17 13:33:51,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12294 states. [2021-11-17 13:33:52,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12294 to 11238. [2021-11-17 13:33:52,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11238 states, 7789 states have (on average 1.3020926948260367) internal successors, (10142), 7953 states have internal predecessors, (10142), 2977 states have call successors, (2977), 427 states have call predecessors, (2977), 444 states have return successors, (3145), 2939 states have call predecessors, (3145), 2975 states have call successors, (3145) [2021-11-17 13:33:52,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11238 states to 11238 states and 16264 transitions. [2021-11-17 13:33:52,300 INFO L78 Accepts]: Start accepts. Automaton has 11238 states and 16264 transitions. Word has length 64 [2021-11-17 13:33:52,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:33:52,301 INFO L470 AbstractCegarLoop]: Abstraction has 11238 states and 16264 transitions. [2021-11-17 13:33:52,301 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-17 13:33:52,301 INFO L276 IsEmpty]: Start isEmpty. Operand 11238 states and 16264 transitions. [2021-11-17 13:33:52,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-17 13:33:52,305 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:33:52,305 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:33:52,305 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-17 13:33:52,306 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_check_for_read_sectionErr2ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2021-11-17 13:33:52,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:33:52,306 INFO L85 PathProgramCache]: Analyzing trace with hash 500461083, now seen corresponding path program 1 times [2021-11-17 13:33:52,306 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:33:52,306 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971282624] [2021-11-17 13:33:52,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:33:52,307 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:33:52,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:33:52,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:33:52,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:33:52,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 13:33:52,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:33:52,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:33:52,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:33:52,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:33:52,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:33:52,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:33:52,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:33:52,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:33:52,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:33:52,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-11-17 13:33:52,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:33:52,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-11-17 13:33:52,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:33:52,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-17 13:33:52,591 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:33:52,591 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971282624] [2021-11-17 13:33:52,591 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971282624] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:33:52,592 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:33:52,592 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-17 13:33:52,592 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031620346] [2021-11-17 13:33:52,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:33:52,593 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-17 13:33:52,593 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:33:52,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-17 13:33:52,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-17 13:33:52,594 INFO L87 Difference]: Start difference. First operand 11238 states and 16264 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-17 13:33:54,631 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:34:09,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:34:09,304 INFO L93 Difference]: Finished difference Result 23947 states and 35435 transitions. [2021-11-17 13:34:09,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 13:34:09,304 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 67 [2021-11-17 13:34:09,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:34:09,403 INFO L225 Difference]: With dead ends: 23947 [2021-11-17 13:34:09,404 INFO L226 Difference]: Without dead ends: 23945 [2021-11-17 13:34:09,422 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-17 13:34:09,424 INFO L933 BasicCegarLoop]: 9459 mSDtfsCounter, 9901 mSDsluCounter, 19876 mSDsCounter, 0 mSdLazyCounter, 6452 mSolverCounterSat, 4361 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11133 SdHoareTripleChecker+Valid, 29335 SdHoareTripleChecker+Invalid, 10814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4361 IncrementalHoareTripleChecker+Valid, 6452 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.5s IncrementalHoareTripleChecker+Time [2021-11-17 13:34:09,424 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11133 Valid, 29335 Invalid, 10814 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4361 Valid, 6452 Invalid, 1 Unknown, 0 Unchecked, 15.5s Time] [2021-11-17 13:34:09,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23945 states. [2021-11-17 13:34:10,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23945 to 21764. [2021-11-17 13:34:10,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21764 states, 15095 states have (on average 1.302947996025174) internal successors, (19668), 15396 states have internal predecessors, (19668), 5784 states have call successors, (5784), 806 states have call predecessors, (5784), 857 states have return successors, (6399), 5715 states have call predecessors, (6399), 5782 states have call successors, (6399) [2021-11-17 13:34:10,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21764 states to 21764 states and 31851 transitions. [2021-11-17 13:34:10,250 INFO L78 Accepts]: Start accepts. Automaton has 21764 states and 31851 transitions. Word has length 67 [2021-11-17 13:34:10,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:34:10,252 INFO L470 AbstractCegarLoop]: Abstraction has 21764 states and 31851 transitions. [2021-11-17 13:34:10,252 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-17 13:34:10,252 INFO L276 IsEmpty]: Start isEmpty. Operand 21764 states and 31851 transitions. [2021-11-17 13:34:10,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-17 13:34:10,255 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:34:10,255 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:34:10,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-17 13:34:10,255 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_check_for_read_sectionErr3ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2021-11-17 13:34:10,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:34:10,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1409454521, now seen corresponding path program 1 times [2021-11-17 13:34:10,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:34:10,256 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357237864] [2021-11-17 13:34:10,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:34:10,256 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:34:10,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:34:10,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:34:10,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:34:10,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 13:34:10,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:34:10,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:34:10,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:34:10,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:34:10,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:34:10,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:34:10,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:34:10,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:34:10,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:34:10,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-11-17 13:34:10,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:34:10,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-11-17 13:34:10,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:34:10,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-17 13:34:10,477 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:34:10,477 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357237864] [2021-11-17 13:34:10,477 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357237864] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:34:10,478 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:34:10,478 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-17 13:34:10,478 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391472399] [2021-11-17 13:34:10,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:34:10,478 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-17 13:34:10,478 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:34:10,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-17 13:34:10,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-17 13:34:10,479 INFO L87 Difference]: Start difference. First operand 21764 states and 31851 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-17 13:34:12,518 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:34:19,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:34:19,305 INFO L93 Difference]: Finished difference Result 23638 states and 35103 transitions. [2021-11-17 13:34:19,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-17 13:34:19,305 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 70 [2021-11-17 13:34:19,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:34:19,427 INFO L225 Difference]: With dead ends: 23638 [2021-11-17 13:34:19,427 INFO L226 Difference]: Without dead ends: 23636 [2021-11-17 13:34:19,460 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-17 13:34:19,462 INFO L933 BasicCegarLoop]: 7800 mSDtfsCounter, 8766 mSDsluCounter, 10794 mSDsCounter, 0 mSdLazyCounter, 3272 mSolverCounterSat, 2909 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9775 SdHoareTripleChecker+Valid, 18594 SdHoareTripleChecker+Invalid, 6182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2909 IncrementalHoareTripleChecker+Valid, 3272 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2021-11-17 13:34:19,462 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9775 Valid, 18594 Invalid, 6182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2909 Valid, 3272 Invalid, 1 Unknown, 0 Unchecked, 8.0s Time] [2021-11-17 13:34:19,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23636 states. [2021-11-17 13:34:20,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23636 to 21762. [2021-11-17 13:34:20,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21762 states, 15094 states have (on average 1.3027030608188683) internal successors, (19663), 15394 states have internal predecessors, (19663), 5784 states have call successors, (5784), 806 states have call predecessors, (5784), 857 states have return successors, (6399), 5715 states have call predecessors, (6399), 5782 states have call successors, (6399) [2021-11-17 13:34:20,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21762 states to 21762 states and 31846 transitions. [2021-11-17 13:34:20,407 INFO L78 Accepts]: Start accepts. Automaton has 21762 states and 31846 transitions. Word has length 70 [2021-11-17 13:34:20,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:34:20,407 INFO L470 AbstractCegarLoop]: Abstraction has 21762 states and 31846 transitions. [2021-11-17 13:34:20,407 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-17 13:34:20,407 INFO L276 IsEmpty]: Start isEmpty. Operand 21762 states and 31846 transitions. [2021-11-17 13:34:20,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-11-17 13:34:20,409 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:34:20,409 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:34:20,409 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-17 13:34:20,409 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2021-11-17 13:34:20,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:34:20,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1459220821, now seen corresponding path program 1 times [2021-11-17 13:34:20,410 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:34:20,410 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062594874] [2021-11-17 13:34:20,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:34:20,410 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:34:20,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:34:20,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:34:20,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:34:20,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 13:34:20,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:34:20,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:34:20,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:34:20,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:34:20,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:34:20,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:34:20,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:34:20,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:34:20,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:34:20,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-11-17 13:34:20,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:34:20,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-17 13:34:20,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:34:20,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 13:34:20,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:34:20,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-11-17 13:34:20,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:34:20,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:34:20,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:34:20,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 13:34:20,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:34:20,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-17 13:34:20,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:34:20,686 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-17 13:34:20,686 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:34:20,686 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062594874] [2021-11-17 13:34:20,686 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062594874] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:34:20,686 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:34:20,686 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 13:34:20,687 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157838545] [2021-11-17 13:34:20,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:34:20,687 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 13:34:20,687 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:34:20,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 13:34:20,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-17 13:34:20,688 INFO L87 Difference]: Start difference. First operand 21762 states and 31846 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2021-11-17 13:34:22,737 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 13:34:24,836 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 13:34:26,938 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 13:34:42,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:34:42,286 INFO L93 Difference]: Finished difference Result 23636 states and 35098 transitions. [2021-11-17 13:34:42,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-17 13:34:42,286 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 88 [2021-11-17 13:34:42,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:34:42,367 INFO L225 Difference]: With dead ends: 23636 [2021-11-17 13:34:42,368 INFO L226 Difference]: Without dead ends: 23634 [2021-11-17 13:34:42,383 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-11-17 13:34:42,384 INFO L933 BasicCegarLoop]: 7208 mSDtfsCounter, 14476 mSDsluCounter, 10694 mSDsCounter, 0 mSdLazyCounter, 9510 mSolverCounterSat, 9801 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15211 SdHoareTripleChecker+Valid, 17902 SdHoareTripleChecker+Invalid, 19314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 9801 IncrementalHoareTripleChecker+Valid, 9510 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.5s IncrementalHoareTripleChecker+Time [2021-11-17 13:34:42,384 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15211 Valid, 17902 Invalid, 19314 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [9801 Valid, 9510 Invalid, 3 Unknown, 0 Unchecked, 20.5s Time] [2021-11-17 13:34:42,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23634 states. [2021-11-17 13:34:43,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23634 to 21760. [2021-11-17 13:34:43,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21760 states, 15093 states have (on average 1.3025906049161864) internal successors, (19660), 15392 states have internal predecessors, (19660), 5784 states have call successors, (5784), 806 states have call predecessors, (5784), 857 states have return successors, (6399), 5715 states have call predecessors, (6399), 5782 states have call successors, (6399) [2021-11-17 13:34:43,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21760 states to 21760 states and 31843 transitions. [2021-11-17 13:34:43,255 INFO L78 Accepts]: Start accepts. Automaton has 21760 states and 31843 transitions. Word has length 88 [2021-11-17 13:34:43,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:34:43,256 INFO L470 AbstractCegarLoop]: Abstraction has 21760 states and 31843 transitions. [2021-11-17 13:34:43,256 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2021-11-17 13:34:43,256 INFO L276 IsEmpty]: Start isEmpty. Operand 21760 states and 31843 transitions. [2021-11-17 13:34:43,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-11-17 13:34:43,257 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:34:43,257 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:34:43,257 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-17 13:34:43,257 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_linux_block_genhd_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2021-11-17 13:34:43,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:34:43,258 INFO L85 PathProgramCache]: Analyzing trace with hash -2018466414, now seen corresponding path program 1 times [2021-11-17 13:34:43,258 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:34:43,258 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880560394] [2021-11-17 13:34:43,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:34:43,258 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:34:43,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:34:43,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:34:43,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:34:43,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 13:34:43,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:34:43,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:34:43,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:34:43,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:34:43,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:34:43,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:34:43,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:34:43,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:34:43,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:34:43,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-11-17 13:34:43,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:34:43,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-17 13:34:43,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:34:43,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 13:34:43,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:34:43,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-11-17 13:34:43,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:34:43,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:34:43,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:34:43,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 13:34:43,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:34:43,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-17 13:34:43,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:34:43,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-17 13:34:43,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:34:43,670 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-17 13:34:43,670 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:34:43,670 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880560394] [2021-11-17 13:34:43,671 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880560394] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:34:43,671 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:34:43,671 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 13:34:43,671 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641183704] [2021-11-17 13:34:43,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:34:43,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 13:34:43,672 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:34:43,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 13:34:43,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-17 13:34:43,673 INFO L87 Difference]: Start difference. First operand 21760 states and 31843 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-17 13:34:45,710 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:34:47,819 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:34:49,939 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:35:05,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:35:05,507 INFO L93 Difference]: Finished difference Result 23634 states and 35095 transitions. [2021-11-17 13:35:05,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-17 13:35:05,508 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 94 [2021-11-17 13:35:05,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:35:05,601 INFO L225 Difference]: With dead ends: 23634 [2021-11-17 13:35:05,601 INFO L226 Difference]: Without dead ends: 23632 [2021-11-17 13:35:05,620 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-11-17 13:35:05,621 INFO L933 BasicCegarLoop]: 7221 mSDtfsCounter, 14435 mSDsluCounter, 10697 mSDsCounter, 0 mSdLazyCounter, 9516 mSolverCounterSat, 9784 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15170 SdHoareTripleChecker+Valid, 17918 SdHoareTripleChecker+Invalid, 19303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 9784 IncrementalHoareTripleChecker+Valid, 9516 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.5s IncrementalHoareTripleChecker+Time [2021-11-17 13:35:05,621 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15170 Valid, 17918 Invalid, 19303 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [9784 Valid, 9516 Invalid, 3 Unknown, 0 Unchecked, 20.5s Time] [2021-11-17 13:35:05,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23632 states. [2021-11-17 13:35:06,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23632 to 21758. [2021-11-17 13:35:06,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21758 states, 15092 states have (on average 1.3024781341107872) internal successors, (19657), 15390 states have internal predecessors, (19657), 5784 states have call successors, (5784), 806 states have call predecessors, (5784), 857 states have return successors, (6399), 5715 states have call predecessors, (6399), 5782 states have call successors, (6399) [2021-11-17 13:35:06,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21758 states to 21758 states and 31840 transitions. [2021-11-17 13:35:06,481 INFO L78 Accepts]: Start accepts. Automaton has 21758 states and 31840 transitions. Word has length 94 [2021-11-17 13:35:06,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:35:06,481 INFO L470 AbstractCegarLoop]: Abstraction has 21758 states and 31840 transitions. [2021-11-17 13:35:06,481 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-17 13:35:06,481 INFO L276 IsEmpty]: Start isEmpty. Operand 21758 states and 31840 transitions. [2021-11-17 13:35:06,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-11-17 13:35:06,482 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:35:06,482 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:35:06,483 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-17 13:35:06,483 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2021-11-17 13:35:06,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:35:06,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1540532965, now seen corresponding path program 1 times [2021-11-17 13:35:06,483 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:35:06,483 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567099761] [2021-11-17 13:35:06,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:35:06,484 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:35:06,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:35:06,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:35:06,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:35:06,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 13:35:06,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:35:06,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:35:06,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:35:06,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:35:06,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:35:06,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:35:06,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:35:06,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:35:06,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:35:06,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-11-17 13:35:06,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:35:06,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-17 13:35:06,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:35:06,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 13:35:06,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:35:06,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-11-17 13:35:06,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:35:06,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:35:06,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:35:06,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 13:35:06,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:35:06,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-17 13:35:06,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:35:06,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-17 13:35:06,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:35:06,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-17 13:35:06,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:35:06,781 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-17 13:35:06,781 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:35:06,781 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567099761] [2021-11-17 13:35:06,782 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567099761] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:35:06,782 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:35:06,782 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 13:35:06,782 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507122068] [2021-11-17 13:35:06,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:35:06,782 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 13:35:06,783 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:35:06,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 13:35:06,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-17 13:35:06,783 INFO L87 Difference]: Start difference. First operand 21758 states and 31840 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-17 13:35:08,834 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 13:35:10,949 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:35:26,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:35:26,667 INFO L93 Difference]: Finished difference Result 23632 states and 35092 transitions. [2021-11-17 13:35:26,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-17 13:35:26,668 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 100 [2021-11-17 13:35:26,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:35:26,745 INFO L225 Difference]: With dead ends: 23632 [2021-11-17 13:35:26,745 INFO L226 Difference]: Without dead ends: 23630 [2021-11-17 13:35:26,761 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-11-17 13:35:26,761 INFO L933 BasicCegarLoop]: 7234 mSDtfsCounter, 14403 mSDsluCounter, 10708 mSDsCounter, 0 mSdLazyCounter, 9526 mSolverCounterSat, 9775 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15133 SdHoareTripleChecker+Valid, 17942 SdHoareTripleChecker+Invalid, 19303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 9775 IncrementalHoareTripleChecker+Valid, 9526 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.7s IncrementalHoareTripleChecker+Time [2021-11-17 13:35:26,761 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15133 Valid, 17942 Invalid, 19303 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [9775 Valid, 9526 Invalid, 2 Unknown, 0 Unchecked, 18.7s Time] [2021-11-17 13:35:26,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23630 states. [2021-11-17 13:35:27,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23630 to 21756. [2021-11-17 13:35:27,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21756 states, 15091 states have (on average 1.3023656483997084) internal successors, (19654), 15388 states have internal predecessors, (19654), 5784 states have call successors, (5784), 806 states have call predecessors, (5784), 857 states have return successors, (6399), 5715 states have call predecessors, (6399), 5782 states have call successors, (6399) [2021-11-17 13:35:27,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21756 states to 21756 states and 31837 transitions. [2021-11-17 13:35:27,628 INFO L78 Accepts]: Start accepts. Automaton has 21756 states and 31837 transitions. Word has length 100 [2021-11-17 13:35:27,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:35:27,629 INFO L470 AbstractCegarLoop]: Abstraction has 21756 states and 31837 transitions. [2021-11-17 13:35:27,629 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-17 13:35:27,629 INFO L276 IsEmpty]: Start isEmpty. Operand 21756 states and 31837 transitions. [2021-11-17 13:35:27,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-11-17 13:35:27,630 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:35:27,630 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:35:27,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-17 13:35:27,631 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2021-11-17 13:35:27,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:35:27,631 INFO L85 PathProgramCache]: Analyzing trace with hash 567460645, now seen corresponding path program 1 times [2021-11-17 13:35:27,631 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:35:27,631 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151032952] [2021-11-17 13:35:27,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:35:27,632 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:35:27,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:35:27,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:35:27,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:35:27,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 13:35:27,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:35:27,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:35:27,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:35:27,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:35:27,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:35:27,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:35:27,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:35:27,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:35:27,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:35:27,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-11-17 13:35:27,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:35:27,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-17 13:35:27,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:35:27,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 13:35:27,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:35:27,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-11-17 13:35:27,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:35:27,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:35:27,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:35:27,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 13:35:27,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:35:27,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-17 13:35:27,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:35:27,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-17 13:35:27,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:35:27,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-17 13:35:27,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:35:27,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-17 13:35:27,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:35:27,931 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-17 13:35:27,931 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:35:27,931 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151032952] [2021-11-17 13:35:27,931 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151032952] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:35:27,931 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:35:27,932 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 13:35:27,932 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351425425] [2021-11-17 13:35:27,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:35:27,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 13:35:27,932 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:35:27,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 13:35:27,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-17 13:35:27,933 INFO L87 Difference]: Start difference. First operand 21756 states and 31837 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-17 13:35:29,972 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:35:32,116 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:35:34,260 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:35:51,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:35:51,012 INFO L93 Difference]: Finished difference Result 23630 states and 35089 transitions. [2021-11-17 13:35:51,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-17 13:35:51,013 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 106 [2021-11-17 13:35:51,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:35:51,148 INFO L225 Difference]: With dead ends: 23630 [2021-11-17 13:35:51,148 INFO L226 Difference]: Without dead ends: 23628 [2021-11-17 13:35:51,157 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-11-17 13:35:51,157 INFO L933 BasicCegarLoop]: 7223 mSDtfsCounter, 14392 mSDsluCounter, 10691 mSDsCounter, 0 mSdLazyCounter, 9527 mSolverCounterSat, 9769 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15128 SdHoareTripleChecker+Valid, 17914 SdHoareTripleChecker+Invalid, 19299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 9769 IncrementalHoareTripleChecker+Valid, 9527 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.7s IncrementalHoareTripleChecker+Time [2021-11-17 13:35:51,157 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15128 Valid, 17914 Invalid, 19299 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [9769 Valid, 9527 Invalid, 3 Unknown, 0 Unchecked, 21.7s Time] [2021-11-17 13:35:51,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23628 states. [2021-11-17 13:35:51,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23628 to 21754. [2021-11-17 13:35:51,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21754 states, 15090 states have (on average 1.3022531477799868) internal successors, (19651), 15386 states have internal predecessors, (19651), 5784 states have call successors, (5784), 806 states have call predecessors, (5784), 857 states have return successors, (6399), 5715 states have call predecessors, (6399), 5782 states have call successors, (6399) [2021-11-17 13:35:52,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21754 states to 21754 states and 31834 transitions. [2021-11-17 13:35:52,152 INFO L78 Accepts]: Start accepts. Automaton has 21754 states and 31834 transitions. Word has length 106 [2021-11-17 13:35:52,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:35:52,153 INFO L470 AbstractCegarLoop]: Abstraction has 21754 states and 31834 transitions. [2021-11-17 13:35:52,153 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-17 13:35:52,153 INFO L276 IsEmpty]: Start isEmpty. Operand 21754 states and 31834 transitions. [2021-11-17 13:35:52,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-11-17 13:35:52,161 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:35:52,161 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:35:52,162 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-17 13:35:52,162 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2021-11-17 13:35:52,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:35:52,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1123283772, now seen corresponding path program 1 times [2021-11-17 13:35:52,175 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:35:52,175 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914530652] [2021-11-17 13:35:52,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:35:52,175 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:35:52,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:35:52,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:35:52,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:35:52,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 13:35:52,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:35:52,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:35:52,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:35:52,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:35:52,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:35:52,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:35:52,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:35:52,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:35:52,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:35:52,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-11-17 13:35:52,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:35:52,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-17 13:35:52,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:35:52,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 13:35:52,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:35:52,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-11-17 13:35:52,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:35:52,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:35:52,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:35:52,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 13:35:52,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:35:52,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-17 13:35:52,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:35:52,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-17 13:35:52,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:35:52,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-17 13:35:52,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:35:52,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-17 13:35:52,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:35:52,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 13:35:52,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:35:52,474 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-17 13:35:52,475 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:35:52,475 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914530652] [2021-11-17 13:35:52,475 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914530652] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:35:52,475 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:35:52,475 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 13:35:52,475 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032079748] [2021-11-17 13:35:52,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:35:52,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 13:35:52,476 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:35:52,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 13:35:52,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-17 13:35:52,477 INFO L87 Difference]: Start difference. First operand 21754 states and 31834 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (18), 5 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2021-11-17 13:35:54,537 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 13:35:56,695 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:35:58,850 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:36:14,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:36:14,346 INFO L93 Difference]: Finished difference Result 23628 states and 35086 transitions. [2021-11-17 13:36:14,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-17 13:36:14,347 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (18), 5 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 112 [2021-11-17 13:36:14,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:36:14,446 INFO L225 Difference]: With dead ends: 23628 [2021-11-17 13:36:14,446 INFO L226 Difference]: Without dead ends: 23626 [2021-11-17 13:36:14,463 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-11-17 13:36:14,464 INFO L933 BasicCegarLoop]: 7178 mSDtfsCounter, 14504 mSDsluCounter, 10696 mSDsCounter, 0 mSdLazyCounter, 9487 mSolverCounterSat, 9831 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15231 SdHoareTripleChecker+Valid, 17874 SdHoareTripleChecker+Invalid, 19321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 9831 IncrementalHoareTripleChecker+Valid, 9487 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.6s IncrementalHoareTripleChecker+Time [2021-11-17 13:36:14,464 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15231 Valid, 17874 Invalid, 19321 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [9831 Valid, 9487 Invalid, 3 Unknown, 0 Unchecked, 20.6s Time] [2021-11-17 13:36:14,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23626 states. [2021-11-17 13:36:15,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23626 to 21752. [2021-11-17 13:36:15,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21752 states, 15089 states have (on average 1.302140632248658) internal successors, (19648), 15384 states have internal predecessors, (19648), 5784 states have call successors, (5784), 806 states have call predecessors, (5784), 857 states have return successors, (6399), 5715 states have call predecessors, (6399), 5782 states have call successors, (6399) [2021-11-17 13:36:15,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21752 states to 21752 states and 31831 transitions. [2021-11-17 13:36:15,550 INFO L78 Accepts]: Start accepts. Automaton has 21752 states and 31831 transitions. Word has length 112 [2021-11-17 13:36:15,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:36:15,551 INFO L470 AbstractCegarLoop]: Abstraction has 21752 states and 31831 transitions. [2021-11-17 13:36:15,551 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (18), 5 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2021-11-17 13:36:15,551 INFO L276 IsEmpty]: Start isEmpty. Operand 21752 states and 31831 transitions. [2021-11-17 13:36:15,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-11-17 13:36:15,554 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:36:15,571 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:36:15,571 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-17 13:36:15,572 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2021-11-17 13:36:15,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:36:15,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1943067699, now seen corresponding path program 1 times [2021-11-17 13:36:15,572 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:36:15,572 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812917195] [2021-11-17 13:36:15,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:36:15,572 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:36:15,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:36:15,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:36:15,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:36:15,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 13:36:15,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:36:15,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:36:15,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:36:15,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:36:15,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:36:15,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:36:15,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:36:15,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:36:15,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:36:15,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-11-17 13:36:15,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:36:15,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-17 13:36:15,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:36:15,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 13:36:15,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:36:15,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-11-17 13:36:15,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:36:16,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:36:16,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:36:16,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 13:36:16,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:36:16,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-17 13:36:16,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:36:16,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-17 13:36:16,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:36:16,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-17 13:36:16,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:36:16,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-17 13:36:16,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:36:16,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 13:36:16,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:36:16,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-11-17 13:36:16,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:36:16,117 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-17 13:36:16,118 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:36:16,118 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812917195] [2021-11-17 13:36:16,118 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812917195] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:36:16,118 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:36:16,118 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 13:36:16,118 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218249933] [2021-11-17 13:36:16,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:36:16,119 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 13:36:16,119 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:36:16,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 13:36:16,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-17 13:36:16,119 INFO L87 Difference]: Start difference. First operand 21752 states and 31831 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2021-11-17 13:36:18,174 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 13:36:20,240 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:36:22,444 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:36:39,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:36:39,788 INFO L93 Difference]: Finished difference Result 23626 states and 35083 transitions. [2021-11-17 13:36:39,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-17 13:36:39,789 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (19), 5 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 118 [2021-11-17 13:36:39,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:36:39,862 INFO L225 Difference]: With dead ends: 23626 [2021-11-17 13:36:39,862 INFO L226 Difference]: Without dead ends: 23624 [2021-11-17 13:36:39,876 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-11-17 13:36:39,877 INFO L933 BasicCegarLoop]: 7213 mSDtfsCounter, 14385 mSDsluCounter, 10686 mSDsCounter, 0 mSdLazyCounter, 9509 mSolverCounterSat, 9779 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15121 SdHoareTripleChecker+Valid, 17899 SdHoareTripleChecker+Invalid, 19290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 9779 IncrementalHoareTripleChecker+Valid, 9509 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.2s IncrementalHoareTripleChecker+Time [2021-11-17 13:36:39,877 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15121 Valid, 17899 Invalid, 19290 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [9779 Valid, 9509 Invalid, 2 Unknown, 0 Unchecked, 22.2s Time] [2021-11-17 13:36:39,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23624 states. [2021-11-17 13:36:40,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23624 to 21750. [2021-11-17 13:36:40,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21750 states, 15088 states have (on average 1.302028101802757) internal successors, (19645), 15382 states have internal predecessors, (19645), 5784 states have call successors, (5784), 806 states have call predecessors, (5784), 857 states have return successors, (6399), 5715 states have call predecessors, (6399), 5782 states have call successors, (6399) [2021-11-17 13:36:40,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21750 states to 21750 states and 31828 transitions. [2021-11-17 13:36:40,806 INFO L78 Accepts]: Start accepts. Automaton has 21750 states and 31828 transitions. Word has length 118 [2021-11-17 13:36:40,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:36:40,806 INFO L470 AbstractCegarLoop]: Abstraction has 21750 states and 31828 transitions. [2021-11-17 13:36:40,806 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2021-11-17 13:36:40,806 INFO L276 IsEmpty]: Start isEmpty. Operand 21750 states and 31828 transitions. [2021-11-17 13:36:40,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-11-17 13:36:40,807 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:36:40,808 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:36:40,808 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-17 13:36:40,808 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2021-11-17 13:36:40,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:36:40,808 INFO L85 PathProgramCache]: Analyzing trace with hash -421768288, now seen corresponding path program 1 times [2021-11-17 13:36:40,808 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:36:40,808 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806631398] [2021-11-17 13:36:40,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:36:40,809 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:36:40,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:36:40,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:36:40,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:36:40,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 13:36:40,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:36:40,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:36:40,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:36:40,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:36:40,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:36:40,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:36:40,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:36:40,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:36:40,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:36:40,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-11-17 13:36:40,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:36:40,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-17 13:36:40,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:36:40,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 13:36:41,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:36:41,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-11-17 13:36:41,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:36:41,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:36:41,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:36:41,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 13:36:41,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:36:41,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-17 13:36:41,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:36:41,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-17 13:36:41,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:36:41,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-17 13:36:41,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:36:41,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-17 13:36:41,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:36:41,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 13:36:41,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:36:41,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-11-17 13:36:41,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:36:41,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-11-17 13:36:41,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:36:41,081 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-17 13:36:41,081 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:36:41,082 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806631398] [2021-11-17 13:36:41,082 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806631398] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:36:41,082 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:36:41,082 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 13:36:41,082 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418480107] [2021-11-17 13:36:41,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:36:41,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 13:36:41,083 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:36:41,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 13:36:41,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-17 13:36:41,083 INFO L87 Difference]: Start difference. First operand 21750 states and 31828 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2021-11-17 13:36:43,122 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:36:45,304 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:36:47,483 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:37:04,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:37:04,158 INFO L93 Difference]: Finished difference Result 23624 states and 35080 transitions. [2021-11-17 13:37:04,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-17 13:37:04,158 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (20), 5 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 124 [2021-11-17 13:37:04,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:37:04,233 INFO L225 Difference]: With dead ends: 23624 [2021-11-17 13:37:04,233 INFO L226 Difference]: Without dead ends: 23622 [2021-11-17 13:37:04,249 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-11-17 13:37:04,250 INFO L933 BasicCegarLoop]: 7174 mSDtfsCounter, 14464 mSDsluCounter, 10679 mSDsCounter, 0 mSdLazyCounter, 9473 mSolverCounterSat, 9827 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15198 SdHoareTripleChecker+Valid, 17853 SdHoareTripleChecker+Invalid, 19303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 9827 IncrementalHoareTripleChecker+Valid, 9473 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.7s IncrementalHoareTripleChecker+Time [2021-11-17 13:37:04,250 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15198 Valid, 17853 Invalid, 19303 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [9827 Valid, 9473 Invalid, 3 Unknown, 0 Unchecked, 21.7s Time] [2021-11-17 13:37:04,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23622 states. [2021-11-17 13:37:05,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23622 to 21748. [2021-11-17 13:37:05,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21748 states, 15087 states have (on average 1.3019155564393186) internal successors, (19642), 15380 states have internal predecessors, (19642), 5784 states have call successors, (5784), 806 states have call predecessors, (5784), 857 states have return successors, (6399), 5715 states have call predecessors, (6399), 5782 states have call successors, (6399) [2021-11-17 13:37:05,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21748 states to 21748 states and 31825 transitions. [2021-11-17 13:37:05,202 INFO L78 Accepts]: Start accepts. Automaton has 21748 states and 31825 transitions. Word has length 124 [2021-11-17 13:37:05,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:37:05,202 INFO L470 AbstractCegarLoop]: Abstraction has 21748 states and 31825 transitions. [2021-11-17 13:37:05,203 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2021-11-17 13:37:05,203 INFO L276 IsEmpty]: Start isEmpty. Operand 21748 states and 31825 transitions. [2021-11-17 13:37:05,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-11-17 13:37:05,204 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:37:05,204 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:37:05,204 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-17 13:37:05,205 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2021-11-17 13:37:05,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:37:05,205 INFO L85 PathProgramCache]: Analyzing trace with hash -767396784, now seen corresponding path program 1 times [2021-11-17 13:37:05,205 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:37:05,205 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856882346] [2021-11-17 13:37:05,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:37:05,205 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:37:05,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:05,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:37:05,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:05,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 13:37:05,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:05,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:37:05,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:05,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:37:05,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:05,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:37:05,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:05,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:37:05,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:05,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-11-17 13:37:05,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:05,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-17 13:37:05,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:05,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 13:37:05,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:05,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-11-17 13:37:05,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:05,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:37:05,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:05,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 13:37:05,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:05,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-17 13:37:05,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:05,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-17 13:37:05,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:05,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-17 13:37:05,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:05,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-17 13:37:05,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:05,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 13:37:05,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:05,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-11-17 13:37:05,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:05,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-11-17 13:37:05,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:05,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-11-17 13:37:05,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:05,491 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-17 13:37:05,492 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:37:05,492 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856882346] [2021-11-17 13:37:05,492 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856882346] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:37:05,492 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:37:05,492 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 13:37:05,492 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89378816] [2021-11-17 13:37:05,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:37:05,493 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 13:37:05,493 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:37:05,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 13:37:05,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-17 13:37:05,493 INFO L87 Difference]: Start difference. First operand 21748 states and 31825 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2021-11-17 13:37:07,532 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:37:09,717 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:37:11,938 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:37:29,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:37:29,025 INFO L93 Difference]: Finished difference Result 23622 states and 35077 transitions. [2021-11-17 13:37:29,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-17 13:37:29,026 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (21), 5 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 130 [2021-11-17 13:37:29,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:37:29,094 INFO L225 Difference]: With dead ends: 23622 [2021-11-17 13:37:29,095 INFO L226 Difference]: Without dead ends: 23620 [2021-11-17 13:37:29,108 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-11-17 13:37:29,109 INFO L933 BasicCegarLoop]: 7185 mSDtfsCounter, 14442 mSDsluCounter, 10691 mSDsCounter, 0 mSdLazyCounter, 9479 mSolverCounterSat, 9822 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15170 SdHoareTripleChecker+Valid, 17876 SdHoareTripleChecker+Invalid, 19304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 9822 IncrementalHoareTripleChecker+Valid, 9479 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.1s IncrementalHoareTripleChecker+Time [2021-11-17 13:37:29,109 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15170 Valid, 17876 Invalid, 19304 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [9822 Valid, 9479 Invalid, 3 Unknown, 0 Unchecked, 22.1s Time] [2021-11-17 13:37:29,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23620 states. [2021-11-17 13:37:29,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23620 to 21746. [2021-11-17 13:37:29,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21746 states, 15086 states have (on average 1.3018029961553759) internal successors, (19639), 15378 states have internal predecessors, (19639), 5784 states have call successors, (5784), 806 states have call predecessors, (5784), 857 states have return successors, (6399), 5715 states have call predecessors, (6399), 5782 states have call successors, (6399) [2021-11-17 13:37:30,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21746 states to 21746 states and 31822 transitions. [2021-11-17 13:37:30,163 INFO L78 Accepts]: Start accepts. Automaton has 21746 states and 31822 transitions. Word has length 130 [2021-11-17 13:37:30,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:37:30,163 INFO L470 AbstractCegarLoop]: Abstraction has 21746 states and 31822 transitions. [2021-11-17 13:37:30,163 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2021-11-17 13:37:30,164 INFO L276 IsEmpty]: Start isEmpty. Operand 21746 states and 31822 transitions. [2021-11-17 13:37:30,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2021-11-17 13:37:30,165 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:37:30,165 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:37:30,165 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-17 13:37:30,165 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2021-11-17 13:37:30,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:37:30,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1266277779, now seen corresponding path program 1 times [2021-11-17 13:37:30,166 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:37:30,166 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117404277] [2021-11-17 13:37:30,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:37:30,166 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:37:30,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:30,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:37:30,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:30,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 13:37:30,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:30,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:37:30,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:30,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:37:30,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:30,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:37:30,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:30,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:37:30,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:30,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-11-17 13:37:30,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:30,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-17 13:37:30,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:30,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 13:37:30,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:30,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-11-17 13:37:30,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:30,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:37:30,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:30,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 13:37:30,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:30,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-17 13:37:30,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:30,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-17 13:37:30,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:30,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-17 13:37:30,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:30,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-17 13:37:30,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:30,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 13:37:30,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:30,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-11-17 13:37:30,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:30,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-11-17 13:37:30,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:30,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-11-17 13:37:30,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:30,448 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-17 13:37:30,448 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:37:30,449 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117404277] [2021-11-17 13:37:30,450 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117404277] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:37:30,450 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:37:30,450 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 13:37:30,450 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117110542] [2021-11-17 13:37:30,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:37:30,451 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 13:37:30,451 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:37:30,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 13:37:30,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-17 13:37:30,452 INFO L87 Difference]: Start difference. First operand 21746 states and 31822 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2021-11-17 13:37:32,493 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:37:34,719 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:37:36,953 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:37:54,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:37:54,064 INFO L93 Difference]: Finished difference Result 23620 states and 35074 transitions. [2021-11-17 13:37:54,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-17 13:37:54,065 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 132 [2021-11-17 13:37:54,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:37:54,123 INFO L225 Difference]: With dead ends: 23620 [2021-11-17 13:37:54,124 INFO L226 Difference]: Without dead ends: 23618 [2021-11-17 13:37:54,132 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-11-17 13:37:54,132 INFO L933 BasicCegarLoop]: 7189 mSDtfsCounter, 14416 mSDsluCounter, 10693 mSDsCounter, 0 mSdLazyCounter, 9495 mSolverCounterSat, 9805 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15144 SdHoareTripleChecker+Valid, 17882 SdHoareTripleChecker+Invalid, 19303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 9805 IncrementalHoareTripleChecker+Valid, 9495 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.0s IncrementalHoareTripleChecker+Time [2021-11-17 13:37:54,132 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15144 Valid, 17882 Invalid, 19303 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [9805 Valid, 9495 Invalid, 3 Unknown, 0 Unchecked, 22.0s Time] [2021-11-17 13:37:54,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23618 states. [2021-11-17 13:37:54,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23618 to 21744. [2021-11-17 13:37:54,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21744 states, 15085 states have (on average 1.3016904209479616) internal successors, (19636), 15376 states have internal predecessors, (19636), 5784 states have call successors, (5784), 806 states have call predecessors, (5784), 857 states have return successors, (6399), 5715 states have call predecessors, (6399), 5782 states have call successors, (6399) [2021-11-17 13:37:55,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21744 states to 21744 states and 31819 transitions. [2021-11-17 13:37:55,169 INFO L78 Accepts]: Start accepts. Automaton has 21744 states and 31819 transitions. Word has length 132 [2021-11-17 13:37:55,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:37:55,170 INFO L470 AbstractCegarLoop]: Abstraction has 21744 states and 31819 transitions. [2021-11-17 13:37:55,170 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2021-11-17 13:37:55,170 INFO L276 IsEmpty]: Start isEmpty. Operand 21744 states and 31819 transitions. [2021-11-17 13:37:55,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-11-17 13:37:55,171 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:37:55,172 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:37:55,172 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-17 13:37:55,172 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_linux_kernel_module_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2021-11-17 13:37:55,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:37:55,172 INFO L85 PathProgramCache]: Analyzing trace with hash 999497018, now seen corresponding path program 1 times [2021-11-17 13:37:55,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:37:55,173 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997057960] [2021-11-17 13:37:55,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:37:55,173 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:37:55,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:55,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:37:55,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:55,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 13:37:55,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:55,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:37:55,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:55,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:37:55,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:55,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:37:55,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:55,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:37:55,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:55,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-11-17 13:37:55,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:55,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-17 13:37:55,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:55,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 13:37:55,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:55,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-11-17 13:37:55,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:55,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:37:55,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:55,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 13:37:55,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:55,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-17 13:37:55,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:55,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-17 13:37:55,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:55,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-17 13:37:55,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:55,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-17 13:37:55,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:55,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 13:37:55,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:55,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-11-17 13:37:55,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:55,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-11-17 13:37:55,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:55,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-11-17 13:37:55,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:55,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-11-17 13:37:55,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:55,485 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-17 13:37:55,485 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:37:55,485 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997057960] [2021-11-17 13:37:55,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997057960] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:37:55,486 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:37:55,486 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 13:37:55,486 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103421502] [2021-11-17 13:37:55,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:37:55,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 13:37:55,486 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:37:55,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 13:37:55,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-17 13:37:55,487 INFO L87 Difference]: Start difference. First operand 21744 states and 31819 transitions. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (22), 5 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2021-11-17 13:37:57,527 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:37:59,059 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:38:01,314 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:38:34,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:38:34,309 INFO L93 Difference]: Finished difference Result 47129 states and 70783 transitions. [2021-11-17 13:38:34,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-17 13:38:34,309 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (22), 5 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 138 [2021-11-17 13:38:34,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:38:34,464 INFO L225 Difference]: With dead ends: 47129 [2021-11-17 13:38:34,464 INFO L226 Difference]: Without dead ends: 47127 [2021-11-17 13:38:34,486 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2021-11-17 13:38:34,487 INFO L933 BasicCegarLoop]: 7874 mSDtfsCounter, 22273 mSDsluCounter, 15800 mSDsCounter, 0 mSdLazyCounter, 18237 mSolverCounterSat, 17320 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22822 SdHoareTripleChecker+Valid, 23674 SdHoareTripleChecker+Invalid, 35559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 17320 IncrementalHoareTripleChecker+Valid, 18237 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 35.7s IncrementalHoareTripleChecker+Time [2021-11-17 13:38:34,487 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22822 Valid, 23674 Invalid, 35559 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [17320 Valid, 18237 Invalid, 2 Unknown, 0 Unchecked, 35.7s Time] [2021-11-17 13:38:34,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47127 states. [2021-11-17 13:38:36,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47127 to 43555. [2021-11-17 13:38:36,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43555 states, 30240 states have (on average 1.302281746031746) internal successors, (39381), 30806 states have internal predecessors, (39381), 11572 states have call successors, (11572), 1579 states have call predecessors, (11572), 1725 states have return successors, (13850), 11471 states have call predecessors, (13850), 11570 states have call successors, (13850) [2021-11-17 13:38:36,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43555 states to 43555 states and 64803 transitions. [2021-11-17 13:38:36,890 INFO L78 Accepts]: Start accepts. Automaton has 43555 states and 64803 transitions. Word has length 138 [2021-11-17 13:38:36,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:38:36,891 INFO L470 AbstractCegarLoop]: Abstraction has 43555 states and 64803 transitions. [2021-11-17 13:38:36,891 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (22), 5 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2021-11-17 13:38:36,891 INFO L276 IsEmpty]: Start isEmpty. Operand 43555 states and 64803 transitions. [2021-11-17 13:38:36,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-11-17 13:38:36,893 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:38:36,893 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:38:36,893 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-17 13:38:36,893 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2021-11-17 13:38:36,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:38:36,894 INFO L85 PathProgramCache]: Analyzing trace with hash -602767383, now seen corresponding path program 1 times [2021-11-17 13:38:36,894 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:38:36,894 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301575080] [2021-11-17 13:38:36,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:38:36,894 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:38:36,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:38:37,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:38:37,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:38:37,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 13:38:37,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:38:37,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:38:37,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:38:37,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:38:37,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:38:37,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:38:37,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:38:37,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:38:37,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:38:37,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-11-17 13:38:37,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:38:37,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-17 13:38:37,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:38:37,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 13:38:37,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:38:37,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-11-17 13:38:37,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:38:37,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:38:37,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:38:37,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 13:38:37,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:38:37,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-17 13:38:37,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:38:37,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-17 13:38:37,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:38:37,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-17 13:38:37,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:38:37,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-17 13:38:37,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:38:37,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 13:38:37,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:38:37,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-11-17 13:38:37,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:38:37,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-11-17 13:38:37,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:38:37,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-11-17 13:38:37,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:38:37,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-11-17 13:38:37,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:38:37,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2021-11-17 13:38:37,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:38:37,238 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-17 13:38:37,239 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:38:37,239 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301575080] [2021-11-17 13:38:37,239 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301575080] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:38:37,239 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:38:37,239 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 13:38:37,240 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900216039] [2021-11-17 13:38:37,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:38:37,240 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 13:38:37,240 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:38:37,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 13:38:37,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-17 13:38:37,241 INFO L87 Difference]: Start difference. First operand 43555 states and 64803 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (23), 5 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2021-11-17 13:38:39,285 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:38:41,535 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:38:43,134 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:39:13,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:39:13,237 INFO L93 Difference]: Finished difference Result 47119 states and 70759 transitions. [2021-11-17 13:39:13,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-17 13:39:13,237 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (23), 5 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 144 [2021-11-17 13:39:13,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:39:13,377 INFO L225 Difference]: With dead ends: 47119 [2021-11-17 13:39:13,378 INFO L226 Difference]: Without dead ends: 47117 [2021-11-17 13:39:13,398 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2021-11-17 13:39:13,398 INFO L933 BasicCegarLoop]: 7813 mSDtfsCounter, 22473 mSDsluCounter, 15656 mSDsCounter, 0 mSdLazyCounter, 17994 mSolverCounterSat, 17316 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23105 SdHoareTripleChecker+Valid, 23469 SdHoareTripleChecker+Invalid, 35312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 17316 IncrementalHoareTripleChecker+Valid, 17994 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.9s IncrementalHoareTripleChecker+Time [2021-11-17 13:39:13,399 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23105 Valid, 23469 Invalid, 35312 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [17316 Valid, 17994 Invalid, 2 Unknown, 0 Unchecked, 32.9s Time] [2021-11-17 13:39:13,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47117 states. [2021-11-17 13:39:15,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47117 to 43677. [2021-11-17 13:39:15,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43677 states, 30324 states have (on average 1.3014444004748713) internal successors, (39465), 30890 states have internal predecessors, (39465), 11591 states have call successors, (11591), 1598 states have call predecessors, (11591), 1744 states have return successors, (13869), 11490 states have call predecessors, (13869), 11589 states have call successors, (13869) [2021-11-17 13:39:15,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43677 states to 43677 states and 64925 transitions. [2021-11-17 13:39:15,885 INFO L78 Accepts]: Start accepts. Automaton has 43677 states and 64925 transitions. Word has length 144 [2021-11-17 13:39:15,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:39:15,886 INFO L470 AbstractCegarLoop]: Abstraction has 43677 states and 64925 transitions. [2021-11-17 13:39:15,886 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (23), 5 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2021-11-17 13:39:15,886 INFO L276 IsEmpty]: Start isEmpty. Operand 43677 states and 64925 transitions. [2021-11-17 13:39:15,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2021-11-17 13:39:15,888 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:39:15,888 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:39:15,888 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-17 13:39:15,888 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2021-11-17 13:39:15,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:39:15,888 INFO L85 PathProgramCache]: Analyzing trace with hash 14588060, now seen corresponding path program 1 times [2021-11-17 13:39:15,889 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:39:15,889 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258594158] [2021-11-17 13:39:15,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:39:15,889 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:39:16,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:39:16,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:39:16,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:39:16,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 13:39:16,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:39:16,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:39:16,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:39:16,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:39:16,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:39:16,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:39:16,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:39:16,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:39:16,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:39:16,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-11-17 13:39:16,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:39:16,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-17 13:39:16,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:39:16,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 13:39:16,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:39:16,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-11-17 13:39:16,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:39:16,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:39:16,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:39:16,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 13:39:16,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:39:16,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-17 13:39:16,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:39:16,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-17 13:39:16,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:39:16,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-17 13:39:16,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:39:16,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-17 13:39:16,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:39:16,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 13:39:16,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:39:16,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-11-17 13:39:16,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:39:16,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-11-17 13:39:16,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:39:16,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-11-17 13:39:16,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:39:16,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-11-17 13:39:16,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:39:16,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2021-11-17 13:39:16,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:39:16,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-11-17 13:39:16,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:39:16,343 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-17 13:39:16,343 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:39:16,343 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258594158] [2021-11-17 13:39:16,343 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258594158] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:39:16,343 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:39:16,344 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 13:39:16,344 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266697063] [2021-11-17 13:39:16,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:39:16,345 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 13:39:16,345 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:39:16,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 13:39:16,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-17 13:39:16,346 INFO L87 Difference]: Start difference. First operand 43677 states and 64925 transitions. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (24), 5 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2021-11-17 13:39:18,388 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:39:20,652 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:39:22,936 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:39:39,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:39:39,962 INFO L93 Difference]: Finished difference Result 47026 states and 70671 transitions. [2021-11-17 13:39:39,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-17 13:39:39,963 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (24), 5 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 150 [2021-11-17 13:39:39,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:39:40,139 INFO L225 Difference]: With dead ends: 47026 [2021-11-17 13:39:40,139 INFO L226 Difference]: Without dead ends: 47024 [2021-11-17 13:39:40,167 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-11-17 13:39:40,168 INFO L933 BasicCegarLoop]: 7192 mSDtfsCounter, 14395 mSDsluCounter, 10694 mSDsCounter, 0 mSdLazyCounter, 9492 mSolverCounterSat, 9807 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15120 SdHoareTripleChecker+Valid, 17886 SdHoareTripleChecker+Invalid, 19302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 9807 IncrementalHoareTripleChecker+Valid, 9492 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.2s IncrementalHoareTripleChecker+Time [2021-11-17 13:39:40,168 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15120 Valid, 17886 Invalid, 19302 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [9807 Valid, 9492 Invalid, 3 Unknown, 0 Unchecked, 21.2s Time] [2021-11-17 13:39:40,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47024 states. [2021-11-17 13:39:42,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47024 to 43675. [2021-11-17 13:39:42,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43675 states, 30323 states have (on average 1.3013883850542491) internal successors, (39462), 30888 states have internal predecessors, (39462), 11591 states have call successors, (11591), 1598 states have call predecessors, (11591), 1744 states have return successors, (13869), 11490 states have call predecessors, (13869), 11589 states have call successors, (13869) [2021-11-17 13:39:42,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43675 states to 43675 states and 64922 transitions. [2021-11-17 13:39:42,751 INFO L78 Accepts]: Start accepts. Automaton has 43675 states and 64922 transitions. Word has length 150 [2021-11-17 13:39:42,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:39:42,751 INFO L470 AbstractCegarLoop]: Abstraction has 43675 states and 64922 transitions. [2021-11-17 13:39:42,751 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (24), 5 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2021-11-17 13:39:42,751 INFO L276 IsEmpty]: Start isEmpty. Operand 43675 states and 64922 transitions. [2021-11-17 13:39:42,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2021-11-17 13:39:42,753 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:39:42,753 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:39:42,753 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-17 13:39:42,753 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2021-11-17 13:39:42,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:39:42,754 INFO L85 PathProgramCache]: Analyzing trace with hash 854813835, now seen corresponding path program 1 times [2021-11-17 13:39:42,754 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:39:42,754 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429619132] [2021-11-17 13:39:42,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:39:42,754 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:39:42,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:39:42,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:39:42,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:39:42,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 13:39:42,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:39:42,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:39:42,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:39:42,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:39:42,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:39:42,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:39:42,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:39:42,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:39:42,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:39:42,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-11-17 13:39:42,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:39:42,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-17 13:39:42,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:39:42,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 13:39:42,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:39:42,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-11-17 13:39:42,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:39:42,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:39:42,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:39:42,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 13:39:42,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:39:42,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-17 13:39:42,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:39:42,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-17 13:39:42,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:39:42,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-17 13:39:42,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:39:43,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-17 13:39:43,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:39:43,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 13:39:43,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:39:43,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-11-17 13:39:43,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:39:43,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-11-17 13:39:43,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:39:43,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-11-17 13:39:43,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:39:43,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-11-17 13:39:43,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:39:43,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2021-11-17 13:39:43,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:39:43,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-11-17 13:39:43,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:39:43,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-11-17 13:39:43,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:39:43,081 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-17 13:39:43,081 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:39:43,081 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429619132] [2021-11-17 13:39:43,081 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429619132] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:39:43,081 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:39:43,081 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 13:39:43,082 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792964409] [2021-11-17 13:39:43,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:39:43,082 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 13:39:43,082 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:39:43,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 13:39:43,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-17 13:39:43,083 INFO L87 Difference]: Start difference. First operand 43675 states and 64922 transitions. Second operand has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2021-11-17 13:39:45,124 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:39:47,406 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:39:49,692 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:40:21,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:40:21,388 INFO L93 Difference]: Finished difference Result 47329 states and 70985 transitions. [2021-11-17 13:40:21,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-17 13:40:21,388 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 156 [2021-11-17 13:40:21,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:40:21,537 INFO L225 Difference]: With dead ends: 47329 [2021-11-17 13:40:21,537 INFO L226 Difference]: Without dead ends: 47327 [2021-11-17 13:40:21,559 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2021-11-17 13:40:21,560 INFO L933 BasicCegarLoop]: 8292 mSDtfsCounter, 20612 mSDsluCounter, 15797 mSDsCounter, 0 mSdLazyCounter, 18451 mSolverCounterSat, 16305 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21242 SdHoareTripleChecker+Valid, 24089 SdHoareTripleChecker+Invalid, 34759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 16305 IncrementalHoareTripleChecker+Valid, 18451 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 35.3s IncrementalHoareTripleChecker+Time [2021-11-17 13:40:21,560 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21242 Valid, 24089 Invalid, 34759 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [16305 Valid, 18451 Invalid, 3 Unknown, 0 Unchecked, 35.3s Time] [2021-11-17 13:40:21,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47327 states. [2021-11-17 13:40:23,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47327 to 43873. [2021-11-17 13:40:23,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43873 states, 30459 states have (on average 1.3001083423618636) internal successors, (39600), 31024 states have internal predecessors, (39600), 11622 states have call successors, (11622), 1629 states have call predecessors, (11622), 1775 states have return successors, (13900), 11521 states have call predecessors, (13900), 11620 states have call successors, (13900) [2021-11-17 13:40:24,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43873 states to 43873 states and 65122 transitions. [2021-11-17 13:40:24,061 INFO L78 Accepts]: Start accepts. Automaton has 43873 states and 65122 transitions. Word has length 156 [2021-11-17 13:40:24,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:40:24,061 INFO L470 AbstractCegarLoop]: Abstraction has 43873 states and 65122 transitions. [2021-11-17 13:40:24,061 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2021-11-17 13:40:24,061 INFO L276 IsEmpty]: Start isEmpty. Operand 43873 states and 65122 transitions. [2021-11-17 13:40:24,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2021-11-17 13:40:24,063 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:40:24,063 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:40:24,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-17 13:40:24,063 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_linux_kernel_rcu_srcu_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2021-11-17 13:40:24,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:40:24,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1404651948, now seen corresponding path program 1 times [2021-11-17 13:40:24,064 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:40:24,064 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161579983] [2021-11-17 13:40:24,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:40:24,064 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:40:24,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:40:24,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:40:24,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:40:24,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 13:40:24,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:40:24,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:40:24,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:40:24,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:40:24,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:40:24,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:40:24,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:40:24,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:40:24,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:40:24,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-11-17 13:40:24,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:40:24,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-17 13:40:24,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:40:24,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 13:40:24,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:40:24,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-11-17 13:40:24,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:40:24,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:40:24,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:40:24,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 13:40:24,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:40:24,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-17 13:40:24,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:40:24,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-17 13:40:24,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:40:24,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-17 13:40:24,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:40:24,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-17 13:40:24,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:40:24,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 13:40:24,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:40:24,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-11-17 13:40:24,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:40:24,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-11-17 13:40:24,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:40:24,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-11-17 13:40:24,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:40:24,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-11-17 13:40:24,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:40:24,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2021-11-17 13:40:24,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:40:24,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-11-17 13:40:24,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:40:24,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-11-17 13:40:24,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:40:24,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2021-11-17 13:40:24,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:40:24,354 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-17 13:40:24,355 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:40:24,355 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161579983] [2021-11-17 13:40:24,355 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161579983] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:40:24,355 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:40:24,355 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 13:40:24,355 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344040663] [2021-11-17 13:40:24,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:40:24,355 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 13:40:24,355 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:40:24,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 13:40:24,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-17 13:40:24,356 INFO L87 Difference]: Start difference. First operand 43873 states and 65122 transitions. Second operand has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (26), 5 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2021-11-17 13:40:26,395 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:40:28,704 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:40:31,009 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:40:49,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:40:49,329 INFO L93 Difference]: Finished difference Result 47222 states and 70868 transitions. [2021-11-17 13:40:49,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-17 13:40:49,329 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (26), 5 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 162 [2021-11-17 13:40:49,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:40:49,477 INFO L225 Difference]: With dead ends: 47222 [2021-11-17 13:40:49,477 INFO L226 Difference]: Without dead ends: 47220 [2021-11-17 13:40:49,501 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-11-17 13:40:49,502 INFO L933 BasicCegarLoop]: 7206 mSDtfsCounter, 14351 mSDsluCounter, 10700 mSDsCounter, 0 mSdLazyCounter, 9506 mSolverCounterSat, 9796 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15072 SdHoareTripleChecker+Valid, 17906 SdHoareTripleChecker+Invalid, 19305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 9796 IncrementalHoareTripleChecker+Valid, 9506 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.3s IncrementalHoareTripleChecker+Time [2021-11-17 13:40:49,502 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15072 Valid, 17906 Invalid, 19305 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [9796 Valid, 9506 Invalid, 3 Unknown, 0 Unchecked, 22.3s Time] [2021-11-17 13:40:49,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47220 states. [2021-11-17 13:40:51,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47220 to 43871. [2021-11-17 13:40:51,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43871 states, 30458 states have (on average 1.3000525313546523) internal successors, (39597), 31022 states have internal predecessors, (39597), 11622 states have call successors, (11622), 1629 states have call predecessors, (11622), 1775 states have return successors, (13900), 11521 states have call predecessors, (13900), 11620 states have call successors, (13900) [2021-11-17 13:40:51,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43871 states to 43871 states and 65119 transitions. [2021-11-17 13:40:51,867 INFO L78 Accepts]: Start accepts. Automaton has 43871 states and 65119 transitions. Word has length 162 [2021-11-17 13:40:51,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:40:51,867 INFO L470 AbstractCegarLoop]: Abstraction has 43871 states and 65119 transitions. [2021-11-17 13:40:51,867 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (26), 5 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2021-11-17 13:40:51,867 INFO L276 IsEmpty]: Start isEmpty. Operand 43871 states and 65119 transitions. [2021-11-17 13:40:51,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2021-11-17 13:40:51,870 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:40:51,870 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:40:51,870 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-17 13:40:51,870 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_linux_lib_idr_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2021-11-17 13:40:51,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:40:51,871 INFO L85 PathProgramCache]: Analyzing trace with hash -187057953, now seen corresponding path program 1 times [2021-11-17 13:40:51,871 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:40:51,871 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450644487] [2021-11-17 13:40:51,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:40:51,871 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:40:51,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:40:52,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:40:52,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:40:52,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 13:40:52,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:40:52,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:40:52,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:40:52,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:40:52,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:40:52,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:40:52,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:40:52,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:40:52,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:40:52,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-11-17 13:40:52,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:40:52,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-17 13:40:52,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:40:52,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 13:40:52,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:40:52,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-11-17 13:40:52,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:40:52,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:40:52,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:40:52,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 13:40:52,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:40:52,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-17 13:40:52,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:40:52,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-17 13:40:52,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:40:52,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-17 13:40:52,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:40:52,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-17 13:40:52,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:40:52,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 13:40:52,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:40:52,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-11-17 13:40:52,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:40:52,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-11-17 13:40:52,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:40:52,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-11-17 13:40:52,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:40:52,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-11-17 13:40:52,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:40:52,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2021-11-17 13:40:52,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:40:52,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-11-17 13:40:52,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:40:52,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-11-17 13:40:52,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:40:52,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2021-11-17 13:40:52,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:40:52,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2021-11-17 13:40:52,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:40:52,189 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-17 13:40:52,189 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:40:52,190 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450644487] [2021-11-17 13:40:52,190 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450644487] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:40:52,190 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:40:52,190 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 13:40:52,190 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861060807] [2021-11-17 13:40:52,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:40:52,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 13:40:52,191 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:40:52,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 13:40:52,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-17 13:40:52,191 INFO L87 Difference]: Start difference. First operand 43871 states and 65119 transitions. Second operand has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2021-11-17 13:40:54,234 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:40:56,530 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:40:58,844 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:41:18,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:41:18,415 INFO L93 Difference]: Finished difference Result 47220 states and 70865 transitions. [2021-11-17 13:41:18,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-17 13:41:18,417 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 168 [2021-11-17 13:41:18,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:41:18,567 INFO L225 Difference]: With dead ends: 47220 [2021-11-17 13:41:18,567 INFO L226 Difference]: Without dead ends: 47218 [2021-11-17 13:41:18,590 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-11-17 13:41:18,591 INFO L933 BasicCegarLoop]: 7188 mSDtfsCounter, 14385 mSDsluCounter, 10697 mSDsCounter, 0 mSdLazyCounter, 9496 mSolverCounterSat, 9802 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15105 SdHoareTripleChecker+Valid, 17885 SdHoareTripleChecker+Invalid, 19301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 9802 IncrementalHoareTripleChecker+Valid, 9496 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.1s IncrementalHoareTripleChecker+Time [2021-11-17 13:41:18,591 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15105 Valid, 17885 Invalid, 19301 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [9802 Valid, 9496 Invalid, 3 Unknown, 0 Unchecked, 23.1s Time] [2021-11-17 13:41:18,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47218 states. [2021-11-17 13:41:20,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47218 to 43869. [2021-11-17 13:41:20,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43869 states, 30457 states have (on average 1.2999967166825361) internal successors, (39594), 31020 states have internal predecessors, (39594), 11622 states have call successors, (11622), 1629 states have call predecessors, (11622), 1775 states have return successors, (13900), 11521 states have call predecessors, (13900), 11620 states have call successors, (13900) [2021-11-17 13:41:21,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43869 states to 43869 states and 65116 transitions. [2021-11-17 13:41:21,112 INFO L78 Accepts]: Start accepts. Automaton has 43869 states and 65116 transitions. Word has length 168 [2021-11-17 13:41:21,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:41:21,113 INFO L470 AbstractCegarLoop]: Abstraction has 43869 states and 65116 transitions. [2021-11-17 13:41:21,113 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2021-11-17 13:41:21,113 INFO L276 IsEmpty]: Start isEmpty. Operand 43869 states and 65116 transitions. [2021-11-17 13:41:21,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-11-17 13:41:21,116 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:41:21,116 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:41:21,116 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-17 13:41:21,116 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2021-11-17 13:41:21,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:41:21,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1455846079, now seen corresponding path program 1 times [2021-11-17 13:41:21,117 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:41:21,117 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476027582] [2021-11-17 13:41:21,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:41:21,117 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:41:21,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:21,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:41:21,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:21,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 13:41:21,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:21,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:41:21,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:21,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:41:21,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:21,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:41:21,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:21,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:41:21,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:21,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-11-17 13:41:21,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:21,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-17 13:41:21,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:21,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 13:41:21,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:21,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-11-17 13:41:21,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:21,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:41:21,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:21,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 13:41:21,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:21,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-17 13:41:21,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:21,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-17 13:41:21,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:21,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-17 13:41:21,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:21,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-17 13:41:21,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:21,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 13:41:21,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:21,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-11-17 13:41:21,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:21,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-11-17 13:41:21,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:21,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-11-17 13:41:21,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:21,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-11-17 13:41:21,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:21,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2021-11-17 13:41:21,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:21,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-11-17 13:41:21,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:21,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-11-17 13:41:21,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:21,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2021-11-17 13:41:21,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:21,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2021-11-17 13:41:21,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:21,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2021-11-17 13:41:21,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:21,676 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-17 13:41:21,677 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:41:21,677 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476027582] [2021-11-17 13:41:21,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476027582] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:41:21,677 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:41:21,677 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 13:41:21,678 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614902210] [2021-11-17 13:41:21,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:41:21,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 13:41:21,679 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:41:21,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 13:41:21,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-17 13:41:21,679 INFO L87 Difference]: Start difference. First operand 43869 states and 65116 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (28), 5 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2021-11-17 13:41:23,720 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:41:26,039 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:41:28,345 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:41:46,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:41:46,862 INFO L93 Difference]: Finished difference Result 47218 states and 70862 transitions. [2021-11-17 13:41:46,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-17 13:41:46,862 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (28), 5 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 174 [2021-11-17 13:41:46,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:41:47,009 INFO L225 Difference]: With dead ends: 47218 [2021-11-17 13:41:47,009 INFO L226 Difference]: Without dead ends: 47216 [2021-11-17 13:41:47,033 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-11-17 13:41:47,034 INFO L933 BasicCegarLoop]: 7191 mSDtfsCounter, 14374 mSDsluCounter, 10704 mSDsCounter, 0 mSdLazyCounter, 9497 mSolverCounterSat, 9804 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15090 SdHoareTripleChecker+Valid, 17895 SdHoareTripleChecker+Invalid, 19304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 9804 IncrementalHoareTripleChecker+Valid, 9497 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.1s IncrementalHoareTripleChecker+Time [2021-11-17 13:41:47,034 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15090 Valid, 17895 Invalid, 19304 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [9804 Valid, 9497 Invalid, 3 Unknown, 0 Unchecked, 22.1s Time] [2021-11-17 13:41:47,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47216 states. [2021-11-17 13:41:49,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47216 to 43867. [2021-11-17 13:41:49,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43867 states, 30456 states have (on average 1.2999408983451537) internal successors, (39591), 31018 states have internal predecessors, (39591), 11622 states have call successors, (11622), 1629 states have call predecessors, (11622), 1775 states have return successors, (13900), 11521 states have call predecessors, (13900), 11620 states have call successors, (13900) [2021-11-17 13:41:49,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43867 states to 43867 states and 65113 transitions. [2021-11-17 13:41:49,596 INFO L78 Accepts]: Start accepts. Automaton has 43867 states and 65113 transitions. Word has length 174 [2021-11-17 13:41:49,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:41:49,596 INFO L470 AbstractCegarLoop]: Abstraction has 43867 states and 65113 transitions. [2021-11-17 13:41:49,597 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (28), 5 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2021-11-17 13:41:49,597 INFO L276 IsEmpty]: Start isEmpty. Operand 43867 states and 65113 transitions. [2021-11-17 13:41:49,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2021-11-17 13:41:49,600 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:41:49,600 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:41:49,600 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-17 13:41:49,600 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_linux_net_rtnetlink_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2021-11-17 13:41:49,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:41:49,600 INFO L85 PathProgramCache]: Analyzing trace with hash -370924715, now seen corresponding path program 1 times [2021-11-17 13:41:49,601 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:41:49,601 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284778225] [2021-11-17 13:41:49,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:41:49,601 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:41:49,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:49,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:41:49,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:49,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 13:41:49,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:49,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:41:49,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:49,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:41:49,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:49,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:41:49,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:49,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:41:49,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:49,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-11-17 13:41:49,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:49,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-17 13:41:49,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:49,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 13:41:49,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:49,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-11-17 13:41:49,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:49,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:41:49,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:49,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 13:41:49,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:49,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-17 13:41:49,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:49,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-17 13:41:49,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:49,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-17 13:41:49,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:49,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-17 13:41:49,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:49,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 13:41:49,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:49,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-11-17 13:41:49,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:49,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-11-17 13:41:49,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:49,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-11-17 13:41:49,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:49,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-11-17 13:41:49,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:49,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2021-11-17 13:41:49,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:49,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-11-17 13:41:49,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:49,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-11-17 13:41:49,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:49,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2021-11-17 13:41:49,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:49,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2021-11-17 13:41:49,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:49,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2021-11-17 13:41:49,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:49,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2021-11-17 13:41:49,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:49,902 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-17 13:41:49,903 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:41:49,903 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284778225] [2021-11-17 13:41:49,903 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284778225] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:41:49,903 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:41:49,903 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 13:41:49,903 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173368562] [2021-11-17 13:41:49,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:41:49,904 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 13:41:49,904 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:41:49,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 13:41:49,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-17 13:41:49,904 INFO L87 Difference]: Start difference. First operand 43867 states and 65113 transitions. Second operand has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2021-11-17 13:41:51,945 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:41:54,287 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:41:56,678 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.39s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:42:15,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:42:15,611 INFO L93 Difference]: Finished difference Result 47216 states and 70859 transitions. [2021-11-17 13:42:15,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-17 13:42:15,611 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 180 [2021-11-17 13:42:15,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:42:15,769 INFO L225 Difference]: With dead ends: 47216 [2021-11-17 13:42:15,769 INFO L226 Difference]: Without dead ends: 47214 [2021-11-17 13:42:15,795 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-11-17 13:42:15,796 INFO L933 BasicCegarLoop]: 7186 mSDtfsCounter, 14369 mSDsluCounter, 10697 mSDsCounter, 0 mSdLazyCounter, 9482 mSolverCounterSat, 9792 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15089 SdHoareTripleChecker+Valid, 17883 SdHoareTripleChecker+Invalid, 19277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 9792 IncrementalHoareTripleChecker+Valid, 9482 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.7s IncrementalHoareTripleChecker+Time [2021-11-17 13:42:15,796 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15089 Valid, 17883 Invalid, 19277 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [9792 Valid, 9482 Invalid, 3 Unknown, 0 Unchecked, 22.7s Time] [2021-11-17 13:42:15,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47214 states. [2021-11-17 13:42:17,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47214 to 43865. [2021-11-17 13:42:18,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43865 states, 30455 states have (on average 1.2998850763421441) internal successors, (39588), 31016 states have internal predecessors, (39588), 11622 states have call successors, (11622), 1629 states have call predecessors, (11622), 1775 states have return successors, (13900), 11521 states have call predecessors, (13900), 11620 states have call successors, (13900) [2021-11-17 13:42:18,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43865 states to 43865 states and 65110 transitions. [2021-11-17 13:42:18,430 INFO L78 Accepts]: Start accepts. Automaton has 43865 states and 65110 transitions. Word has length 180 [2021-11-17 13:42:18,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:42:18,431 INFO L470 AbstractCegarLoop]: Abstraction has 43865 states and 65110 transitions. [2021-11-17 13:42:18,431 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2021-11-17 13:42:18,431 INFO L276 IsEmpty]: Start isEmpty. Operand 43865 states and 65110 transitions. [2021-11-17 13:42:18,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2021-11-17 13:42:18,434 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:42:18,434 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:42:18,434 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-17 13:42:18,435 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_linux_net_sock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2021-11-17 13:42:18,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:42:18,435 INFO L85 PathProgramCache]: Analyzing trace with hash -724932992, now seen corresponding path program 1 times [2021-11-17 13:42:18,435 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:42:18,435 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000418052] [2021-11-17 13:42:18,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:42:18,435 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:42:18,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:18,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:42:18,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:18,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 13:42:18,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:18,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:42:18,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:18,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:42:18,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:18,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:42:18,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:18,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:42:18,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:18,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-11-17 13:42:18,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:18,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-17 13:42:18,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:18,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 13:42:18,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:18,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-11-17 13:42:18,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:18,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:42:18,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:18,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 13:42:18,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:18,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-17 13:42:18,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:18,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-17 13:42:18,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:18,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-17 13:42:18,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:18,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-17 13:42:18,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:18,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 13:42:18,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:18,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-11-17 13:42:18,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:18,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-11-17 13:42:18,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:18,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-11-17 13:42:18,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:18,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-11-17 13:42:18,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:18,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2021-11-17 13:42:18,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:18,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-11-17 13:42:18,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:18,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-11-17 13:42:18,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:18,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2021-11-17 13:42:18,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:18,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2021-11-17 13:42:18,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:18,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2021-11-17 13:42:18,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:18,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2021-11-17 13:42:18,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:18,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2021-11-17 13:42:18,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:18,786 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-17 13:42:18,786 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:42:18,786 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000418052] [2021-11-17 13:42:18,786 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000418052] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:42:18,786 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:42:18,786 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 13:42:18,786 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386164584] [2021-11-17 13:42:18,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:42:18,787 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 13:42:18,787 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:42:18,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 13:42:18,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-17 13:42:18,787 INFO L87 Difference]: Start difference. First operand 43865 states and 65110 transitions. Second operand has 7 states, 7 states have (on average 17.0) internal successors, (119), 4 states have internal predecessors, (119), 2 states have call successors, (30), 5 states have call predecessors, (30), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2021-11-17 13:42:20,830 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:42:23,222 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.39s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:42:25,581 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:42:44,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:42:44,956 INFO L93 Difference]: Finished difference Result 47214 states and 70856 transitions. [2021-11-17 13:42:44,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-17 13:42:44,957 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 4 states have internal predecessors, (119), 2 states have call successors, (30), 5 states have call predecessors, (30), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 186 [2021-11-17 13:42:44,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:42:45,128 INFO L225 Difference]: With dead ends: 47214 [2021-11-17 13:42:45,128 INFO L226 Difference]: Without dead ends: 47212 [2021-11-17 13:42:45,155 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-11-17 13:42:45,155 INFO L933 BasicCegarLoop]: 7203 mSDtfsCounter, 14307 mSDsluCounter, 10696 mSDsCounter, 0 mSdLazyCounter, 9493 mSolverCounterSat, 9783 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15028 SdHoareTripleChecker+Valid, 17899 SdHoareTripleChecker+Invalid, 19279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 9783 IncrementalHoareTripleChecker+Valid, 9493 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.1s IncrementalHoareTripleChecker+Time [2021-11-17 13:42:45,155 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15028 Valid, 17899 Invalid, 19279 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [9783 Valid, 9493 Invalid, 3 Unknown, 0 Unchecked, 23.1s Time] [2021-11-17 13:42:45,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47212 states. [2021-11-17 13:42:47,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47212 to 43863. [2021-11-17 13:42:47,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43863 states, 30454 states have (on average 1.2998292506731464) internal successors, (39585), 31014 states have internal predecessors, (39585), 11622 states have call successors, (11622), 1629 states have call predecessors, (11622), 1775 states have return successors, (13900), 11521 states have call predecessors, (13900), 11620 states have call successors, (13900) [2021-11-17 13:42:47,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43863 states to 43863 states and 65107 transitions. [2021-11-17 13:42:47,975 INFO L78 Accepts]: Start accepts. Automaton has 43863 states and 65107 transitions. Word has length 186 [2021-11-17 13:42:47,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:42:47,975 INFO L470 AbstractCegarLoop]: Abstraction has 43863 states and 65107 transitions. [2021-11-17 13:42:47,976 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 4 states have internal predecessors, (119), 2 states have call successors, (30), 5 states have call predecessors, (30), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2021-11-17 13:42:47,976 INFO L276 IsEmpty]: Start isEmpty. Operand 43863 states and 65107 transitions. [2021-11-17 13:42:47,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2021-11-17 13:42:47,980 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:42:47,980 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:42:47,980 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-17 13:42:47,980 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2021-11-17 13:42:47,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:42:47,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1500765042, now seen corresponding path program 1 times [2021-11-17 13:42:47,981 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:42:47,981 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911965836] [2021-11-17 13:42:47,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:42:47,981 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:42:48,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:48,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:42:48,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:48,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 13:42:48,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:48,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:42:48,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:48,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:42:48,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:48,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:42:48,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:48,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:42:48,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:48,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-11-17 13:42:48,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:48,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-17 13:42:48,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:48,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 13:42:48,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:48,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-11-17 13:42:48,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:48,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:42:48,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:48,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 13:42:48,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:48,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-17 13:42:48,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:48,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-17 13:42:48,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:48,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-17 13:42:48,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:48,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-17 13:42:48,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:48,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 13:42:48,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:48,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-11-17 13:42:48,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:48,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-11-17 13:42:48,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:48,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-11-17 13:42:48,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:48,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-11-17 13:42:48,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:48,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2021-11-17 13:42:48,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:48,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-11-17 13:42:48,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:48,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-11-17 13:42:48,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:48,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2021-11-17 13:42:48,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:48,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2021-11-17 13:42:48,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:48,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2021-11-17 13:42:48,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:48,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2021-11-17 13:42:48,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:48,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2021-11-17 13:42:48,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:48,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2021-11-17 13:42:48,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:48,490 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-17 13:42:48,490 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:42:48,490 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911965836] [2021-11-17 13:42:48,490 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911965836] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:42:48,490 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:42:48,490 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 13:42:48,490 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854879365] [2021-11-17 13:42:48,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:42:48,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 13:42:48,490 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:42:48,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 13:42:48,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-17 13:42:48,491 INFO L87 Difference]: Start difference. First operand 43863 states and 65107 transitions. Second operand has 7 states, 7 states have (on average 17.571428571428573) internal successors, (123), 4 states have internal predecessors, (123), 2 states have call successors, (31), 5 states have call predecessors, (31), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2021-11-17 13:42:50,532 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:42:52,904 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:42:55,254 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:43:14,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:43:14,707 INFO L93 Difference]: Finished difference Result 47212 states and 70853 transitions. [2021-11-17 13:43:14,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-17 13:43:14,708 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.571428571428573) internal successors, (123), 4 states have internal predecessors, (123), 2 states have call successors, (31), 5 states have call predecessors, (31), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 192 [2021-11-17 13:43:14,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:43:14,870 INFO L225 Difference]: With dead ends: 47212 [2021-11-17 13:43:14,871 INFO L226 Difference]: Without dead ends: 47210 [2021-11-17 13:43:14,894 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-11-17 13:43:14,895 INFO L933 BasicCegarLoop]: 7178 mSDtfsCounter, 14347 mSDsluCounter, 10688 mSDsCounter, 0 mSdLazyCounter, 9481 mSolverCounterSat, 9798 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15068 SdHoareTripleChecker+Valid, 17866 SdHoareTripleChecker+Invalid, 19282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 9798 IncrementalHoareTripleChecker+Valid, 9481 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.0s IncrementalHoareTripleChecker+Time [2021-11-17 13:43:14,895 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15068 Valid, 17866 Invalid, 19282 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [9798 Valid, 9481 Invalid, 3 Unknown, 0 Unchecked, 23.0s Time] [2021-11-17 13:43:14,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47210 states. [2021-11-17 13:43:17,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47210 to 43861. [2021-11-17 13:43:17,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43861 states, 30453 states have (on average 1.2997734213377992) internal successors, (39582), 31012 states have internal predecessors, (39582), 11622 states have call successors, (11622), 1629 states have call predecessors, (11622), 1775 states have return successors, (13900), 11521 states have call predecessors, (13900), 11620 states have call successors, (13900) [2021-11-17 13:43:17,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43861 states to 43861 states and 65104 transitions. [2021-11-17 13:43:17,859 INFO L78 Accepts]: Start accepts. Automaton has 43861 states and 65104 transitions. Word has length 192 [2021-11-17 13:43:17,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:43:17,860 INFO L470 AbstractCegarLoop]: Abstraction has 43861 states and 65104 transitions. [2021-11-17 13:43:17,860 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.571428571428573) internal successors, (123), 4 states have internal predecessors, (123), 2 states have call successors, (31), 5 states have call predecessors, (31), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2021-11-17 13:43:17,860 INFO L276 IsEmpty]: Start isEmpty. Operand 43861 states and 65104 transitions. [2021-11-17 13:43:17,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2021-11-17 13:43:17,867 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:43:17,867 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:43:17,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-17 13:43:17,867 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2021-11-17 13:43:17,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:43:17,867 INFO L85 PathProgramCache]: Analyzing trace with hash 822057716, now seen corresponding path program 1 times [2021-11-17 13:43:17,867 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:43:17,868 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710489984] [2021-11-17 13:43:17,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:43:17,868 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:43:17,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:17,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:43:17,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:18,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 13:43:18,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:18,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:43:18,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:18,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:43:18,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:18,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:43:18,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:18,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:43:18,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:18,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-11-17 13:43:18,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:18,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-17 13:43:18,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:18,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 13:43:18,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:18,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-11-17 13:43:18,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:18,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:43:18,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:18,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 13:43:18,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:18,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-17 13:43:18,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:18,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-17 13:43:18,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:18,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-17 13:43:18,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:18,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-17 13:43:18,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:18,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 13:43:18,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:18,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-11-17 13:43:18,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:18,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-11-17 13:43:18,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:18,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-11-17 13:43:18,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:18,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-11-17 13:43:18,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:18,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2021-11-17 13:43:18,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:18,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-11-17 13:43:18,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:18,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-11-17 13:43:18,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:18,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2021-11-17 13:43:18,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:18,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2021-11-17 13:43:18,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:18,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2021-11-17 13:43:18,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:18,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2021-11-17 13:43:18,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:18,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2021-11-17 13:43:18,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:18,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2021-11-17 13:43:18,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:18,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2021-11-17 13:43:18,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:18,219 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-17 13:43:18,219 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:43:18,220 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710489984] [2021-11-17 13:43:18,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710489984] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:43:18,220 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:43:18,220 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 13:43:18,220 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258592405] [2021-11-17 13:43:18,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:43:18,220 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 13:43:18,221 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:43:18,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 13:43:18,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-17 13:43:18,221 INFO L87 Difference]: Start difference. First operand 43861 states and 65104 transitions. Second operand has 7 states, 7 states have (on average 18.142857142857142) internal successors, (127), 4 states have internal predecessors, (127), 2 states have call successors, (32), 5 states have call predecessors, (32), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2021-11-17 13:43:20,261 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:43:22,638 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:43:25,036 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:43:45,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:43:45,042 INFO L93 Difference]: Finished difference Result 47210 states and 70850 transitions. [2021-11-17 13:43:45,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-17 13:43:45,042 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.142857142857142) internal successors, (127), 4 states have internal predecessors, (127), 2 states have call successors, (32), 5 states have call predecessors, (32), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 198 [2021-11-17 13:43:45,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:43:45,211 INFO L225 Difference]: With dead ends: 47210 [2021-11-17 13:43:45,212 INFO L226 Difference]: Without dead ends: 47208 [2021-11-17 13:43:45,239 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-11-17 13:43:45,239 INFO L933 BasicCegarLoop]: 7169 mSDtfsCounter, 14372 mSDsluCounter, 10694 mSDsCounter, 0 mSdLazyCounter, 9464 mSolverCounterSat, 9802 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15090 SdHoareTripleChecker+Valid, 17863 SdHoareTripleChecker+Invalid, 19269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 9802 IncrementalHoareTripleChecker+Valid, 9464 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.5s IncrementalHoareTripleChecker+Time [2021-11-17 13:43:45,240 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15090 Valid, 17863 Invalid, 19269 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [9802 Valid, 9464 Invalid, 3 Unknown, 0 Unchecked, 23.5s Time] [2021-11-17 13:43:45,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47208 states. [2021-11-17 13:43:47,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47208 to 43859. [2021-11-17 13:43:47,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43859 states, 30452 states have (on average 1.2997175883357415) internal successors, (39579), 31010 states have internal predecessors, (39579), 11622 states have call successors, (11622), 1629 states have call predecessors, (11622), 1775 states have return successors, (13900), 11521 states have call predecessors, (13900), 11620 states have call successors, (13900) [2021-11-17 13:43:48,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43859 states to 43859 states and 65101 transitions. [2021-11-17 13:43:48,190 INFO L78 Accepts]: Start accepts. Automaton has 43859 states and 65101 transitions. Word has length 198 [2021-11-17 13:43:48,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:43:48,190 INFO L470 AbstractCegarLoop]: Abstraction has 43859 states and 65101 transitions. [2021-11-17 13:43:48,190 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.142857142857142) internal successors, (127), 4 states have internal predecessors, (127), 2 states have call successors, (32), 5 states have call predecessors, (32), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2021-11-17 13:43:48,190 INFO L276 IsEmpty]: Start isEmpty. Operand 43859 states and 65101 transitions. [2021-11-17 13:43:48,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2021-11-17 13:43:48,195 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:43:48,195 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:43:48,196 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-17 13:43:48,196 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ldv_linux_kernel_module_module_putErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2021-11-17 13:43:48,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:43:48,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1067281980, now seen corresponding path program 1 times [2021-11-17 13:43:48,196 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:43:48,196 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278847770] [2021-11-17 13:43:48,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:43:48,197 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:43:48,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:48,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:43:48,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:48,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 13:43:48,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:48,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:43:48,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:48,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:43:48,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:48,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:43:48,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:48,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:43:48,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:48,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-11-17 13:43:48,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:48,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-17 13:43:48,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:48,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 13:43:48,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:48,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-11-17 13:43:48,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:48,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:43:48,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:48,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 13:43:48,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:48,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-17 13:43:48,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:48,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-11-17 13:43:48,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:48,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-11-17 13:43:48,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:48,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:43:48,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:48,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:43:48,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:48,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:43:48,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:49,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-11-17 13:43:49,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:49,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-11-17 13:43:49,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:49,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:43:49,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:49,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:43:49,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:49,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:43:49,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:49,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2021-11-17 13:43:49,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:49,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2021-11-17 13:43:49,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:49,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:43:49,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:49,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2021-11-17 13:43:49,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:49,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:43:49,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:49,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2021-11-17 13:43:49,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:49,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2021-11-17 13:43:49,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:49,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-11-17 13:43:49,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:49,118 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2021-11-17 13:43:49,119 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:43:49,119 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278847770] [2021-11-17 13:43:49,119 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278847770] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 13:43:49,119 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612646131] [2021-11-17 13:43:49,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:43:49,120 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 13:43:49,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 13:43:49,121 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-17 13:43:49,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-17 13:43:50,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:50,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 3513 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-17 13:43:50,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 13:43:50,967 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2021-11-17 13:43:50,968 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-17 13:43:50,968 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612646131] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:43:50,968 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-17 13:43:50,968 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [19] total 21 [2021-11-17 13:43:50,969 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114642083] [2021-11-17 13:43:50,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:43:50,969 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-17 13:43:50,969 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:43:50,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-17 13:43:50,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=378, Unknown=0, NotChecked=0, Total=420 [2021-11-17 13:43:50,970 INFO L87 Difference]: Start difference. First operand 43859 states and 65101 transitions. Second operand has 15 states, 14 states have (on average 9.071428571428571) internal successors, (127), 14 states have internal predecessors, (127), 6 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (28), 6 states have call predecessors, (28), 6 states have call successors, (28) [2021-11-17 13:43:55,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:43:55,019 INFO L93 Difference]: Finished difference Result 87678 states and 130140 transitions. [2021-11-17 13:43:55,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-17 13:43:55,020 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 9.071428571428571) internal successors, (127), 14 states have internal predecessors, (127), 6 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (28), 6 states have call predecessors, (28), 6 states have call successors, (28) Word has length 216 [2021-11-17 13:43:55,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:43:55,221 INFO L225 Difference]: With dead ends: 87678 [2021-11-17 13:43:55,221 INFO L226 Difference]: Without dead ends: 43910 [2021-11-17 13:43:55,444 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=126, Invalid=744, Unknown=0, NotChecked=0, Total=870 [2021-11-17 13:43:55,445 INFO L933 BasicCegarLoop]: 7957 mSDtfsCounter, 53 mSDsluCounter, 103246 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 111203 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-17 13:43:55,445 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 111203 Invalid, 582 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [198 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-17 13:43:55,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43910 states. [2021-11-17 13:43:57,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43910 to 43872. [2021-11-17 13:43:57,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43872 states, 30461 states have (on average 1.299629033846558) internal successors, (39588), 31018 states have internal predecessors, (39588), 11626 states have call successors, (11626), 1629 states have call predecessors, (11626), 1775 states have return successors, (13904), 11525 states have call predecessors, (13904), 11624 states have call successors, (13904) [2021-11-17 13:43:58,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43872 states to 43872 states and 65118 transitions. [2021-11-17 13:43:58,420 INFO L78 Accepts]: Start accepts. Automaton has 43872 states and 65118 transitions. Word has length 216 [2021-11-17 13:43:58,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:43:58,421 INFO L470 AbstractCegarLoop]: Abstraction has 43872 states and 65118 transitions. [2021-11-17 13:43:58,421 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 9.071428571428571) internal successors, (127), 14 states have internal predecessors, (127), 6 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (28), 6 states have call predecessors, (28), 6 states have call successors, (28) [2021-11-17 13:43:58,421 INFO L276 IsEmpty]: Start isEmpty. Operand 43872 states and 65118 transitions. [2021-11-17 13:43:58,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2021-11-17 13:43:58,423 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:43:58,423 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:43:58,452 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-11-17 13:43:58,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-11-17 13:43:58,624 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ldv_linux_usb_urb_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2021-11-17 13:43:58,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:43:58,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1436233397, now seen corresponding path program 1 times [2021-11-17 13:43:58,624 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:43:58,625 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143900892] [2021-11-17 13:43:58,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:43:58,625 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:43:58,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:58,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:43:58,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:58,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 13:43:58,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:58,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:43:58,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:58,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:43:58,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:58,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:43:58,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:58,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:43:58,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:58,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-11-17 13:43:58,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:58,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-17 13:43:58,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:58,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 13:43:58,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:58,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-11-17 13:43:58,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:58,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:43:58,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:58,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 13:43:58,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:58,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-17 13:43:58,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:58,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-17 13:43:58,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:58,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-17 13:43:58,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:58,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-17 13:43:58,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:58,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 13:43:58,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:58,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-11-17 13:43:58,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:58,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-11-17 13:43:58,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:58,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-11-17 13:43:58,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:58,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-11-17 13:43:58,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:58,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2021-11-17 13:43:58,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:58,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-11-17 13:43:58,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:58,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-11-17 13:43:58,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:58,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2021-11-17 13:43:58,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:58,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2021-11-17 13:43:58,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:58,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2021-11-17 13:43:58,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:58,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2021-11-17 13:43:58,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:58,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2021-11-17 13:43:58,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:58,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2021-11-17 13:43:58,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:58,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2021-11-17 13:43:59,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:59,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2021-11-17 13:43:59,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:43:59,243 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-17 13:43:59,243 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:43:59,243 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143900892] [2021-11-17 13:43:59,244 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143900892] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:43:59,244 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:43:59,244 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 13:43:59,244 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066455433] [2021-11-17 13:43:59,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:43:59,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 13:43:59,244 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:43:59,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 13:43:59,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-17 13:43:59,245 INFO L87 Difference]: Start difference. First operand 43872 states and 65118 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 4 states have internal predecessors, (131), 2 states have call successors, (33), 5 states have call predecessors, (33), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2021-11-17 13:44:01,288 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:44:03,712 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:44:06,087 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:44:27,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:44:27,115 INFO L93 Difference]: Finished difference Result 47221 states and 70864 transitions. [2021-11-17 13:44:27,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-17 13:44:27,115 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 4 states have internal predecessors, (131), 2 states have call successors, (33), 5 states have call predecessors, (33), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 204 [2021-11-17 13:44:27,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:44:27,291 INFO L225 Difference]: With dead ends: 47221 [2021-11-17 13:44:27,291 INFO L226 Difference]: Without dead ends: 46982 [2021-11-17 13:44:27,319 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-11-17 13:44:27,319 INFO L933 BasicCegarLoop]: 7216 mSDtfsCounter, 14235 mSDsluCounter, 10699 mSDsCounter, 0 mSdLazyCounter, 9515 mSolverCounterSat, 9756 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14953 SdHoareTripleChecker+Valid, 17915 SdHoareTripleChecker+Invalid, 19274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 9756 IncrementalHoareTripleChecker+Valid, 9515 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.2s IncrementalHoareTripleChecker+Time [2021-11-17 13:44:27,320 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14953 Valid, 17915 Invalid, 19274 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [9756 Valid, 9515 Invalid, 3 Unknown, 0 Unchecked, 24.2s Time] [2021-11-17 13:44:27,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46982 states. [2021-11-17 13:44:29,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46982 to 43633. [2021-11-17 13:44:29,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43633 states, 30313 states have (on average 1.3008610167254973) internal successors, (39433), 30865 states have internal predecessors, (39433), 11568 states have call successors, (11568), 1599 states have call predecessors, (11568), 1743 states have return successors, (13845), 11469 states have call predecessors, (13845), 11565 states have call successors, (13845) [2021-11-17 13:44:30,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43633 states to 43633 states and 64846 transitions. [2021-11-17 13:44:30,339 INFO L78 Accepts]: Start accepts. Automaton has 43633 states and 64846 transitions. Word has length 204 [2021-11-17 13:44:30,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:44:30,339 INFO L470 AbstractCegarLoop]: Abstraction has 43633 states and 64846 transitions. [2021-11-17 13:44:30,339 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 4 states have internal predecessors, (131), 2 states have call successors, (33), 5 states have call predecessors, (33), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2021-11-17 13:44:30,339 INFO L276 IsEmpty]: Start isEmpty. Operand 43633 states and 64846 transitions. [2021-11-17 13:44:30,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2021-11-17 13:44:30,343 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:44:30,344 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:44:30,344 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-17 13:44:30,344 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ldv_linux_kernel_module_module_putErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2021-11-17 13:44:30,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:44:30,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1822220564, now seen corresponding path program 1 times [2021-11-17 13:44:30,344 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:44:30,344 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111657142] [2021-11-17 13:44:30,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:44:30,345 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:44:30,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:44:30,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:44:30,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:44:30,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 13:44:30,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:44:30,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:44:30,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:44:30,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:44:30,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:44:30,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:44:30,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:44:30,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:44:30,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:44:30,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-11-17 13:44:30,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:44:30,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-17 13:44:30,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:44:30,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:44:30,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:44:30,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-17 13:44:30,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:44:30,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:44:30,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:44:30,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-17 13:44:30,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:44:30,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-11-17 13:44:30,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:44:30,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-17 13:44:30,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:44:30,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 13:44:30,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:44:30,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:44:30,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:44:30,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2021-11-17 13:44:30,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:44:30,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-11-17 13:44:30,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:44:30,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-11-17 13:44:30,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:44:30,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2021-11-17 13:44:30,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:44:30,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:44:30,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:44:30,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:44:30,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:44:30,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:44:30,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:44:30,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2021-11-17 13:44:30,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:44:30,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2021-11-17 13:44:30,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:44:30,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:44:30,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:44:30,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:44:30,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:44:30,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:44:30,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:44:30,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2021-11-17 13:44:30,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:44:30,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2021-11-17 13:44:30,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:44:30,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:44:30,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:44:30,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2021-11-17 13:44:30,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:44:30,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:44:30,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:44:30,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2021-11-17 13:44:30,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:44:30,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2021-11-17 13:44:30,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:44:30,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2021-11-17 13:44:30,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:44:30,708 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2021-11-17 13:44:30,709 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:44:30,709 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111657142] [2021-11-17 13:44:30,709 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111657142] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:44:30,709 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:44:30,709 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-17 13:44:30,709 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661351430] [2021-11-17 13:44:30,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:44:30,709 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-17 13:44:30,709 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:44:30,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-17 13:44:30,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-11-17 13:44:30,710 INFO L87 Difference]: Start difference. First operand 43633 states and 64846 transitions. Second operand has 10 states, 10 states have (on average 13.8) internal successors, (138), 5 states have internal predecessors, (138), 2 states have call successors, (36), 6 states have call predecessors, (36), 2 states have return successors, (33), 3 states have call predecessors, (33), 2 states have call successors, (33) [2021-11-17 13:44:32,753 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:44:35,139 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:44:37,531 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.39s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:45:07,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:45:07,733 INFO L93 Difference]: Finished difference Result 90578 states and 135382 transitions. [2021-11-17 13:45:07,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-17 13:45:07,733 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.8) internal successors, (138), 5 states have internal predecessors, (138), 2 states have call successors, (36), 6 states have call predecessors, (36), 2 states have return successors, (33), 3 states have call predecessors, (33), 2 states have call successors, (33) Word has length 259 [2021-11-17 13:45:07,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:45:07,941 INFO L225 Difference]: With dead ends: 90578 [2021-11-17 13:45:07,942 INFO L226 Difference]: Without dead ends: 46982 [2021-11-17 13:45:08,283 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2021-11-17 13:45:08,284 INFO L933 BasicCegarLoop]: 7099 mSDtfsCounter, 11837 mSDsluCounter, 20561 mSDsCounter, 0 mSdLazyCounter, 21139 mSolverCounterSat, 9574 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12552 SdHoareTripleChecker+Valid, 27660 SdHoareTripleChecker+Invalid, 30716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 9574 IncrementalHoareTripleChecker+Valid, 21139 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.3s IncrementalHoareTripleChecker+Time [2021-11-17 13:45:08,284 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12552 Valid, 27660 Invalid, 30716 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [9574 Valid, 21139 Invalid, 3 Unknown, 0 Unchecked, 32.3s Time] [2021-11-17 13:45:08,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46982 states. [2021-11-17 13:45:10,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46982 to 43633. [2021-11-17 13:45:10,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43633 states, 30313 states have (on average 1.3008280275789266) internal successors, (39432), 30864 states have internal predecessors, (39432), 11568 states have call successors, (11568), 1599 states have call predecessors, (11568), 1743 states have return successors, (13845), 11469 states have call predecessors, (13845), 11565 states have call successors, (13845) [2021-11-17 13:45:11,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43633 states to 43633 states and 64845 transitions. [2021-11-17 13:45:11,171 INFO L78 Accepts]: Start accepts. Automaton has 43633 states and 64845 transitions. Word has length 259 [2021-11-17 13:45:11,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:45:11,172 INFO L470 AbstractCegarLoop]: Abstraction has 43633 states and 64845 transitions. [2021-11-17 13:45:11,172 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.8) internal successors, (138), 5 states have internal predecessors, (138), 2 states have call successors, (36), 6 states have call predecessors, (36), 2 states have return successors, (33), 3 states have call predecessors, (33), 2 states have call successors, (33) [2021-11-17 13:45:11,172 INFO L276 IsEmpty]: Start isEmpty. Operand 43633 states and 64845 transitions. [2021-11-17 13:45:11,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2021-11-17 13:45:11,177 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:45:11,177 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:45:11,177 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-17 13:45:11,177 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ldv_linux_kernel_module_module_putErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2021-11-17 13:45:11,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:45:11,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1685736867, now seen corresponding path program 1 times [2021-11-17 13:45:11,177 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:45:11,177 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978081507] [2021-11-17 13:45:11,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:45:11,178 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:45:11,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:45:11,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:45:11,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:45:11,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 13:45:11,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:45:11,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:45:11,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:45:11,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:45:11,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:45:11,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:45:11,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:45:11,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:45:11,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:45:11,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-11-17 13:45:11,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:45:11,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-17 13:45:11,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:45:11,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:45:11,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:45:11,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-17 13:45:11,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:45:11,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:45:11,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:45:11,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-17 13:45:11,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:45:11,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-17 13:45:11,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:45:11,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:45:11,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:45:11,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-17 13:45:11,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:45:11,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:45:11,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:45:11,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-17 13:45:11,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:45:11,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-11-17 13:45:11,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:45:11,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-17 13:45:11,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:45:11,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:45:11,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:45:11,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 13:45:11,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:45:11,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:45:11,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:45:11,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-17 13:45:11,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:45:11,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2021-11-17 13:45:11,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:45:11,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2021-11-17 13:45:11,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:45:11,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2021-11-17 13:45:11,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:45:11,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:45:11,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:45:11,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2021-11-17 13:45:11,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:45:11,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2021-11-17 13:45:11,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:45:11,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2021-11-17 13:45:11,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:45:11,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2021-11-17 13:45:11,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:45:11,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:45:11,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:45:11,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:45:11,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:45:11,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:45:11,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:45:11,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2021-11-17 13:45:11,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:45:11,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2021-11-17 13:45:11,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:45:11,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:45:11,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:45:11,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:45:11,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:45:11,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:45:11,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:45:11,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2021-11-17 13:45:11,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:45:11,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2021-11-17 13:45:11,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:45:11,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:45:11,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:45:11,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2021-11-17 13:45:11,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:45:11,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:45:11,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:45:11,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 307 [2021-11-17 13:45:11,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:45:11,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-11-17 13:45:11,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:45:11,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 322 [2021-11-17 13:45:11,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:45:11,635 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2021-11-17 13:45:11,635 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:45:11,635 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978081507] [2021-11-17 13:45:11,636 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978081507] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:45:11,636 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:45:11,636 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-17 13:45:11,636 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055351583] [2021-11-17 13:45:11,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:45:11,636 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-17 13:45:11,637 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:45:11,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-17 13:45:11,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-11-17 13:45:11,637 INFO L87 Difference]: Start difference. First operand 43633 states and 64845 transitions. Second operand has 10 states, 10 states have (on average 14.8) internal successors, (148), 5 states have internal predecessors, (148), 2 states have call successors, (43), 6 states have call predecessors, (43), 2 states have return successors, (40), 3 states have call predecessors, (40), 2 states have call successors, (40) [2021-11-17 13:45:13,678 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:45:16,143 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.46s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:45:18,545 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] Killed by 15