./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.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 6e98c668899fc19a628c1d936389b59135bc3426718905326099068187537de8 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 04:09:05,148 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 04:09:05,151 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 04:09:05,197 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 04:09:05,198 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 04:09:05,200 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 04:09:05,201 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 04:09:05,208 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 04:09:05,210 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 04:09:05,214 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 04:09:05,216 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 04:09:05,217 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 04:09:05,218 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 04:09:05,219 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 04:09:05,220 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 04:09:05,222 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 04:09:05,222 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 04:09:05,223 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 04:09:05,224 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 04:09:05,227 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 04:09:05,229 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 04:09:05,230 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 04:09:05,231 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 04:09:05,232 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 04:09:05,233 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 04:09:05,237 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 04:09:05,237 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 04:09:05,237 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 04:09:05,238 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 04:09:05,239 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 04:09:05,240 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 04:09:05,240 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 04:09:05,242 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 04:09:05,242 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 04:09:05,243 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 04:09:05,244 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 04:09:05,244 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 04:09:05,244 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 04:09:05,244 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 04:09:05,245 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 04:09:05,245 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 04:09:05,249 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 04:09:05,250 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-23 04:09:05,277 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 04:09:05,278 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 04:09:05,279 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 04:09:05,279 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 04:09:05,279 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 04:09:05,280 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 04:09:05,280 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 04:09:05,280 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 04:09:05,281 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 04:09:05,281 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 04:09:05,282 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 04:09:05,282 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 04:09:05,282 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-23 04:09:05,282 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 04:09:05,282 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-23 04:09:05,283 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-23 04:09:05,283 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 04:09:05,283 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-23 04:09:05,283 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 04:09:05,284 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 04:09:05,284 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 04:09:05,285 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 04:09:05,285 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 04:09:05,285 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 04:09:05,285 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-23 04:09:05,285 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 04:09:05,286 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-23 04:09:05,286 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-23 04:09:05,286 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-23 04:09:05,286 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-23 04:09:05,286 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 -> 6e98c668899fc19a628c1d936389b59135bc3426718905326099068187537de8 [2022-07-23 04:09:05,512 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 04:09:05,540 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 04:09:05,542 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 04:09:05,543 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 04:09:05,544 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 04:09:05,545 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i [2022-07-23 04:09:05,617 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d358e0f0/82d890ff1cd848c887d1bb1d1af326f2/FLAG290f0cbbc [2022-07-23 04:09:06,386 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 04:09:06,387 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i [2022-07-23 04:09:06,445 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d358e0f0/82d890ff1cd848c887d1bb1d1af326f2/FLAG290f0cbbc [2022-07-23 04:09:06,890 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d358e0f0/82d890ff1cd848c887d1bb1d1af326f2 [2022-07-23 04:09:06,893 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 04:09:06,894 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 04:09:06,897 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 04:09:06,897 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 04:09:06,900 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 04:09:06,901 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 04:09:06" (1/1) ... [2022-07-23 04:09:06,902 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cd1ca6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:09:06, skipping insertion in model container [2022-07-23 04:09:06,902 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 04:09:06" (1/1) ... [2022-07-23 04:09:06,908 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 04:09:07,057 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 04:09:12,230 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[477597,477610] [2022-07-23 04:09:12,232 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[477742,477755] [2022-07-23 04:09:12,233 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[477888,477901] [2022-07-23 04:09:12,233 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478053,478066] [2022-07-23 04:09:12,234 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478211,478224] [2022-07-23 04:09:12,234 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478369,478382] [2022-07-23 04:09:12,235 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478527,478540] [2022-07-23 04:09:12,235 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478687,478700] [2022-07-23 04:09:12,236 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478846,478859] [2022-07-23 04:09:12,236 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478985,478998] [2022-07-23 04:09:12,236 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[479127,479140] [2022-07-23 04:09:12,237 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[479276,479289] [2022-07-23 04:09:12,237 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[479415,479428] [2022-07-23 04:09:12,238 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[479570,479583] [2022-07-23 04:09:12,238 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[479730,479743] [2022-07-23 04:09:12,238 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[479881,479894] [2022-07-23 04:09:12,239 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480032,480045] [2022-07-23 04:09:12,239 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480184,480197] [2022-07-23 04:09:12,240 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480333,480346] [2022-07-23 04:09:12,240 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480481,480494] [2022-07-23 04:09:12,240 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480638,480651] [2022-07-23 04:09:12,241 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480787,480800] [2022-07-23 04:09:12,241 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480943,480956] [2022-07-23 04:09:12,242 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481096,481109] [2022-07-23 04:09:12,242 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481242,481255] [2022-07-23 04:09:12,242 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481385,481398] [2022-07-23 04:09:12,243 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481537,481550] [2022-07-23 04:09:12,243 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481683,481696] [2022-07-23 04:09:12,244 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481828,481841] [2022-07-23 04:09:12,244 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481982,481995] [2022-07-23 04:09:12,244 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[482133,482146] [2022-07-23 04:09:12,245 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[482288,482301] [2022-07-23 04:09:12,245 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[482440,482453] [2022-07-23 04:09:12,246 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[482595,482608] [2022-07-23 04:09:12,246 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[482759,482772] [2022-07-23 04:09:12,246 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[482915,482928] [2022-07-23 04:09:12,247 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[483079,483092] [2022-07-23 04:09:12,247 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[483221,483234] [2022-07-23 04:09:12,248 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[483379,483392] [2022-07-23 04:09:12,248 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[483546,483559] [2022-07-23 04:09:12,248 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[483705,483718] [2022-07-23 04:09:12,249 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[483864,483877] [2022-07-23 04:09:12,249 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484013,484026] [2022-07-23 04:09:12,250 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484160,484173] [2022-07-23 04:09:12,250 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484299,484312] [2022-07-23 04:09:12,250 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484462,484475] [2022-07-23 04:09:12,251 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484628,484641] [2022-07-23 04:09:12,251 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484792,484805] [2022-07-23 04:09:12,251 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484957,484970] [2022-07-23 04:09:12,252 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[485122,485135] [2022-07-23 04:09:12,252 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[485288,485301] [2022-07-23 04:09:12,253 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[485453,485466] [2022-07-23 04:09:12,253 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[485620,485633] [2022-07-23 04:09:12,253 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[485780,485793] [2022-07-23 04:09:12,254 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[485942,485955] [2022-07-23 04:09:12,254 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486101,486114] [2022-07-23 04:09:12,254 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486247,486260] [2022-07-23 04:09:12,255 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486390,486403] [2022-07-23 04:09:12,255 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486534,486547] [2022-07-23 04:09:12,256 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486677,486690] [2022-07-23 04:09:12,256 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486821,486834] [2022-07-23 04:09:12,256 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486962,486975] [2022-07-23 04:09:12,257 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[487100,487113] [2022-07-23 04:09:12,257 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[487258,487271] [2022-07-23 04:09:12,258 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[487417,487430] [2022-07-23 04:09:12,258 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[487573,487586] [2022-07-23 04:09:12,258 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[487722,487735] [2022-07-23 04:09:12,259 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[487874,487887] [2022-07-23 04:09:12,259 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488025,488038] [2022-07-23 04:09:12,259 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488174,488187] [2022-07-23 04:09:12,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---drivers--atm--fore_200e.ko.cil.i[488326,488339] [2022-07-23 04:09:12,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---drivers--atm--fore_200e.ko.cil.i[488474,488487] [2022-07-23 04:09:12,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---drivers--atm--fore_200e.ko.cil.i[488627,488640] [2022-07-23 04:09:12,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---drivers--atm--fore_200e.ko.cil.i[488778,488791] [2022-07-23 04:09:12,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---drivers--atm--fore_200e.ko.cil.i[488928,488941] [2022-07-23 04:09:12,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---drivers--atm--fore_200e.ko.cil.i[489075,489088] [2022-07-23 04:09:12,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---drivers--atm--fore_200e.ko.cil.i[489226,489239] [2022-07-23 04:09:12,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---drivers--atm--fore_200e.ko.cil.i[489377,489390] [2022-07-23 04:09:12,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---drivers--atm--fore_200e.ko.cil.i[489525,489538] [2022-07-23 04:09:12,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---drivers--atm--fore_200e.ko.cil.i[489691,489704] [2022-07-23 04:09:12,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---drivers--atm--fore_200e.ko.cil.i[489860,489873] [2022-07-23 04:09:12,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---drivers--atm--fore_200e.ko.cil.i[490027,490040] [2022-07-23 04:09:12,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---drivers--atm--fore_200e.ko.cil.i[490195,490208] [2022-07-23 04:09:12,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---drivers--atm--fore_200e.ko.cil.i[490345,490358] [2022-07-23 04:09:12,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---drivers--atm--fore_200e.ko.cil.i[490492,490505] [2022-07-23 04:09:12,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---drivers--atm--fore_200e.ko.cil.i[490653,490666] [2022-07-23 04:09:12,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---drivers--atm--fore_200e.ko.cil.i[490823,490836] [2022-07-23 04:09:12,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---drivers--atm--fore_200e.ko.cil.i[490985,490998] [2022-07-23 04:09:12,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 04:09:12,300 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 04:09:12,808 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[477597,477610] [2022-07-23 04:09:12,808 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[477742,477755] [2022-07-23 04:09:12,809 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[477888,477901] [2022-07-23 04:09:12,809 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478053,478066] [2022-07-23 04:09:12,810 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478211,478224] [2022-07-23 04:09:12,810 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478369,478382] [2022-07-23 04:09:12,810 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478527,478540] [2022-07-23 04:09:12,811 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478687,478700] [2022-07-23 04:09:12,811 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478846,478859] [2022-07-23 04:09:12,811 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478985,478998] [2022-07-23 04:09:12,812 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[479127,479140] [2022-07-23 04:09:12,812 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[479276,479289] [2022-07-23 04:09:12,812 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[479415,479428] [2022-07-23 04:09:12,813 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[479570,479583] [2022-07-23 04:09:12,813 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[479730,479743] [2022-07-23 04:09:12,813 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[479881,479894] [2022-07-23 04:09:12,814 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480032,480045] [2022-07-23 04:09:12,814 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480184,480197] [2022-07-23 04:09:12,814 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480333,480346] [2022-07-23 04:09:12,815 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480481,480494] [2022-07-23 04:09:12,815 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480638,480651] [2022-07-23 04:09:12,815 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480787,480800] [2022-07-23 04:09:12,816 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480943,480956] [2022-07-23 04:09:12,816 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481096,481109] [2022-07-23 04:09:12,816 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481242,481255] [2022-07-23 04:09:12,817 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481385,481398] [2022-07-23 04:09:12,817 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481537,481550] [2022-07-23 04:09:12,817 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481683,481696] [2022-07-23 04:09:12,818 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481828,481841] [2022-07-23 04:09:12,818 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481982,481995] [2022-07-23 04:09:12,818 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[482133,482146] [2022-07-23 04:09:12,819 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[482288,482301] [2022-07-23 04:09:12,819 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[482440,482453] [2022-07-23 04:09:12,819 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[482595,482608] [2022-07-23 04:09:12,820 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[482759,482772] [2022-07-23 04:09:12,820 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[482915,482928] [2022-07-23 04:09:12,820 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[483079,483092] [2022-07-23 04:09:12,821 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[483221,483234] [2022-07-23 04:09:12,821 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[483379,483392] [2022-07-23 04:09:12,821 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[483546,483559] [2022-07-23 04:09:12,822 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[483705,483718] [2022-07-23 04:09:12,822 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[483864,483877] [2022-07-23 04:09:12,822 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484013,484026] [2022-07-23 04:09:12,823 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484160,484173] [2022-07-23 04:09:12,823 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484299,484312] [2022-07-23 04:09:12,823 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484462,484475] [2022-07-23 04:09:12,824 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484628,484641] [2022-07-23 04:09:12,824 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484792,484805] [2022-07-23 04:09:12,824 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484957,484970] [2022-07-23 04:09:12,825 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[485122,485135] [2022-07-23 04:09:12,825 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[485288,485301] [2022-07-23 04:09:12,825 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[485453,485466] [2022-07-23 04:09:12,826 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[485620,485633] [2022-07-23 04:09:12,826 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[485780,485793] [2022-07-23 04:09:12,826 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[485942,485955] [2022-07-23 04:09:12,827 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486101,486114] [2022-07-23 04:09:12,827 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486247,486260] [2022-07-23 04:09:12,827 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486390,486403] [2022-07-23 04:09:12,828 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486534,486547] [2022-07-23 04:09:12,828 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486677,486690] [2022-07-23 04:09:12,828 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486821,486834] [2022-07-23 04:09:12,829 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486962,486975] [2022-07-23 04:09:12,829 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[487100,487113] [2022-07-23 04:09:12,829 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[487258,487271] [2022-07-23 04:09:12,830 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[487417,487430] [2022-07-23 04:09:12,830 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[487573,487586] [2022-07-23 04:09:12,830 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[487722,487735] [2022-07-23 04:09:12,831 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[487874,487887] [2022-07-23 04:09:12,831 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488025,488038] [2022-07-23 04:09:12,832 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488174,488187] [2022-07-23 04:09:12,832 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488326,488339] [2022-07-23 04:09:12,833 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488474,488487] [2022-07-23 04:09:12,833 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488627,488640] [2022-07-23 04:09:12,833 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488778,488791] [2022-07-23 04:09:12,833 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488928,488941] [2022-07-23 04:09:12,834 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[489075,489088] [2022-07-23 04:09:12,834 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[489226,489239] [2022-07-23 04:09:12,834 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[489377,489390] [2022-07-23 04:09:12,835 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[489525,489538] [2022-07-23 04:09:12,835 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[489691,489704] [2022-07-23 04:09:12,835 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[489860,489873] [2022-07-23 04:09:12,836 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490027,490040] [2022-07-23 04:09:12,836 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490195,490208] [2022-07-23 04:09:12,836 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490345,490358] [2022-07-23 04:09:12,837 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490492,490505] [2022-07-23 04:09:12,837 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490653,490666] [2022-07-23 04:09:12,837 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490823,490836] [2022-07-23 04:09:12,838 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490985,490998] [2022-07-23 04:09:12,841 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 04:09:13,086 INFO L208 MainTranslator]: Completed translation [2022-07-23 04:09:13,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:09:13 WrapperNode [2022-07-23 04:09:13,087 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 04:09:13,088 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 04:09:13,088 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 04:09:13,089 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 04:09:13,095 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:09:13" (1/1) ... [2022-07-23 04:09:13,226 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:09:13" (1/1) ... [2022-07-23 04:09:13,393 INFO L137 Inliner]: procedures = 673, calls = 2647, calls flagged for inlining = 296, calls inlined = 204, statements flattened = 6079 [2022-07-23 04:09:13,394 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 04:09:13,396 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 04:09:13,396 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 04:09:13,396 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 04:09:13,405 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:09:13" (1/1) ... [2022-07-23 04:09:13,406 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:09:13" (1/1) ... [2022-07-23 04:09:13,459 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:09:13" (1/1) ... [2022-07-23 04:09:13,459 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:09:13" (1/1) ... [2022-07-23 04:09:13,627 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:09:13" (1/1) ... [2022-07-23 04:09:13,647 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:09:13" (1/1) ... [2022-07-23 04:09:13,677 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:09:13" (1/1) ... [2022-07-23 04:09:13,713 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 04:09:13,714 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 04:09:13,714 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 04:09:13,714 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 04:09:13,715 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:09:13" (1/1) ... [2022-07-23 04:09:13,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 04:09:13,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 04:09:13,745 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-23 04:09:13,760 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-23 04:09:13,792 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_io_instance_callback_2_25 [2022-07-23 04:09:13,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_io_instance_callback_2_25 [2022-07-23 04:09:13,793 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_supply [2022-07-23 04:09:13,793 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_supply [2022-07-23 04:09:13,793 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_dma_sync_for_device [2022-07-23 04:09:13,793 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_dma_sync_for_device [2022-07-23 04:09:13,793 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~u32~0~X~$Pointer$~TO~VOID [2022-07-23 04:09:13,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~u32~0~X~$Pointer$~TO~VOID [2022-07-23 04:09:13,794 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-07-23 04:09:13,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-07-23 04:09:13,794 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_register [2022-07-23 04:09:13,794 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_register [2022-07-23 04:09:13,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-23 04:09:13,794 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-23 04:09:13,795 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_unmap [2022-07-23 04:09:13,795 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_unmap [2022-07-23 04:09:13,795 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-23 04:09:13,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-23 04:09:13,796 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_read [2022-07-23 04:09:13,797 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_read [2022-07-23 04:09:13,797 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-23 04:09:13,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-23 04:09:13,797 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_activate_vcin [2022-07-23 04:09:13,797 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_activate_vcin [2022-07-23 04:09:13,798 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_remove_one [2022-07-23 04:09:13,798 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_remove_one [2022-07-23 04:09:13,798 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_io_poll [2022-07-23 04:09:13,798 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_io_poll [2022-07-23 04:09:13,798 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-23 04:09:13,798 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-23 04:09:13,798 INFO L130 BoogieDeclarations]: Found specification of procedure valid_dma_direction [2022-07-23 04:09:13,799 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_dma_direction [2022-07-23 04:09:13,799 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-07-23 04:09:13,799 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-07-23 04:09:13,799 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-07-23 04:09:13,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-07-23 04:09:13,799 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-07-23 04:09:13,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-07-23 04:09:13,800 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-23 04:09:13,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-23 04:09:13,800 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_irq_check [2022-07-23 04:09:13,800 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_irq_check [2022-07-23 04:09:13,800 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_getstats [2022-07-23 04:09:13,800 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_getstats [2022-07-23 04:09:13,800 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-23 04:09:13,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-23 04:09:13,800 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-07-23 04:09:13,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-07-23 04:09:13,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 04:09:13,801 INFO L130 BoogieDeclarations]: Found specification of procedure tasklet_init [2022-07-23 04:09:13,801 INFO L138 BoogieDeclarations]: Found implementation of procedure tasklet_init [2022-07-23 04:09:13,801 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_shutdown [2022-07-23 04:09:13,801 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_shutdown [2022-07-23 04:09:13,801 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_detect [2022-07-23 04:09:13,802 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_detect [2022-07-23 04:09:13,802 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-07-23 04:09:13,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-07-23 04:09:13,802 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-23 04:09:13,802 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_ops [2022-07-23 04:09:13,802 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_ops [2022-07-23 04:09:13,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-23 04:09:13,803 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2022-07-23 04:09:13,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2022-07-23 04:09:13,803 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-23 04:09:13,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-23 04:09:13,803 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~TO~~u32~0 [2022-07-23 04:09:13,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~TO~~u32~0 [2022-07-23 04:09:13,804 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_map [2022-07-23 04:09:13,804 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_map [2022-07-23 04:09:13,804 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-23 04:09:13,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-23 04:09:13,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-23 04:09:13,805 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-07-23 04:09:13,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-07-23 04:09:13,807 INFO L130 BoogieDeclarations]: Found specification of procedure __phys_addr [2022-07-23 04:09:13,807 INFO L138 BoogieDeclarations]: Found implementation of procedure __phys_addr [2022-07-23 04:09:13,807 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2022-07-23 04:09:13,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2022-07-23 04:09:13,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-23 04:09:13,808 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-23 04:09:13,808 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_proc_read [2022-07-23 04:09:13,808 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_proc_read [2022-07-23 04:09:13,812 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-07-23 04:09:13,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-07-23 04:09:13,812 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2022-07-23 04:09:13,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2022-07-23 04:09:13,812 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-07-23 04:09:13,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-07-23 04:09:13,812 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_open [2022-07-23 04:09:13,813 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_open [2022-07-23 04:09:13,813 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-07-23 04:09:13,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-07-23 04:09:13,813 INFO L130 BoogieDeclarations]: Found specification of procedure pci_disable_device [2022-07-23 04:09:13,813 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_disable_device [2022-07-23 04:09:13,813 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-23 04:09:13,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-23 04:09:13,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-23 04:09:13,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 04:09:13,814 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_write [2022-07-23 04:09:13,815 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_write [2022-07-23 04:09:13,815 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-23 04:09:13,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-23 04:09:13,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-23 04:09:13,815 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-23 04:09:13,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-23 04:09:13,816 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2022-07-23 04:09:13,816 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2022-07-23 04:09:13,816 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~u32~0~X~int~X~int~TO~VOID [2022-07-23 04:09:13,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~u32~0~X~int~X~int~TO~VOID [2022-07-23 04:09:13,816 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-07-23 04:09:13,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-07-23 04:09:13,816 INFO L130 BoogieDeclarations]: Found specification of procedure tasklet_schedule [2022-07-23 04:09:13,816 INFO L138 BoogieDeclarations]: Found implementation of procedure tasklet_schedule [2022-07-23 04:09:13,817 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atm_dev_register [2022-07-23 04:09:13,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atm_dev_register [2022-07-23 04:09:13,817 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_get_esi [2022-07-23 04:09:13,817 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_get_esi [2022-07-23 04:09:13,817 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_monitor_getc [2022-07-23 04:09:13,817 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_monitor_getc [2022-07-23 04:09:13,817 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~dma_addr_t~0~X~int~X~int~TO~VOID [2022-07-23 04:09:13,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~dma_addr_t~0~X~int~X~int~TO~VOID [2022-07-23 04:09:13,818 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_dma_chunk_free [2022-07-23 04:09:13,818 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_dma_chunk_free [2022-07-23 04:09:13,818 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~~u32~0 [2022-07-23 04:09:13,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~~u32~0 [2022-07-23 04:09:13,819 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-07-23 04:09:13,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-07-23 04:09:13,819 INFO L130 BoogieDeclarations]: Found specification of procedure writel [2022-07-23 04:09:13,819 INFO L138 BoogieDeclarations]: Found implementation of procedure writel [2022-07-23 04:09:13,819 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2022-07-23 04:09:13,819 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2022-07-23 04:09:13,819 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_close [2022-07-23 04:09:13,819 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_close [2022-07-23 04:09:13,820 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_reset [2022-07-23 04:09:13,820 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_reset [2022-07-23 04:09:13,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 04:09:13,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 04:09:13,820 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_rate_ctrl [2022-07-23 04:09:13,820 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_rate_ctrl [2022-07-23 04:09:13,820 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2022-07-23 04:09:13,820 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2022-07-23 04:09:13,821 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~X~int~TO~int [2022-07-23 04:09:13,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~X~int~TO~int [2022-07-23 04:09:13,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-23 04:09:13,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-23 04:09:13,821 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-23 04:09:13,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-23 04:09:13,821 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-23 04:09:13,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-23 04:09:13,822 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_irq_itoa [2022-07-23 04:09:13,822 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_irq_itoa [2022-07-23 04:09:13,822 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_init [2022-07-23 04:09:13,822 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_init [2022-07-23 04:09:13,822 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_struct_atmdev_ops_io_instance_2 [2022-07-23 04:09:13,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_struct_atmdev_ops_io_instance_2 [2022-07-23 04:09:13,823 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_irq_ack [2022-07-23 04:09:13,823 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_irq_ack [2022-07-23 04:09:13,823 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_130 [2022-07-23 04:09:13,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_130 [2022-07-23 04:09:13,823 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_read [2022-07-23 04:09:13,823 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_read [2022-07-23 04:09:13,823 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-07-23 04:09:13,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-07-23 04:09:13,824 INFO L130 BoogieDeclarations]: Found specification of procedure sk_atm [2022-07-23 04:09:13,824 INFO L138 BoogieDeclarations]: Found implementation of procedure sk_atm [2022-07-23 04:09:13,824 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-07-23 04:09:13,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-07-23 04:09:13,824 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_prom_read [2022-07-23 04:09:13,824 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_prom_read [2022-07-23 04:09:13,824 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-23 04:09:13,824 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-23 04:09:13,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-23 04:09:13,825 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-23 04:09:13,825 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_dma_sync_for_cpu [2022-07-23 04:09:13,825 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_dma_sync_for_cpu [2022-07-23 04:09:13,825 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_reset [2022-07-23 04:09:13,825 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_reset [2022-07-23 04:09:13,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-23 04:09:13,825 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-07-23 04:09:13,826 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-07-23 04:09:13,826 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2022-07-23 04:09:13,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2022-07-23 04:09:13,826 INFO L130 BoogieDeclarations]: Found specification of procedure pci_write_config_byte [2022-07-23 04:09:13,826 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_write_config_byte [2022-07-23 04:09:13,826 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-23 04:09:13,826 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-23 04:09:13,826 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_chunk_free [2022-07-23 04:09:13,827 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_chunk_free [2022-07-23 04:09:13,827 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-23 04:09:13,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-23 04:09:13,827 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-23 04:09:13,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-23 04:09:13,827 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_rate_mtx_of_fore200e [2022-07-23 04:09:13,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_rate_mtx_of_fore200e [2022-07-23 04:09:13,827 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-23 04:09:13,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-23 04:09:13,828 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_dma_map [2022-07-23 04:09:13,828 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_dma_map [2022-07-23 04:09:13,828 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_atm2fore_aal [2022-07-23 04:09:13,829 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_atm2fore_aal [2022-07-23 04:09:13,830 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_q_lock_of_fore200e [2022-07-23 04:09:13,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_q_lock_of_fore200e [2022-07-23 04:09:13,831 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-23 04:09:13,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-23 04:09:13,831 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-23 04:09:13,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-23 04:09:13,831 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-07-23 04:09:13,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-07-23 04:09:13,831 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2022-07-23 04:09:13,832 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2022-07-23 04:09:13,833 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-07-23 04:09:13,833 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-07-23 04:09:13,833 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atm_dev_register_150 [2022-07-23 04:09:13,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atm_dev_register_150 [2022-07-23 04:09:13,833 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-23 04:09:13,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-23 04:09:13,833 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-23 04:09:13,833 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-23 04:09:13,834 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-23 04:09:13,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-23 04:09:13,834 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dispatch_register_8_1 [2022-07-23 04:09:13,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dispatch_register_8_1 [2022-07-23 04:09:13,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-23 04:09:13,834 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-23 04:09:13,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-23 04:09:13,834 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_configure [2022-07-23 04:09:13,834 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_configure [2022-07-23 04:09:13,835 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-23 04:09:13,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-23 04:09:13,835 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-23 04:09:13,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-23 04:09:13,835 INFO L130 BoogieDeclarations]: Found specification of procedure dev_kfree_skb_any [2022-07-23 04:09:13,835 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_kfree_skb_any [2022-07-23 04:09:13,835 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_inc [2022-07-23 04:09:13,835 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_inc [2022-07-23 04:09:13,836 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_send [2022-07-23 04:09:13,836 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_send [2022-07-23 04:09:13,836 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_dma_unmap [2022-07-23 04:09:13,836 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_dma_unmap [2022-07-23 04:09:13,836 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_dma_chunk_alloc [2022-07-23 04:09:13,836 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_dma_chunk_alloc [2022-07-23 04:09:13,836 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-23 04:09:13,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-23 04:09:13,836 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-23 04:09:13,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-23 04:09:13,837 INFO L130 BoogieDeclarations]: Found specification of procedure msecs_to_jiffies [2022-07-23 04:09:13,837 INFO L138 BoogieDeclarations]: Found implementation of procedure msecs_to_jiffies [2022-07-23 04:09:13,837 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_proc_read [2022-07-23 04:09:13,837 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_proc_read [2022-07-23 04:09:13,837 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_poll [2022-07-23 04:09:13,837 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_poll [2022-07-23 04:09:13,837 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-23 04:09:13,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-23 04:09:13,838 INFO L130 BoogieDeclarations]: Found specification of procedure readl [2022-07-23 04:09:13,838 INFO L138 BoogieDeclarations]: Found implementation of procedure readl [2022-07-23 04:09:13,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-23 04:09:13,838 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~VOID [2022-07-23 04:09:13,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~VOID [2022-07-23 04:09:13,838 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_rate_mtx_of_fore200e [2022-07-23 04:09:13,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_rate_mtx_of_fore200e [2022-07-23 04:09:13,838 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_tx_irq [2022-07-23 04:09:13,839 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_tx_irq [2022-07-23 04:09:14,886 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 04:09:14,890 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 04:09:15,360 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-23 04:09:20,536 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 04:09:20,595 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 04:09:20,600 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-23 04:09:20,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 04:09:20 BoogieIcfgContainer [2022-07-23 04:09:20,611 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 04:09:20,612 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 04:09:20,613 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 04:09:20,616 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 04:09:20,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 04:09:06" (1/3) ... [2022-07-23 04:09:20,617 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@785b495 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 04:09:20, skipping insertion in model container [2022-07-23 04:09:20,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:09:13" (2/3) ... [2022-07-23 04:09:20,618 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@785b495 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 04:09:20, skipping insertion in model container [2022-07-23 04:09:20,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 04:09:20" (3/3) ... [2022-07-23 04:09:20,619 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i [2022-07-23 04:09:20,633 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 04:09:20,633 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2022-07-23 04:09:20,725 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 04:09:20,731 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@4ea801e9, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@17f6eeda [2022-07-23 04:09:20,732 INFO L358 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2022-07-23 04:09:20,744 INFO L276 IsEmpty]: Start isEmpty. Operand has 1985 states, 1344 states have (on average 1.2961309523809523) internal successors, (1742), 1405 states have internal predecessors, (1742), 488 states have call successors, (488), 123 states have call predecessors, (488), 122 states have return successors, (483), 474 states have call predecessors, (483), 483 states have call successors, (483) [2022-07-23 04:09:20,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-23 04:09:20,753 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:09:20,753 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:09:20,754 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 28 more)] === [2022-07-23 04:09:20,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:09:20,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1268169960, now seen corresponding path program 1 times [2022-07-23 04:09:20,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:09:20,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638979262] [2022-07-23 04:09:20,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:09:20,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:09:21,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:09:21,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:09:21,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:09:21,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:09:21,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:09:21,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:09:21,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:09:21,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:09:21,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:09:21,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:09:21,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:09:21,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:09:21,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:09:21,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:09:21,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:09:21,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:09:21,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:09:21,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:09:21,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:09:21,768 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-23 04:09:21,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:09:21,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638979262] [2022-07-23 04:09:21,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638979262] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:09:21,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:09:21,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:09:21,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631086248] [2022-07-23 04:09:21,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:09:21,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:09:21,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:09:21,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:09:21,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:09:21,821 INFO L87 Difference]: Start difference. First operand has 1985 states, 1344 states have (on average 1.2961309523809523) internal successors, (1742), 1405 states have internal predecessors, (1742), 488 states have call successors, (488), 123 states have call predecessors, (488), 122 states have return successors, (483), 474 states have call predecessors, (483), 483 states have call successors, (483) Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-23 04:09:23,618 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:09:34,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:09:34,436 INFO L93 Difference]: Finished difference Result 5888 states and 8392 transitions. [2022-07-23 04:09:34,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 04:09:34,438 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 64 [2022-07-23 04:09:34,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:09:34,484 INFO L225 Difference]: With dead ends: 5888 [2022-07-23 04:09:34,484 INFO L226 Difference]: Without dead ends: 3905 [2022-07-23 04:09:34,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-07-23 04:09:34,505 INFO L413 NwaCegarLoop]: 2477 mSDtfsCounter, 7596 mSDsluCounter, 971 mSDsCounter, 0 mSdLazyCounter, 6489 mSolverCounterSat, 4215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7681 SdHoareTripleChecker+Valid, 3448 SdHoareTripleChecker+Invalid, 10704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4215 IncrementalHoareTripleChecker+Valid, 6489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.9s IncrementalHoareTripleChecker+Time [2022-07-23 04:09:34,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7681 Valid, 3448 Invalid, 10704 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4215 Valid, 6489 Invalid, 0 Unknown, 0 Unchecked, 11.9s Time] [2022-07-23 04:09:34,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3905 states. [2022-07-23 04:09:34,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3905 to 3713. [2022-07-23 04:09:34,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3713 states, 2539 states have (on average 1.257975580937377) internal successors, (3194), 2626 states have internal predecessors, (3194), 920 states have call successors, (920), 225 states have call predecessors, (920), 224 states have return successors, (951), 898 states have call predecessors, (951), 918 states have call successors, (951) [2022-07-23 04:09:34,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3713 states to 3713 states and 5065 transitions. [2022-07-23 04:09:34,809 INFO L78 Accepts]: Start accepts. Automaton has 3713 states and 5065 transitions. Word has length 64 [2022-07-23 04:09:34,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:09:34,811 INFO L495 AbstractCegarLoop]: Abstraction has 3713 states and 5065 transitions. [2022-07-23 04:09:34,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-23 04:09:34,812 INFO L276 IsEmpty]: Start isEmpty. Operand 3713 states and 5065 transitions. [2022-07-23 04:09:34,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-23 04:09:34,823 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:09:34,823 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:09:34,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-23 04:09:34,824 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 28 more)] === [2022-07-23 04:09:34,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:09:34,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1435080531, now seen corresponding path program 1 times [2022-07-23 04:09:34,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:09:34,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198957071] [2022-07-23 04:09:34,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:09:34,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:09:34,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:09:35,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:09:35,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:09:35,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:09:35,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:09:35,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:09:35,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:09:35,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:09:35,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:09:35,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:09:35,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:09:35,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:09:35,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:09:35,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:09:35,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:09:35,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:09:35,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:09:35,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:09:35,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:09:35,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:09:35,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:09:35,218 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-23 04:09:35,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:09:35,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198957071] [2022-07-23 04:09:35,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198957071] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:09:35,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:09:35,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:09:35,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173672350] [2022-07-23 04:09:35,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:09:35,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:09:35,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:09:35,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:09:35,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:09:35,222 INFO L87 Difference]: Start difference. First operand 3713 states and 5065 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-23 04:09:37,177 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:09:42,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:09:42,601 INFO L93 Difference]: Finished difference Result 3713 states and 5065 transitions. [2022-07-23 04:09:42,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:09:42,602 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 70 [2022-07-23 04:09:42,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:09:42,623 INFO L225 Difference]: With dead ends: 3713 [2022-07-23 04:09:42,624 INFO L226 Difference]: Without dead ends: 3711 [2022-07-23 04:09:42,626 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-23 04:09:42,627 INFO L413 NwaCegarLoop]: 2247 mSDtfsCounter, 4725 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 2940 mSolverCounterSat, 2496 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4814 SdHoareTripleChecker+Valid, 2878 SdHoareTripleChecker+Invalid, 5436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2496 IncrementalHoareTripleChecker+Valid, 2940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-07-23 04:09:42,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4814 Valid, 2878 Invalid, 5436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2496 Valid, 2940 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2022-07-23 04:09:42,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3711 states. [2022-07-23 04:09:42,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3711 to 3711. [2022-07-23 04:09:42,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3711 states, 2538 states have (on average 1.2576832151300237) internal successors, (3192), 2624 states have internal predecessors, (3192), 920 states have call successors, (920), 225 states have call predecessors, (920), 224 states have return successors, (951), 898 states have call predecessors, (951), 918 states have call successors, (951) [2022-07-23 04:09:42,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3711 states to 3711 states and 5063 transitions. [2022-07-23 04:09:42,775 INFO L78 Accepts]: Start accepts. Automaton has 3711 states and 5063 transitions. Word has length 70 [2022-07-23 04:09:42,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:09:42,776 INFO L495 AbstractCegarLoop]: Abstraction has 3711 states and 5063 transitions. [2022-07-23 04:09:42,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-23 04:09:42,776 INFO L276 IsEmpty]: Start isEmpty. Operand 3711 states and 5063 transitions. [2022-07-23 04:09:42,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-23 04:09:42,777 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:09:42,778 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:09:42,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-23 04:09:42,778 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 28 more)] === [2022-07-23 04:09:42,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:09:42,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1860087943, now seen corresponding path program 1 times [2022-07-23 04:09:42,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:09:42,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046475415] [2022-07-23 04:09:42,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:09:42,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:09:42,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:09:42,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:09:42,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:09:42,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:09:42,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:09:42,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:09:42,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:09:43,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:09:43,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:09:43,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:09:43,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:09:43,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:09:43,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:09:43,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:09:43,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:09:43,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:09:43,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:09:43,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:09:43,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:09:43,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:09:43,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:09:43,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:09:43,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:09:43,128 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-23 04:09:43,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:09:43,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046475415] [2022-07-23 04:09:43,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046475415] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:09:43,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:09:43,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:09:43,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490441987] [2022-07-23 04:09:43,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:09:43,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:09:43,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:09:43,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:09:43,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:09:43,131 INFO L87 Difference]: Start difference. First operand 3711 states and 5063 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-23 04:09:44,859 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:09:49,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:09:49,326 INFO L93 Difference]: Finished difference Result 3711 states and 5063 transitions. [2022-07-23 04:09:49,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:09:49,326 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 76 [2022-07-23 04:09:49,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:09:49,347 INFO L225 Difference]: With dead ends: 3711 [2022-07-23 04:09:49,347 INFO L226 Difference]: Without dead ends: 3709 [2022-07-23 04:09:49,349 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-23 04:09:49,350 INFO L413 NwaCegarLoop]: 2245 mSDtfsCounter, 4719 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 2938 mSolverCounterSat, 2496 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4807 SdHoareTripleChecker+Valid, 2876 SdHoareTripleChecker+Invalid, 5434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2496 IncrementalHoareTripleChecker+Valid, 2938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-07-23 04:09:49,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4807 Valid, 2876 Invalid, 5434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2496 Valid, 2938 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2022-07-23 04:09:49,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3709 states. [2022-07-23 04:09:49,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3709 to 3709. [2022-07-23 04:09:49,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3709 states, 2537 states have (on average 1.257390618841151) internal successors, (3190), 2622 states have internal predecessors, (3190), 920 states have call successors, (920), 225 states have call predecessors, (920), 224 states have return successors, (951), 898 states have call predecessors, (951), 918 states have call successors, (951) [2022-07-23 04:09:49,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3709 states to 3709 states and 5061 transitions. [2022-07-23 04:09:49,501 INFO L78 Accepts]: Start accepts. Automaton has 3709 states and 5061 transitions. Word has length 76 [2022-07-23 04:09:49,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:09:49,502 INFO L495 AbstractCegarLoop]: Abstraction has 3709 states and 5061 transitions. [2022-07-23 04:09:49,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-23 04:09:49,502 INFO L276 IsEmpty]: Start isEmpty. Operand 3709 states and 5061 transitions. [2022-07-23 04:09:49,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-23 04:09:49,505 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:09:49,505 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:09:49,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-23 04:09:49,506 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 28 more)] === [2022-07-23 04:09:49,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:09:49,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1019236422, now seen corresponding path program 1 times [2022-07-23 04:09:49,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:09:49,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515971967] [2022-07-23 04:09:49,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:09:49,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:09:49,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:09:49,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:09:49,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:09:49,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:09:49,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:09:49,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:09:49,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:09:49,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:09:49,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:09:49,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:09:49,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:09:49,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:09:49,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:09:49,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:09:49,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:09:49,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:09:49,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:09:49,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:09:49,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:09:49,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:09:49,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:09:49,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:09:49,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:09:49,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:09:49,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:09:49,849 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-23 04:09:49,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:09:49,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515971967] [2022-07-23 04:09:49,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515971967] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:09:49,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:09:49,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:09:49,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706799025] [2022-07-23 04:09:49,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:09:49,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:09:49,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:09:49,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:09:49,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:09:49,852 INFO L87 Difference]: Start difference. First operand 3709 states and 5061 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-23 04:09:51,408 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:09:52,539 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-23 04:09:56,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:09:56,761 INFO L93 Difference]: Finished difference Result 3709 states and 5061 transitions. [2022-07-23 04:09:56,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:09:56,762 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 82 [2022-07-23 04:09:56,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:09:56,785 INFO L225 Difference]: With dead ends: 3709 [2022-07-23 04:09:56,786 INFO L226 Difference]: Without dead ends: 3707 [2022-07-23 04:09:56,789 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-23 04:09:56,791 INFO L413 NwaCegarLoop]: 2243 mSDtfsCounter, 4713 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 2936 mSolverCounterSat, 2496 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4800 SdHoareTripleChecker+Valid, 2874 SdHoareTripleChecker+Invalid, 5432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2496 IncrementalHoareTripleChecker+Valid, 2936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-07-23 04:09:56,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4800 Valid, 2874 Invalid, 5432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2496 Valid, 2936 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2022-07-23 04:09:56,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3707 states. [2022-07-23 04:09:56,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3707 to 3707. [2022-07-23 04:09:56,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3707 states, 2536 states have (on average 1.2570977917981072) internal successors, (3188), 2620 states have internal predecessors, (3188), 920 states have call successors, (920), 225 states have call predecessors, (920), 224 states have return successors, (951), 898 states have call predecessors, (951), 918 states have call successors, (951) [2022-07-23 04:09:57,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3707 states to 3707 states and 5059 transitions. [2022-07-23 04:09:57,002 INFO L78 Accepts]: Start accepts. Automaton has 3707 states and 5059 transitions. Word has length 82 [2022-07-23 04:09:57,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:09:57,003 INFO L495 AbstractCegarLoop]: Abstraction has 3707 states and 5059 transitions. [2022-07-23 04:09:57,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-23 04:09:57,004 INFO L276 IsEmpty]: Start isEmpty. Operand 3707 states and 5059 transitions. [2022-07-23 04:09:57,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-23 04:09:57,006 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:09:57,006 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:09:57,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-23 04:09:57,006 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 28 more)] === [2022-07-23 04:09:57,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:09:57,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1523732060, now seen corresponding path program 1 times [2022-07-23 04:09:57,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:09:57,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870647886] [2022-07-23 04:09:57,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:09:57,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:09:57,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:09:57,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:09:57,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:09:57,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:09:57,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:09:57,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:09:57,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:09:57,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:09:57,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:09:57,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:09:57,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:09:57,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:09:57,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:09:57,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:09:57,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:09:57,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:09:57,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:09:57,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:09:57,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:09:57,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:09:57,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:09:57,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:09:57,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:09:57,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:09:57,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:09:57,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:09:57,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:09:57,353 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-23 04:09:57,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:09:57,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870647886] [2022-07-23 04:09:57,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870647886] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:09:57,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:09:57,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:09:57,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804225416] [2022-07-23 04:09:57,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:09:57,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:09:57,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:09:57,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:09:57,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:09:57,356 INFO L87 Difference]: Start difference. First operand 3707 states and 5059 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-23 04:10:02,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:10:02,973 INFO L93 Difference]: Finished difference Result 3707 states and 5059 transitions. [2022-07-23 04:10:02,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:10:02,973 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 88 [2022-07-23 04:10:02,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:10:02,992 INFO L225 Difference]: With dead ends: 3707 [2022-07-23 04:10:02,993 INFO L226 Difference]: Without dead ends: 3705 [2022-07-23 04:10:02,997 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-23 04:10:02,998 INFO L413 NwaCegarLoop]: 2241 mSDtfsCounter, 4707 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 2934 mSolverCounterSat, 2496 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4793 SdHoareTripleChecker+Valid, 2872 SdHoareTripleChecker+Invalid, 5430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2496 IncrementalHoareTripleChecker+Valid, 2934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-07-23 04:10:02,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4793 Valid, 2872 Invalid, 5430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2496 Valid, 2934 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2022-07-23 04:10:03,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3705 states. [2022-07-23 04:10:03,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3705 to 3705. [2022-07-23 04:10:03,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3705 states, 2535 states have (on average 1.2568047337278105) internal successors, (3186), 2618 states have internal predecessors, (3186), 920 states have call successors, (920), 225 states have call predecessors, (920), 224 states have return successors, (951), 898 states have call predecessors, (951), 918 states have call successors, (951) [2022-07-23 04:10:03,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3705 states to 3705 states and 5057 transitions. [2022-07-23 04:10:03,165 INFO L78 Accepts]: Start accepts. Automaton has 3705 states and 5057 transitions. Word has length 88 [2022-07-23 04:10:03,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:10:03,165 INFO L495 AbstractCegarLoop]: Abstraction has 3705 states and 5057 transitions. [2022-07-23 04:10:03,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-23 04:10:03,166 INFO L276 IsEmpty]: Start isEmpty. Operand 3705 states and 5057 transitions. [2022-07-23 04:10:03,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-23 04:10:03,167 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:10:03,168 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-23 04:10:03,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-23 04:10:03,168 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting fore200e_pca_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-23 04:10:03,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:10:03,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1546673947, now seen corresponding path program 1 times [2022-07-23 04:10:03,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:10:03,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604004566] [2022-07-23 04:10:03,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:10:03,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:10:03,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:10:03,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:10:03,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:10:03,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:10:03,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:10:03,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:10:03,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:10:03,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:10:03,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:10:03,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:10:03,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:10:03,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:10:03,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:10:04,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:10:04,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:10:04,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:10:04,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:10:04,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:10:04,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:10:04,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-23 04:10:04,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:10:04,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:10:04,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:10:04,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:10:04,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:10:04,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:10:04,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:10:04,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:10:04,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:10:04,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:10:04,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:10:04,152 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-07-23 04:10:04,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:10:04,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604004566] [2022-07-23 04:10:04,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604004566] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 04:10:04,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248769622] [2022-07-23 04:10:04,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:10:04,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:10:04,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 04:10:04,155 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 04:10:04,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-23 04:10:04,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:10:04,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 1885 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-23 04:10:04,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 04:10:05,133 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 53 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-23 04:10:05,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 04:10:05,402 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-07-23 04:10:05,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248769622] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 04:10:05,403 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 04:10:05,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 17] total 23 [2022-07-23 04:10:05,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556569299] [2022-07-23 04:10:05,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 04:10:05,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-23 04:10:05,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:10:05,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-23 04:10:05,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=459, Unknown=0, NotChecked=0, Total=506 [2022-07-23 04:10:05,405 INFO L87 Difference]: Start difference. First operand 3705 states and 5057 transitions. Second operand has 23 states, 22 states have (on average 3.1363636363636362) internal successors, (69), 18 states have internal predecessors, (69), 7 states have call successors, (26), 5 states have call predecessors, (26), 5 states have return successors, (23), 8 states have call predecessors, (23), 7 states have call successors, (23) [2022-07-23 04:10:07,428 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:10:08,444 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:10:39,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:10:39,842 INFO L93 Difference]: Finished difference Result 4846 states and 6526 transitions. [2022-07-23 04:10:39,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-23 04:10:39,842 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.1363636363636362) internal successors, (69), 18 states have internal predecessors, (69), 7 states have call successors, (26), 5 states have call predecessors, (26), 5 states have return successors, (23), 8 states have call predecessors, (23), 7 states have call successors, (23) Word has length 99 [2022-07-23 04:10:39,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:10:39,862 INFO L225 Difference]: With dead ends: 4846 [2022-07-23 04:10:39,862 INFO L226 Difference]: Without dead ends: 3911 [2022-07-23 04:10:39,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 221 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=237, Invalid=1403, Unknown=0, NotChecked=0, Total=1640 [2022-07-23 04:10:39,868 INFO L413 NwaCegarLoop]: 2255 mSDtfsCounter, 3772 mSDsluCounter, 5047 mSDsCounter, 0 mSdLazyCounter, 43081 mSolverCounterSat, 2768 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3791 SdHoareTripleChecker+Valid, 7302 SdHoareTripleChecker+Invalid, 45850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2768 IncrementalHoareTripleChecker+Valid, 43081 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.6s IncrementalHoareTripleChecker+Time [2022-07-23 04:10:39,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3791 Valid, 7302 Invalid, 45850 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2768 Valid, 43081 Invalid, 1 Unknown, 0 Unchecked, 33.6s Time] [2022-07-23 04:10:39,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3911 states. [2022-07-23 04:10:40,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3911 to 3742. [2022-07-23 04:10:40,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3742 states, 2561 states have (on average 1.254978524014057) internal successors, (3214), 2646 states have internal predecessors, (3214), 926 states have call successors, (926), 225 states have call predecessors, (926), 229 states have return successors, (969), 908 states have call predecessors, (969), 924 states have call successors, (969) [2022-07-23 04:10:40,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 5109 transitions. [2022-07-23 04:10:40,029 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 5109 transitions. Word has length 99 [2022-07-23 04:10:40,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:10:40,030 INFO L495 AbstractCegarLoop]: Abstraction has 3742 states and 5109 transitions. [2022-07-23 04:10:40,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.1363636363636362) internal successors, (69), 18 states have internal predecessors, (69), 7 states have call successors, (26), 5 states have call predecessors, (26), 5 states have return successors, (23), 8 states have call predecessors, (23), 7 states have call successors, (23) [2022-07-23 04:10:40,030 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 5109 transitions. [2022-07-23 04:10:40,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-23 04:10:40,031 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:10:40,032 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:10:40,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-23 04:10:40,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-07-23 04:10:40,248 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-23 04:10:40,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:10:40,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1428851801, now seen corresponding path program 1 times [2022-07-23 04:10:40,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:10:40,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810343550] [2022-07-23 04:10:40,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:10:40,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:10:40,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:10:40,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:10:40,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:10:40,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:10:40,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:10:40,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:10:40,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:10:40,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:10:40,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:10:40,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:10:40,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:10:40,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:10:40,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:10:40,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:10:40,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:10:40,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:10:40,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:10:40,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:10:40,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:10:40,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:10:40,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:10:40,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:10:40,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:10:40,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:10:40,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:10:40,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:10:40,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:10:40,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:10:40,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:10:40,556 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-23 04:10:40,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:10:40,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810343550] [2022-07-23 04:10:40,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810343550] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:10:40,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:10:40,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:10:40,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936437387] [2022-07-23 04:10:40,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:10:40,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:10:40,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:10:40,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:10:40,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:10:40,558 INFO L87 Difference]: Start difference. First operand 3742 states and 5109 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-23 04:10:42,576 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:10:47,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:10:47,630 INFO L93 Difference]: Finished difference Result 3742 states and 5109 transitions. [2022-07-23 04:10:47,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:10:47,630 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 94 [2022-07-23 04:10:47,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:10:47,651 INFO L225 Difference]: With dead ends: 3742 [2022-07-23 04:10:47,651 INFO L226 Difference]: Without dead ends: 3740 [2022-07-23 04:10:47,656 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-23 04:10:47,656 INFO L413 NwaCegarLoop]: 2239 mSDtfsCounter, 4701 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 2932 mSolverCounterSat, 2496 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4786 SdHoareTripleChecker+Valid, 2870 SdHoareTripleChecker+Invalid, 5428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2496 IncrementalHoareTripleChecker+Valid, 2932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-07-23 04:10:47,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4786 Valid, 2870 Invalid, 5428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2496 Valid, 2932 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2022-07-23 04:10:47,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3740 states. [2022-07-23 04:10:47,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3740 to 3740. [2022-07-23 04:10:47,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3740 states, 2560 states have (on average 1.2546875) internal successors, (3212), 2644 states have internal predecessors, (3212), 926 states have call successors, (926), 225 states have call predecessors, (926), 229 states have return successors, (969), 908 states have call predecessors, (969), 924 states have call successors, (969) [2022-07-23 04:10:47,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3740 states to 3740 states and 5107 transitions. [2022-07-23 04:10:47,825 INFO L78 Accepts]: Start accepts. Automaton has 3740 states and 5107 transitions. Word has length 94 [2022-07-23 04:10:47,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:10:47,826 INFO L495 AbstractCegarLoop]: Abstraction has 3740 states and 5107 transitions. [2022-07-23 04:10:47,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-23 04:10:47,826 INFO L276 IsEmpty]: Start isEmpty. Operand 3740 states and 5107 transitions. [2022-07-23 04:10:47,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-23 04:10:47,828 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:10:47,828 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:10:47,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-23 04:10:47,828 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-23 04:10:47,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:10:47,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1577371483, now seen corresponding path program 1 times [2022-07-23 04:10:47,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:10:47,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155564349] [2022-07-23 04:10:47,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:10:47,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:10:47,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:10:47,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:10:47,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:10:47,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:10:47,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:10:47,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:10:47,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:10:47,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 04:10:47,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:10:47,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:10:47,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:10:48,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:10:48,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:10:48,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:10:48,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:10:48,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 04:10:48,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:10:48,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:10:48,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:10:48,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:10:48,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:10:48,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:10:48,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:10:48,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:10:48,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:10:48,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:10:48,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:10:48,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:10:48,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:10:48,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:10:48,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:10:48,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:10:48,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:10:48,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:10:48,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:10:48,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:10:48,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:10:48,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-23 04:10:48,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:10:48,144 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-23 04:10:48,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:10:48,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155564349] [2022-07-23 04:10:48,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155564349] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:10:48,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:10:48,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 04:10:48,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881141265] [2022-07-23 04:10:48,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:10:48,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 04:10:48,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:10:48,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 04:10:48,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-23 04:10:48,147 INFO L87 Difference]: Start difference. First operand 3740 states and 5107 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-23 04:10:50,063 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:10:52,532 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:10:57,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:10:57,909 INFO L93 Difference]: Finished difference Result 7670 states and 10549 transitions. [2022-07-23 04:10:57,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:10:57,909 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 115 [2022-07-23 04:10:57,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:10:57,932 INFO L225 Difference]: With dead ends: 7670 [2022-07-23 04:10:57,932 INFO L226 Difference]: Without dead ends: 3965 [2022-07-23 04:10:57,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-07-23 04:10:57,951 INFO L413 NwaCegarLoop]: 2084 mSDtfsCounter, 6078 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 2321 mSolverCounterSat, 3939 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6176 SdHoareTripleChecker+Valid, 2592 SdHoareTripleChecker+Invalid, 6261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3939 IncrementalHoareTripleChecker+Valid, 2321 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2022-07-23 04:10:57,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6176 Valid, 2592 Invalid, 6261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3939 Valid, 2321 Invalid, 1 Unknown, 0 Unchecked, 9.4s Time] [2022-07-23 04:10:57,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3965 states. [2022-07-23 04:10:58,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3965 to 3741. [2022-07-23 04:10:58,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3741 states, 2559 states have (on average 1.2532239155920282) internal successors, (3207), 2644 states have internal predecessors, (3207), 926 states have call successors, (926), 225 states have call predecessors, (926), 232 states have return successors, (981), 909 states have call predecessors, (981), 924 states have call successors, (981) [2022-07-23 04:10:58,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3741 states to 3741 states and 5114 transitions. [2022-07-23 04:10:58,158 INFO L78 Accepts]: Start accepts. Automaton has 3741 states and 5114 transitions. Word has length 115 [2022-07-23 04:10:58,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:10:58,159 INFO L495 AbstractCegarLoop]: Abstraction has 3741 states and 5114 transitions. [2022-07-23 04:10:58,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-23 04:10:58,159 INFO L276 IsEmpty]: Start isEmpty. Operand 3741 states and 5114 transitions. [2022-07-23 04:10:58,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-23 04:10:58,162 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:10:58,162 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:10:58,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-23 04:10:58,163 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-23 04:10:58,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:10:58,163 INFO L85 PathProgramCache]: Analyzing trace with hash -250727530, now seen corresponding path program 1 times [2022-07-23 04:10:58,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:10:58,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968490734] [2022-07-23 04:10:58,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:10:58,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:10:58,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:10:58,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:10:58,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:10:58,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:10:58,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:10:58,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:10:58,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:10:58,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:10:58,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:10:58,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:10:58,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:10:58,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:10:58,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:10:58,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:10:58,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:10:58,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:10:58,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:10:58,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:10:58,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:10:58,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:10:58,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:10:58,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:10:58,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:10:58,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:10:58,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:10:58,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:10:58,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:10:58,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:10:58,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:10:58,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:10:58,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:10:58,487 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-23 04:10:58,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:10:58,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968490734] [2022-07-23 04:10:58,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968490734] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:10:58,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:10:58,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:10:58,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685321739] [2022-07-23 04:10:58,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:10:58,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:10:58,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:10:58,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:10:58,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:10:58,491 INFO L87 Difference]: Start difference. First operand 3741 states and 5114 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-23 04:11:00,512 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:11:02,518 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:11:06,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:11:06,972 INFO L93 Difference]: Finished difference Result 3741 states and 5114 transitions. [2022-07-23 04:11:06,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:11:06,973 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 100 [2022-07-23 04:11:06,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:11:06,990 INFO L225 Difference]: With dead ends: 3741 [2022-07-23 04:11:06,990 INFO L226 Difference]: Without dead ends: 3739 [2022-07-23 04:11:06,993 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-23 04:11:06,994 INFO L413 NwaCegarLoop]: 2232 mSDtfsCounter, 4690 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 2927 mSolverCounterSat, 2496 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4774 SdHoareTripleChecker+Valid, 2849 SdHoareTripleChecker+Invalid, 5425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2496 IncrementalHoareTripleChecker+Valid, 2927 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2022-07-23 04:11:06,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4774 Valid, 2849 Invalid, 5425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2496 Valid, 2927 Invalid, 2 Unknown, 0 Unchecked, 8.2s Time] [2022-07-23 04:11:06,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3739 states. [2022-07-23 04:11:07,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3739 to 3739. [2022-07-23 04:11:07,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3739 states, 2558 states have (on average 1.2529319781078967) internal successors, (3205), 2642 states have internal predecessors, (3205), 926 states have call successors, (926), 225 states have call predecessors, (926), 232 states have return successors, (981), 909 states have call predecessors, (981), 924 states have call successors, (981) [2022-07-23 04:11:07,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3739 states to 3739 states and 5112 transitions. [2022-07-23 04:11:07,197 INFO L78 Accepts]: Start accepts. Automaton has 3739 states and 5112 transitions. Word has length 100 [2022-07-23 04:11:07,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:11:07,198 INFO L495 AbstractCegarLoop]: Abstraction has 3739 states and 5112 transitions. [2022-07-23 04:11:07,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-23 04:11:07,198 INFO L276 IsEmpty]: Start isEmpty. Operand 3739 states and 5112 transitions. [2022-07-23 04:11:07,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-23 04:11:07,199 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:11:07,200 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:11:07,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-23 04:11:07,200 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-23 04:11:07,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:11:07,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1733111734, now seen corresponding path program 1 times [2022-07-23 04:11:07,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:11:07,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674173599] [2022-07-23 04:11:07,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:11:07,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:11:07,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:07,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:11:07,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:07,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:11:07,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:07,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:11:07,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:07,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 04:11:07,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:07,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:11:07,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:07,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:11:07,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:07,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:11:07,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:07,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 04:11:07,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:07,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:11:07,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:07,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:11:07,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:07,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:11:07,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:07,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:11:07,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:07,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:11:07,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:07,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:11:07,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:07,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:11:07,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:07,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:11:07,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:07,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:11:07,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:07,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:11:07,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:07,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-23 04:11:07,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:07,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-23 04:11:07,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:07,564 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2022-07-23 04:11:07,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:11:07,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674173599] [2022-07-23 04:11:07,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674173599] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 04:11:07,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171245955] [2022-07-23 04:11:07,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:11:07,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:11:07,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 04:11:07,568 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 04:11:07,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-23 04:11:08,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:08,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 2073 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 04:11:08,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 04:11:08,473 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-23 04:11:08,473 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 04:11:08,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171245955] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:11:08,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 04:11:08,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-07-23 04:11:08,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489177776] [2022-07-23 04:11:08,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:11:08,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 04:11:08,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:11:08,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 04:11:08,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-23 04:11:08,476 INFO L87 Difference]: Start difference. First operand 3739 states and 5112 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-23 04:11:08,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:11:08,685 INFO L93 Difference]: Finished difference Result 7437 states and 10168 transitions. [2022-07-23 04:11:08,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 04:11:08,686 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 121 [2022-07-23 04:11:08,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:11:08,701 INFO L225 Difference]: With dead ends: 7437 [2022-07-23 04:11:08,702 INFO L226 Difference]: Without dead ends: 3733 [2022-07-23 04:11:08,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-23 04:11:08,718 INFO L413 NwaCegarLoop]: 2611 mSDtfsCounter, 2590 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2590 SdHoareTripleChecker+Valid, 2611 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 04:11:08,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2590 Valid, 2611 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 04:11:08,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3733 states. [2022-07-23 04:11:09,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3733 to 3733. [2022-07-23 04:11:09,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3733 states, 2553 states have (on average 1.2518605562083822) internal successors, (3196), 2636 states have internal predecessors, (3196), 926 states have call successors, (926), 225 states have call predecessors, (926), 232 states have return successors, (981), 909 states have call predecessors, (981), 924 states have call successors, (981) [2022-07-23 04:11:09,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3733 states to 3733 states and 5103 transitions. [2022-07-23 04:11:09,054 INFO L78 Accepts]: Start accepts. Automaton has 3733 states and 5103 transitions. Word has length 121 [2022-07-23 04:11:09,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:11:09,055 INFO L495 AbstractCegarLoop]: Abstraction has 3733 states and 5103 transitions. [2022-07-23 04:11:09,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-23 04:11:09,055 INFO L276 IsEmpty]: Start isEmpty. Operand 3733 states and 5103 transitions. [2022-07-23 04:11:09,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-07-23 04:11:09,058 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:11:09,058 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:11:09,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-23 04:11:09,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-23 04:11:09,278 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-23 04:11:09,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:11:09,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1292108662, now seen corresponding path program 1 times [2022-07-23 04:11:09,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:11:09,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854672881] [2022-07-23 04:11:09,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:11:09,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:11:09,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:09,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:11:09,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:09,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:11:09,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:09,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:11:09,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:09,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 04:11:09,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:09,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:11:09,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:09,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:11:09,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:09,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:11:09,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:09,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 04:11:09,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:09,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:11:09,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:09,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:11:09,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:09,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:11:09,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:09,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:11:09,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:09,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:11:09,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:09,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:11:09,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:09,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:11:09,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:09,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:11:09,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:09,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:11:09,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:09,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:11:09,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:09,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:11:09,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:09,614 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-23 04:11:09,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:11:09,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854672881] [2022-07-23 04:11:09,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854672881] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:11:09,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:11:09,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 04:11:09,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756008681] [2022-07-23 04:11:09,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:11:09,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 04:11:09,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:11:09,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 04:11:09,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-23 04:11:09,617 INFO L87 Difference]: Start difference. First operand 3733 states and 5103 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-23 04:11:11,640 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:11:14,336 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:11:23,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:11:23,566 INFO L93 Difference]: Finished difference Result 7594 states and 10483 transitions. [2022-07-23 04:11:23,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-23 04:11:23,567 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 125 [2022-07-23 04:11:23,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:11:23,580 INFO L225 Difference]: With dead ends: 7594 [2022-07-23 04:11:23,581 INFO L226 Difference]: Without dead ends: 3896 [2022-07-23 04:11:23,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2022-07-23 04:11:23,597 INFO L413 NwaCegarLoop]: 2232 mSDtfsCounter, 3718 mSDsluCounter, 1303 mSDsCounter, 0 mSdLazyCounter, 9107 mSolverCounterSat, 2442 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3718 SdHoareTripleChecker+Valid, 3535 SdHoareTripleChecker+Invalid, 11551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2442 IncrementalHoareTripleChecker+Valid, 9107 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.5s IncrementalHoareTripleChecker+Time [2022-07-23 04:11:23,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3718 Valid, 3535 Invalid, 11551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2442 Valid, 9107 Invalid, 2 Unknown, 0 Unchecked, 13.5s Time] [2022-07-23 04:11:23,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3896 states. [2022-07-23 04:11:23,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3896 to 3739. [2022-07-23 04:11:23,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3739 states, 2559 states have (on average 1.2512700273544353) internal successors, (3202), 2642 states have internal predecessors, (3202), 926 states have call successors, (926), 225 states have call predecessors, (926), 232 states have return successors, (981), 909 states have call predecessors, (981), 924 states have call successors, (981) [2022-07-23 04:11:23,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3739 states to 3739 states and 5109 transitions. [2022-07-23 04:11:23,867 INFO L78 Accepts]: Start accepts. Automaton has 3739 states and 5109 transitions. Word has length 125 [2022-07-23 04:11:23,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:11:23,868 INFO L495 AbstractCegarLoop]: Abstraction has 3739 states and 5109 transitions. [2022-07-23 04:11:23,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-23 04:11:23,868 INFO L276 IsEmpty]: Start isEmpty. Operand 3739 states and 5109 transitions. [2022-07-23 04:11:23,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-23 04:11:23,870 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:11:23,870 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:11:23,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-23 04:11:23,870 INFO L420 AbstractCegarLoop]: === Iteration 12 === 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 28 more)] === [2022-07-23 04:11:23,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:11:23,871 INFO L85 PathProgramCache]: Analyzing trace with hash 562293705, now seen corresponding path program 1 times [2022-07-23 04:11:23,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:11:23,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127602519] [2022-07-23 04:11:23,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:11:23,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:11:23,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:24,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:11:24,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:24,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:11:24,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:24,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:11:24,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:24,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:11:24,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:24,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:11:24,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:24,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:11:24,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:24,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:11:24,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:24,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:11:24,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:24,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:11:24,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:24,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:11:24,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:24,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:11:24,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:24,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:11:24,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:24,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:11:24,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:24,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:11:24,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:24,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:11:24,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:24,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:11:24,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:24,144 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-23 04:11:24,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:11:24,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127602519] [2022-07-23 04:11:24,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127602519] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:11:24,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:11:24,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:11:24,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465053208] [2022-07-23 04:11:24,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:11:24,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:11:24,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:11:24,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:11:24,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:11:24,147 INFO L87 Difference]: Start difference. First operand 3739 states and 5109 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-23 04:11:26,167 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:11:31,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:11:31,708 INFO L93 Difference]: Finished difference Result 3739 states and 5109 transitions. [2022-07-23 04:11:31,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:11:31,709 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 106 [2022-07-23 04:11:31,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:11:31,723 INFO L225 Difference]: With dead ends: 3739 [2022-07-23 04:11:31,724 INFO L226 Difference]: Without dead ends: 3737 [2022-07-23 04:11:31,727 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-23 04:11:31,728 INFO L413 NwaCegarLoop]: 2225 mSDtfsCounter, 4683 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 2921 mSolverCounterSat, 2496 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4766 SdHoareTripleChecker+Valid, 2828 SdHoareTripleChecker+Invalid, 5418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2496 IncrementalHoareTripleChecker+Valid, 2921 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-07-23 04:11:31,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4766 Valid, 2828 Invalid, 5418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2496 Valid, 2921 Invalid, 1 Unknown, 0 Unchecked, 7.3s Time] [2022-07-23 04:11:31,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3737 states. [2022-07-23 04:11:31,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3737 to 3737. [2022-07-23 04:11:31,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3737 states, 2558 states have (on average 1.2509773260359656) internal successors, (3200), 2640 states have internal predecessors, (3200), 926 states have call successors, (926), 225 states have call predecessors, (926), 232 states have return successors, (981), 909 states have call predecessors, (981), 924 states have call successors, (981) [2022-07-23 04:11:31,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3737 states to 3737 states and 5107 transitions. [2022-07-23 04:11:31,930 INFO L78 Accepts]: Start accepts. Automaton has 3737 states and 5107 transitions. Word has length 106 [2022-07-23 04:11:31,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:11:31,931 INFO L495 AbstractCegarLoop]: Abstraction has 3737 states and 5107 transitions. [2022-07-23 04:11:31,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-23 04:11:31,931 INFO L276 IsEmpty]: Start isEmpty. Operand 3737 states and 5107 transitions. [2022-07-23 04:11:31,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-07-23 04:11:31,933 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:11:31,933 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:11:31,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-23 04:11:31,933 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-23 04:11:31,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:11:31,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1412084910, now seen corresponding path program 1 times [2022-07-23 04:11:31,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:11:31,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679051498] [2022-07-23 04:11:31,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:11:31,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:11:32,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:32,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:11:32,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:32,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:11:32,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:32,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:11:32,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:32,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 04:11:32,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:32,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:11:32,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:32,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:11:32,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:32,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:11:32,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:32,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 04:11:32,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:32,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:11:32,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:32,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:11:32,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:32,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:11:32,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:32,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:11:32,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:32,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:11:32,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:32,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:11:32,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:32,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:11:32,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:32,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:11:32,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:32,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:11:32,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:32,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:11:32,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:32,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-23 04:11:32,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:32,344 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-23 04:11:32,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:11:32,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679051498] [2022-07-23 04:11:32,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679051498] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:11:32,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:11:32,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-23 04:11:32,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169960851] [2022-07-23 04:11:32,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:11:32,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 04:11:32,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:11:32,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 04:11:32,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-23 04:11:32,347 INFO L87 Difference]: Start difference. First operand 3737 states and 5107 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-23 04:11:34,369 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:11:36,377 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:11:37,896 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:11:39,696 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:11:50,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:11:50,938 INFO L93 Difference]: Finished difference Result 8857 states and 12124 transitions. [2022-07-23 04:11:50,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-23 04:11:50,939 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 128 [2022-07-23 04:11:50,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:11:50,958 INFO L225 Difference]: With dead ends: 8857 [2022-07-23 04:11:50,958 INFO L226 Difference]: Without dead ends: 5155 [2022-07-23 04:11:50,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2022-07-23 04:11:50,972 INFO L413 NwaCegarLoop]: 2231 mSDtfsCounter, 6825 mSDsluCounter, 1202 mSDsCounter, 0 mSdLazyCounter, 10557 mSolverCounterSat, 4005 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6916 SdHoareTripleChecker+Valid, 3433 SdHoareTripleChecker+Invalid, 14564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4005 IncrementalHoareTripleChecker+Valid, 10557 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.0s IncrementalHoareTripleChecker+Time [2022-07-23 04:11:50,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6916 Valid, 3433 Invalid, 14564 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4005 Valid, 10557 Invalid, 2 Unknown, 0 Unchecked, 18.0s Time] [2022-07-23 04:11:50,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5155 states. [2022-07-23 04:11:51,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5155 to 4892. [2022-07-23 04:11:51,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4892 states, 3348 states have (on average 1.246415770609319) internal successors, (4173), 3450 states have internal predecessors, (4173), 1166 states have call successors, (1166), 347 states have call predecessors, (1166), 357 states have return successors, (1231), 1138 states have call predecessors, (1231), 1164 states have call successors, (1231) [2022-07-23 04:11:51,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4892 states to 4892 states and 6570 transitions. [2022-07-23 04:11:51,250 INFO L78 Accepts]: Start accepts. Automaton has 4892 states and 6570 transitions. Word has length 128 [2022-07-23 04:11:51,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:11:51,251 INFO L495 AbstractCegarLoop]: Abstraction has 4892 states and 6570 transitions. [2022-07-23 04:11:51,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-23 04:11:51,251 INFO L276 IsEmpty]: Start isEmpty. Operand 4892 states and 6570 transitions. [2022-07-23 04:11:51,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-07-23 04:11:51,253 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:11:51,253 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:11:51,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-23 04:11:51,254 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-23 04:11:51,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:11:51,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1412144492, now seen corresponding path program 1 times [2022-07-23 04:11:51,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:11:51,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623948222] [2022-07-23 04:11:51,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:11:51,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:11:51,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:51,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:11:51,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:51,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:11:51,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:51,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:11:51,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:51,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 04:11:51,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:51,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:11:51,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:51,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:11:51,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:51,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:11:51,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:51,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 04:11:51,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:51,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:11:51,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:51,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:11:51,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:51,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:11:51,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:51,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:11:51,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:51,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:11:51,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:51,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:11:51,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:51,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:11:51,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:51,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:11:51,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:51,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:11:51,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:51,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:11:51,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:51,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-23 04:11:51,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:11:51,540 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-23 04:11:51,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:11:51,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623948222] [2022-07-23 04:11:51,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623948222] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:11:51,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:11:51,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 04:11:51,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047317727] [2022-07-23 04:11:51,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:11:51,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 04:11:51,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:11:51,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 04:11:51,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-23 04:11:51,545 INFO L87 Difference]: Start difference. First operand 4892 states and 6570 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2022-07-23 04:12:01,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:12:01,238 INFO L93 Difference]: Finished difference Result 5165 states and 6992 transitions. [2022-07-23 04:12:01,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 04:12:01,239 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 128 [2022-07-23 04:12:01,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:12:01,255 INFO L225 Difference]: With dead ends: 5165 [2022-07-23 04:12:01,255 INFO L226 Difference]: Without dead ends: 5163 [2022-07-23 04:12:01,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2022-07-23 04:12:01,260 INFO L413 NwaCegarLoop]: 2231 mSDtfsCounter, 3752 mSDsluCounter, 1034 mSDsCounter, 0 mSdLazyCounter, 6710 mSolverCounterSat, 2443 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3752 SdHoareTripleChecker+Valid, 3265 SdHoareTripleChecker+Invalid, 9153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2443 IncrementalHoareTripleChecker+Valid, 6710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2022-07-23 04:12:01,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3752 Valid, 3265 Invalid, 9153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2443 Valid, 6710 Invalid, 0 Unknown, 0 Unchecked, 9.3s Time] [2022-07-23 04:12:01,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5163 states. [2022-07-23 04:12:01,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5163 to 4896. [2022-07-23 04:12:01,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4896 states, 3352 states have (on average 1.2455250596658711) internal successors, (4175), 3454 states have internal predecessors, (4175), 1166 states have call successors, (1166), 347 states have call predecessors, (1166), 357 states have return successors, (1231), 1138 states have call predecessors, (1231), 1164 states have call successors, (1231) [2022-07-23 04:12:01,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4896 states to 4896 states and 6572 transitions. [2022-07-23 04:12:01,545 INFO L78 Accepts]: Start accepts. Automaton has 4896 states and 6572 transitions. Word has length 128 [2022-07-23 04:12:01,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:12:01,546 INFO L495 AbstractCegarLoop]: Abstraction has 4896 states and 6572 transitions. [2022-07-23 04:12:01,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2022-07-23 04:12:01,546 INFO L276 IsEmpty]: Start isEmpty. Operand 4896 states and 6572 transitions. [2022-07-23 04:12:01,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-23 04:12:01,548 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:12:01,548 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:12:01,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-23 04:12:01,549 INFO L420 AbstractCegarLoop]: === Iteration 15 === 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 28 more)] === [2022-07-23 04:12:01,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:12:01,549 INFO L85 PathProgramCache]: Analyzing trace with hash -801451636, now seen corresponding path program 1 times [2022-07-23 04:12:01,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:12:01,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141460960] [2022-07-23 04:12:01,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:12:01,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:12:01,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:01,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:12:01,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:01,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:12:01,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:01,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:12:01,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:01,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:12:01,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:01,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:12:01,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:01,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:12:01,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:01,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:12:01,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:01,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:12:01,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:01,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:12:01,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:01,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:12:01,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:01,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:12:01,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:01,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:12:01,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:01,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:12:01,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:01,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:12:01,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:01,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:12:01,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:01,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:12:01,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:01,817 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-23 04:12:01,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:12:01,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141460960] [2022-07-23 04:12:01,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141460960] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:12:01,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:12:01,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:12:01,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117705576] [2022-07-23 04:12:01,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:12:01,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:12:01,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:12:01,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:12:01,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:12:01,820 INFO L87 Difference]: Start difference. First operand 4896 states and 6572 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-23 04:12:03,842 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:12:09,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:12:09,134 INFO L93 Difference]: Finished difference Result 4896 states and 6572 transitions. [2022-07-23 04:12:09,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:12:09,134 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 108 [2022-07-23 04:12:09,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:12:09,147 INFO L225 Difference]: With dead ends: 4896 [2022-07-23 04:12:09,148 INFO L226 Difference]: Without dead ends: 4894 [2022-07-23 04:12:09,150 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-23 04:12:09,151 INFO L413 NwaCegarLoop]: 2223 mSDtfsCounter, 4671 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 2923 mSolverCounterSat, 2496 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4754 SdHoareTripleChecker+Valid, 2826 SdHoareTripleChecker+Invalid, 5420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2496 IncrementalHoareTripleChecker+Valid, 2923 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-07-23 04:12:09,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4754 Valid, 2826 Invalid, 5420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2496 Valid, 2923 Invalid, 1 Unknown, 0 Unchecked, 7.0s Time] [2022-07-23 04:12:09,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4894 states. [2022-07-23 04:12:09,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4894 to 4894. [2022-07-23 04:12:09,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4894 states, 3351 states have (on average 1.2452999104744853) internal successors, (4173), 3452 states have internal predecessors, (4173), 1166 states have call successors, (1166), 347 states have call predecessors, (1166), 357 states have return successors, (1231), 1138 states have call predecessors, (1231), 1164 states have call successors, (1231) [2022-07-23 04:12:09,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4894 states to 4894 states and 6570 transitions. [2022-07-23 04:12:09,439 INFO L78 Accepts]: Start accepts. Automaton has 4894 states and 6570 transitions. Word has length 108 [2022-07-23 04:12:09,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:12:09,440 INFO L495 AbstractCegarLoop]: Abstraction has 4894 states and 6570 transitions. [2022-07-23 04:12:09,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-23 04:12:09,440 INFO L276 IsEmpty]: Start isEmpty. Operand 4894 states and 6570 transitions. [2022-07-23 04:12:09,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-07-23 04:12:09,442 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:12:09,442 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:12:09,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-23 04:12:09,442 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_check_alloc_flagsErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-23 04:12:09,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:12:09,443 INFO L85 PathProgramCache]: Analyzing trace with hash -82159438, now seen corresponding path program 1 times [2022-07-23 04:12:09,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:12:09,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62550475] [2022-07-23 04:12:09,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:12:09,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:12:09,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:09,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:12:09,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:09,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:12:09,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:09,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:12:09,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:09,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 04:12:09,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:09,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:12:09,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:09,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:12:09,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:09,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:12:09,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:09,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 04:12:09,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:09,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:12:09,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:09,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:12:09,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:09,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:12:09,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:09,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:12:09,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:09,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:12:09,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:09,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:12:09,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:09,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:12:09,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:09,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:12:09,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:09,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:12:09,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:09,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:12:09,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:09,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-23 04:12:09,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:09,821 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-23 04:12:09,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:12:09,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62550475] [2022-07-23 04:12:09,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62550475] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:12:09,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:12:09,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:12:09,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570339495] [2022-07-23 04:12:09,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:12:09,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:12:09,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:12:09,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:12:09,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:12:09,824 INFO L87 Difference]: Start difference. First operand 4894 states and 6570 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-23 04:12:11,363 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:12:13,392 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:12:17,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:12:17,865 INFO L93 Difference]: Finished difference Result 9992 states and 13573 transitions. [2022-07-23 04:12:17,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:12:17,865 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 132 [2022-07-23 04:12:17,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:12:17,877 INFO L225 Difference]: With dead ends: 9992 [2022-07-23 04:12:17,877 INFO L226 Difference]: Without dead ends: 5133 [2022-07-23 04:12:17,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-23 04:12:17,889 INFO L413 NwaCegarLoop]: 2243 mSDtfsCounter, 5371 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 1958 mSolverCounterSat, 3239 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5464 SdHoareTripleChecker+Valid, 2739 SdHoareTripleChecker+Invalid, 5197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3239 IncrementalHoareTripleChecker+Valid, 1958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2022-07-23 04:12:17,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5464 Valid, 2739 Invalid, 5197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3239 Valid, 1958 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2022-07-23 04:12:17,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5133 states. [2022-07-23 04:12:18,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5133 to 4884. [2022-07-23 04:12:18,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4884 states, 3342 states have (on average 1.2435667265110713) internal successors, (4156), 3442 states have internal predecessors, (4156), 1166 states have call successors, (1166), 347 states have call predecessors, (1166), 357 states have return successors, (1231), 1138 states have call predecessors, (1231), 1164 states have call successors, (1231) [2022-07-23 04:12:18,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4884 states to 4884 states and 6553 transitions. [2022-07-23 04:12:18,186 INFO L78 Accepts]: Start accepts. Automaton has 4884 states and 6553 transitions. Word has length 132 [2022-07-23 04:12:18,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:12:18,188 INFO L495 AbstractCegarLoop]: Abstraction has 4884 states and 6553 transitions. [2022-07-23 04:12:18,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-23 04:12:18,188 INFO L276 IsEmpty]: Start isEmpty. Operand 4884 states and 6553 transitions. [2022-07-23 04:12:18,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-23 04:12:18,190 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:12:18,191 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:12:18,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-23 04:12:18,191 INFO L420 AbstractCegarLoop]: === Iteration 17 === 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 28 more)] === [2022-07-23 04:12:18,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:12:18,192 INFO L85 PathProgramCache]: Analyzing trace with hash -199200027, now seen corresponding path program 1 times [2022-07-23 04:12:18,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:12:18,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987379505] [2022-07-23 04:12:18,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:12:18,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:12:18,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:18,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:12:18,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:18,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:12:18,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:18,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:12:18,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:18,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:12:18,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:18,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:12:18,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:18,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:12:18,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:18,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:12:18,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:18,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:12:18,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:18,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:12:18,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:18,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:12:18,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:18,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:12:18,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:18,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:12:18,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:18,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:12:18,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:18,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:12:18,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:18,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:12:18,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:18,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:12:18,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:18,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 04:12:18,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:18,466 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-23 04:12:18,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:12:18,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987379505] [2022-07-23 04:12:18,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987379505] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:12:18,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:12:18,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:12:18,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379929804] [2022-07-23 04:12:18,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:12:18,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:12:18,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:12:18,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:12:18,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:12:18,470 INFO L87 Difference]: Start difference. First operand 4884 states and 6553 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-23 04:12:20,491 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:12:21,907 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:12:26,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:12:26,447 INFO L93 Difference]: Finished difference Result 4884 states and 6553 transitions. [2022-07-23 04:12:26,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:12:26,451 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 114 [2022-07-23 04:12:26,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:12:26,461 INFO L225 Difference]: With dead ends: 4884 [2022-07-23 04:12:26,461 INFO L226 Difference]: Without dead ends: 4882 [2022-07-23 04:12:26,462 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-23 04:12:26,462 INFO L413 NwaCegarLoop]: 2216 mSDtfsCounter, 4652 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 2916 mSolverCounterSat, 2496 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4734 SdHoareTripleChecker+Valid, 2819 SdHoareTripleChecker+Invalid, 5413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2496 IncrementalHoareTripleChecker+Valid, 2916 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2022-07-23 04:12:26,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4734 Valid, 2819 Invalid, 5413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2496 Valid, 2916 Invalid, 1 Unknown, 0 Unchecked, 7.7s Time] [2022-07-23 04:12:26,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4882 states. [2022-07-23 04:12:26,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4882 to 4882. [2022-07-23 04:12:26,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4882 states, 3341 states have (on average 1.2433403172702784) internal successors, (4154), 3440 states have internal predecessors, (4154), 1166 states have call successors, (1166), 347 states have call predecessors, (1166), 357 states have return successors, (1231), 1138 states have call predecessors, (1231), 1164 states have call successors, (1231) [2022-07-23 04:12:26,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4882 states to 4882 states and 6551 transitions. [2022-07-23 04:12:26,740 INFO L78 Accepts]: Start accepts. Automaton has 4882 states and 6551 transitions. Word has length 114 [2022-07-23 04:12:26,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:12:26,740 INFO L495 AbstractCegarLoop]: Abstraction has 4882 states and 6551 transitions. [2022-07-23 04:12:26,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-23 04:12:26,741 INFO L276 IsEmpty]: Start isEmpty. Operand 4882 states and 6551 transitions. [2022-07-23 04:12:26,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-23 04:12:26,742 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:12:26,742 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:12:26,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-23 04:12:26,743 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-23 04:12:26,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:12:26,743 INFO L85 PathProgramCache]: Analyzing trace with hash 755987782, now seen corresponding path program 1 times [2022-07-23 04:12:26,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:12:26,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881137264] [2022-07-23 04:12:26,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:12:26,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:12:26,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:26,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:12:26,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:26,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:12:26,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:26,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:12:26,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:26,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:12:26,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:26,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:12:26,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:26,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:12:26,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:26,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:12:26,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:26,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:12:26,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:26,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:12:26,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:26,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:12:26,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:26,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:12:26,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:26,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:12:26,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:26,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:12:26,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:26,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:12:26,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:26,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:12:26,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:26,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:12:26,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:26,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 04:12:26,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:27,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 04:12:27,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:27,015 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-23 04:12:27,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:12:27,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881137264] [2022-07-23 04:12:27,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881137264] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:12:27,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:12:27,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:12:27,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334456958] [2022-07-23 04:12:27,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:12:27,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:12:27,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:12:27,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:12:27,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:12:27,019 INFO L87 Difference]: Start difference. First operand 4882 states and 6551 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-23 04:12:29,020 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:12:30,456 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:12:34,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:12:34,839 INFO L93 Difference]: Finished difference Result 4882 states and 6551 transitions. [2022-07-23 04:12:34,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:12:34,840 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 120 [2022-07-23 04:12:34,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:12:34,849 INFO L225 Difference]: With dead ends: 4882 [2022-07-23 04:12:34,849 INFO L226 Difference]: Without dead ends: 4880 [2022-07-23 04:12:34,850 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-23 04:12:34,850 INFO L413 NwaCegarLoop]: 2214 mSDtfsCounter, 4646 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 2915 mSolverCounterSat, 2496 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4727 SdHoareTripleChecker+Valid, 2817 SdHoareTripleChecker+Invalid, 5411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2496 IncrementalHoareTripleChecker+Valid, 2915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2022-07-23 04:12:34,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4727 Valid, 2817 Invalid, 5411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2496 Valid, 2915 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2022-07-23 04:12:34,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4880 states. [2022-07-23 04:12:35,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4880 to 4880. [2022-07-23 04:12:35,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4880 states, 3340 states have (on average 1.2431137724550898) internal successors, (4152), 3438 states have internal predecessors, (4152), 1166 states have call successors, (1166), 347 states have call predecessors, (1166), 357 states have return successors, (1231), 1138 states have call predecessors, (1231), 1164 states have call successors, (1231) [2022-07-23 04:12:35,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4880 states to 4880 states and 6549 transitions. [2022-07-23 04:12:35,073 INFO L78 Accepts]: Start accepts. Automaton has 4880 states and 6549 transitions. Word has length 120 [2022-07-23 04:12:35,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:12:35,073 INFO L495 AbstractCegarLoop]: Abstraction has 4880 states and 6549 transitions. [2022-07-23 04:12:35,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-23 04:12:35,073 INFO L276 IsEmpty]: Start isEmpty. Operand 4880 states and 6549 transitions. [2022-07-23 04:12:35,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-07-23 04:12:35,075 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:12:35,075 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:12:35,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-23 04:12:35,075 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-23 04:12:35,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:12:35,076 INFO L85 PathProgramCache]: Analyzing trace with hash 453861164, now seen corresponding path program 1 times [2022-07-23 04:12:35,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:12:35,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862767255] [2022-07-23 04:12:35,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:12:35,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:12:35,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:35,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:12:35,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:35,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:12:35,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:35,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:12:35,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:35,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:12:35,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:35,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:12:35,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:35,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:12:35,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:35,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:12:35,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:35,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:12:35,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:35,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:12:35,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:35,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:12:35,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:35,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:12:35,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:35,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:12:35,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:35,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:12:35,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:35,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:12:35,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:35,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:12:35,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:35,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:12:35,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:35,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 04:12:35,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:35,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 04:12:35,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:35,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:12:35,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:35,368 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-23 04:12:35,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:12:35,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862767255] [2022-07-23 04:12:35,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862767255] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:12:35,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:12:35,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:12:35,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070667027] [2022-07-23 04:12:35,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:12:35,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:12:35,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:12:35,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:12:35,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:12:35,371 INFO L87 Difference]: Start difference. First operand 4880 states and 6549 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-23 04:12:36,489 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:12:37,703 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:12:42,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:12:42,259 INFO L93 Difference]: Finished difference Result 4880 states and 6549 transitions. [2022-07-23 04:12:42,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:12:42,259 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 126 [2022-07-23 04:12:42,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:12:42,269 INFO L225 Difference]: With dead ends: 4880 [2022-07-23 04:12:42,269 INFO L226 Difference]: Without dead ends: 4878 [2022-07-23 04:12:42,270 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-23 04:12:42,270 INFO L413 NwaCegarLoop]: 2212 mSDtfsCounter, 4640 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 2913 mSolverCounterSat, 2496 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4720 SdHoareTripleChecker+Valid, 2815 SdHoareTripleChecker+Invalid, 5409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2496 IncrementalHoareTripleChecker+Valid, 2913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-07-23 04:12:42,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4720 Valid, 2815 Invalid, 5409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2496 Valid, 2913 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2022-07-23 04:12:42,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4878 states. [2022-07-23 04:12:42,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4878 to 4878. [2022-07-23 04:12:42,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4878 states, 3339 states have (on average 1.2428870919436956) internal successors, (4150), 3436 states have internal predecessors, (4150), 1166 states have call successors, (1166), 347 states have call predecessors, (1166), 357 states have return successors, (1231), 1138 states have call predecessors, (1231), 1164 states have call successors, (1231) [2022-07-23 04:12:42,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4878 states to 4878 states and 6547 transitions. [2022-07-23 04:12:42,502 INFO L78 Accepts]: Start accepts. Automaton has 4878 states and 6547 transitions. Word has length 126 [2022-07-23 04:12:42,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:12:42,502 INFO L495 AbstractCegarLoop]: Abstraction has 4878 states and 6547 transitions. [2022-07-23 04:12:42,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-23 04:12:42,503 INFO L276 IsEmpty]: Start isEmpty. Operand 4878 states and 6547 transitions. [2022-07-23 04:12:42,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-07-23 04:12:42,505 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:12:42,505 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:12:42,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-23 04:12:42,505 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-23 04:12:42,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:12:42,506 INFO L85 PathProgramCache]: Analyzing trace with hash 51485224, now seen corresponding path program 1 times [2022-07-23 04:12:42,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:12:42,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682260313] [2022-07-23 04:12:42,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:12:42,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:12:42,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:42,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:12:42,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:42,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:12:42,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:42,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:12:42,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:42,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:12:42,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:42,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:12:42,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:42,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:12:42,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:42,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:12:42,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:42,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:12:42,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:42,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:12:42,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:42,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:12:42,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:42,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:12:42,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:42,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:12:42,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:42,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:12:42,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:42,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:12:42,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:42,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:12:42,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:42,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:12:42,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:42,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 04:12:42,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:42,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 04:12:42,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:42,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:12:42,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:42,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-23 04:12:42,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:12:42,799 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-23 04:12:42,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:12:42,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682260313] [2022-07-23 04:12:42,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682260313] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:12:42,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:12:42,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:12:42,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069007178] [2022-07-23 04:12:42,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:12:42,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:12:42,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:12:42,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:12:42,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:12:42,802 INFO L87 Difference]: Start difference. First operand 4878 states and 6547 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-23 04:12:44,823 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:12:46,830 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []