./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 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---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-?-6c24879 [2022-07-12 17:12:24,927 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 17:12:24,929 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 17:12:24,961 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 17:12:24,961 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 17:12:24,962 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 17:12:24,964 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 17:12:24,965 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 17:12:24,967 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 17:12:24,970 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 17:12:24,970 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 17:12:24,972 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 17:12:24,972 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 17:12:24,974 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 17:12:24,974 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 17:12:24,976 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 17:12:24,977 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 17:12:24,978 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 17:12:24,979 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 17:12:24,982 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 17:12:24,983 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 17:12:24,983 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 17:12:24,984 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 17:12:24,985 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 17:12:24,985 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 17:12:24,987 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 17:12:24,987 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 17:12:24,987 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 17:12:24,988 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 17:12:24,988 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 17:12:24,989 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 17:12:24,989 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 17:12:24,990 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 17:12:24,991 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 17:12:24,991 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 17:12:24,992 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 17:12:24,992 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 17:12:24,992 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 17:12:24,993 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 17:12:24,993 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 17:12:24,994 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 17:12:24,995 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 17:12:24,996 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-12 17:12:25,018 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 17:12:25,019 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 17:12:25,019 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 17:12:25,019 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 17:12:25,020 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 17:12:25,020 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 17:12:25,020 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 17:12:25,020 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 17:12:25,021 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 17:12:25,021 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 17:12:25,021 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 17:12:25,022 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 17:12:25,022 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 17:12:25,022 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 17:12:25,022 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 17:12:25,022 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 17:12:25,022 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 17:12:25,022 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 17:12:25,023 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 17:12:25,023 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 17:12:25,023 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 17:12:25,023 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 17:12:25,024 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 17:12:25,024 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 17:12:25,024 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 17:12:25,024 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 17:12:25,025 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 17:12:25,025 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 17:12:25,025 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 17:12:25,025 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 17:12:25,025 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-12 17:12:25,198 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 17:12:25,213 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 17:12:25,215 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 17:12:25,216 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 17:12:25,217 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 17:12:25,217 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-12 17:12:25,261 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8887ed67/509d8213715e464fa7e9c76f0376a056/FLAG1d86e376e [2022-07-12 17:12:26,023 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 17:12:26,023 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-12 17:12:26,082 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8887ed67/509d8213715e464fa7e9c76f0376a056/FLAG1d86e376e [2022-07-12 17:12:26,504 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8887ed67/509d8213715e464fa7e9c76f0376a056 [2022-07-12 17:12:26,506 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 17:12:26,507 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 17:12:26,509 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 17:12:26,509 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 17:12:26,511 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 17:12:26,512 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 05:12:26" (1/1) ... [2022-07-12 17:12:26,513 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@391c6adc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:12:26, skipping insertion in model container [2022-07-12 17:12:26,513 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 05:12:26" (1/1) ... [2022-07-12 17:12:26,521 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 17:12:26,719 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 17:12:36,881 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1177218,1177231] [2022-07-12 17:12:36,883 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1177363,1177376] [2022-07-12 17:12:36,883 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1177509,1177522] [2022-07-12 17:12:36,884 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1177674,1177687] [2022-07-12 17:12:36,884 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1177832,1177845] [2022-07-12 17:12:36,884 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1177990,1178003] [2022-07-12 17:12:36,885 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,885 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,885 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,885 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,886 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,886 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,886 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,887 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,887 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,887 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,887 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,888 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,888 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,888 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,889 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,889 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,889 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,890 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,890 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,890 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,890 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,891 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,891 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,891 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,892 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,892 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,892 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,892 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,893 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,893 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,893 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,894 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,894 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,894 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,894 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,895 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,895 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,895 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,896 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,896 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,896 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,897 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,897 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,897 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,897 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,898 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,898 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,898 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,899 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,899 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,899 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,900 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,900 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,900 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,900 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,901 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,901 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,908 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,908 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,908 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,908 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,909 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,909 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,909 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,909 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,910 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,910 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,910 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,910 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,910 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,911 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,911 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,911 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,911 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,911 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,912 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,912 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,912 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,912 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,912 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,913 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,915 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:36,927 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 17:12:36,946 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 17:12:37,260 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12 17:12:37,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-12 17:12:37,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[1177509,1177522] [2022-07-12 17:12:37,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[1177674,1177687] [2022-07-12 17:12:37,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-12 17:12:37,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[1177990,1178003] [2022-07-12 17:12:37,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[1178148,1178161] [2022-07-12 17:12:37,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-12 17:12:37,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[1178467,1178480] [2022-07-12 17:12:37,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[1178606,1178619] [2022-07-12 17:12:37,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[1178748,1178761] [2022-07-12 17:12:37,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-12 17:12:37,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[1179036,1179049] [2022-07-12 17:12:37,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[1179191,1179204] [2022-07-12 17:12:37,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[1179351,1179364] [2022-07-12 17:12:37,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-12 17:12:37,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[1179653,1179666] [2022-07-12 17:12:37,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[1179805,1179818] [2022-07-12 17:12:37,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[1179954,1179967] [2022-07-12 17:12:37,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[1180102,1180115] [2022-07-12 17:12:37,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[1180259,1180272] [2022-07-12 17:12:37,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[1180408,1180421] [2022-07-12 17:12:37,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[1180564,1180577] [2022-07-12 17:12:37,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[1180717,1180730] [2022-07-12 17:12:37,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[1180863,1180876] [2022-07-12 17:12:37,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[1181006,1181019] [2022-07-12 17:12:37,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[1181158,1181171] [2022-07-12 17:12:37,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[1181304,1181317] [2022-07-12 17:12:37,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[1181449,1181462] [2022-07-12 17:12:37,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[1181603,1181616] [2022-07-12 17:12:37,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[1181754,1181767] [2022-07-12 17:12:37,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[1181909,1181922] [2022-07-12 17:12:37,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[1182061,1182074] [2022-07-12 17:12:37,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[1182216,1182229] [2022-07-12 17:12:37,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[1182380,1182393] [2022-07-12 17:12:37,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[1182536,1182549] [2022-07-12 17:12:37,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[1182700,1182713] [2022-07-12 17:12:37,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[1182842,1182855] [2022-07-12 17:12:37,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[1183000,1183013] [2022-07-12 17:12:37,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[1183167,1183180] [2022-07-12 17:12:37,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[1183326,1183339] [2022-07-12 17:12:37,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-12 17:12:37,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[1183634,1183647] [2022-07-12 17:12:37,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[1183781,1183794] [2022-07-12 17:12:37,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[1183920,1183933] [2022-07-12 17:12:37,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[1184083,1184096] [2022-07-12 17:12:37,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[1184249,1184262] [2022-07-12 17:12:37,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[1184413,1184426] [2022-07-12 17:12:37,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[1184578,1184591] [2022-07-12 17:12:37,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[1184743,1184756] [2022-07-12 17:12:37,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[1184909,1184922] [2022-07-12 17:12:37,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[1185074,1185087] [2022-07-12 17:12:37,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[1185241,1185254] [2022-07-12 17:12:37,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[1185401,1185414] [2022-07-12 17:12:37,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[1185563,1185576] [2022-07-12 17:12:37,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[1185722,1185735] [2022-07-12 17:12:37,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[1185868,1185881] [2022-07-12 17:12:37,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[1186011,1186024] [2022-07-12 17:12:37,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[1186155,1186168] [2022-07-12 17:12:37,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[1186298,1186311] [2022-07-12 17:12:37,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[1186442,1186455] [2022-07-12 17:12:37,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[1186583,1186596] [2022-07-12 17:12:37,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[1186721,1186734] [2022-07-12 17:12:37,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[1186879,1186892] [2022-07-12 17:12:37,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[1187038,1187051] [2022-07-12 17:12:37,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[1187194,1187207] [2022-07-12 17:12:37,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[1187343,1187356] [2022-07-12 17:12:37,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[1187495,1187508] [2022-07-12 17:12:37,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[1187646,1187659] [2022-07-12 17:12:37,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[1187795,1187808] [2022-07-12 17:12:37,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[1187947,1187960] [2022-07-12 17:12:37,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[1188095,1188108] [2022-07-12 17:12:37,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[1188248,1188261] [2022-07-12 17:12:37,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[1188399,1188412] [2022-07-12 17:12:37,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[1188549,1188562] [2022-07-12 17:12:37,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[1188696,1188709] [2022-07-12 17:12:37,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[1188847,1188860] [2022-07-12 17:12:37,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[1188998,1189011] [2022-07-12 17:12:37,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[1189146,1189159] [2022-07-12 17:12:37,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[1189312,1189325] [2022-07-12 17:12:37,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[1189481,1189494] [2022-07-12 17:12:37,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[1189648,1189661] [2022-07-12 17:12:37,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[1189816,1189829] [2022-07-12 17:12:37,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[1189966,1189979] [2022-07-12 17:12:37,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[1190113,1190126] [2022-07-12 17:12:37,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[1190274,1190287] [2022-07-12 17:12:37,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[1190444,1190457] [2022-07-12 17:12:37,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[1190606,1190619] [2022-07-12 17:12:37,285 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 17:12:37,573 INFO L208 MainTranslator]: Completed translation [2022-07-12 17:12:37,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:12:37 WrapperNode [2022-07-12 17:12:37,574 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 17:12:37,575 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 17:12:37,575 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 17:12:37,575 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 17:12:37,579 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:12:37" (1/1) ... [2022-07-12 17:12:37,679 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:12:37" (1/1) ... [2022-07-12 17:12:37,890 INFO L137 Inliner]: procedures = 1178, calls = 4145, calls flagged for inlining = 795, calls inlined = 711, statements flattened = 14771 [2022-07-12 17:12:37,891 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 17:12:37,891 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 17:12:37,891 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 17:12:37,892 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 17:12:37,897 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:12:37" (1/1) ... [2022-07-12 17:12:37,897 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:12:37" (1/1) ... [2022-07-12 17:12:37,939 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:12:37" (1/1) ... [2022-07-12 17:12:37,940 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:12:37" (1/1) ... [2022-07-12 17:12:38,164 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:12:37" (1/1) ... [2022-07-12 17:12:38,188 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:12:37" (1/1) ... [2022-07-12 17:12:38,226 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:12:37" (1/1) ... [2022-07-12 17:12:38,373 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 17:12:38,381 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 17:12:38,382 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 17:12:38,382 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 17:12:38,382 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:12:37" (1/1) ... [2022-07-12 17:12:38,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 17:12:38,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 17:12:38,456 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 17:12:38,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 17:12:38,529 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-12 17:12:38,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-12 17:12:38,529 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_create [2022-07-12 17:12:38,529 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_create [2022-07-12 17:12:38,530 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-12 17:12:38,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-12 17:12:38,530 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_write_setup [2022-07-12 17:12:38,530 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_write_setup [2022-07-12 17:12:38,530 INFO L130 BoogieDeclarations]: Found specification of procedure xdr_write_pages [2022-07-12 17:12:38,530 INFO L138 BoogieDeclarations]: Found implementation of procedure xdr_write_pages [2022-07-12 17:12:38,530 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_alloc_createdata [2022-07-12 17:12:38,530 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_alloc_createdata [2022-07-12 17:12:38,531 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_lock_check_bounds [2022-07-12 17:12:38,531 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_lock_check_bounds [2022-07-12 17:12:38,531 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_mkdir [2022-07-12 17:12:38,531 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_mkdir [2022-07-12 17:12:38,531 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_rename_setup [2022-07-12 17:12:38,532 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_rename_setup [2022-07-12 17:12:38,532 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-07-12 17:12:38,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-07-12 17:12:38,533 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_lookup [2022-07-12 17:12:38,533 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_lookup [2022-07-12 17:12:38,533 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-12 17:12:38,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-12 17:12:38,533 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 17:12:38,533 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-12 17:12:38,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-12 17:12:38,534 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-07-12 17:12:38,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-07-12 17:12:38,547 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2022-07-12 17:12:38,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2022-07-12 17:12:38,547 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_unlink [2022-07-12 17:12:38,548 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_stat_to_errno [2022-07-12 17:12:38,548 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_stat_to_errno [2022-07-12 17:12:38,548 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-12 17:12:38,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-12 17:12:38,548 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 17:12:38,548 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_readdir [2022-07-12 17:12:38,548 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_readdir [2022-07-12 17:12:38,548 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 17:12:38,548 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-12 17:12:38,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-12 17:12:38,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 17:12:38,549 INFO L130 BoogieDeclarations]: Found specification of procedure encode_sattr [2022-07-12 17:12:38,549 INFO L138 BoogieDeclarations]: Found implementation of procedure encode_sattr [2022-07-12 17:12:38,549 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_rename_rpc_prepare [2022-07-12 17:12:38,549 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_rename_rpc_prepare [2022-07-12 17:12:38,550 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_unlink_rpc_prepare [2022-07-12 17:12:38,550 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_unlink_rpc_prepare [2022-07-12 17:12:38,550 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_rmdir [2022-07-12 17:12:38,550 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_rmdir [2022-07-12 17:12:38,550 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_free_client [2022-07-12 17:12:38,550 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_free_client [2022-07-12 17:12:38,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 17:12:38,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 17:12:38,550 INFO L130 BoogieDeclarations]: Found specification of procedure __kuid_val [2022-07-12 17:12:38,550 INFO L138 BoogieDeclarations]: Found implementation of procedure __kuid_val [2022-07-12 17:12:38,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-12 17:12:38,551 INFO L130 BoogieDeclarations]: Found specification of procedure xdr_encode_current_server_time [2022-07-12 17:12:38,551 INFO L138 BoogieDeclarations]: Found implementation of procedure xdr_encode_current_server_time [2022-07-12 17:12:38,551 INFO L130 BoogieDeclarations]: Found specification of procedure __be32_to_cpup [2022-07-12 17:12:38,551 INFO L138 BoogieDeclarations]: Found implementation of procedure __be32_to_cpup [2022-07-12 17:12:38,551 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_commit_rpc_prepare [2022-07-12 17:12:38,551 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_commit_rpc_prepare [2022-07-12 17:12:38,551 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_readlink [2022-07-12 17:12:38,551 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_readlink [2022-07-12 17:12:38,552 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_invalidate_atime [2022-07-12 17:12:38,552 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_invalidate_atime [2022-07-12 17:12:38,552 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_clone_server [2022-07-12 17:12:38,552 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_clone_server [2022-07-12 17:12:38,552 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-07-12 17:12:38,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-07-12 17:12:38,552 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_pgio_rpc_prepare [2022-07-12 17:12:38,554 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_pgio_rpc_prepare [2022-07-12 17:12:38,554 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_permission [2022-07-12 17:12:38,554 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_permission [2022-07-12 17:12:38,555 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-07-12 17:12:38,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-07-12 17:12:38,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 17:12:38,555 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-12 17:12:38,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-12 17:12:38,555 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 17:12:38,558 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_symlink [2022-07-12 17:12:38,559 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_symlink [2022-07-12 17:12:38,559 INFO L130 BoogieDeclarations]: Found specification of procedure xdr_encode_time [2022-07-12 17:12:38,559 INFO L138 BoogieDeclarations]: Found implementation of procedure xdr_encode_time [2022-07-12 17:12:38,559 INFO L130 BoogieDeclarations]: Found specification of procedure NFS_I [2022-07-12 17:12:38,559 INFO L138 BoogieDeclarations]: Found implementation of procedure NFS_I [2022-07-12 17:12:38,559 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_rename_done [2022-07-12 17:12:38,559 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_rename_done [2022-07-12 17:12:38,559 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-12 17:12:38,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-12 17:12:38,560 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-07-12 17:12:38,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-07-12 17:12:38,560 INFO L130 BoogieDeclarations]: Found specification of procedure xdr_decode_time [2022-07-12 17:12:38,560 INFO L138 BoogieDeclarations]: Found implementation of procedure xdr_decode_time [2022-07-12 17:12:38,560 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_getattr [2022-07-12 17:12:38,560 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_getattr [2022-07-12 17:12:38,561 INFO L130 BoogieDeclarations]: Found specification of procedure decode_attrstat [2022-07-12 17:12:38,561 INFO L138 BoogieDeclarations]: Found implementation of procedure decode_attrstat [2022-07-12 17:12:38,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 17:12:38,561 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-12 17:12:38,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-12 17:12:38,561 INFO L130 BoogieDeclarations]: Found specification of procedure __kgid_val [2022-07-12 17:12:38,561 INFO L138 BoogieDeclarations]: Found implementation of procedure __kgid_val [2022-07-12 17:12:38,561 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_alloc_client [2022-07-12 17:12:38,561 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_alloc_client [2022-07-12 17:12:38,561 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_lock [2022-07-12 17:12:38,562 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_lock [2022-07-12 17:12:38,562 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_statfs [2022-07-12 17:12:38,562 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_statfs [2022-07-12 17:12:38,562 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_remove [2022-07-12 17:12:38,562 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_remove [2022-07-12 17:12:38,562 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_read_done [2022-07-12 17:12:38,562 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_read_done [2022-07-12 17:12:38,562 INFO L130 BoogieDeclarations]: Found specification of procedure prepare_reply_buffer [2022-07-12 17:12:38,562 INFO L138 BoogieDeclarations]: Found implementation of procedure prepare_reply_buffer [2022-07-12 17:12:38,562 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_read_setup [2022-07-12 17:12:38,563 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_read_setup [2022-07-12 17:12:38,563 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-07-12 17:12:38,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-07-12 17:12:38,563 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_return_delegation [2022-07-12 17:12:38,563 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_return_delegation [2022-07-12 17:12:38,564 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-12 17:12:38,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-12 17:12:38,564 INFO L130 BoogieDeclarations]: Found specification of procedure encode_fhandle [2022-07-12 17:12:38,564 INFO L138 BoogieDeclarations]: Found implementation of procedure encode_fhandle [2022-07-12 17:12:38,564 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-07-12 17:12:38,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-07-12 17:12:38,564 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-07-12 17:12:38,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-07-12 17:12:38,564 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_instantiate [2022-07-12 17:12:38,564 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_instantiate [2022-07-12 17:12:38,565 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_commit_setup [2022-07-12 17:12:38,565 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_commit_setup [2022-07-12 17:12:38,565 INFO L130 BoogieDeclarations]: Found specification of procedure NFS_SERVER [2022-07-12 17:12:38,565 INFO L138 BoogieDeclarations]: Found implementation of procedure NFS_SERVER [2022-07-12 17:12:38,565 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-12 17:12:38,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-12 17:12:38,565 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-12 17:12:38,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-12 17:12:38,565 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-07-12 17:12:38,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-07-12 17:12:38,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 17:12:38,566 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_link [2022-07-12 17:12:38,566 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_link [2022-07-12 17:12:38,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-12 17:12:38,566 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_pathconf [2022-07-12 17:12:38,566 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_pathconf [2022-07-12 17:12:38,566 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_rename [2022-07-12 17:12:38,566 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_rename [2022-07-12 17:12:38,566 INFO L130 BoogieDeclarations]: Found specification of procedure NFS_FH [2022-07-12 17:12:38,566 INFO L138 BoogieDeclarations]: Found implementation of procedure NFS_FH [2022-07-12 17:12:38,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-12 17:12:38,567 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2022-07-12 17:12:38,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2022-07-12 17:12:38,567 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2022-07-12 17:12:38,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2022-07-12 17:12:38,567 INFO L130 BoogieDeclarations]: Found specification of procedure decode_stat [2022-07-12 17:12:38,567 INFO L138 BoogieDeclarations]: Found implementation of procedure decode_stat [2022-07-12 17:12:38,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-12 17:12:38,567 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-12 17:12:38,567 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-07-12 17:12:38,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-07-12 17:12:38,568 INFO L130 BoogieDeclarations]: Found specification of procedure nfs2_xdr_enc_writeargs [2022-07-12 17:12:38,568 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs2_xdr_enc_writeargs [2022-07-12 17:12:38,568 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-07-12 17:12:38,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-07-12 17:12:38,568 INFO L130 BoogieDeclarations]: Found specification of procedure xdr_read_pages [2022-07-12 17:12:38,568 INFO L138 BoogieDeclarations]: Found implementation of procedure xdr_read_pages [2022-07-12 17:12:38,568 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_rmdir [2022-07-12 17:12:38,568 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_rmdir [2022-07-12 17:12:38,568 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-07-12 17:12:38,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-07-12 17:12:38,569 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_fattr_init [2022-07-12 17:12:38,569 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_fattr_init [2022-07-12 17:12:38,569 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_setattr [2022-07-12 17:12:38,569 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_setattr [2022-07-12 17:12:38,569 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_fsinfo [2022-07-12 17:12:38,569 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_fsinfo [2022-07-12 17:12:38,569 INFO L130 BoogieDeclarations]: Found specification of procedure print_overflow_msg [2022-07-12 17:12:38,569 INFO L138 BoogieDeclarations]: Found implementation of procedure print_overflow_msg [2022-07-12 17:12:38,569 INFO L130 BoogieDeclarations]: Found specification of procedure xdr_inline_decode [2022-07-12 17:12:38,570 INFO L138 BoogieDeclarations]: Found implementation of procedure xdr_inline_decode [2022-07-12 17:12:38,570 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_free_createdata [2022-07-12 17:12:38,570 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_free_createdata [2022-07-12 17:12:38,570 INFO L130 BoogieDeclarations]: Found specification of procedure decode_fattr [2022-07-12 17:12:38,570 INFO L138 BoogieDeclarations]: Found implementation of procedure decode_fattr [2022-07-12 17:12:38,570 INFO L130 BoogieDeclarations]: Found specification of procedure NFS_CLIENT [2022-07-12 17:12:38,570 INFO L138 BoogieDeclarations]: Found implementation of procedure NFS_CLIENT [2022-07-12 17:12:38,570 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-07-12 17:12:38,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-07-12 17:12:38,570 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_write_done [2022-07-12 17:12:38,570 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_write_done [2022-07-12 17:12:38,571 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2022-07-12 17:12:38,571 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2022-07-12 17:12:38,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-12 17:12:38,571 INFO L130 BoogieDeclarations]: Found specification of procedure rpc_call_start [2022-07-12 17:12:38,571 INFO L138 BoogieDeclarations]: Found implementation of procedure rpc_call_start [2022-07-12 17:12:38,571 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-12 17:12:38,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-12 17:12:38,573 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-12 17:12:38,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-12 17:12:38,573 INFO L130 BoogieDeclarations]: Found specification of procedure nfs2_xdr_dec_attrstat [2022-07-12 17:12:38,573 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs2_xdr_dec_attrstat [2022-07-12 17:12:38,573 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_get_root [2022-07-12 17:12:38,573 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_get_root [2022-07-12 17:12:38,573 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_try_mount [2022-07-12 17:12:38,573 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_try_mount [2022-07-12 17:12:38,574 INFO L130 BoogieDeclarations]: Found specification of procedure nfs2_decode_dirent [2022-07-12 17:12:38,574 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs2_decode_dirent [2022-07-12 17:12:38,574 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_create_server [2022-07-12 17:12:38,575 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_create_server [2022-07-12 17:12:38,575 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_mknod [2022-07-12 17:12:38,575 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_mknod [2022-07-12 17:12:38,575 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~$Pointer$~TO~int [2022-07-12 17:12:38,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~$Pointer$~TO~int [2022-07-12 17:12:38,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 17:12:38,575 INFO L130 BoogieDeclarations]: Found specification of procedure xdr_reserve_space [2022-07-12 17:12:38,575 INFO L138 BoogieDeclarations]: Found implementation of procedure xdr_reserve_space [2022-07-12 17:12:38,575 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-12 17:12:38,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-12 17:12:38,576 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_close_context [2022-07-12 17:12:38,576 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_close_context [2022-07-12 17:12:38,576 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-12 17:12:38,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-12 17:12:38,576 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_init_client [2022-07-12 17:12:38,576 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_init_client [2022-07-12 17:12:38,576 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-12 17:12:38,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-12 17:12:38,576 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-12 17:12:38,576 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-12 17:12:38,576 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_unlink_done [2022-07-12 17:12:38,577 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_unlink_done [2022-07-12 17:12:38,577 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-12 17:12:38,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-12 17:12:38,577 INFO L130 BoogieDeclarations]: Found specification of procedure rpc_call_sync [2022-07-12 17:12:38,577 INFO L138 BoogieDeclarations]: Found implementation of procedure rpc_call_sync [2022-07-12 17:12:38,577 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-12 17:12:38,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-12 17:12:38,577 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_submount [2022-07-12 17:12:38,577 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_submount [2022-07-12 17:12:38,577 INFO L130 BoogieDeclarations]: Found specification of procedure encode_diropargs [2022-07-12 17:12:38,578 INFO L138 BoogieDeclarations]: Found implementation of procedure encode_diropargs [2022-07-12 17:12:38,578 INFO L130 BoogieDeclarations]: Found specification of procedure xdr_time_not_set [2022-07-12 17:12:38,578 INFO L138 BoogieDeclarations]: Found implementation of procedure xdr_time_not_set [2022-07-12 17:12:38,578 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-12 17:12:38,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-12 17:12:38,578 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-12 17:12:38,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-12 17:12:38,578 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_unlink_setup [2022-07-12 17:12:38,578 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_unlink_setup [2022-07-12 17:12:38,578 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-12 17:12:38,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-12 17:12:38,579 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_setattr [2022-07-12 17:12:38,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 17:12:38,579 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_mark_for_revalidate [2022-07-12 17:12:38,579 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_mark_for_revalidate [2022-07-12 17:12:38,579 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_have_delegation [2022-07-12 17:12:38,579 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_have_delegation [2022-07-12 17:12:40,473 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 17:12:40,476 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 17:12:40,829 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-12 17:12:47,404 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 17:12:47,495 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 17:12:47,495 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-12 17:12:47,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 05:12:47 BoogieIcfgContainer [2022-07-12 17:12:47,500 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 17:12:47,501 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 17:12:47,501 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 17:12:47,503 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 17:12:47,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 05:12:26" (1/3) ... [2022-07-12 17:12:47,504 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5da50a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 05:12:47, skipping insertion in model container [2022-07-12 17:12:47,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:12:37" (2/3) ... [2022-07-12 17:12:47,504 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5da50a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 05:12:47, skipping insertion in model container [2022-07-12 17:12:47,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 05:12:47" (3/3) ... [2022-07-12 17:12:47,505 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i [2022-07-12 17:12:47,514 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 17:12:47,514 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2022-07-12 17:12:47,595 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 17:12:47,599 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@711025a2, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@56d900f7 [2022-07-12 17:12:47,599 INFO L358 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2022-07-12 17:12:47,611 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-12 17:12:47,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-12 17:12:47,617 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:12:47,618 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-12 17:12:47,618 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-12 17:12:47,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:12:47,621 INFO L85 PathProgramCache]: Analyzing trace with hash -944763359, now seen corresponding path program 1 times [2022-07-12 17:12:47,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:12:47,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503209755] [2022-07-12 17:12:47,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:12:47,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:12:47,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:48,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:12:48,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:48,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 17:12:48,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:48,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:12:48,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:48,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 17:12:48,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:48,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:12:48,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:48,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 17:12:48,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:48,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 17:12:48,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:48,167 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-12 17:12:48,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:12:48,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503209755] [2022-07-12 17:12:48,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503209755] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:12:48,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:12:48,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:12:48,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572055400] [2022-07-12 17:12:48,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:12:48,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:12:48,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:12:48,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:12:48,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:12:48,206 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-12 17:12:58,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:12:58,395 INFO L93 Difference]: Finished difference Result 10695 states and 15913 transitions. [2022-07-12 17:12:58,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:12:58,401 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-12 17:12:58,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:12:58,444 INFO L225 Difference]: With dead ends: 10695 [2022-07-12 17:12:58,444 INFO L226 Difference]: Without dead ends: 5254 [2022-07-12 17:12:58,472 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-12 17:12:58,475 INFO L413 NwaCegarLoop]: 7579 mSDtfsCounter, 7565 mSDsluCounter, 11493 mSDsCounter, 0 mSdLazyCounter, 6262 mSolverCounterSat, 4622 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s 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.6s IncrementalHoareTripleChecker+Time [2022-07-12 17:12:58,478 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.6s Time] [2022-07-12 17:12:58,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5254 states. [2022-07-12 17:12:58,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5254 to 5254. [2022-07-12 17:12:58,815 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-12 17:12:58,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5254 states to 5254 states and 7662 transitions. [2022-07-12 17:12:58,859 INFO L78 Accepts]: Start accepts. Automaton has 5254 states and 7662 transitions. Word has length 50 [2022-07-12 17:12:58,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:12:58,861 INFO L495 AbstractCegarLoop]: Abstraction has 5254 states and 7662 transitions. [2022-07-12 17:12:58,861 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-12 17:12:58,861 INFO L276 IsEmpty]: Start isEmpty. Operand 5254 states and 7662 transitions. [2022-07-12 17:12:58,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-12 17:12:58,863 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:12:58,863 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-12 17:12:58,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 17:12:58,864 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-12 17:12:58,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:12:58,865 INFO L85 PathProgramCache]: Analyzing trace with hash -116995083, now seen corresponding path program 1 times [2022-07-12 17:12:58,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:12:58,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575250208] [2022-07-12 17:12:58,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:12:58,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:12:58,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:59,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:12:59,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:59,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 17:12:59,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:59,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:12:59,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:59,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 17:12:59,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:59,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:12:59,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:59,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 17:12:59,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:59,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 17:12:59,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:59,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 17:12:59,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:59,238 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-12 17:12:59,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:12:59,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575250208] [2022-07-12 17:12:59,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575250208] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:12:59,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:12:59,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:12:59,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945759315] [2022-07-12 17:12:59,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:12:59,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:12:59,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:12:59,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:12:59,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:12:59,241 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-12 17:13:08,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:13:08,238 INFO L93 Difference]: Finished difference Result 5254 states and 7662 transitions. [2022-07-12 17:13:08,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:13:08,238 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-12 17:13:08,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:13:08,264 INFO L225 Difference]: With dead ends: 5254 [2022-07-12 17:13:08,264 INFO L226 Difference]: Without dead ends: 5252 [2022-07-12 17:13:08,268 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-12 17:13:08,270 INFO L413 NwaCegarLoop]: 7421 mSDtfsCounter, 7405 mSDsluCounter, 11209 mSDsCounter, 0 mSdLazyCounter, 6212 mSolverCounterSat, 4498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s 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, 8.6s IncrementalHoareTripleChecker+Time [2022-07-12 17:13:08,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8935 Valid, 18630 Invalid, 10710 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4498 Valid, 6212 Invalid, 0 Unknown, 0 Unchecked, 8.6s Time] [2022-07-12 17:13:08,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5252 states. [2022-07-12 17:13:08,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5252 to 5252. [2022-07-12 17:13:08,546 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-12 17:13:08,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5252 states to 5252 states and 7660 transitions. [2022-07-12 17:13:08,570 INFO L78 Accepts]: Start accepts. Automaton has 5252 states and 7660 transitions. Word has length 56 [2022-07-12 17:13:08,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:13:08,571 INFO L495 AbstractCegarLoop]: Abstraction has 5252 states and 7660 transitions. [2022-07-12 17:13:08,571 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-12 17:13:08,572 INFO L276 IsEmpty]: Start isEmpty. Operand 5252 states and 7660 transitions. [2022-07-12 17:13:08,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-12 17:13:08,574 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:13:08,574 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-12 17:13:08,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 17:13:08,575 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-12 17:13:08,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:13:08,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1415149588, now seen corresponding path program 1 times [2022-07-12 17:13:08,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:13:08,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879621119] [2022-07-12 17:13:08,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:13:08,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:13:08,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:08,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:13:08,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:08,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 17:13:08,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:08,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:13:08,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:08,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 17:13:08,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:08,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:13:08,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:08,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 17:13:08,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:08,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 17:13:08,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:08,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 17:13:08,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:08,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:13:08,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:08,847 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-12 17:13:08,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:13:08,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879621119] [2022-07-12 17:13:08,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879621119] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:13:08,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:13:08,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:13:08,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416153091] [2022-07-12 17:13:08,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:13:08,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:13:08,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:13:08,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:13:08,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:13:08,850 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-12 17:13:17,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:13:17,300 INFO L93 Difference]: Finished difference Result 5252 states and 7660 transitions. [2022-07-12 17:13:17,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:13:17,300 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-12 17:13:17,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:13:17,322 INFO L225 Difference]: With dead ends: 5252 [2022-07-12 17:13:17,322 INFO L226 Difference]: Without dead ends: 5250 [2022-07-12 17:13:17,325 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-12 17:13:17,327 INFO L413 NwaCegarLoop]: 7419 mSDtfsCounter, 7399 mSDsluCounter, 11209 mSDsCounter, 0 mSdLazyCounter, 6210 mSolverCounterSat, 4498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s 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, 8.2s IncrementalHoareTripleChecker+Time [2022-07-12 17:13:17,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8928 Valid, 18628 Invalid, 10708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4498 Valid, 6210 Invalid, 0 Unknown, 0 Unchecked, 8.2s Time] [2022-07-12 17:13:17,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5250 states. [2022-07-12 17:13:17,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5250 to 5250. [2022-07-12 17:13:17,576 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-12 17:13:17,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5250 states to 5250 states and 7658 transitions. [2022-07-12 17:13:17,594 INFO L78 Accepts]: Start accepts. Automaton has 5250 states and 7658 transitions. Word has length 62 [2022-07-12 17:13:17,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:13:17,595 INFO L495 AbstractCegarLoop]: Abstraction has 5250 states and 7658 transitions. [2022-07-12 17:13:17,595 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-12 17:13:17,595 INFO L276 IsEmpty]: Start isEmpty. Operand 5250 states and 7658 transitions. [2022-07-12 17:13:17,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-12 17:13:17,599 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:13:17,599 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-12 17:13:17,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 17:13:17,599 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-12 17:13:17,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:13:17,600 INFO L85 PathProgramCache]: Analyzing trace with hash -670828120, now seen corresponding path program 1 times [2022-07-12 17:13:17,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:13:17,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182004342] [2022-07-12 17:13:17,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:13:17,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:13:17,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:17,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:13:17,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:17,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 17:13:17,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:17,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:13:17,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:17,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 17:13:17,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:17,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:13:17,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:17,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 17:13:17,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:17,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 17:13:17,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:17,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 17:13:17,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:17,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:13:17,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:17,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 17:13:17,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:17,871 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-12 17:13:17,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:13:17,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182004342] [2022-07-12 17:13:17,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182004342] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:13:17,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:13:17,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:13:17,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73608986] [2022-07-12 17:13:17,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:13:17,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:13:17,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:13:17,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:13:17,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:13:17,873 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-12 17:13:26,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:13:26,378 INFO L93 Difference]: Finished difference Result 5250 states and 7658 transitions. [2022-07-12 17:13:26,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:13:26,378 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-12 17:13:26,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:13:26,398 INFO L225 Difference]: With dead ends: 5250 [2022-07-12 17:13:26,398 INFO L226 Difference]: Without dead ends: 5248 [2022-07-12 17:13:26,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:13:26,401 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-12 17:13:26,402 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-12 17:13:26,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5248 states. [2022-07-12 17:13:26,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5248 to 5248. [2022-07-12 17:13:26,647 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-12 17:13:26,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5248 states to 5248 states and 7656 transitions. [2022-07-12 17:13:26,666 INFO L78 Accepts]: Start accepts. Automaton has 5248 states and 7656 transitions. Word has length 68 [2022-07-12 17:13:26,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:13:26,667 INFO L495 AbstractCegarLoop]: Abstraction has 5248 states and 7656 transitions. [2022-07-12 17:13:26,668 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-12 17:13:26,668 INFO L276 IsEmpty]: Start isEmpty. Operand 5248 states and 7656 transitions. [2022-07-12 17:13:26,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-12 17:13:26,670 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:13:26,670 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-12 17:13:26,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 17:13:26,671 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-12 17:13:26,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:13:26,671 INFO L85 PathProgramCache]: Analyzing trace with hash -135949064, now seen corresponding path program 1 times [2022-07-12 17:13:26,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:13:26,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032458918] [2022-07-12 17:13:26,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:13:26,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:13:26,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:26,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:13:26,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:26,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 17:13:26,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:26,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:13:26,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:26,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 17:13:26,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:26,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:13:26,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:26,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 17:13:26,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:26,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 17:13:26,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:26,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 17:13:26,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:26,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:13:26,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:26,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 17:13:26,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:26,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 17:13:26,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:26,910 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-12 17:13:26,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:13:26,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032458918] [2022-07-12 17:13:26,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032458918] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:13:26,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:13:26,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:13:26,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254625071] [2022-07-12 17:13:26,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:13:26,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:13:26,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:13:26,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:13:26,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:13:26,913 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-12 17:13:36,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:13:36,078 INFO L93 Difference]: Finished difference Result 5248 states and 7656 transitions. [2022-07-12 17:13:36,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:13:36,099 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-12 17:13:36,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:13:36,129 INFO L225 Difference]: With dead ends: 5248 [2022-07-12 17:13:36,130 INFO L226 Difference]: Without dead ends: 5246 [2022-07-12 17:13:36,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:13:36,148 INFO L413 NwaCegarLoop]: 7415 mSDtfsCounter, 7387 mSDsluCounter, 11209 mSDsCounter, 0 mSdLazyCounter, 6206 mSolverCounterSat, 4498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s 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, 8.8s IncrementalHoareTripleChecker+Time [2022-07-12 17:13:36,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8914 Valid, 18624 Invalid, 10704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4498 Valid, 6206 Invalid, 0 Unknown, 0 Unchecked, 8.8s Time] [2022-07-12 17:13:36,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5246 states. [2022-07-12 17:13:36,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5246 to 5246. [2022-07-12 17:13:36,394 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-12 17:13:36,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5246 states to 5246 states and 7654 transitions. [2022-07-12 17:13:36,414 INFO L78 Accepts]: Start accepts. Automaton has 5246 states and 7654 transitions. Word has length 74 [2022-07-12 17:13:36,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:13:36,414 INFO L495 AbstractCegarLoop]: Abstraction has 5246 states and 7654 transitions. [2022-07-12 17:13:36,415 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-12 17:13:36,415 INFO L276 IsEmpty]: Start isEmpty. Operand 5246 states and 7654 transitions. [2022-07-12 17:13:36,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-07-12 17:13:36,415 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:13:36,416 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-12 17:13:36,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 17:13:36,416 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-12 17:13:36,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:13:36,416 INFO L85 PathProgramCache]: Analyzing trace with hash -107039956, now seen corresponding path program 1 times [2022-07-12 17:13:36,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:13:36,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629095624] [2022-07-12 17:13:36,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:13:36,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:13:36,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:36,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:13:36,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:36,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 17:13:36,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:36,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:13:36,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:36,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 17:13:36,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:36,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:13:36,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:36,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 17:13:36,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:36,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 17:13:36,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:36,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 17:13:36,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:36,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:13:36,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:36,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 17:13:36,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:36,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 17:13:36,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:36,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 17:13:36,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:36,719 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-12 17:13:36,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:13:36,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629095624] [2022-07-12 17:13:36,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629095624] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:13:36,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:13:36,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:13:36,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213861744] [2022-07-12 17:13:36,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:13:36,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:13:36,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:13:36,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:13:36,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:13:36,721 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-12 17:13:38,195 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-12 17:13:45,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:13:45,986 INFO L93 Difference]: Finished difference Result 5246 states and 7654 transitions. [2022-07-12 17:13:45,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:13:45,986 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-12 17:13:45,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:13:46,012 INFO L225 Difference]: With dead ends: 5246 [2022-07-12 17:13:46,013 INFO L226 Difference]: Without dead ends: 5244 [2022-07-12 17:13:46,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:13:46,017 INFO L413 NwaCegarLoop]: 7413 mSDtfsCounter, 7381 mSDsluCounter, 11209 mSDsCounter, 0 mSdLazyCounter, 6204 mSolverCounterSat, 4498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s 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, 8.9s IncrementalHoareTripleChecker+Time [2022-07-12 17:13:46,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8907 Valid, 18622 Invalid, 10702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4498 Valid, 6204 Invalid, 0 Unknown, 0 Unchecked, 8.9s Time] [2022-07-12 17:13:46,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5244 states. [2022-07-12 17:13:46,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5244 to 5244. [2022-07-12 17:13:46,235 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-12 17:13:46,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5244 states to 5244 states and 7652 transitions. [2022-07-12 17:13:46,252 INFO L78 Accepts]: Start accepts. Automaton has 5244 states and 7652 transitions. Word has length 80 [2022-07-12 17:13:46,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:13:46,252 INFO L495 AbstractCegarLoop]: Abstraction has 5244 states and 7652 transitions. [2022-07-12 17:13:46,252 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-12 17:13:46,252 INFO L276 IsEmpty]: Start isEmpty. Operand 5244 states and 7652 transitions. [2022-07-12 17:13:46,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-12 17:13:46,253 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:13:46,253 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-12 17:13:46,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 17:13:46,253 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-12 17:13:46,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:13:46,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1125642395, now seen corresponding path program 1 times [2022-07-12 17:13:46,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:13:46,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491172992] [2022-07-12 17:13:46,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:13:46,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:13:46,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:46,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:13:46,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:46,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 17:13:46,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:46,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:13:46,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:46,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 17:13:46,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:46,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:13:46,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:46,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 17:13:46,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:46,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 17:13:46,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:46,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 17:13:46,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:46,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:13:46,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:46,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 17:13:46,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:46,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 17:13:46,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:46,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 17:13:46,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:46,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 17:13:46,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:46,549 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-12 17:13:46,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:13:46,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491172992] [2022-07-12 17:13:46,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491172992] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:13:46,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:13:46,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:13:46,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501083399] [2022-07-12 17:13:46,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:13:46,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:13:46,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:13:46,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:13:46,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:13:46,552 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-12 17:13:48,649 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:13:56,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:13:56,800 INFO L93 Difference]: Finished difference Result 5244 states and 7652 transitions. [2022-07-12 17:13:56,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:13:56,800 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-12 17:13:56,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:13:56,814 INFO L225 Difference]: With dead ends: 5244 [2022-07-12 17:13:56,814 INFO L226 Difference]: Without dead ends: 5242 [2022-07-12 17:13:56,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:13:56,816 INFO L413 NwaCegarLoop]: 7411 mSDtfsCounter, 7375 mSDsluCounter, 11209 mSDsCounter, 0 mSdLazyCounter, 6202 mSolverCounterSat, 4498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s 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, 9.9s IncrementalHoareTripleChecker+Time [2022-07-12 17:13:56,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8900 Valid, 18620 Invalid, 10700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4498 Valid, 6202 Invalid, 0 Unknown, 0 Unchecked, 9.9s Time] [2022-07-12 17:13:56,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5242 states. [2022-07-12 17:13:57,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5242 to 5242. [2022-07-12 17:13:57,032 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-12 17:13:57,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5242 states to 5242 states and 7650 transitions. [2022-07-12 17:13:57,050 INFO L78 Accepts]: Start accepts. Automaton has 5242 states and 7650 transitions. Word has length 86 [2022-07-12 17:13:57,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:13:57,051 INFO L495 AbstractCegarLoop]: Abstraction has 5242 states and 7650 transitions. [2022-07-12 17:13:57,051 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-12 17:13:57,051 INFO L276 IsEmpty]: Start isEmpty. Operand 5242 states and 7650 transitions. [2022-07-12 17:13:57,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-12 17:13:57,051 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:13:57,052 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-12 17:13:57,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 17:13:57,052 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-12 17:13:57,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:13:57,052 INFO L85 PathProgramCache]: Analyzing trace with hash -800428171, now seen corresponding path program 1 times [2022-07-12 17:13:57,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:13:57,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546556052] [2022-07-12 17:13:57,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:13:57,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:13:57,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:57,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:13:57,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:57,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 17:13:57,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:57,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:13:57,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:57,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 17:13:57,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:57,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:13:57,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:57,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 17:13:57,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:57,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 17:13:57,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:57,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 17:13:57,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:57,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:13:57,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:57,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 17:13:57,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:57,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 17:13:57,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:57,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 17:13:57,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:57,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 17:13:57,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:57,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 17:13:57,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:13:57,337 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-12 17:13:57,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:13:57,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546556052] [2022-07-12 17:13:57,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546556052] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:13:57,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:13:57,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:13:57,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101027473] [2022-07-12 17:13:57,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:13:57,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:13:57,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:13:57,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:13:57,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:13:57,339 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-12 17:13:59,123 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:14:06,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:14:06,926 INFO L93 Difference]: Finished difference Result 5242 states and 7650 transitions. [2022-07-12 17:14:06,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:14:06,927 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-12 17:14:06,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:14:06,942 INFO L225 Difference]: With dead ends: 5242 [2022-07-12 17:14:06,942 INFO L226 Difference]: Without dead ends: 5240 [2022-07-12 17:14:06,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:14:06,945 INFO L413 NwaCegarLoop]: 7409 mSDtfsCounter, 7373 mSDsluCounter, 11209 mSDsCounter, 0 mSdLazyCounter, 6196 mSolverCounterSat, 4498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8897 SdHoareTripleChecker+Valid, 18618 SdHoareTripleChecker+Invalid, 10694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4498 IncrementalHoareTripleChecker+Valid, 6196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2022-07-12 17:14:06,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8897 Valid, 18618 Invalid, 10694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4498 Valid, 6196 Invalid, 0 Unknown, 0 Unchecked, 9.2s Time] [2022-07-12 17:14:06,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5240 states. [2022-07-12 17:14:07,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5240 to 5240. [2022-07-12 17:14:07,177 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-12 17:14:07,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5240 states to 5240 states and 7648 transitions. [2022-07-12 17:14:07,197 INFO L78 Accepts]: Start accepts. Automaton has 5240 states and 7648 transitions. Word has length 92 [2022-07-12 17:14:07,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:14:07,197 INFO L495 AbstractCegarLoop]: Abstraction has 5240 states and 7648 transitions. [2022-07-12 17:14:07,197 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-12 17:14:07,197 INFO L276 IsEmpty]: Start isEmpty. Operand 5240 states and 7648 transitions. [2022-07-12 17:14:07,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-12 17:14:07,198 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:14:07,198 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-12 17:14:07,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 17:14:07,198 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-12 17:14:07,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:14:07,199 INFO L85 PathProgramCache]: Analyzing trace with hash -412192424, now seen corresponding path program 1 times [2022-07-12 17:14:07,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:14:07,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268223853] [2022-07-12 17:14:07,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:14:07,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:14:07,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:07,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:14:07,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:07,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 17:14:07,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:07,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:14:07,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:07,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 17:14:07,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:07,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:14:07,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:07,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 17:14:07,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:07,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 17:14:07,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:07,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 17:14:07,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:07,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:14:07,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:07,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 17:14:07,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:07,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 17:14:07,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:07,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 17:14:07,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:07,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 17:14:07,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:07,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 17:14:07,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:07,486 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-12 17:14:07,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:14:07,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268223853] [2022-07-12 17:14:07,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268223853] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:14:07,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:14:07,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:14:07,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126352811] [2022-07-12 17:14:07,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:14:07,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:14:07,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:14:07,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:14:07,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:14:07,488 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-12 17:14:09,193 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:14:17,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:14:17,875 INFO L93 Difference]: Finished difference Result 5240 states and 7648 transitions. [2022-07-12 17:14:17,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:14:17,875 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-12 17:14:17,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:14:17,889 INFO L225 Difference]: With dead ends: 5240 [2022-07-12 17:14:17,890 INFO L226 Difference]: Without dead ends: 5238 [2022-07-12 17:14:17,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:14:17,893 INFO L413 NwaCegarLoop]: 7407 mSDtfsCounter, 7361 mSDsluCounter, 11209 mSDsCounter, 0 mSdLazyCounter, 6198 mSolverCounterSat, 4498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8885 SdHoareTripleChecker+Valid, 18616 SdHoareTripleChecker+Invalid, 10696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4498 IncrementalHoareTripleChecker+Valid, 6198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.0s IncrementalHoareTripleChecker+Time [2022-07-12 17:14:17,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8885 Valid, 18616 Invalid, 10696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4498 Valid, 6198 Invalid, 0 Unknown, 0 Unchecked, 10.0s Time] [2022-07-12 17:14:17,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5238 states. [2022-07-12 17:14:18,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5238 to 5238. [2022-07-12 17:14:18,133 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-12 17:14:18,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5238 states to 5238 states and 7646 transitions. [2022-07-12 17:14:18,153 INFO L78 Accepts]: Start accepts. Automaton has 5238 states and 7646 transitions. Word has length 94 [2022-07-12 17:14:18,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:14:18,153 INFO L495 AbstractCegarLoop]: Abstraction has 5238 states and 7646 transitions. [2022-07-12 17:14:18,153 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-12 17:14:18,154 INFO L276 IsEmpty]: Start isEmpty. Operand 5238 states and 7646 transitions. [2022-07-12 17:14:18,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-12 17:14:18,154 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:14:18,154 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-12 17:14:18,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 17:14:18,155 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-12 17:14:18,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:14:18,156 INFO L85 PathProgramCache]: Analyzing trace with hash 306975492, now seen corresponding path program 1 times [2022-07-12 17:14:18,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:14:18,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815270652] [2022-07-12 17:14:18,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:14:18,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:14:18,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:18,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:14:18,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:18,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 17:14:18,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:18,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:14:18,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:18,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 17:14:18,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:18,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:14:18,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:18,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 17:14:18,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:18,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 17:14:18,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:18,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 17:14:18,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:18,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:14:18,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:18,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 17:14:18,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:18,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 17:14:18,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:18,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 17:14:18,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:18,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 17:14:18,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:18,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 17:14:18,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:18,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 17:14:18,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:18,423 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-12 17:14:18,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:14:18,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815270652] [2022-07-12 17:14:18,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815270652] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:14:18,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:14:18,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:14:18,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468718820] [2022-07-12 17:14:18,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:14:18,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:14:18,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:14:18,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:14:18,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:14:18,425 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-12 17:14:20,027 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:14:28,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:14:28,655 INFO L93 Difference]: Finished difference Result 5238 states and 7646 transitions. [2022-07-12 17:14:28,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:14:28,656 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-12 17:14:28,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:14:28,669 INFO L225 Difference]: With dead ends: 5238 [2022-07-12 17:14:28,669 INFO L226 Difference]: Without dead ends: 5236 [2022-07-12 17:14:28,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:14:28,671 INFO L413 NwaCegarLoop]: 7405 mSDtfsCounter, 7357 mSDsluCounter, 11209 mSDsCounter, 0 mSdLazyCounter, 6196 mSolverCounterSat, 4498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s 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, 9.8s IncrementalHoareTripleChecker+Time [2022-07-12 17:14:28,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8880 Valid, 18614 Invalid, 10694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4498 Valid, 6196 Invalid, 0 Unknown, 0 Unchecked, 9.8s Time] [2022-07-12 17:14:28,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5236 states. [2022-07-12 17:14:28,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5236 to 5236. [2022-07-12 17:14:28,898 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-12 17:14:28,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5236 states to 5236 states and 7644 transitions. [2022-07-12 17:14:28,914 INFO L78 Accepts]: Start accepts. Automaton has 5236 states and 7644 transitions. Word has length 100 [2022-07-12 17:14:28,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:14:28,914 INFO L495 AbstractCegarLoop]: Abstraction has 5236 states and 7644 transitions. [2022-07-12 17:14:28,915 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-12 17:14:28,915 INFO L276 IsEmpty]: Start isEmpty. Operand 5236 states and 7644 transitions. [2022-07-12 17:14:28,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-12 17:14:28,918 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:14:28,918 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-12 17:14:28,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 17:14:28,919 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-12 17:14:28,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:14:28,919 INFO L85 PathProgramCache]: Analyzing trace with hash 2136352058, now seen corresponding path program 1 times [2022-07-12 17:14:28,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:14:28,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935500284] [2022-07-12 17:14:28,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:14:28,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:14:28,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:29,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:14:29,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:29,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 17:14:29,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:29,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:14:29,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:29,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 17:14:29,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:29,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:14:29,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:29,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 17:14:29,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:29,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 17:14:29,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:29,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 17:14:29,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:29,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:14:29,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:29,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 17:14:29,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:29,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 17:14:29,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:29,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 17:14:29,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:29,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 17:14:29,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:29,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 17:14:29,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:29,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 17:14:29,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:29,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:14:29,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:29,136 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-12 17:14:29,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:14:29,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935500284] [2022-07-12 17:14:29,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935500284] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:14:29,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:14:29,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:14:29,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711214793] [2022-07-12 17:14:29,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:14:29,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:14:29,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:14:29,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:14:29,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:14:29,138 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-12 17:14:39,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:14:39,392 INFO L93 Difference]: Finished difference Result 5236 states and 7644 transitions. [2022-07-12 17:14:39,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:14:39,393 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-12 17:14:39,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:14:39,408 INFO L225 Difference]: With dead ends: 5236 [2022-07-12 17:14:39,409 INFO L226 Difference]: Without dead ends: 5234 [2022-07-12 17:14:39,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:14:39,412 INFO L413 NwaCegarLoop]: 7403 mSDtfsCounter, 7351 mSDsluCounter, 11209 mSDsCounter, 0 mSdLazyCounter, 6194 mSolverCounterSat, 4498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s 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.9s IncrementalHoareTripleChecker+Time [2022-07-12 17:14:39,412 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.9s Time] [2022-07-12 17:14:39,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5234 states. [2022-07-12 17:14:39,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5234 to 5234. [2022-07-12 17:14:39,655 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-12 17:14:39,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5234 states to 5234 states and 7642 transitions. [2022-07-12 17:14:39,673 INFO L78 Accepts]: Start accepts. Automaton has 5234 states and 7642 transitions. Word has length 106 [2022-07-12 17:14:39,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:14:39,674 INFO L495 AbstractCegarLoop]: Abstraction has 5234 states and 7642 transitions. [2022-07-12 17:14:39,674 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-12 17:14:39,674 INFO L276 IsEmpty]: Start isEmpty. Operand 5234 states and 7642 transitions. [2022-07-12 17:14:39,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-12 17:14:39,675 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:14:39,675 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-12 17:14:39,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 17:14:39,676 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-12 17:14:39,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:14:39,676 INFO L85 PathProgramCache]: Analyzing trace with hash 869079226, now seen corresponding path program 1 times [2022-07-12 17:14:39,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:14:39,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997037160] [2022-07-12 17:14:39,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:14:39,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:14:39,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:39,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:14:39,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:39,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 17:14:39,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:39,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:14:39,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:39,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 17:14:39,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:39,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:14:39,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:39,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 17:14:39,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:39,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 17:14:39,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:39,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 17:14:39,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:39,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:14:39,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:39,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 17:14:39,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:39,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 17:14:39,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:39,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 17:14:39,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:39,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 17:14:39,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:39,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 17:14:39,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:39,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 17:14:39,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:39,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:14:39,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:39,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 17:14:39,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:39,913 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-12 17:14:39,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:14:39,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997037160] [2022-07-12 17:14:39,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997037160] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:14:39,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:14:39,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:14:39,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850323334] [2022-07-12 17:14:39,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:14:39,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:14:39,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:14:39,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:14:39,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:14:39,915 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-12 17:14:49,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:14:49,705 INFO L93 Difference]: Finished difference Result 5234 states and 7642 transitions. [2022-07-12 17:14:49,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:14:49,705 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-12 17:14:49,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:14:49,717 INFO L225 Difference]: With dead ends: 5234 [2022-07-12 17:14:49,718 INFO L226 Difference]: Without dead ends: 5232 [2022-07-12 17:14:49,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:14:49,723 INFO L413 NwaCegarLoop]: 7401 mSDtfsCounter, 7345 mSDsluCounter, 11209 mSDsCounter, 0 mSdLazyCounter, 6192 mSolverCounterSat, 4498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s 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, 9.4s IncrementalHoareTripleChecker+Time [2022-07-12 17:14:49,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8866 Valid, 18610 Invalid, 10690 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4498 Valid, 6192 Invalid, 0 Unknown, 0 Unchecked, 9.4s Time] [2022-07-12 17:14:49,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5232 states. [2022-07-12 17:14:49,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5232 to 5232. [2022-07-12 17:14:49,968 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-12 17:14:49,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5232 states to 5232 states and 7640 transitions. [2022-07-12 17:14:49,986 INFO L78 Accepts]: Start accepts. Automaton has 5232 states and 7640 transitions. Word has length 112 [2022-07-12 17:14:49,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:14:49,988 INFO L495 AbstractCegarLoop]: Abstraction has 5232 states and 7640 transitions. [2022-07-12 17:14:49,989 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-12 17:14:49,989 INFO L276 IsEmpty]: Start isEmpty. Operand 5232 states and 7640 transitions. [2022-07-12 17:14:49,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-12 17:14:49,990 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:14:49,990 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-12 17:14:49,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 17:14:49,990 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-12 17:14:49,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:14:49,991 INFO L85 PathProgramCache]: Analyzing trace with hash -574328519, now seen corresponding path program 1 times [2022-07-12 17:14:49,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:14:49,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651563087] [2022-07-12 17:14:49,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:14:49,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:14:50,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:50,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:14:50,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:50,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 17:14:50,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:50,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:14:50,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:50,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 17:14:50,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:50,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:14:50,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:50,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 17:14:50,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:50,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 17:14:50,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:50,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 17:14:50,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:50,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:14:50,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:50,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 17:14:50,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:50,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 17:14:50,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:50,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 17:14:50,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:50,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 17:14:50,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:50,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 17:14:50,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:50,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 17:14:50,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:50,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:14:50,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:50,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 17:14:50,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:50,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 17:14:50,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:14:50,247 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-12 17:14:50,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:14:50,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651563087] [2022-07-12 17:14:50,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651563087] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:14:50,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:14:50,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:14:50,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316301830] [2022-07-12 17:14:50,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:14:50,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:14:50,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:14:50,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:14:50,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:14:50,249 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-12 17:14:52,533 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:15:01,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:15:01,490 INFO L93 Difference]: Finished difference Result 5232 states and 7640 transitions. [2022-07-12 17:15:01,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:15:01,490 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-12 17:15:01,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:15:01,503 INFO L225 Difference]: With dead ends: 5232 [2022-07-12 17:15:01,503 INFO L226 Difference]: Without dead ends: 5230 [2022-07-12 17:15:01,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:15:01,506 INFO L413 NwaCegarLoop]: 7399 mSDtfsCounter, 7339 mSDsluCounter, 11209 mSDsCounter, 0 mSdLazyCounter, 6190 mSolverCounterSat, 4498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8859 SdHoareTripleChecker+Valid, 18608 SdHoareTripleChecker+Invalid, 10688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4498 IncrementalHoareTripleChecker+Valid, 6190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.9s IncrementalHoareTripleChecker+Time [2022-07-12 17:15:01,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8859 Valid, 18608 Invalid, 10688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4498 Valid, 6190 Invalid, 0 Unknown, 0 Unchecked, 10.9s Time] [2022-07-12 17:15:01,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5230 states. [2022-07-12 17:15:01,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5230 to 5230. [2022-07-12 17:15:01,759 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-12 17:15:01,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5230 states to 5230 states and 7638 transitions. [2022-07-12 17:15:01,778 INFO L78 Accepts]: Start accepts. Automaton has 5230 states and 7638 transitions. Word has length 118 [2022-07-12 17:15:01,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:15:01,778 INFO L495 AbstractCegarLoop]: Abstraction has 5230 states and 7638 transitions. [2022-07-12 17:15:01,779 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-12 17:15:01,779 INFO L276 IsEmpty]: Start isEmpty. Operand 5230 states and 7638 transitions. [2022-07-12 17:15:01,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-07-12 17:15:01,780 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:15:01,780 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-12 17:15:01,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 17:15:01,780 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-12 17:15:01,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:15:01,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1828773943, now seen corresponding path program 1 times [2022-07-12 17:15:01,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:15:01,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108189442] [2022-07-12 17:15:01,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:15:01,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:15:01,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:01,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:15:01,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:01,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 17:15:01,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:01,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:15:01,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:01,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 17:15:01,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:01,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:15:01,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:01,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 17:15:01,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:01,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 17:15:01,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:01,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 17:15:01,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:01,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:15:01,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:01,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 17:15:01,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:01,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 17:15:01,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:01,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 17:15:01,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:01,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 17:15:01,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:02,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 17:15:02,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:02,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 17:15:02,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:02,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:15:02,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:02,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 17:15:02,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:02,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 17:15:02,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:02,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 17:15:02,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:02,093 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-12 17:15:02,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:15:02,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108189442] [2022-07-12 17:15:02,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108189442] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:15:02,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:15:02,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:15:02,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525201178] [2022-07-12 17:15:02,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:15:02,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:15:02,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:15:02,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:15:02,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:15:02,095 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-12 17:15:12,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:15:12,177 INFO L93 Difference]: Finished difference Result 5230 states and 7638 transitions. [2022-07-12 17:15:12,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:15:12,178 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-12 17:15:12,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:15:12,190 INFO L225 Difference]: With dead ends: 5230 [2022-07-12 17:15:12,190 INFO L226 Difference]: Without dead ends: 5228 [2022-07-12 17:15:12,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:15:12,193 INFO L413 NwaCegarLoop]: 7397 mSDtfsCounter, 7333 mSDsluCounter, 11209 mSDsCounter, 0 mSdLazyCounter, 6188 mSolverCounterSat, 4498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8852 SdHoareTripleChecker+Valid, 18606 SdHoareTripleChecker+Invalid, 10686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4498 IncrementalHoareTripleChecker+Valid, 6188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.7s IncrementalHoareTripleChecker+Time [2022-07-12 17:15:12,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8852 Valid, 18606 Invalid, 10686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4498 Valid, 6188 Invalid, 0 Unknown, 0 Unchecked, 9.7s Time] [2022-07-12 17:15:12,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5228 states. [2022-07-12 17:15:12,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5228 to 5228. [2022-07-12 17:15:12,448 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-12 17:15:12,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5228 states to 5228 states and 7636 transitions. [2022-07-12 17:15:12,467 INFO L78 Accepts]: Start accepts. Automaton has 5228 states and 7636 transitions. Word has length 124 [2022-07-12 17:15:12,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:15:12,468 INFO L495 AbstractCegarLoop]: Abstraction has 5228 states and 7636 transitions. [2022-07-12 17:15:12,468 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-12 17:15:12,468 INFO L276 IsEmpty]: Start isEmpty. Operand 5228 states and 7636 transitions. [2022-07-12 17:15:12,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-07-12 17:15:12,469 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:15:12,469 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-12 17:15:12,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 17:15:12,469 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-12 17:15:12,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:15:12,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1873078433, now seen corresponding path program 1 times [2022-07-12 17:15:12,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:15:12,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667337052] [2022-07-12 17:15:12,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:15:12,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:15:12,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:12,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:15:12,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:12,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 17:15:12,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:12,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:15:12,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:12,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 17:15:12,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:12,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:15:12,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:12,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 17:15:12,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:12,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 17:15:12,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:12,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 17:15:12,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:12,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:15:12,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:12,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 17:15:12,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:12,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 17:15:12,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:12,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 17:15:12,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:12,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 17:15:12,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:12,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 17:15:12,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:12,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 17:15:12,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:12,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:15:12,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:12,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 17:15:12,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:12,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 17:15:12,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:12,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 17:15:12,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:12,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-12 17:15:12,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:12,853 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-12 17:15:12,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:15:12,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667337052] [2022-07-12 17:15:12,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667337052] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:15:12,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:15:12,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:15:12,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624230928] [2022-07-12 17:15:12,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:15:12,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:15:12,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:15:12,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:15:12,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:15:12,855 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-12 17:15:23,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:15:23,388 INFO L93 Difference]: Finished difference Result 5228 states and 7636 transitions. [2022-07-12 17:15:23,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:15:23,388 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-12 17:15:23,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:15:23,399 INFO L225 Difference]: With dead ends: 5228 [2022-07-12 17:15:23,399 INFO L226 Difference]: Without dead ends: 5226 [2022-07-12 17:15:23,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:15:23,402 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-12 17:15:23,403 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-12 17:15:23,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5226 states. [2022-07-12 17:15:23,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5226 to 5226. [2022-07-12 17:15:23,666 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-12 17:15:23,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5226 states to 5226 states and 7634 transitions. [2022-07-12 17:15:23,682 INFO L78 Accepts]: Start accepts. Automaton has 5226 states and 7634 transitions. Word has length 130 [2022-07-12 17:15:23,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:15:23,682 INFO L495 AbstractCegarLoop]: Abstraction has 5226 states and 7634 transitions. [2022-07-12 17:15:23,682 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-12 17:15:23,682 INFO L276 IsEmpty]: Start isEmpty. Operand 5226 states and 7634 transitions. [2022-07-12 17:15:23,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-12 17:15:23,683 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:15:23,683 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-12 17:15:23,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 17:15:23,684 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-12 17:15:23,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:15:23,684 INFO L85 PathProgramCache]: Analyzing trace with hash 595773319, now seen corresponding path program 1 times [2022-07-12 17:15:23,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:15:23,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899627559] [2022-07-12 17:15:23,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:15:23,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:15:23,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:23,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:15:23,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:23,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 17:15:23,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:23,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:15:23,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:23,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 17:15:23,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:23,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:15:23,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:23,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 17:15:23,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:23,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 17:15:23,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:23,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 17:15:23,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:23,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:15:23,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:23,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 17:15:23,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:23,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 17:15:23,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:23,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 17:15:23,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:23,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 17:15:23,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:23,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 17:15:23,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:23,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 17:15:23,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:23,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:15:23,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:23,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 17:15:23,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:23,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 17:15:23,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:24,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 17:15:24,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:24,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-12 17:15:24,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:24,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-12 17:15:24,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:24,034 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-12 17:15:24,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:15:24,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899627559] [2022-07-12 17:15:24,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899627559] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:15:24,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:15:24,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:15:24,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336422505] [2022-07-12 17:15:24,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:15:24,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:15:24,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:15:24,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:15:24,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:15:24,037 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-12 17:15:25,872 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:15:34,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:15:34,756 INFO L93 Difference]: Finished difference Result 5226 states and 7634 transitions. [2022-07-12 17:15:34,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:15:34,756 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-12 17:15:34,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:15:34,769 INFO L225 Difference]: With dead ends: 5226 [2022-07-12 17:15:34,769 INFO L226 Difference]: Without dead ends: 5224 [2022-07-12 17:15:34,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:15:34,772 INFO L413 NwaCegarLoop]: 7393 mSDtfsCounter, 7321 mSDsluCounter, 11209 mSDsCounter, 0 mSdLazyCounter, 6184 mSolverCounterSat, 4498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s 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.3s IncrementalHoareTripleChecker+Time [2022-07-12 17:15:34,773 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.3s Time] [2022-07-12 17:15:34,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5224 states. [2022-07-12 17:15:35,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5224 to 5224. [2022-07-12 17:15:35,085 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-12 17:15:35,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5224 states to 5224 states and 7632 transitions. [2022-07-12 17:15:35,102 INFO L78 Accepts]: Start accepts. Automaton has 5224 states and 7632 transitions. Word has length 136 [2022-07-12 17:15:35,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:15:35,103 INFO L495 AbstractCegarLoop]: Abstraction has 5224 states and 7632 transitions. [2022-07-12 17:15:35,103 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-12 17:15:35,103 INFO L276 IsEmpty]: Start isEmpty. Operand 5224 states and 7632 transitions. [2022-07-12 17:15:35,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-07-12 17:15:35,104 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:15:35,104 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-12 17:15:35,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 17:15:35,105 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-12 17:15:35,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:15:35,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1290209167, now seen corresponding path program 1 times [2022-07-12 17:15:35,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:15:35,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638124629] [2022-07-12 17:15:35,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:15:35,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:15:35,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:35,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:15:35,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:35,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 17:15:35,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:35,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:15:35,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:35,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 17:15:35,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:35,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:15:35,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:35,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 17:15:35,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:35,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 17:15:35,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:35,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 17:15:35,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:35,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:15:35,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:35,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 17:15:35,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:35,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 17:15:35,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:35,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 17:15:35,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:35,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 17:15:35,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:35,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 17:15:35,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:35,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 17:15:35,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:35,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:15:35,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:35,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 17:15:35,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:35,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 17:15:35,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:35,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 17:15:35,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:35,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-12 17:15:35,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:35,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-12 17:15:35,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:35,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-12 17:15:35,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:35,411 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-12 17:15:35,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:15:35,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638124629] [2022-07-12 17:15:35,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638124629] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:15:35,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:15:35,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:15:35,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078781694] [2022-07-12 17:15:35,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:15:35,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:15:35,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:15:35,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:15:35,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:15:35,413 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-12 17:15:45,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:15:45,583 INFO L93 Difference]: Finished difference Result 5224 states and 7632 transitions. [2022-07-12 17:15:45,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:15:45,583 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-12 17:15:45,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:15:45,598 INFO L225 Difference]: With dead ends: 5224 [2022-07-12 17:15:45,598 INFO L226 Difference]: Without dead ends: 5222 [2022-07-12 17:15:45,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:15:45,602 INFO L413 NwaCegarLoop]: 7391 mSDtfsCounter, 7315 mSDsluCounter, 11209 mSDsCounter, 0 mSdLazyCounter, 6182 mSolverCounterSat, 4498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s 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, 9.7s IncrementalHoareTripleChecker+Time [2022-07-12 17:15:45,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8831 Valid, 18600 Invalid, 10680 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4498 Valid, 6182 Invalid, 0 Unknown, 0 Unchecked, 9.7s Time] [2022-07-12 17:15:45,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5222 states. [2022-07-12 17:15:45,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5222 to 5222. [2022-07-12 17:15:45,917 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-12 17:15:45,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5222 states to 5222 states and 7630 transitions. [2022-07-12 17:15:45,935 INFO L78 Accepts]: Start accepts. Automaton has 5222 states and 7630 transitions. Word has length 142 [2022-07-12 17:15:45,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:15:45,935 INFO L495 AbstractCegarLoop]: Abstraction has 5222 states and 7630 transitions. [2022-07-12 17:15:45,935 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-12 17:15:45,935 INFO L276 IsEmpty]: Start isEmpty. Operand 5222 states and 7630 transitions. [2022-07-12 17:15:45,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-07-12 17:15:45,936 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:15:45,937 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-12 17:15:45,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-12 17:15:45,937 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-12 17:15:45,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:15:45,939 INFO L85 PathProgramCache]: Analyzing trace with hash -315189183, now seen corresponding path program 1 times [2022-07-12 17:15:45,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:15:45,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333404024] [2022-07-12 17:15:45,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:15:45,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:15:45,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:46,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:15:46,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:46,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 17:15:46,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:46,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:15:46,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:46,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 17:15:46,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:46,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:15:46,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:46,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 17:15:46,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:46,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 17:15:46,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:46,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 17:15:46,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:46,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:15:46,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:46,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 17:15:46,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:46,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 17:15:46,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:46,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 17:15:46,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:46,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 17:15:46,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:46,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 17:15:46,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:46,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 17:15:46,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:46,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:15:46,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:46,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 17:15:46,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:46,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 17:15:46,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:46,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 17:15:46,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:46,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-12 17:15:46,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:46,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-12 17:15:46,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:46,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-12 17:15:46,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:46,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-12 17:15:46,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:46,215 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-12 17:15:46,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:15:46,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333404024] [2022-07-12 17:15:46,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333404024] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:15:46,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:15:46,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:15:46,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685173810] [2022-07-12 17:15:46,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:15:46,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:15:46,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:15:46,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:15:46,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:15:46,218 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) [2022-07-12 17:15:56,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:15:56,092 INFO L93 Difference]: Finished difference Result 5222 states and 7630 transitions. [2022-07-12 17:15:56,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:15:56,092 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 148 [2022-07-12 17:15:56,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:15:56,103 INFO L225 Difference]: With dead ends: 5222 [2022-07-12 17:15:56,103 INFO L226 Difference]: Without dead ends: 5220 [2022-07-12 17:15:56,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:15:56,104 INFO L413 NwaCegarLoop]: 7389 mSDtfsCounter, 7309 mSDsluCounter, 11209 mSDsCounter, 0 mSdLazyCounter, 6180 mSolverCounterSat, 4498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8824 SdHoareTripleChecker+Valid, 18598 SdHoareTripleChecker+Invalid, 10678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4498 IncrementalHoareTripleChecker+Valid, 6180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2022-07-12 17:15:56,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8824 Valid, 18598 Invalid, 10678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4498 Valid, 6180 Invalid, 0 Unknown, 0 Unchecked, 9.4s Time] [2022-07-12 17:15:56,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5220 states. [2022-07-12 17:15:56,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5220 to 5220. [2022-07-12 17:15:56,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5220 states, 3320 states have (on average 1.2283132530120482) internal successors, (4078), 3618 states have internal predecessors, (4078), 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-12 17:15:56,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5220 states to 5220 states and 7628 transitions. [2022-07-12 17:15:56,389 INFO L78 Accepts]: Start accepts. Automaton has 5220 states and 7628 transitions. Word has length 148 [2022-07-12 17:15:56,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:15:56,389 INFO L495 AbstractCegarLoop]: Abstraction has 5220 states and 7628 transitions. [2022-07-12 17:15:56,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has 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) [2022-07-12 17:15:56,390 INFO L276 IsEmpty]: Start isEmpty. Operand 5220 states and 7628 transitions. [2022-07-12 17:15:56,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-07-12 17:15:56,391 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:15:56,391 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, 1, 1, 1, 1, 1, 1] [2022-07-12 17:15:56,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-12 17:15:56,391 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 23 more)] === [2022-07-12 17:15:56,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:15:56,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1038938895, now seen corresponding path program 1 times [2022-07-12 17:15:56,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:15:56,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670811322] [2022-07-12 17:15:56,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:15:56,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:15:56,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:56,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:15:56,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:56,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 17:15:56,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:56,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:15:56,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:56,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 17:15:56,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:56,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:15:56,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:56,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 17:15:56,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:56,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 17:15:56,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:56,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 17:15:56,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:56,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:15:56,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:56,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 17:15:56,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:56,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 17:15:56,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:56,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 17:15:56,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:56,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 17:15:56,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:56,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 17:15:56,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:56,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 17:15:56,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:56,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:15:56,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:56,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 17:15:56,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:56,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 17:15:56,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:56,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 17:15:56,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:56,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-12 17:15:56,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:56,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-12 17:15:56,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:56,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-12 17:15:56,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:56,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-12 17:15:56,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:56,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-12 17:15:56,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:15:56,680 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-12 17:15:56,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:15:56,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670811322] [2022-07-12 17:15:56,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670811322] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:15:56,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:15:56,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:15:56,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013537340] [2022-07-12 17:15:56,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:15:56,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:15:56,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:15:56,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:15:56,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:15:56,684 INFO L87 Difference]: Start difference. First operand 5220 states and 7628 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-12 17:16:06,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:16:06,629 INFO L93 Difference]: Finished difference Result 5220 states and 7628 transitions. [2022-07-12 17:16:06,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:16:06,630 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 154 [2022-07-12 17:16:06,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:16:06,642 INFO L225 Difference]: With dead ends: 5220 [2022-07-12 17:16:06,642 INFO L226 Difference]: Without dead ends: 5218 [2022-07-12 17:16:06,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:16:06,645 INFO L413 NwaCegarLoop]: 7387 mSDtfsCounter, 7303 mSDsluCounter, 11209 mSDsCounter, 0 mSdLazyCounter, 6178 mSolverCounterSat, 4498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8817 SdHoareTripleChecker+Valid, 18596 SdHoareTripleChecker+Invalid, 10676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4498 IncrementalHoareTripleChecker+Valid, 6178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2022-07-12 17:16:06,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8817 Valid, 18596 Invalid, 10676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4498 Valid, 6178 Invalid, 0 Unknown, 0 Unchecked, 9.5s Time] [2022-07-12 17:16:06,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5218 states. [2022-07-12 17:16:06,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5218 to 5218. [2022-07-12 17:16:06,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5218 states, 3319 states have (on average 1.228080747213016) internal successors, (4076), 3616 states have internal predecessors, (4076), 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-12 17:16:06,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5218 states to 5218 states and 7626 transitions. [2022-07-12 17:16:06,952 INFO L78 Accepts]: Start accepts. Automaton has 5218 states and 7626 transitions. Word has length 154 [2022-07-12 17:16:06,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:16:06,953 INFO L495 AbstractCegarLoop]: Abstraction has 5218 states and 7626 transitions. [2022-07-12 17:16:06,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-12 17:16:06,953 INFO L276 IsEmpty]: Start isEmpty. Operand 5218 states and 7626 transitions. [2022-07-12 17:16:06,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2022-07-12 17:16:06,955 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:16:06,955 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:16:06,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-12 17:16:06,955 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 23 more)] === [2022-07-12 17:16:06,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:16:06,955 INFO L85 PathProgramCache]: Analyzing trace with hash -2067430942, now seen corresponding path program 1 times [2022-07-12 17:16:06,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:16:06,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675889079] [2022-07-12 17:16:06,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:16:06,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:16:07,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:16:07,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:16:07,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:16:07,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 17:16:07,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:16:07,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:16:07,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:16:07,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 17:16:07,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:16:07,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:16:07,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:16:07,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 17:16:07,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:16:07,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 17:16:07,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:16:07,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 17:16:07,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:16:07,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 17:16:07,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:16:07,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:16:07,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:16:07,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:16:07,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:16:07,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:16:07,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:16:07,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:16:07,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:16:07,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:16:07,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:16:07,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:16:07,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:16:07,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:16:07,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:16:07,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-12 17:16:07,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:16:07,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:16:07,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:16:07,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:16:07,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:16:07,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:16:07,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:16:07,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 17:16:07,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:16:07,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:16:07,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:16:07,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:16:07,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:16:07,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:16:07,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:16:07,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 17:16:07,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:16:07,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:16:07,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:16:07,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:16:07,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:16:07,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:16:07,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:16:07,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-12 17:16:07,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:16:07,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:16:07,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:16:07,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:16:07,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:16:07,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:16:07,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:16:07,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-12 17:16:07,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:16:07,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-12 17:16:07,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:16:07,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-12 17:16:07,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:16:07,673 INFO L134 CoverageAnalysis]: Checked inductivity of 603 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 603 trivial. 0 not checked. [2022-07-12 17:16:07,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:16:07,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675889079] [2022-07-12 17:16:07,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675889079] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:16:07,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:16:07,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 17:16:07,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108570459] [2022-07-12 17:16:07,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:16:07,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 17:16:07,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:16:07,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 17:16:07,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 17:16:07,675 INFO L87 Difference]: Start difference. First operand 5218 states and 7626 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (24), 6 states have call predecessors, (24), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-12 17:16:10,895 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:16:12,548 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []