./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 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---fs--nfs--nfsv2.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 32187ad6a98dd17c1b18f8e1b845f566cde13ca56738d1b8876a5b9bb005af7a --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 04:54:27,787 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 04:54:27,794 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 04:54:27,839 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 04:54:27,840 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 04:54:27,841 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 04:54:27,843 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 04:54:27,845 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 04:54:27,847 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 04:54:27,850 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 04:54:27,851 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 04:54:27,852 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 04:54:27,853 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 04:54:27,854 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 04:54:27,855 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 04:54:27,857 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 04:54:27,858 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 04:54:27,859 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 04:54:27,860 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 04:54:27,864 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 04:54:27,866 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 04:54:27,867 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 04:54:27,867 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 04:54:27,868 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 04:54:27,869 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 04:54:27,871 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 04:54:27,871 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 04:54:27,872 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 04:54:27,872 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 04:54:27,873 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 04:54:27,874 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 04:54:27,874 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 04:54:27,875 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 04:54:27,875 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 04:54:27,876 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 04:54:27,877 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 04:54:27,877 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 04:54:27,877 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 04:54:27,877 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 04:54:27,878 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 04:54:27,879 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 04:54:27,880 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 04:54:27,881 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-14 04:54:27,911 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 04:54:27,912 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 04:54:27,912 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 04:54:27,912 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 04:54:27,913 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 04:54:27,913 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 04:54:27,914 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 04:54:27,914 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 04:54:27,914 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 04:54:27,914 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 04:54:27,915 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 04:54:27,915 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 04:54:27,915 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-14 04:54:27,915 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 04:54:27,915 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-14 04:54:27,915 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 04:54:27,916 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 04:54:27,916 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-14 04:54:27,917 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 04:54:27,917 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 04:54:27,917 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 04:54:27,917 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 04:54:27,918 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 04:54:27,918 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 04:54:27,918 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-14 04:54:27,918 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 04:54:27,918 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 04:54:27,918 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-14 04:54:27,918 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-14 04:54:27,919 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-14 04:54:27,919 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 -> 32187ad6a98dd17c1b18f8e1b845f566cde13ca56738d1b8876a5b9bb005af7a [2022-07-14 04:54:28,116 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 04:54:28,134 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 04:54:28,136 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 04:54:28,137 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 04:54:28,138 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 04:54:28,139 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---fs--nfs--nfsv2.ko.cil.i [2022-07-14 04:54:28,190 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c85756254/e0defb71a4f149b4b1604e8dc681b956/FLAG67d06617f [2022-07-14 04:54:29,212 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 04:54:29,212 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i [2022-07-14 04:54:29,277 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c85756254/e0defb71a4f149b4b1604e8dc681b956/FLAG67d06617f [2022-07-14 04:54:29,690 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c85756254/e0defb71a4f149b4b1604e8dc681b956 [2022-07-14 04:54:29,692 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 04:54:29,693 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 04:54:29,694 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 04:54:29,694 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 04:54:29,696 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 04:54:29,696 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 04:54:29" (1/1) ... [2022-07-14 04:54:29,697 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cbda67d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:54:29, skipping insertion in model container [2022-07-14 04:54:29,697 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 04:54:29" (1/1) ... [2022-07-14 04:54:29,701 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 04:54:29,869 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 04:54:40,835 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1177218,1177231] [2022-07-14 04:54:40,837 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1177363,1177376] [2022-07-14 04:54:40,837 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1177509,1177522] [2022-07-14 04:54:40,837 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1177674,1177687] [2022-07-14 04:54:40,838 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1177832,1177845] [2022-07-14 04:54:40,838 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1177990,1178003] [2022-07-14 04:54:40,838 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1178148,1178161] [2022-07-14 04:54:40,838 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1178308,1178321] [2022-07-14 04:54:40,839 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1178467,1178480] [2022-07-14 04:54:40,839 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1178606,1178619] [2022-07-14 04:54:40,839 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1178748,1178761] [2022-07-14 04:54:40,840 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1178897,1178910] [2022-07-14 04:54:40,840 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1179036,1179049] [2022-07-14 04:54:40,840 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1179191,1179204] [2022-07-14 04:54:40,841 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1179351,1179364] [2022-07-14 04:54:40,841 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1179502,1179515] [2022-07-14 04:54:40,841 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1179653,1179666] [2022-07-14 04:54:40,842 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1179805,1179818] [2022-07-14 04:54:40,842 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1179954,1179967] [2022-07-14 04:54:40,842 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1180102,1180115] [2022-07-14 04:54:40,842 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1180259,1180272] [2022-07-14 04:54:40,843 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1180408,1180421] [2022-07-14 04:54:40,843 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1180564,1180577] [2022-07-14 04:54:40,843 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1180717,1180730] [2022-07-14 04:54:40,844 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1180863,1180876] [2022-07-14 04:54:40,844 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1181006,1181019] [2022-07-14 04:54:40,844 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1181158,1181171] [2022-07-14 04:54:40,845 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1181304,1181317] [2022-07-14 04:54:40,845 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1181449,1181462] [2022-07-14 04:54:40,845 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1181603,1181616] [2022-07-14 04:54:40,845 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1181754,1181767] [2022-07-14 04:54:40,846 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1181909,1181922] [2022-07-14 04:54:40,846 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1182061,1182074] [2022-07-14 04:54:40,846 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1182216,1182229] [2022-07-14 04:54:40,847 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1182380,1182393] [2022-07-14 04:54:40,847 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1182536,1182549] [2022-07-14 04:54:40,847 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1182700,1182713] [2022-07-14 04:54:40,848 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1182842,1182855] [2022-07-14 04:54:40,848 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1183000,1183013] [2022-07-14 04:54:40,848 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1183167,1183180] [2022-07-14 04:54:40,848 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1183326,1183339] [2022-07-14 04:54:40,849 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1183485,1183498] [2022-07-14 04:54:40,849 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1183634,1183647] [2022-07-14 04:54:40,849 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1183781,1183794] [2022-07-14 04:54:40,850 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1183920,1183933] [2022-07-14 04:54:40,850 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1184083,1184096] [2022-07-14 04:54:40,850 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1184249,1184262] [2022-07-14 04:54:40,851 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1184413,1184426] [2022-07-14 04:54:40,851 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1184578,1184591] [2022-07-14 04:54:40,851 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1184743,1184756] [2022-07-14 04:54:40,851 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1184909,1184922] [2022-07-14 04:54:40,852 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1185074,1185087] [2022-07-14 04:54:40,852 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1185241,1185254] [2022-07-14 04:54:40,852 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1185401,1185414] [2022-07-14 04:54:40,853 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1185563,1185576] [2022-07-14 04:54:40,853 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1185722,1185735] [2022-07-14 04:54:40,853 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1185868,1185881] [2022-07-14 04:54:40,853 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1186011,1186024] [2022-07-14 04:54:40,854 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1186155,1186168] [2022-07-14 04:54:40,854 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1186298,1186311] [2022-07-14 04:54:40,854 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1186442,1186455] [2022-07-14 04:54:40,855 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1186583,1186596] [2022-07-14 04:54:40,855 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1186721,1186734] [2022-07-14 04:54:40,855 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1186879,1186892] [2022-07-14 04:54:40,856 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1187038,1187051] [2022-07-14 04:54:40,856 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1187194,1187207] [2022-07-14 04:54:40,856 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1187343,1187356] [2022-07-14 04:54:40,856 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1187495,1187508] [2022-07-14 04:54:40,857 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1187646,1187659] [2022-07-14 04:54:40,857 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1187795,1187808] [2022-07-14 04:54:40,857 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1187947,1187960] [2022-07-14 04:54:40,858 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1188095,1188108] [2022-07-14 04:54:40,858 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1188248,1188261] [2022-07-14 04:54:40,858 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1188399,1188412] [2022-07-14 04:54:40,859 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1188549,1188562] [2022-07-14 04:54:40,859 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1188696,1188709] [2022-07-14 04:54:40,859 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1188847,1188860] [2022-07-14 04:54:40,859 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1188998,1189011] [2022-07-14 04:54:40,860 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1189146,1189159] [2022-07-14 04:54:40,860 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1189312,1189325] [2022-07-14 04:54:40,860 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1189481,1189494] [2022-07-14 04:54:40,861 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1189648,1189661] [2022-07-14 04:54:40,861 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1189816,1189829] [2022-07-14 04:54:40,861 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1189966,1189979] [2022-07-14 04:54:40,861 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1190113,1190126] [2022-07-14 04:54:40,862 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1190274,1190287] [2022-07-14 04:54:40,862 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1190444,1190457] [2022-07-14 04:54:40,862 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1190606,1190619] [2022-07-14 04:54:40,874 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 04:54:40,893 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 04:54:41,261 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1177218,1177231] [2022-07-14 04:54:41,261 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1177363,1177376] [2022-07-14 04:54:41,262 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1177509,1177522] [2022-07-14 04:54:41,262 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1177674,1177687] [2022-07-14 04:54:41,262 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1177832,1177845] [2022-07-14 04:54:41,263 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1177990,1178003] [2022-07-14 04:54:41,263 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1178148,1178161] [2022-07-14 04:54:41,263 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1178308,1178321] [2022-07-14 04:54:41,264 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1178467,1178480] [2022-07-14 04:54:41,264 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1178606,1178619] [2022-07-14 04:54:41,264 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1178748,1178761] [2022-07-14 04:54:41,264 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1178897,1178910] [2022-07-14 04:54:41,265 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1179036,1179049] [2022-07-14 04:54:41,265 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1179191,1179204] [2022-07-14 04:54:41,265 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1179351,1179364] [2022-07-14 04:54:41,265 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1179502,1179515] [2022-07-14 04:54:41,266 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1179653,1179666] [2022-07-14 04:54:41,266 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1179805,1179818] [2022-07-14 04:54:41,266 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1179954,1179967] [2022-07-14 04:54:41,267 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1180102,1180115] [2022-07-14 04:54:41,267 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1180259,1180272] [2022-07-14 04:54:41,267 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1180408,1180421] [2022-07-14 04:54:41,267 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1180564,1180577] [2022-07-14 04:54:41,268 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1180717,1180730] [2022-07-14 04:54:41,268 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1180863,1180876] [2022-07-14 04:54:41,268 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1181006,1181019] [2022-07-14 04:54:41,268 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1181158,1181171] [2022-07-14 04:54:41,269 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1181304,1181317] [2022-07-14 04:54:41,269 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1181449,1181462] [2022-07-14 04:54:41,269 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1181603,1181616] [2022-07-14 04:54:41,269 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1181754,1181767] [2022-07-14 04:54:41,270 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1181909,1181922] [2022-07-14 04:54:41,270 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1182061,1182074] [2022-07-14 04:54:41,270 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1182216,1182229] [2022-07-14 04:54:41,271 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1182380,1182393] [2022-07-14 04:54:41,271 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1182536,1182549] [2022-07-14 04:54:41,271 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1182700,1182713] [2022-07-14 04:54:41,271 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1182842,1182855] [2022-07-14 04:54:41,272 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1183000,1183013] [2022-07-14 04:54:41,272 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1183167,1183180] [2022-07-14 04:54:41,272 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1183326,1183339] [2022-07-14 04:54:41,272 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1183485,1183498] [2022-07-14 04:54:41,273 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1183634,1183647] [2022-07-14 04:54:41,273 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1183781,1183794] [2022-07-14 04:54:41,273 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1183920,1183933] [2022-07-14 04:54:41,273 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1184083,1184096] [2022-07-14 04:54:41,274 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1184249,1184262] [2022-07-14 04:54:41,274 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1184413,1184426] [2022-07-14 04:54:41,274 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1184578,1184591] [2022-07-14 04:54:41,275 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1184743,1184756] [2022-07-14 04:54:41,275 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1184909,1184922] [2022-07-14 04:54:41,275 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1185074,1185087] [2022-07-14 04:54:41,275 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1185241,1185254] [2022-07-14 04:54:41,276 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1185401,1185414] [2022-07-14 04:54:41,276 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1185563,1185576] [2022-07-14 04:54:41,276 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1185722,1185735] [2022-07-14 04:54:41,276 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1185868,1185881] [2022-07-14 04:54:41,277 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1186011,1186024] [2022-07-14 04:54:41,277 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1186155,1186168] [2022-07-14 04:54:41,277 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1186298,1186311] [2022-07-14 04:54:41,277 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1186442,1186455] [2022-07-14 04:54:41,278 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1186583,1186596] [2022-07-14 04:54:41,278 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1186721,1186734] [2022-07-14 04:54:41,278 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1186879,1186892] [2022-07-14 04:54:41,279 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1187038,1187051] [2022-07-14 04:54:41,279 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1187194,1187207] [2022-07-14 04:54:41,279 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1187343,1187356] [2022-07-14 04:54:41,279 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1187495,1187508] [2022-07-14 04:54:41,280 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1187646,1187659] [2022-07-14 04:54:41,280 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1187795,1187808] [2022-07-14 04:54:41,280 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1187947,1187960] [2022-07-14 04:54:41,280 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1188095,1188108] [2022-07-14 04:54:41,281 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1188248,1188261] [2022-07-14 04:54:41,281 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1188399,1188412] [2022-07-14 04:54:41,281 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1188549,1188562] [2022-07-14 04:54:41,281 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1188696,1188709] [2022-07-14 04:54:41,282 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1188847,1188860] [2022-07-14 04:54:41,282 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1188998,1189011] [2022-07-14 04:54:41,282 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1189146,1189159] [2022-07-14 04:54:41,282 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1189312,1189325] [2022-07-14 04:54:41,283 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1189481,1189494] [2022-07-14 04:54:41,283 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1189648,1189661] [2022-07-14 04:54:41,283 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1189816,1189829] [2022-07-14 04:54:41,283 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1189966,1189979] [2022-07-14 04:54:41,284 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1190113,1190126] [2022-07-14 04:54:41,284 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1190274,1190287] [2022-07-14 04:54:41,284 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1190444,1190457] [2022-07-14 04:54:41,284 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1190606,1190619] [2022-07-14 04:54:41,287 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 04:54:41,680 INFO L208 MainTranslator]: Completed translation [2022-07-14 04:54:41,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:54:41 WrapperNode [2022-07-14 04:54:41,680 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 04:54:41,681 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 04:54:41,681 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 04:54:41,682 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 04:54:41,687 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:54:41" (1/1) ... [2022-07-14 04:54:41,834 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:54:41" (1/1) ... [2022-07-14 04:54:42,079 INFO L137 Inliner]: procedures = 1178, calls = 4145, calls flagged for inlining = 795, calls inlined = 711, statements flattened = 14771 [2022-07-14 04:54:42,080 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 04:54:42,080 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 04:54:42,080 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 04:54:42,081 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 04:54:42,087 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:54:41" (1/1) ... [2022-07-14 04:54:42,088 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:54:41" (1/1) ... [2022-07-14 04:54:42,146 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:54:41" (1/1) ... [2022-07-14 04:54:42,146 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:54:41" (1/1) ... [2022-07-14 04:54:42,312 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:54:41" (1/1) ... [2022-07-14 04:54:42,344 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:54:41" (1/1) ... [2022-07-14 04:54:42,390 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:54:41" (1/1) ... [2022-07-14 04:54:42,464 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 04:54:42,466 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 04:54:42,466 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 04:54:42,466 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 04:54:42,467 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:54:41" (1/1) ... [2022-07-14 04:54:42,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 04:54:42,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 04:54:42,514 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-14 04:54:42,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-14 04:54:42,549 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-14 04:54:42,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-14 04:54:42,550 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_create [2022-07-14 04:54:42,550 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_create [2022-07-14 04:54:42,550 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-14 04:54:42,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-14 04:54:42,550 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_write_setup [2022-07-14 04:54:42,550 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_write_setup [2022-07-14 04:54:42,550 INFO L130 BoogieDeclarations]: Found specification of procedure xdr_write_pages [2022-07-14 04:54:42,551 INFO L138 BoogieDeclarations]: Found implementation of procedure xdr_write_pages [2022-07-14 04:54:42,551 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_alloc_createdata [2022-07-14 04:54:42,552 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_alloc_createdata [2022-07-14 04:54:42,552 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_lock_check_bounds [2022-07-14 04:54:42,552 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_lock_check_bounds [2022-07-14 04:54:42,552 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_mkdir [2022-07-14 04:54:42,552 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_mkdir [2022-07-14 04:54:42,553 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_rename_setup [2022-07-14 04:54:42,553 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_rename_setup [2022-07-14 04:54:42,554 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-07-14 04:54:42,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-07-14 04:54:42,554 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_lookup [2022-07-14 04:54:42,554 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_lookup [2022-07-14 04:54:42,554 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-14 04:54:42,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-14 04:54:42,555 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 04:54:42,556 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-14 04:54:42,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-14 04:54:42,556 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-07-14 04:54:42,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-07-14 04:54:42,556 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2022-07-14 04:54:42,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2022-07-14 04:54:42,557 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_unlink [2022-07-14 04:54:42,557 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_stat_to_errno [2022-07-14 04:54:42,557 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_stat_to_errno [2022-07-14 04:54:42,557 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-14 04:54:42,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-14 04:54:42,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 04:54:42,557 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_readdir [2022-07-14 04:54:42,558 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_readdir [2022-07-14 04:54:42,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 04:54:42,558 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-14 04:54:42,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-14 04:54:42,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 04:54:42,558 INFO L130 BoogieDeclarations]: Found specification of procedure encode_sattr [2022-07-14 04:54:42,558 INFO L138 BoogieDeclarations]: Found implementation of procedure encode_sattr [2022-07-14 04:54:42,558 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_rename_rpc_prepare [2022-07-14 04:54:42,559 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_rename_rpc_prepare [2022-07-14 04:54:42,559 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_unlink_rpc_prepare [2022-07-14 04:54:42,559 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_unlink_rpc_prepare [2022-07-14 04:54:42,559 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_rmdir [2022-07-14 04:54:42,559 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_rmdir [2022-07-14 04:54:42,559 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_free_client [2022-07-14 04:54:42,559 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_free_client [2022-07-14 04:54:42,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 04:54:42,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 04:54:42,560 INFO L130 BoogieDeclarations]: Found specification of procedure __kuid_val [2022-07-14 04:54:42,560 INFO L138 BoogieDeclarations]: Found implementation of procedure __kuid_val [2022-07-14 04:54:42,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-14 04:54:42,560 INFO L130 BoogieDeclarations]: Found specification of procedure xdr_encode_current_server_time [2022-07-14 04:54:42,561 INFO L138 BoogieDeclarations]: Found implementation of procedure xdr_encode_current_server_time [2022-07-14 04:54:42,561 INFO L130 BoogieDeclarations]: Found specification of procedure __be32_to_cpup [2022-07-14 04:54:42,561 INFO L138 BoogieDeclarations]: Found implementation of procedure __be32_to_cpup [2022-07-14 04:54:42,561 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_commit_rpc_prepare [2022-07-14 04:54:42,561 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_commit_rpc_prepare [2022-07-14 04:54:42,561 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_readlink [2022-07-14 04:54:42,561 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_readlink [2022-07-14 04:54:42,562 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_invalidate_atime [2022-07-14 04:54:42,562 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_invalidate_atime [2022-07-14 04:54:42,562 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_clone_server [2022-07-14 04:54:42,562 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_clone_server [2022-07-14 04:54:42,562 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-07-14 04:54:42,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-07-14 04:54:42,562 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_pgio_rpc_prepare [2022-07-14 04:54:42,564 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_pgio_rpc_prepare [2022-07-14 04:54:42,565 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_permission [2022-07-14 04:54:42,566 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_permission [2022-07-14 04:54:42,566 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-07-14 04:54:42,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-07-14 04:54:42,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 04:54:42,567 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-14 04:54:42,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-14 04:54:42,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 04:54:42,571 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_symlink [2022-07-14 04:54:42,571 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_symlink [2022-07-14 04:54:42,571 INFO L130 BoogieDeclarations]: Found specification of procedure xdr_encode_time [2022-07-14 04:54:42,571 INFO L138 BoogieDeclarations]: Found implementation of procedure xdr_encode_time [2022-07-14 04:54:42,571 INFO L130 BoogieDeclarations]: Found specification of procedure NFS_I [2022-07-14 04:54:42,571 INFO L138 BoogieDeclarations]: Found implementation of procedure NFS_I [2022-07-14 04:54:42,572 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_rename_done [2022-07-14 04:54:42,572 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_rename_done [2022-07-14 04:54:42,572 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-14 04:54:42,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-14 04:54:42,572 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-07-14 04:54:42,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-07-14 04:54:42,572 INFO L130 BoogieDeclarations]: Found specification of procedure xdr_decode_time [2022-07-14 04:54:42,572 INFO L138 BoogieDeclarations]: Found implementation of procedure xdr_decode_time [2022-07-14 04:54:42,573 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_getattr [2022-07-14 04:54:42,573 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_getattr [2022-07-14 04:54:42,574 INFO L130 BoogieDeclarations]: Found specification of procedure decode_attrstat [2022-07-14 04:54:42,574 INFO L138 BoogieDeclarations]: Found implementation of procedure decode_attrstat [2022-07-14 04:54:42,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 04:54:42,574 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-14 04:54:42,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-14 04:54:42,574 INFO L130 BoogieDeclarations]: Found specification of procedure __kgid_val [2022-07-14 04:54:42,574 INFO L138 BoogieDeclarations]: Found implementation of procedure __kgid_val [2022-07-14 04:54:42,574 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_alloc_client [2022-07-14 04:54:42,575 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_alloc_client [2022-07-14 04:54:42,575 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_lock [2022-07-14 04:54:42,575 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_lock [2022-07-14 04:54:42,575 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_statfs [2022-07-14 04:54:42,575 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_statfs [2022-07-14 04:54:42,575 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_remove [2022-07-14 04:54:42,575 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_remove [2022-07-14 04:54:42,575 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_read_done [2022-07-14 04:54:42,576 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_read_done [2022-07-14 04:54:42,576 INFO L130 BoogieDeclarations]: Found specification of procedure prepare_reply_buffer [2022-07-14 04:54:42,576 INFO L138 BoogieDeclarations]: Found implementation of procedure prepare_reply_buffer [2022-07-14 04:54:42,576 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_read_setup [2022-07-14 04:54:42,576 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_read_setup [2022-07-14 04:54:42,577 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-07-14 04:54:42,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-07-14 04:54:42,577 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_return_delegation [2022-07-14 04:54:42,577 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_return_delegation [2022-07-14 04:54:42,577 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-14 04:54:42,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-14 04:54:42,578 INFO L130 BoogieDeclarations]: Found specification of procedure encode_fhandle [2022-07-14 04:54:42,578 INFO L138 BoogieDeclarations]: Found implementation of procedure encode_fhandle [2022-07-14 04:54:42,578 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-07-14 04:54:42,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-07-14 04:54:42,578 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-07-14 04:54:42,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-07-14 04:54:42,578 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_instantiate [2022-07-14 04:54:42,578 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_instantiate [2022-07-14 04:54:42,579 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_commit_setup [2022-07-14 04:54:42,579 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_commit_setup [2022-07-14 04:54:42,579 INFO L130 BoogieDeclarations]: Found specification of procedure NFS_SERVER [2022-07-14 04:54:42,579 INFO L138 BoogieDeclarations]: Found implementation of procedure NFS_SERVER [2022-07-14 04:54:42,579 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-14 04:54:42,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-14 04:54:42,579 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-14 04:54:42,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-14 04:54:42,579 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-07-14 04:54:42,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-07-14 04:54:42,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 04:54:42,580 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_link [2022-07-14 04:54:42,580 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_link [2022-07-14 04:54:42,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-14 04:54:42,580 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_pathconf [2022-07-14 04:54:42,580 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_pathconf [2022-07-14 04:54:42,580 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_rename [2022-07-14 04:54:42,581 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_rename [2022-07-14 04:54:42,581 INFO L130 BoogieDeclarations]: Found specification of procedure NFS_FH [2022-07-14 04:54:42,581 INFO L138 BoogieDeclarations]: Found implementation of procedure NFS_FH [2022-07-14 04:54:42,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-14 04:54:42,581 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2022-07-14 04:54:42,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2022-07-14 04:54:42,581 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2022-07-14 04:54:42,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2022-07-14 04:54:42,582 INFO L130 BoogieDeclarations]: Found specification of procedure decode_stat [2022-07-14 04:54:42,582 INFO L138 BoogieDeclarations]: Found implementation of procedure decode_stat [2022-07-14 04:54:42,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-14 04:54:42,582 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-14 04:54:42,582 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-07-14 04:54:42,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-07-14 04:54:42,582 INFO L130 BoogieDeclarations]: Found specification of procedure nfs2_xdr_enc_writeargs [2022-07-14 04:54:42,582 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs2_xdr_enc_writeargs [2022-07-14 04:54:42,583 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-07-14 04:54:42,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-07-14 04:54:42,583 INFO L130 BoogieDeclarations]: Found specification of procedure xdr_read_pages [2022-07-14 04:54:42,583 INFO L138 BoogieDeclarations]: Found implementation of procedure xdr_read_pages [2022-07-14 04:54:42,583 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_rmdir [2022-07-14 04:54:42,583 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_rmdir [2022-07-14 04:54:42,583 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-07-14 04:54:42,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-07-14 04:54:42,584 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_fattr_init [2022-07-14 04:54:42,584 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_fattr_init [2022-07-14 04:54:42,584 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_setattr [2022-07-14 04:54:42,584 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_setattr [2022-07-14 04:54:42,584 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_fsinfo [2022-07-14 04:54:42,584 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_fsinfo [2022-07-14 04:54:42,584 INFO L130 BoogieDeclarations]: Found specification of procedure print_overflow_msg [2022-07-14 04:54:42,584 INFO L138 BoogieDeclarations]: Found implementation of procedure print_overflow_msg [2022-07-14 04:54:42,585 INFO L130 BoogieDeclarations]: Found specification of procedure xdr_inline_decode [2022-07-14 04:54:42,585 INFO L138 BoogieDeclarations]: Found implementation of procedure xdr_inline_decode [2022-07-14 04:54:42,663 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_free_createdata [2022-07-14 04:54:42,663 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_free_createdata [2022-07-14 04:54:42,663 INFO L130 BoogieDeclarations]: Found specification of procedure decode_fattr [2022-07-14 04:54:42,663 INFO L138 BoogieDeclarations]: Found implementation of procedure decode_fattr [2022-07-14 04:54:42,663 INFO L130 BoogieDeclarations]: Found specification of procedure NFS_CLIENT [2022-07-14 04:54:42,663 INFO L138 BoogieDeclarations]: Found implementation of procedure NFS_CLIENT [2022-07-14 04:54:42,663 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-07-14 04:54:42,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-07-14 04:54:42,663 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_write_done [2022-07-14 04:54:42,663 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_write_done [2022-07-14 04:54:42,663 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2022-07-14 04:54:42,663 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2022-07-14 04:54:42,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-14 04:54:42,664 INFO L130 BoogieDeclarations]: Found specification of procedure rpc_call_start [2022-07-14 04:54:42,664 INFO L138 BoogieDeclarations]: Found implementation of procedure rpc_call_start [2022-07-14 04:54:42,664 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-14 04:54:42,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-14 04:54:42,664 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-14 04:54:42,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-14 04:54:42,664 INFO L130 BoogieDeclarations]: Found specification of procedure nfs2_xdr_dec_attrstat [2022-07-14 04:54:42,664 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs2_xdr_dec_attrstat [2022-07-14 04:54:42,664 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_get_root [2022-07-14 04:54:42,664 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_get_root [2022-07-14 04:54:42,664 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_try_mount [2022-07-14 04:54:42,664 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_try_mount [2022-07-14 04:54:42,664 INFO L130 BoogieDeclarations]: Found specification of procedure nfs2_decode_dirent [2022-07-14 04:54:42,664 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs2_decode_dirent [2022-07-14 04:54:42,664 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_create_server [2022-07-14 04:54:42,664 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_create_server [2022-07-14 04:54:42,664 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_mknod [2022-07-14 04:54:42,664 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_mknod [2022-07-14 04:54:42,664 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~$Pointer$~TO~int [2022-07-14 04:54:42,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~$Pointer$~TO~int [2022-07-14 04:54:42,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-14 04:54:42,664 INFO L130 BoogieDeclarations]: Found specification of procedure xdr_reserve_space [2022-07-14 04:54:42,664 INFO L138 BoogieDeclarations]: Found implementation of procedure xdr_reserve_space [2022-07-14 04:54:42,664 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-14 04:54:42,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-14 04:54:42,665 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_close_context [2022-07-14 04:54:42,665 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_close_context [2022-07-14 04:54:42,665 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-14 04:54:42,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-14 04:54:42,665 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_init_client [2022-07-14 04:54:42,665 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_init_client [2022-07-14 04:54:42,665 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-14 04:54:42,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-14 04:54:42,665 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-14 04:54:42,665 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-14 04:54:42,665 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_unlink_done [2022-07-14 04:54:42,665 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_unlink_done [2022-07-14 04:54:42,665 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-14 04:54:42,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-14 04:54:42,665 INFO L130 BoogieDeclarations]: Found specification of procedure rpc_call_sync [2022-07-14 04:54:42,665 INFO L138 BoogieDeclarations]: Found implementation of procedure rpc_call_sync [2022-07-14 04:54:42,665 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-14 04:54:42,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-14 04:54:42,665 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_submount [2022-07-14 04:54:42,665 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_submount [2022-07-14 04:54:42,665 INFO L130 BoogieDeclarations]: Found specification of procedure encode_diropargs [2022-07-14 04:54:42,665 INFO L138 BoogieDeclarations]: Found implementation of procedure encode_diropargs [2022-07-14 04:54:42,665 INFO L130 BoogieDeclarations]: Found specification of procedure xdr_time_not_set [2022-07-14 04:54:42,665 INFO L138 BoogieDeclarations]: Found implementation of procedure xdr_time_not_set [2022-07-14 04:54:42,665 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-14 04:54:42,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-14 04:54:42,666 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-14 04:54:42,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-14 04:54:42,666 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_unlink_setup [2022-07-14 04:54:42,666 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_unlink_setup [2022-07-14 04:54:42,666 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-14 04:54:42,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-14 04:54:42,666 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_setattr [2022-07-14 04:54:42,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 04:54:42,666 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_mark_for_revalidate [2022-07-14 04:54:42,666 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_mark_for_revalidate [2022-07-14 04:54:42,666 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_have_delegation [2022-07-14 04:54:42,666 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_have_delegation [2022-07-14 04:54:44,800 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 04:54:44,802 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 04:54:45,159 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-14 04:54:51,893 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 04:54:51,925 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 04:54:51,925 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-14 04:54:51,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 04:54:51 BoogieIcfgContainer [2022-07-14 04:54:51,931 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 04:54:51,933 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 04:54:51,933 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 04:54:51,935 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 04:54:51,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 04:54:29" (1/3) ... [2022-07-14 04:54:51,937 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cd57a73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 04:54:51, skipping insertion in model container [2022-07-14 04:54:51,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:54:41" (2/3) ... [2022-07-14 04:54:51,938 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cd57a73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 04:54:51, skipping insertion in model container [2022-07-14 04:54:51,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 04:54:51" (3/3) ... [2022-07-14 04:54:51,939 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i [2022-07-14 04:54:51,948 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 04:54:51,949 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2022-07-14 04:54:52,061 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 04:54:52,066 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@58000295, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@60d39b39 [2022-07-14 04:54:52,066 INFO L358 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2022-07-14 04:54:52,079 INFO L276 IsEmpty]: Start isEmpty. Operand has 5395 states, 3399 states have (on average 1.2509561635775228) internal successors, (4252), 3752 states have internal predecessors, (4252), 1850 states have call successors, (1850), 121 states have call predecessors, (1850), 120 states have return successors, (1824), 1548 states have call predecessors, (1824), 1824 states have call successors, (1824) [2022-07-14 04:54:52,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-14 04:54:52,085 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:54:52,085 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:54:52,086 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 23 more)] === [2022-07-14 04:54:52,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:54:52,089 INFO L85 PathProgramCache]: Analyzing trace with hash -944763359, now seen corresponding path program 1 times [2022-07-14 04:54:52,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:54:52,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833910453] [2022-07-14 04:54:52,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:54:52,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:54:52,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:52,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:54:52,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:52,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 04:54:52,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:52,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:54:52,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:52,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-14 04:54:52,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:52,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:54:52,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:52,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-14 04:54:52,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:52,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-14 04:54:52,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:52,686 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-14 04:54:52,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:54:52,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833910453] [2022-07-14 04:54:52,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833910453] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:54:52,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:54:52,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:54:52,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128275481] [2022-07-14 04:54:52,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:54:52,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:54:52,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:54:52,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:54:52,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:54:52,719 INFO L87 Difference]: Start difference. First operand has 5395 states, 3399 states have (on average 1.2509561635775228) internal successors, (4252), 3752 states have internal predecessors, (4252), 1850 states have call successors, (1850), 121 states have call predecessors, (1850), 120 states have return successors, (1824), 1548 states have call predecessors, (1824), 1824 states have call successors, (1824) Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-14 04:55:03,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:55:03,343 INFO L93 Difference]: Finished difference Result 10695 states and 15913 transitions. [2022-07-14 04:55:03,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:55:03,357 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 50 [2022-07-14 04:55:03,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:55:03,404 INFO L225 Difference]: With dead ends: 10695 [2022-07-14 04:55:03,405 INFO L226 Difference]: Without dead ends: 5254 [2022-07-14 04:55:03,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:55:03,438 INFO L413 NwaCegarLoop]: 7579 mSDtfsCounter, 7565 mSDsluCounter, 11493 mSDsCounter, 0 mSdLazyCounter, 6262 mSolverCounterSat, 4622 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9110 SdHoareTripleChecker+Valid, 19072 SdHoareTripleChecker+Invalid, 10884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4622 IncrementalHoareTripleChecker+Valid, 6262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.9s IncrementalHoareTripleChecker+Time [2022-07-14 04:55:03,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9110 Valid, 19072 Invalid, 10884 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4622 Valid, 6262 Invalid, 0 Unknown, 0 Unchecked, 9.9s Time] [2022-07-14 04:55:03,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5254 states. [2022-07-14 04:55:03,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5254 to 5254. [2022-07-14 04:55:03,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5254 states, 3337 states have (on average 1.2322445310158825) internal successors, (4112), 3652 states have internal predecessors, (4112), 1776 states have call successors, (1776), 118 states have call predecessors, (1776), 117 states have return successors, (1774), 1510 states have call predecessors, (1774), 1774 states have call successors, (1774) [2022-07-14 04:55:03,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5254 states to 5254 states and 7662 transitions. [2022-07-14 04:55:03,843 INFO L78 Accepts]: Start accepts. Automaton has 5254 states and 7662 transitions. Word has length 50 [2022-07-14 04:55:03,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:55:03,845 INFO L495 AbstractCegarLoop]: Abstraction has 5254 states and 7662 transitions. [2022-07-14 04:55:03,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-14 04:55:03,846 INFO L276 IsEmpty]: Start isEmpty. Operand 5254 states and 7662 transitions. [2022-07-14 04:55:03,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-14 04:55:03,848 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:55:03,848 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:55:03,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 04:55:03,849 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_linux_block_genhd_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 23 more)] === [2022-07-14 04:55:03,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:55:03,850 INFO L85 PathProgramCache]: Analyzing trace with hash -116995083, now seen corresponding path program 1 times [2022-07-14 04:55:03,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:55:03,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249699606] [2022-07-14 04:55:03,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:55:03,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:55:03,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:04,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:55:04,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:04,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 04:55:04,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:04,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:55:04,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:04,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-14 04:55:04,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:04,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:55:04,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:04,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-14 04:55:04,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:04,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-14 04:55:04,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:04,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 04:55:04,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:04,157 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-14 04:55:04,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:55:04,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249699606] [2022-07-14 04:55:04,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249699606] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:55:04,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:55:04,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:55:04,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360105643] [2022-07-14 04:55:04,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:55:04,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:55:04,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:55:04,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:55:04,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:55:04,161 INFO L87 Difference]: Start difference. First operand 5254 states and 7662 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-14 04:55:14,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:55:14,565 INFO L93 Difference]: Finished difference Result 5254 states and 7662 transitions. [2022-07-14 04:55:14,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:55:14,566 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 56 [2022-07-14 04:55:14,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:55:14,590 INFO L225 Difference]: With dead ends: 5254 [2022-07-14 04:55:14,590 INFO L226 Difference]: Without dead ends: 5252 [2022-07-14 04:55:14,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:55:14,594 INFO L413 NwaCegarLoop]: 7421 mSDtfsCounter, 7405 mSDsluCounter, 11209 mSDsCounter, 0 mSdLazyCounter, 6212 mSolverCounterSat, 4498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8935 SdHoareTripleChecker+Valid, 18630 SdHoareTripleChecker+Invalid, 10710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4498 IncrementalHoareTripleChecker+Valid, 6212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.0s IncrementalHoareTripleChecker+Time [2022-07-14 04:55:14,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8935 Valid, 18630 Invalid, 10710 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4498 Valid, 6212 Invalid, 0 Unknown, 0 Unchecked, 10.0s Time] [2022-07-14 04:55:14,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5252 states. [2022-07-14 04:55:14,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5252 to 5252. [2022-07-14 04:55:14,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5252 states, 3336 states have (on average 1.2320143884892085) internal successors, (4110), 3650 states have internal predecessors, (4110), 1776 states have call successors, (1776), 118 states have call predecessors, (1776), 117 states have return successors, (1774), 1510 states have call predecessors, (1774), 1774 states have call successors, (1774) [2022-07-14 04:55:14,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5252 states to 5252 states and 7660 transitions. [2022-07-14 04:55:14,872 INFO L78 Accepts]: Start accepts. Automaton has 5252 states and 7660 transitions. Word has length 56 [2022-07-14 04:55:14,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:55:14,873 INFO L495 AbstractCegarLoop]: Abstraction has 5252 states and 7660 transitions. [2022-07-14 04:55:14,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-14 04:55:14,873 INFO L276 IsEmpty]: Start isEmpty. Operand 5252 states and 7660 transitions. [2022-07-14 04:55:14,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-14 04:55:14,876 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:55:14,876 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:55:14,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 04:55:14,877 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 23 more)] === [2022-07-14 04:55:14,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:55:14,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1415149588, now seen corresponding path program 1 times [2022-07-14 04:55:14,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:55:14,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298485651] [2022-07-14 04:55:14,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:55:14,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:55:14,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:15,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:55:15,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:15,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 04:55:15,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:15,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:55:15,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:15,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-14 04:55:15,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:15,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:55:15,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:15,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-14 04:55:15,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:15,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-14 04:55:15,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:15,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 04:55:15,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:15,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 04:55:15,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:15,141 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-14 04:55:15,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:55:15,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298485651] [2022-07-14 04:55:15,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298485651] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:55:15,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:55:15,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:55:15,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657115448] [2022-07-14 04:55:15,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:55:15,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:55:15,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:55:15,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:55:15,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:55:15,144 INFO L87 Difference]: Start difference. First operand 5252 states and 7660 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-14 04:55:25,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:55:25,062 INFO L93 Difference]: Finished difference Result 5252 states and 7660 transitions. [2022-07-14 04:55:25,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:55:25,063 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 62 [2022-07-14 04:55:25,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:55:25,096 INFO L225 Difference]: With dead ends: 5252 [2022-07-14 04:55:25,097 INFO L226 Difference]: Without dead ends: 5250 [2022-07-14 04:55:25,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:55:25,103 INFO L413 NwaCegarLoop]: 7419 mSDtfsCounter, 7399 mSDsluCounter, 11209 mSDsCounter, 0 mSdLazyCounter, 6210 mSolverCounterSat, 4498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8928 SdHoareTripleChecker+Valid, 18628 SdHoareTripleChecker+Invalid, 10708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4498 IncrementalHoareTripleChecker+Valid, 6210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2022-07-14 04:55:25,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8928 Valid, 18628 Invalid, 10708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4498 Valid, 6210 Invalid, 0 Unknown, 0 Unchecked, 9.6s Time] [2022-07-14 04:55:25,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5250 states. [2022-07-14 04:55:25,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5250 to 5250. [2022-07-14 04:55:25,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5250 states, 3335 states have (on average 1.231784107946027) internal successors, (4108), 3648 states have internal predecessors, (4108), 1776 states have call successors, (1776), 118 states have call predecessors, (1776), 117 states have return successors, (1774), 1510 states have call predecessors, (1774), 1774 states have call successors, (1774) [2022-07-14 04:55:25,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5250 states to 5250 states and 7658 transitions. [2022-07-14 04:55:25,486 INFO L78 Accepts]: Start accepts. Automaton has 5250 states and 7658 transitions. Word has length 62 [2022-07-14 04:55:25,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:55:25,486 INFO L495 AbstractCegarLoop]: Abstraction has 5250 states and 7658 transitions. [2022-07-14 04:55:25,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-14 04:55:25,487 INFO L276 IsEmpty]: Start isEmpty. Operand 5250 states and 7658 transitions. [2022-07-14 04:55:25,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-14 04:55:25,491 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:55:25,491 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:55:25,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 04:55:25,492 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 23 more)] === [2022-07-14 04:55:25,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:55:25,492 INFO L85 PathProgramCache]: Analyzing trace with hash -670828120, now seen corresponding path program 1 times [2022-07-14 04:55:25,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:55:25,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68863225] [2022-07-14 04:55:25,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:55:25,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:55:25,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:25,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:55:25,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:25,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 04:55:25,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:25,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:55:25,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:25,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-14 04:55:25,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:25,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:55:25,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:25,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-14 04:55:25,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:25,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-14 04:55:25,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:25,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 04:55:25,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:25,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 04:55:25,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:25,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-14 04:55:25,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:25,770 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-14 04:55:25,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:55:25,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68863225] [2022-07-14 04:55:25,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68863225] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:55:25,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:55:25,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:55:25,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629333705] [2022-07-14 04:55:25,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:55:25,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:55:25,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:55:25,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:55:25,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:55:25,772 INFO L87 Difference]: Start difference. First operand 5250 states and 7658 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-14 04:55:34,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:55:34,300 INFO L93 Difference]: Finished difference Result 5250 states and 7658 transitions. [2022-07-14 04:55:34,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:55:34,300 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 68 [2022-07-14 04:55:34,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:55:34,323 INFO L225 Difference]: With dead ends: 5250 [2022-07-14 04:55:34,323 INFO L226 Difference]: Without dead ends: 5248 [2022-07-14 04:55:34,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:55:34,328 INFO L413 NwaCegarLoop]: 7417 mSDtfsCounter, 7393 mSDsluCounter, 11209 mSDsCounter, 0 mSdLazyCounter, 6208 mSolverCounterSat, 4498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8921 SdHoareTripleChecker+Valid, 18626 SdHoareTripleChecker+Invalid, 10706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4498 IncrementalHoareTripleChecker+Valid, 6208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2022-07-14 04:55:34,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8921 Valid, 18626 Invalid, 10706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4498 Valid, 6208 Invalid, 0 Unknown, 0 Unchecked, 8.2s Time] [2022-07-14 04:55:34,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5248 states. [2022-07-14 04:55:34,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5248 to 5248. [2022-07-14 04:55:34,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5248 states, 3334 states have (on average 1.2315536892621475) internal successors, (4106), 3646 states have internal predecessors, (4106), 1776 states have call successors, (1776), 118 states have call predecessors, (1776), 117 states have return successors, (1774), 1510 states have call predecessors, (1774), 1774 states have call successors, (1774) [2022-07-14 04:55:34,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5248 states to 5248 states and 7656 transitions. [2022-07-14 04:55:34,614 INFO L78 Accepts]: Start accepts. Automaton has 5248 states and 7656 transitions. Word has length 68 [2022-07-14 04:55:34,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:55:34,615 INFO L495 AbstractCegarLoop]: Abstraction has 5248 states and 7656 transitions. [2022-07-14 04:55:34,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-14 04:55:34,616 INFO L276 IsEmpty]: Start isEmpty. Operand 5248 states and 7656 transitions. [2022-07-14 04:55:34,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-14 04:55:34,618 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:55:34,619 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:55:34,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 04:55:34,619 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 23 more)] === [2022-07-14 04:55:34,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:55:34,621 INFO L85 PathProgramCache]: Analyzing trace with hash -135949064, now seen corresponding path program 1 times [2022-07-14 04:55:34,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:55:34,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357186409] [2022-07-14 04:55:34,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:55:34,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:55:34,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:34,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:55:34,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:34,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 04:55:34,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:34,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:55:34,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:34,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-14 04:55:34,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:34,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:55:34,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:34,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-14 04:55:34,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:34,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-14 04:55:34,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:34,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 04:55:34,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:34,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 04:55:34,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:34,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-14 04:55:34,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:34,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-14 04:55:34,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:34,892 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-14 04:55:34,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:55:34,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357186409] [2022-07-14 04:55:34,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357186409] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:55:34,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:55:34,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:55:34,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929165074] [2022-07-14 04:55:34,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:55:34,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:55:34,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:55:34,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:55:34,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:55:34,894 INFO L87 Difference]: Start difference. First operand 5248 states and 7656 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-14 04:55:44,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:55:44,768 INFO L93 Difference]: Finished difference Result 5248 states and 7656 transitions. [2022-07-14 04:55:44,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:55:44,769 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 74 [2022-07-14 04:55:44,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:55:44,790 INFO L225 Difference]: With dead ends: 5248 [2022-07-14 04:55:44,790 INFO L226 Difference]: Without dead ends: 5246 [2022-07-14 04:55:44,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:55:44,794 INFO L413 NwaCegarLoop]: 7415 mSDtfsCounter, 7387 mSDsluCounter, 11209 mSDsCounter, 0 mSdLazyCounter, 6206 mSolverCounterSat, 4498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8914 SdHoareTripleChecker+Valid, 18624 SdHoareTripleChecker+Invalid, 10704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4498 IncrementalHoareTripleChecker+Valid, 6206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2022-07-14 04:55:44,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8914 Valid, 18624 Invalid, 10704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4498 Valid, 6206 Invalid, 0 Unknown, 0 Unchecked, 9.6s Time] [2022-07-14 04:55:44,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5246 states. [2022-07-14 04:55:44,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5246 to 5246. [2022-07-14 04:55:45,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5246 states, 3333 states have (on average 1.2313231323132314) internal successors, (4104), 3644 states have internal predecessors, (4104), 1776 states have call successors, (1776), 118 states have call predecessors, (1776), 117 states have return successors, (1774), 1510 states have call predecessors, (1774), 1774 states have call successors, (1774) [2022-07-14 04:55:45,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5246 states to 5246 states and 7654 transitions. [2022-07-14 04:55:45,024 INFO L78 Accepts]: Start accepts. Automaton has 5246 states and 7654 transitions. Word has length 74 [2022-07-14 04:55:45,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:55:45,025 INFO L495 AbstractCegarLoop]: Abstraction has 5246 states and 7654 transitions. [2022-07-14 04:55:45,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-14 04:55:45,025 INFO L276 IsEmpty]: Start isEmpty. Operand 5246 states and 7654 transitions. [2022-07-14 04:55:45,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-07-14 04:55:45,026 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:55:45,026 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:55:45,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-14 04:55:45,028 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 23 more)] === [2022-07-14 04:55:45,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:55:45,028 INFO L85 PathProgramCache]: Analyzing trace with hash -107039956, now seen corresponding path program 1 times [2022-07-14 04:55:45,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:55:45,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355087947] [2022-07-14 04:55:45,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:55:45,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:55:45,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:45,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:55:45,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:45,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 04:55:45,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:45,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:55:45,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:45,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-14 04:55:45,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:45,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:55:45,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:45,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-14 04:55:45,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:45,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-14 04:55:45,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:45,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 04:55:45,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:45,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 04:55:45,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:45,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-14 04:55:45,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:45,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-14 04:55:45,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:45,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-14 04:55:45,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:45,296 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-14 04:55:45,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:55:45,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355087947] [2022-07-14 04:55:45,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355087947] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:55:45,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:55:45,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:55:45,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525427926] [2022-07-14 04:55:45,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:55:45,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:55:45,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:55:45,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:55:45,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:55:45,299 INFO L87 Difference]: Start difference. First operand 5246 states and 7654 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-14 04:55:56,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:55:56,850 INFO L93 Difference]: Finished difference Result 5246 states and 7654 transitions. [2022-07-14 04:55:56,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:55:56,851 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 80 [2022-07-14 04:55:56,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:55:56,872 INFO L225 Difference]: With dead ends: 5246 [2022-07-14 04:55:56,872 INFO L226 Difference]: Without dead ends: 5244 [2022-07-14 04:55:56,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:55:56,883 INFO L413 NwaCegarLoop]: 7413 mSDtfsCounter, 7381 mSDsluCounter, 11209 mSDsCounter, 0 mSdLazyCounter, 6204 mSolverCounterSat, 4498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8907 SdHoareTripleChecker+Valid, 18622 SdHoareTripleChecker+Invalid, 10702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4498 IncrementalHoareTripleChecker+Valid, 6204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.2s IncrementalHoareTripleChecker+Time [2022-07-14 04:55:56,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8907 Valid, 18622 Invalid, 10702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4498 Valid, 6204 Invalid, 0 Unknown, 0 Unchecked, 11.2s Time] [2022-07-14 04:55:56,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5244 states. [2022-07-14 04:55:57,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5244 to 5244. [2022-07-14 04:55:57,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5244 states, 3332 states have (on average 1.23109243697479) internal successors, (4102), 3642 states have internal predecessors, (4102), 1776 states have call successors, (1776), 118 states have call predecessors, (1776), 117 states have return successors, (1774), 1510 states have call predecessors, (1774), 1774 states have call successors, (1774) [2022-07-14 04:55:57,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5244 states to 5244 states and 7652 transitions. [2022-07-14 04:55:57,181 INFO L78 Accepts]: Start accepts. Automaton has 5244 states and 7652 transitions. Word has length 80 [2022-07-14 04:55:57,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:55:57,183 INFO L495 AbstractCegarLoop]: Abstraction has 5244 states and 7652 transitions. [2022-07-14 04:55:57,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-14 04:55:57,183 INFO L276 IsEmpty]: Start isEmpty. Operand 5244 states and 7652 transitions. [2022-07-14 04:55:57,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-14 04:55:57,185 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:55:57,186 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:55:57,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-14 04:55:57,186 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 23 more)] === [2022-07-14 04:55:57,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:55:57,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1125642395, now seen corresponding path program 1 times [2022-07-14 04:55:57,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:55:57,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023355843] [2022-07-14 04:55:57,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:55:57,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:55:57,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:57,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:55:57,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:57,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 04:55:57,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:57,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:55:57,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:57,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-14 04:55:57,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:57,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:55:57,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:57,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-14 04:55:57,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:57,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-14 04:55:57,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:57,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 04:55:57,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:57,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 04:55:57,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:57,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-14 04:55:57,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:57,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-14 04:55:57,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:57,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-14 04:55:57,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:57,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-14 04:55:57,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:55:57,460 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-14 04:55:57,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:55:57,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023355843] [2022-07-14 04:55:57,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023355843] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:55:57,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:55:57,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:55:57,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914936085] [2022-07-14 04:55:57,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:55:57,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:55:57,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:55:57,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:55:57,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:55:57,463 INFO L87 Difference]: Start difference. First operand 5244 states and 7652 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-14 04:55:59,396 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:56:08,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:56:08,355 INFO L93 Difference]: Finished difference Result 5244 states and 7652 transitions. [2022-07-14 04:56:08,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:56:08,355 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 86 [2022-07-14 04:56:08,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:56:08,370 INFO L225 Difference]: With dead ends: 5244 [2022-07-14 04:56:08,370 INFO L226 Difference]: Without dead ends: 5242 [2022-07-14 04:56:08,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:56:08,373 INFO L413 NwaCegarLoop]: 7411 mSDtfsCounter, 7375 mSDsluCounter, 11209 mSDsCounter, 0 mSdLazyCounter, 6202 mSolverCounterSat, 4498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8900 SdHoareTripleChecker+Valid, 18620 SdHoareTripleChecker+Invalid, 10700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4498 IncrementalHoareTripleChecker+Valid, 6202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2022-07-14 04:56:08,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8900 Valid, 18620 Invalid, 10700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4498 Valid, 6202 Invalid, 0 Unknown, 0 Unchecked, 10.5s Time] [2022-07-14 04:56:08,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5242 states. [2022-07-14 04:56:08,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5242 to 5242. [2022-07-14 04:56:08,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5242 states, 3331 states have (on average 1.2308616031221855) internal successors, (4100), 3640 states have internal predecessors, (4100), 1776 states have call successors, (1776), 118 states have call predecessors, (1776), 117 states have return successors, (1774), 1510 states have call predecessors, (1774), 1774 states have call successors, (1774) [2022-07-14 04:56:08,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5242 states to 5242 states and 7650 transitions. [2022-07-14 04:56:08,656 INFO L78 Accepts]: Start accepts. Automaton has 5242 states and 7650 transitions. Word has length 86 [2022-07-14 04:56:08,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:56:08,656 INFO L495 AbstractCegarLoop]: Abstraction has 5242 states and 7650 transitions. [2022-07-14 04:56:08,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-14 04:56:08,657 INFO L276 IsEmpty]: Start isEmpty. Operand 5242 states and 7650 transitions. [2022-07-14 04:56:08,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-14 04:56:08,657 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:56:08,658 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:56:08,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-14 04:56:08,658 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 23 more)] === [2022-07-14 04:56:08,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:56:08,658 INFO L85 PathProgramCache]: Analyzing trace with hash -800428171, now seen corresponding path program 1 times [2022-07-14 04:56:08,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:56:08,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701210436] [2022-07-14 04:56:08,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:56:08,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:56:08,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:08,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:56:08,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:08,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 04:56:08,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:08,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:56:08,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:08,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-14 04:56:08,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:08,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:56:08,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:08,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-14 04:56:08,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:08,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-14 04:56:08,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:08,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 04:56:08,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:08,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 04:56:08,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:08,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-14 04:56:08,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:08,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-14 04:56:08,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:08,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-14 04:56:08,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:08,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-14 04:56:08,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:08,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-14 04:56:08,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:08,951 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-14 04:56:08,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:56:08,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701210436] [2022-07-14 04:56:08,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701210436] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:56:08,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:56:08,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:56:08,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303006193] [2022-07-14 04:56:08,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:56:08,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:56:08,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:56:08,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:56:08,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:56:08,953 INFO L87 Difference]: Start difference. First operand 5242 states and 7650 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-14 04:56:10,858 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:56:21,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:56:21,646 INFO L93 Difference]: Finished difference Result 5242 states and 7650 transitions. [2022-07-14 04:56:21,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:56:21,646 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 92 [2022-07-14 04:56:21,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:56:21,670 INFO L225 Difference]: With dead ends: 5242 [2022-07-14 04:56:21,670 INFO L226 Difference]: Without dead ends: 5240 [2022-07-14 04:56:21,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:56:21,676 INFO L413 NwaCegarLoop]: 7409 mSDtfsCounter, 7373 mSDsluCounter, 11209 mSDsCounter, 0 mSdLazyCounter, 6196 mSolverCounterSat, 4498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8897 SdHoareTripleChecker+Valid, 18618 SdHoareTripleChecker+Invalid, 10694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4498 IncrementalHoareTripleChecker+Valid, 6196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.2s IncrementalHoareTripleChecker+Time [2022-07-14 04:56:21,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8897 Valid, 18618 Invalid, 10694 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4498 Valid, 6196 Invalid, 0 Unknown, 0 Unchecked, 12.2s Time] [2022-07-14 04:56:21,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5240 states. [2022-07-14 04:56:21,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5240 to 5240. [2022-07-14 04:56:21,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5240 states, 3330 states have (on average 1.2306306306306307) internal successors, (4098), 3638 states have internal predecessors, (4098), 1776 states have call successors, (1776), 118 states have call predecessors, (1776), 117 states have return successors, (1774), 1510 states have call predecessors, (1774), 1774 states have call successors, (1774) [2022-07-14 04:56:22,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5240 states to 5240 states and 7648 transitions. [2022-07-14 04:56:22,091 INFO L78 Accepts]: Start accepts. Automaton has 5240 states and 7648 transitions. Word has length 92 [2022-07-14 04:56:22,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:56:22,091 INFO L495 AbstractCegarLoop]: Abstraction has 5240 states and 7648 transitions. [2022-07-14 04:56:22,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-14 04:56:22,092 INFO L276 IsEmpty]: Start isEmpty. Operand 5240 states and 7648 transitions. [2022-07-14 04:56:22,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-14 04:56:22,093 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:56:22,093 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:56:22,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-14 04:56:22,093 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 23 more)] === [2022-07-14 04:56:22,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:56:22,096 INFO L85 PathProgramCache]: Analyzing trace with hash -412192424, now seen corresponding path program 1 times [2022-07-14 04:56:22,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:56:22,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668099059] [2022-07-14 04:56:22,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:56:22,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:56:22,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:22,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:56:22,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:22,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 04:56:22,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:22,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:56:22,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:22,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-14 04:56:22,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:22,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:56:22,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:22,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-14 04:56:22,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:22,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-14 04:56:22,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:22,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 04:56:22,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:22,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 04:56:22,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:22,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-14 04:56:22,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:22,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-14 04:56:22,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:22,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-14 04:56:22,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:22,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-14 04:56:22,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:22,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-14 04:56:22,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:22,355 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-14 04:56:22,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:56:22,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668099059] [2022-07-14 04:56:22,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668099059] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:56:22,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:56:22,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:56:22,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062881455] [2022-07-14 04:56:22,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:56:22,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:56:22,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:56:22,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:56:22,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:56:22,358 INFO L87 Difference]: Start difference. First operand 5240 states and 7648 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-14 04:56:33,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:56:33,400 INFO L93 Difference]: Finished difference Result 5240 states and 7648 transitions. [2022-07-14 04:56:33,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:56:33,401 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 94 [2022-07-14 04:56:33,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:56:33,417 INFO L225 Difference]: With dead ends: 5240 [2022-07-14 04:56:33,417 INFO L226 Difference]: Without dead ends: 5238 [2022-07-14 04:56:33,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:56:33,421 INFO L413 NwaCegarLoop]: 7407 mSDtfsCounter, 7361 mSDsluCounter, 11209 mSDsCounter, 0 mSdLazyCounter, 6198 mSolverCounterSat, 4498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8885 SdHoareTripleChecker+Valid, 18616 SdHoareTripleChecker+Invalid, 10696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4498 IncrementalHoareTripleChecker+Valid, 6198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2022-07-14 04:56:33,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8885 Valid, 18616 Invalid, 10696 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4498 Valid, 6198 Invalid, 0 Unknown, 0 Unchecked, 10.6s Time] [2022-07-14 04:56:33,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5238 states. [2022-07-14 04:56:33,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5238 to 5238. [2022-07-14 04:56:33,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5238 states, 3329 states have (on average 1.2303995193751878) internal successors, (4096), 3636 states have internal predecessors, (4096), 1776 states have call successors, (1776), 118 states have call predecessors, (1776), 117 states have return successors, (1774), 1510 states have call predecessors, (1774), 1774 states have call successors, (1774) [2022-07-14 04:56:33,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5238 states to 5238 states and 7646 transitions. [2022-07-14 04:56:33,666 INFO L78 Accepts]: Start accepts. Automaton has 5238 states and 7646 transitions. Word has length 94 [2022-07-14 04:56:33,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:56:33,667 INFO L495 AbstractCegarLoop]: Abstraction has 5238 states and 7646 transitions. [2022-07-14 04:56:33,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-14 04:56:33,667 INFO L276 IsEmpty]: Start isEmpty. Operand 5238 states and 7646 transitions. [2022-07-14 04:56:33,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-14 04:56:33,668 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:56:33,668 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:56:33,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-14 04:56:33,669 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_linux_kernel_module_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 23 more)] === [2022-07-14 04:56:33,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:56:33,670 INFO L85 PathProgramCache]: Analyzing trace with hash 306975492, now seen corresponding path program 1 times [2022-07-14 04:56:33,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:56:33,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081104340] [2022-07-14 04:56:33,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:56:33,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:56:33,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:33,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:56:33,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:33,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 04:56:33,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:33,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:56:33,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:33,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-14 04:56:33,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:33,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:56:33,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:33,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-14 04:56:33,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:33,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-14 04:56:33,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:33,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 04:56:33,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:33,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 04:56:33,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:33,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-14 04:56:33,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:33,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-14 04:56:33,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:33,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-14 04:56:33,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:33,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-14 04:56:33,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:33,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-14 04:56:33,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:33,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-14 04:56:33,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:33,933 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-14 04:56:33,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:56:33,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081104340] [2022-07-14 04:56:33,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081104340] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:56:33,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:56:33,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:56:33,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824764796] [2022-07-14 04:56:33,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:56:33,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:56:33,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:56:33,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:56:33,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:56:33,935 INFO L87 Difference]: Start difference. First operand 5238 states and 7646 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-14 04:56:44,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:56:44,633 INFO L93 Difference]: Finished difference Result 5238 states and 7646 transitions. [2022-07-14 04:56:44,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:56:44,634 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 100 [2022-07-14 04:56:44,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:56:44,652 INFO L225 Difference]: With dead ends: 5238 [2022-07-14 04:56:44,652 INFO L226 Difference]: Without dead ends: 5236 [2022-07-14 04:56:44,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:56:44,657 INFO L413 NwaCegarLoop]: 7405 mSDtfsCounter, 7357 mSDsluCounter, 11209 mSDsCounter, 0 mSdLazyCounter, 6196 mSolverCounterSat, 4498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8880 SdHoareTripleChecker+Valid, 18614 SdHoareTripleChecker+Invalid, 10694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4498 IncrementalHoareTripleChecker+Valid, 6196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2022-07-14 04:56:44,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8880 Valid, 18614 Invalid, 10694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4498 Valid, 6196 Invalid, 0 Unknown, 0 Unchecked, 10.3s Time] [2022-07-14 04:56:44,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5236 states. [2022-07-14 04:56:44,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5236 to 5236. [2022-07-14 04:56:44,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5236 states, 3328 states have (on average 1.2301682692307692) internal successors, (4094), 3634 states have internal predecessors, (4094), 1776 states have call successors, (1776), 118 states have call predecessors, (1776), 117 states have return successors, (1774), 1510 states have call predecessors, (1774), 1774 states have call successors, (1774) [2022-07-14 04:56:44,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5236 states to 5236 states and 7644 transitions. [2022-07-14 04:56:44,953 INFO L78 Accepts]: Start accepts. Automaton has 5236 states and 7644 transitions. Word has length 100 [2022-07-14 04:56:44,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:56:44,954 INFO L495 AbstractCegarLoop]: Abstraction has 5236 states and 7644 transitions. [2022-07-14 04:56:44,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-14 04:56:44,954 INFO L276 IsEmpty]: Start isEmpty. Operand 5236 states and 7644 transitions. [2022-07-14 04:56:44,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-14 04:56:44,957 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:56:44,957 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:56:44,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-14 04:56:44,958 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 23 more)] === [2022-07-14 04:56:44,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:56:44,958 INFO L85 PathProgramCache]: Analyzing trace with hash 2136352058, now seen corresponding path program 1 times [2022-07-14 04:56:44,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:56:44,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184559507] [2022-07-14 04:56:44,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:56:44,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:56:45,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:45,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:56:45,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:45,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 04:56:45,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:45,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:56:45,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:45,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-14 04:56:45,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:45,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:56:45,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:45,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-14 04:56:45,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:45,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-14 04:56:45,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:45,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 04:56:45,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:45,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 04:56:45,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:45,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-14 04:56:45,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:45,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-14 04:56:45,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:45,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-14 04:56:45,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:45,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-14 04:56:45,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:45,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-14 04:56:45,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:45,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-14 04:56:45,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:45,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:56:45,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:45,246 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-14 04:56:45,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:56:45,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184559507] [2022-07-14 04:56:45,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184559507] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:56:45,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:56:45,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:56:45,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030873362] [2022-07-14 04:56:45,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:56:45,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:56:45,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:56:45,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:56:45,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:56:45,249 INFO L87 Difference]: Start difference. First operand 5236 states and 7644 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-14 04:56:54,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:56:54,759 INFO L93 Difference]: Finished difference Result 5236 states and 7644 transitions. [2022-07-14 04:56:54,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:56:54,760 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 106 [2022-07-14 04:56:54,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:56:54,773 INFO L225 Difference]: With dead ends: 5236 [2022-07-14 04:56:54,774 INFO L226 Difference]: Without dead ends: 5234 [2022-07-14 04:56:54,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:56:54,777 INFO L413 NwaCegarLoop]: 7403 mSDtfsCounter, 7351 mSDsluCounter, 11209 mSDsCounter, 0 mSdLazyCounter, 6194 mSolverCounterSat, 4498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8873 SdHoareTripleChecker+Valid, 18612 SdHoareTripleChecker+Invalid, 10692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4498 IncrementalHoareTripleChecker+Valid, 6194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2022-07-14 04:56:54,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8873 Valid, 18612 Invalid, 10692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4498 Valid, 6194 Invalid, 0 Unknown, 0 Unchecked, 9.1s Time] [2022-07-14 04:56:54,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5234 states. [2022-07-14 04:56:55,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5234 to 5234. [2022-07-14 04:56:55,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5234 states, 3327 states have (on average 1.229936880072137) internal successors, (4092), 3632 states have internal predecessors, (4092), 1776 states have call successors, (1776), 118 states have call predecessors, (1776), 117 states have return successors, (1774), 1510 states have call predecessors, (1774), 1774 states have call successors, (1774) [2022-07-14 04:56:55,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5234 states to 5234 states and 7642 transitions. [2022-07-14 04:56:55,086 INFO L78 Accepts]: Start accepts. Automaton has 5234 states and 7642 transitions. Word has length 106 [2022-07-14 04:56:55,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:56:55,086 INFO L495 AbstractCegarLoop]: Abstraction has 5234 states and 7642 transitions. [2022-07-14 04:56:55,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-14 04:56:55,087 INFO L276 IsEmpty]: Start isEmpty. Operand 5234 states and 7642 transitions. [2022-07-14 04:56:55,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-14 04:56:55,087 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:56:55,088 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:56:55,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-14 04:56:55,088 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 23 more)] === [2022-07-14 04:56:55,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:56:55,088 INFO L85 PathProgramCache]: Analyzing trace with hash 869079226, now seen corresponding path program 1 times [2022-07-14 04:56:55,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:56:55,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95326067] [2022-07-14 04:56:55,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:56:55,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:56:55,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:55,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:56:55,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:55,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 04:56:55,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:55,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:56:55,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:55,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-14 04:56:55,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:55,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:56:55,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:55,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-14 04:56:55,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:55,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-14 04:56:55,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:55,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 04:56:55,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:55,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 04:56:55,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:55,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-14 04:56:55,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:55,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-14 04:56:55,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:55,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-14 04:56:55,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:55,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-14 04:56:55,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:55,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-14 04:56:55,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:55,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-14 04:56:55,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:55,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:56:55,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:55,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:56:55,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:56:55,413 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-14 04:56:55,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:56:55,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95326067] [2022-07-14 04:56:55,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95326067] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:56:55,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:56:55,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:56:55,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495560958] [2022-07-14 04:56:55,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:56:55,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:56:55,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:56:55,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:56:55,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:56:55,416 INFO L87 Difference]: Start difference. First operand 5234 states and 7642 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-14 04:56:57,943 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:57:09,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:57:09,746 INFO L93 Difference]: Finished difference Result 5234 states and 7642 transitions. [2022-07-14 04:57:09,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:57:09,747 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 112 [2022-07-14 04:57:09,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:57:09,761 INFO L225 Difference]: With dead ends: 5234 [2022-07-14 04:57:09,761 INFO L226 Difference]: Without dead ends: 5232 [2022-07-14 04:57:09,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:57:09,765 INFO L413 NwaCegarLoop]: 7401 mSDtfsCounter, 7345 mSDsluCounter, 11209 mSDsCounter, 0 mSdLazyCounter, 6192 mSolverCounterSat, 4498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8866 SdHoareTripleChecker+Valid, 18610 SdHoareTripleChecker+Invalid, 10690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4498 IncrementalHoareTripleChecker+Valid, 6192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.9s IncrementalHoareTripleChecker+Time [2022-07-14 04:57:09,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8866 Valid, 18610 Invalid, 10690 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4498 Valid, 6192 Invalid, 0 Unknown, 0 Unchecked, 13.9s Time] [2022-07-14 04:57:09,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5232 states. [2022-07-14 04:57:10,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5232 to 5232. [2022-07-14 04:57:10,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5232 states, 3326 states have (on average 1.2297053517739025) internal successors, (4090), 3630 states have internal predecessors, (4090), 1776 states have call successors, (1776), 118 states have call predecessors, (1776), 117 states have return successors, (1774), 1510 states have call predecessors, (1774), 1774 states have call successors, (1774) [2022-07-14 04:57:10,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5232 states to 5232 states and 7640 transitions. [2022-07-14 04:57:10,078 INFO L78 Accepts]: Start accepts. Automaton has 5232 states and 7640 transitions. Word has length 112 [2022-07-14 04:57:10,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:57:10,079 INFO L495 AbstractCegarLoop]: Abstraction has 5232 states and 7640 transitions. [2022-07-14 04:57:10,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-14 04:57:10,079 INFO L276 IsEmpty]: Start isEmpty. Operand 5232 states and 7640 transitions. [2022-07-14 04:57:10,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-14 04:57:10,080 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:57:10,080 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:57:10,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-14 04:57:10,080 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 23 more)] === [2022-07-14 04:57:10,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:57:10,081 INFO L85 PathProgramCache]: Analyzing trace with hash -574328519, now seen corresponding path program 1 times [2022-07-14 04:57:10,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:57:10,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649424353] [2022-07-14 04:57:10,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:57:10,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:57:10,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:10,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:57:10,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:10,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 04:57:10,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:10,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:57:10,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:10,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-14 04:57:10,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:10,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:57:10,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:10,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-14 04:57:10,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:10,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-14 04:57:10,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:10,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 04:57:10,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:10,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 04:57:10,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:10,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-14 04:57:10,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:10,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-14 04:57:10,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:10,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-14 04:57:10,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:10,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-14 04:57:10,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:10,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-14 04:57:10,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:10,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-14 04:57:10,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:10,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:57:10,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:10,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:57:10,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:10,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-14 04:57:10,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:10,340 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-14 04:57:10,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:57:10,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649424353] [2022-07-14 04:57:10,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649424353] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:57:10,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:57:10,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:57:10,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990466965] [2022-07-14 04:57:10,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:57:10,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:57:10,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:57:10,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:57:10,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:57:10,343 INFO L87 Difference]: Start difference. First operand 5232 states and 7640 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-14 04:57:11,915 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:57:21,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:57:21,553 INFO L93 Difference]: Finished difference Result 5232 states and 7640 transitions. [2022-07-14 04:57:21,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:57:21,554 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 118 [2022-07-14 04:57:21,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:57:21,567 INFO L225 Difference]: With dead ends: 5232 [2022-07-14 04:57:21,567 INFO L226 Difference]: Without dead ends: 5230 [2022-07-14 04:57:21,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:57:21,572 INFO L413 NwaCegarLoop]: 7399 mSDtfsCounter, 7339 mSDsluCounter, 11209 mSDsCounter, 0 mSdLazyCounter, 6190 mSolverCounterSat, 4498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8859 SdHoareTripleChecker+Valid, 18608 SdHoareTripleChecker+Invalid, 10688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4498 IncrementalHoareTripleChecker+Valid, 6190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2022-07-14 04:57:21,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8859 Valid, 18608 Invalid, 10688 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4498 Valid, 6190 Invalid, 0 Unknown, 0 Unchecked, 10.7s Time] [2022-07-14 04:57:21,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5230 states. [2022-07-14 04:57:21,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5230 to 5230. [2022-07-14 04:57:21,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5230 states, 3325 states have (on average 1.2294736842105263) internal successors, (4088), 3628 states have internal predecessors, (4088), 1776 states have call successors, (1776), 118 states have call predecessors, (1776), 117 states have return successors, (1774), 1510 states have call predecessors, (1774), 1774 states have call successors, (1774) [2022-07-14 04:57:21,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5230 states to 5230 states and 7638 transitions. [2022-07-14 04:57:21,839 INFO L78 Accepts]: Start accepts. Automaton has 5230 states and 7638 transitions. Word has length 118 [2022-07-14 04:57:21,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:57:21,840 INFO L495 AbstractCegarLoop]: Abstraction has 5230 states and 7638 transitions. [2022-07-14 04:57:21,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-14 04:57:21,840 INFO L276 IsEmpty]: Start isEmpty. Operand 5230 states and 7638 transitions. [2022-07-14 04:57:21,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-07-14 04:57:21,842 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:57:21,842 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:57:21,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-14 04:57:21,842 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_linux_kernel_rcu_srcu_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 23 more)] === [2022-07-14 04:57:21,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:57:21,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1828773943, now seen corresponding path program 1 times [2022-07-14 04:57:21,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:57:21,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616543018] [2022-07-14 04:57:21,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:57:21,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:57:21,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:21,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:57:21,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:21,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 04:57:21,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:21,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:57:21,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:21,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-14 04:57:21,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:21,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:57:21,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:21,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-14 04:57:21,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:22,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-14 04:57:22,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:22,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 04:57:22,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:22,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 04:57:22,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:22,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-14 04:57:22,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:22,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-14 04:57:22,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:22,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-14 04:57:22,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:22,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-14 04:57:22,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:22,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-14 04:57:22,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:22,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-14 04:57:22,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:22,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:57:22,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:22,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:57:22,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:22,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-14 04:57:22,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:22,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-14 04:57:22,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:22,195 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-14 04:57:22,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:57:22,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616543018] [2022-07-14 04:57:22,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616543018] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:57:22,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:57:22,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:57:22,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315638905] [2022-07-14 04:57:22,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:57:22,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:57:22,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:57:22,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:57:22,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:57:22,197 INFO L87 Difference]: Start difference. First operand 5230 states and 7638 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-14 04:57:23,775 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:57:36,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:57:36,317 INFO L93 Difference]: Finished difference Result 5230 states and 7638 transitions. [2022-07-14 04:57:36,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:57:36,321 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 124 [2022-07-14 04:57:36,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:57:36,332 INFO L225 Difference]: With dead ends: 5230 [2022-07-14 04:57:36,332 INFO L226 Difference]: Without dead ends: 5228 [2022-07-14 04:57:36,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:57:36,334 INFO L413 NwaCegarLoop]: 7397 mSDtfsCounter, 7333 mSDsluCounter, 11209 mSDsCounter, 0 mSdLazyCounter, 6188 mSolverCounterSat, 4498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8852 SdHoareTripleChecker+Valid, 18606 SdHoareTripleChecker+Invalid, 10686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4498 IncrementalHoareTripleChecker+Valid, 6188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.6s IncrementalHoareTripleChecker+Time [2022-07-14 04:57:36,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8852 Valid, 18606 Invalid, 10686 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4498 Valid, 6188 Invalid, 0 Unknown, 0 Unchecked, 13.6s Time] [2022-07-14 04:57:36,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5228 states. [2022-07-14 04:57:36,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5228 to 5228. [2022-07-14 04:57:36,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5228 states, 3324 states have (on average 1.2292418772563176) internal successors, (4086), 3626 states have internal predecessors, (4086), 1776 states have call successors, (1776), 118 states have call predecessors, (1776), 117 states have return successors, (1774), 1510 states have call predecessors, (1774), 1774 states have call successors, (1774) [2022-07-14 04:57:36,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5228 states to 5228 states and 7636 transitions. [2022-07-14 04:57:36,601 INFO L78 Accepts]: Start accepts. Automaton has 5228 states and 7636 transitions. Word has length 124 [2022-07-14 04:57:36,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:57:36,601 INFO L495 AbstractCegarLoop]: Abstraction has 5228 states and 7636 transitions. [2022-07-14 04:57:36,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-14 04:57:36,601 INFO L276 IsEmpty]: Start isEmpty. Operand 5228 states and 7636 transitions. [2022-07-14 04:57:36,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-07-14 04:57:36,602 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:57:36,602 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:57:36,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-14 04:57:36,603 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_linux_lib_idr_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 23 more)] === [2022-07-14 04:57:36,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:57:36,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1873078433, now seen corresponding path program 1 times [2022-07-14 04:57:36,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:57:36,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281560403] [2022-07-14 04:57:36,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:57:36,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:57:36,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:36,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:57:36,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:36,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 04:57:36,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:36,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:57:36,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:36,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-14 04:57:36,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:36,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:57:36,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:36,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-14 04:57:36,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:36,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-14 04:57:36,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:36,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 04:57:36,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:36,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 04:57:36,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:36,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-14 04:57:36,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:36,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-14 04:57:36,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:36,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-14 04:57:36,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:36,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-14 04:57:36,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:36,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-14 04:57:36,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:36,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-14 04:57:36,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:36,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:57:36,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:36,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:57:36,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:36,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-14 04:57:36,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:36,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-14 04:57:36,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:36,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-14 04:57:36,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:36,947 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-14 04:57:36,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:57:36,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281560403] [2022-07-14 04:57:36,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281560403] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:57:36,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:57:36,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:57:36,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942690674] [2022-07-14 04:57:36,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:57:36,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:57:36,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:57:36,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:57:36,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:57:36,949 INFO L87 Difference]: Start difference. First operand 5228 states and 7636 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-14 04:57:47,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:57:47,499 INFO L93 Difference]: Finished difference Result 5228 states and 7636 transitions. [2022-07-14 04:57:47,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:57:47,499 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 130 [2022-07-14 04:57:47,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:57:47,513 INFO L225 Difference]: With dead ends: 5228 [2022-07-14 04:57:47,513 INFO L226 Difference]: Without dead ends: 5226 [2022-07-14 04:57:47,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:57:47,516 INFO L413 NwaCegarLoop]: 7395 mSDtfsCounter, 7327 mSDsluCounter, 11209 mSDsCounter, 0 mSdLazyCounter, 6186 mSolverCounterSat, 4498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8845 SdHoareTripleChecker+Valid, 18604 SdHoareTripleChecker+Invalid, 10684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4498 IncrementalHoareTripleChecker+Valid, 6186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2022-07-14 04:57:47,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8845 Valid, 18604 Invalid, 10684 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4498 Valid, 6186 Invalid, 0 Unknown, 0 Unchecked, 10.1s Time] [2022-07-14 04:57:47,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5226 states. [2022-07-14 04:57:47,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5226 to 5226. [2022-07-14 04:57:47,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5226 states, 3323 states have (on average 1.2290099307854347) internal successors, (4084), 3624 states have internal predecessors, (4084), 1776 states have call successors, (1776), 118 states have call predecessors, (1776), 117 states have return successors, (1774), 1510 states have call predecessors, (1774), 1774 states have call successors, (1774) [2022-07-14 04:57:47,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5226 states to 5226 states and 7634 transitions. [2022-07-14 04:57:47,880 INFO L78 Accepts]: Start accepts. Automaton has 5226 states and 7634 transitions. Word has length 130 [2022-07-14 04:57:47,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:57:47,880 INFO L495 AbstractCegarLoop]: Abstraction has 5226 states and 7634 transitions. [2022-07-14 04:57:47,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-14 04:57:47,880 INFO L276 IsEmpty]: Start isEmpty. Operand 5226 states and 7634 transitions. [2022-07-14 04:57:47,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-14 04:57:47,881 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:57:47,882 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:57:47,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-14 04:57:47,882 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 23 more)] === [2022-07-14 04:57:47,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:57:47,882 INFO L85 PathProgramCache]: Analyzing trace with hash 595773319, now seen corresponding path program 1 times [2022-07-14 04:57:47,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:57:47,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534054075] [2022-07-14 04:57:47,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:57:47,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:57:47,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:48,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:57:48,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:48,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 04:57:48,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:48,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:57:48,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:48,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-14 04:57:48,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:48,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:57:48,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:48,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-14 04:57:48,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:48,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-14 04:57:48,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:48,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 04:57:48,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:48,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 04:57:48,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:48,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-14 04:57:48,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:48,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-14 04:57:48,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:48,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-14 04:57:48,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:48,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-14 04:57:48,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:48,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-14 04:57:48,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:48,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-14 04:57:48,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:48,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:57:48,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:48,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:57:48,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:48,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-14 04:57:48,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:48,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-14 04:57:48,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:48,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-14 04:57:48,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:48,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-14 04:57:48,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:48,222 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-14 04:57:48,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:57:48,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534054075] [2022-07-14 04:57:48,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534054075] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:57:48,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:57:48,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:57:48,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478645061] [2022-07-14 04:57:48,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:57:48,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:57:48,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:57:48,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:57:48,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:57:48,226 INFO L87 Difference]: Start difference. First operand 5226 states and 7634 transitions. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-14 04:57:49,863 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:57:59,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:57:59,306 INFO L93 Difference]: Finished difference Result 5226 states and 7634 transitions. [2022-07-14 04:57:59,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:57:59,307 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 136 [2022-07-14 04:57:59,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:57:59,321 INFO L225 Difference]: With dead ends: 5226 [2022-07-14 04:57:59,321 INFO L226 Difference]: Without dead ends: 5224 [2022-07-14 04:57:59,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:57:59,324 INFO L413 NwaCegarLoop]: 7393 mSDtfsCounter, 7321 mSDsluCounter, 11209 mSDsCounter, 0 mSdLazyCounter, 6184 mSolverCounterSat, 4498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8838 SdHoareTripleChecker+Valid, 18602 SdHoareTripleChecker+Invalid, 10682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4498 IncrementalHoareTripleChecker+Valid, 6184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2022-07-14 04:57:59,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8838 Valid, 18602 Invalid, 10682 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4498 Valid, 6184 Invalid, 0 Unknown, 0 Unchecked, 10.6s Time] [2022-07-14 04:57:59,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5224 states. [2022-07-14 04:57:59,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5224 to 5224. [2022-07-14 04:57:59,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5224 states, 3322 states have (on average 1.2287778446718844) internal successors, (4082), 3622 states have internal predecessors, (4082), 1776 states have call successors, (1776), 118 states have call predecessors, (1776), 117 states have return successors, (1774), 1510 states have call predecessors, (1774), 1774 states have call successors, (1774) [2022-07-14 04:57:59,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5224 states to 5224 states and 7632 transitions. [2022-07-14 04:57:59,635 INFO L78 Accepts]: Start accepts. Automaton has 5224 states and 7632 transitions. Word has length 136 [2022-07-14 04:57:59,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:57:59,636 INFO L495 AbstractCegarLoop]: Abstraction has 5224 states and 7632 transitions. [2022-07-14 04:57:59,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-14 04:57:59,636 INFO L276 IsEmpty]: Start isEmpty. Operand 5224 states and 7632 transitions. [2022-07-14 04:57:59,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-07-14 04:57:59,637 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:57:59,637 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:57:59,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-14 04:57:59,637 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_linux_net_rtnetlink_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 23 more)] === [2022-07-14 04:57:59,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:57:59,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1290209167, now seen corresponding path program 1 times [2022-07-14 04:57:59,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:57:59,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551217037] [2022-07-14 04:57:59,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:57:59,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:57:59,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:59,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:57:59,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:59,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 04:57:59,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:59,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:57:59,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:59,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-14 04:57:59,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:59,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:57:59,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:59,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-14 04:57:59,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:59,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-14 04:57:59,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:59,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 04:57:59,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:59,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 04:57:59,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:59,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-14 04:57:59,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:59,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-14 04:57:59,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:59,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-14 04:57:59,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:59,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-14 04:57:59,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:59,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-14 04:57:59,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:59,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-14 04:57:59,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:59,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:57:59,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:59,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:57:59,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:59,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-14 04:57:59,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:59,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-14 04:57:59,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:59,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-14 04:57:59,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:59,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-14 04:57:59,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:59,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-14 04:57:59,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:57:59,993 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-14 04:57:59,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:57:59,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551217037] [2022-07-14 04:57:59,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551217037] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:57:59,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:57:59,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:57:59,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146566522] [2022-07-14 04:57:59,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:57:59,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:57:59,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:57:59,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:57:59,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:57:59,995 INFO L87 Difference]: Start difference. First operand 5224 states and 7632 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-14 04:58:02,949 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:58:14,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:58:14,457 INFO L93 Difference]: Finished difference Result 5224 states and 7632 transitions. [2022-07-14 04:58:14,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:58:14,458 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 142 [2022-07-14 04:58:14,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:58:14,471 INFO L225 Difference]: With dead ends: 5224 [2022-07-14 04:58:14,471 INFO L226 Difference]: Without dead ends: 5222 [2022-07-14 04:58:14,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:58:14,473 INFO L413 NwaCegarLoop]: 7391 mSDtfsCounter, 7315 mSDsluCounter, 11209 mSDsCounter, 0 mSdLazyCounter, 6182 mSolverCounterSat, 4498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8831 SdHoareTripleChecker+Valid, 18600 SdHoareTripleChecker+Invalid, 10680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4498 IncrementalHoareTripleChecker+Valid, 6182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.9s IncrementalHoareTripleChecker+Time [2022-07-14 04:58:14,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8831 Valid, 18600 Invalid, 10680 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4498 Valid, 6182 Invalid, 0 Unknown, 0 Unchecked, 13.9s Time] [2022-07-14 04:58:14,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5222 states. [2022-07-14 04:58:14,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5222 to 5222. [2022-07-14 04:58:14,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5222 states, 3321 states have (on average 1.2285456187895212) internal successors, (4080), 3620 states have internal predecessors, (4080), 1776 states have call successors, (1776), 118 states have call predecessors, (1776), 117 states have return successors, (1774), 1510 states have call predecessors, (1774), 1774 states have call successors, (1774) [2022-07-14 04:58:14,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5222 states to 5222 states and 7630 transitions. [2022-07-14 04:58:14,784 INFO L78 Accepts]: Start accepts. Automaton has 5222 states and 7630 transitions. Word has length 142 [2022-07-14 04:58:14,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:58:14,784 INFO L495 AbstractCegarLoop]: Abstraction has 5222 states and 7630 transitions. [2022-07-14 04:58:14,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-14 04:58:14,784 INFO L276 IsEmpty]: Start isEmpty. Operand 5222 states and 7630 transitions. [2022-07-14 04:58:14,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-07-14 04:58:14,786 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:58:14,786 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:58:14,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-14 04:58:14,786 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_linux_net_sock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 23 more)] === [2022-07-14 04:58:14,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:58:14,787 INFO L85 PathProgramCache]: Analyzing trace with hash -315189183, now seen corresponding path program 1 times [2022-07-14 04:58:14,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:58:14,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450819099] [2022-07-14 04:58:14,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:58:14,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:58:14,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:14,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:58:14,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:14,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 04:58:14,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:14,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:58:14,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:14,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-14 04:58:14,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:14,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:58:14,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:14,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-14 04:58:14,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:14,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-14 04:58:14,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:14,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 04:58:14,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:14,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 04:58:14,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:14,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-14 04:58:14,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:14,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-14 04:58:14,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:15,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-14 04:58:15,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:15,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-14 04:58:15,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:15,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-14 04:58:15,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:15,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-14 04:58:15,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:15,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:58:15,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:15,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:58:15,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:15,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-14 04:58:15,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:15,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-14 04:58:15,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:15,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-14 04:58:15,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:15,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-14 04:58:15,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:15,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-14 04:58:15,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:15,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-14 04:58:15,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:58:15,129 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-14 04:58:15,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:58:15,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450819099] [2022-07-14 04:58:15,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450819099] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:58:15,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:58:15,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:58:15,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469324947] [2022-07-14 04:58:15,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:58:15,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:58:15,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:58:15,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:58:15,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:58:15,132 INFO L87 Difference]: Start difference. First operand 5222 states and 7630 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23)