./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--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0f8a17c6 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.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 dc9e8bb6b40f5555d57e381f2a097a5016cb2e1f56429745ab057291759776aa --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-17 12:39:44,156 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-17 12:39:44,159 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-17 12:39:44,202 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-17 12:39:44,203 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-17 12:39:44,205 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-17 12:39:44,207 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-17 12:39:44,209 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-17 12:39:44,211 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-17 12:39:44,214 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-17 12:39:44,215 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-17 12:39:44,216 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-17 12:39:44,216 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-17 12:39:44,218 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-17 12:39:44,220 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-17 12:39:44,222 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-17 12:39:44,224 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-17 12:39:44,224 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-17 12:39:44,226 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-17 12:39:44,231 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-17 12:39:44,232 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-17 12:39:44,233 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-17 12:39:44,234 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-17 12:39:44,235 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-17 12:39:44,239 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-17 12:39:44,240 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-17 12:39:44,240 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-17 12:39:44,241 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-17 12:39:44,242 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-17 12:39:44,243 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-17 12:39:44,243 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-17 12:39:44,244 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-17 12:39:44,245 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-17 12:39:44,246 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-17 12:39:44,247 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-17 12:39:44,247 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-17 12:39:44,248 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-17 12:39:44,248 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-17 12:39:44,248 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-17 12:39:44,249 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-17 12:39:44,250 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-17 12:39:44,250 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-17 12:39:44,272 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-17 12:39:44,273 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-17 12:39:44,273 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-17 12:39:44,273 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-17 12:39:44,274 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-17 12:39:44,275 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-17 12:39:44,275 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-17 12:39:44,275 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-17 12:39:44,275 INFO L138 SettingsManager]: * Use SBE=true [2021-11-17 12:39:44,276 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-17 12:39:44,276 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-17 12:39:44,276 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-17 12:39:44,277 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-17 12:39:44,277 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-17 12:39:44,277 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-17 12:39:44,277 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-17 12:39:44,277 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-17 12:39:44,277 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-17 12:39:44,278 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-17 12:39:44,278 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-17 12:39:44,278 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-17 12:39:44,278 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-17 12:39:44,278 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-17 12:39:44,279 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-17 12:39:44,279 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-17 12:39:44,279 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-17 12:39:44,280 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-17 12:39:44,280 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-17 12:39:44,280 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-17 12:39:44,280 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-17 12:39:44,281 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-17 12:39:44,281 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 -> dc9e8bb6b40f5555d57e381f2a097a5016cb2e1f56429745ab057291759776aa [2021-11-17 12:39:44,494 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-17 12:39:44,517 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-17 12:39:44,519 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-17 12:39:44,520 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-17 12:39:44,521 INFO L275 PluginConnector]: CDTParser initialized [2021-11-17 12:39:44,522 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--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i [2021-11-17 12:39:44,576 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2dfe9a1a/0ce10e0efaff435c8441cf3a0037cb21/FLAG680ffc394 [2021-11-17 12:39:45,321 INFO L306 CDTParser]: Found 1 translation units. [2021-11-17 12:39:45,322 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i [2021-11-17 12:39:45,383 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2dfe9a1a/0ce10e0efaff435c8441cf3a0037cb21/FLAG680ffc394 [2021-11-17 12:39:45,605 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2dfe9a1a/0ce10e0efaff435c8441cf3a0037cb21 [2021-11-17 12:39:45,608 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-17 12:39:45,609 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-17 12:39:45,612 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-17 12:39:45,612 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-17 12:39:45,615 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-17 12:39:45,616 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:39:45" (1/1) ... [2021-11-17 12:39:45,616 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43daa9e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:39:45, skipping insertion in model container [2021-11-17 12:39:45,617 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:39:45" (1/1) ... [2021-11-17 12:39:45,622 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-17 12:39:45,780 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-17 12:39:49,615 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[558734,558747] [2021-11-17 12:39:49,618 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[558879,558892] [2021-11-17 12:39:49,618 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[559025,559038] [2021-11-17 12:39:49,619 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[559190,559203] [2021-11-17 12:39:49,619 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[559348,559361] [2021-11-17 12:39:49,619 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[559506,559519] [2021-11-17 12:39:49,620 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[559664,559677] [2021-11-17 12:39:49,620 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[559824,559837] [2021-11-17 12:39:49,620 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[559983,559996] [2021-11-17 12:39:49,621 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[560122,560135] [2021-11-17 12:39:49,621 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[560264,560277] [2021-11-17 12:39:49,621 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[560413,560426] [2021-11-17 12:39:49,622 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[560552,560565] [2021-11-17 12:39:49,622 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[560707,560720] [2021-11-17 12:39:49,622 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[560867,560880] [2021-11-17 12:39:49,622 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[561018,561031] [2021-11-17 12:39:49,623 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[561169,561182] [2021-11-17 12:39:49,623 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[561321,561334] [2021-11-17 12:39:49,629 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[561470,561483] [2021-11-17 12:39:49,631 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[561618,561631] [2021-11-17 12:39:49,632 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[561775,561788] [2021-11-17 12:39:49,632 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[561924,561937] [2021-11-17 12:39:49,632 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[562080,562093] [2021-11-17 12:39:49,632 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[562233,562246] [2021-11-17 12:39:49,633 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[562379,562392] [2021-11-17 12:39:49,634 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[562522,562535] [2021-11-17 12:39:49,634 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[562674,562687] [2021-11-17 12:39:49,634 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[562820,562833] [2021-11-17 12:39:49,635 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[562965,562978] [2021-11-17 12:39:49,636 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[563119,563132] [2021-11-17 12:39:49,637 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[563270,563283] [2021-11-17 12:39:49,637 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[563425,563438] [2021-11-17 12:39:49,638 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[563577,563590] [2021-11-17 12:39:49,638 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[563732,563745] [2021-11-17 12:39:49,640 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[563896,563909] [2021-11-17 12:39:49,641 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[564052,564065] [2021-11-17 12:39:49,641 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[564216,564229] [2021-11-17 12:39:49,641 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[564358,564371] [2021-11-17 12:39:49,642 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[564516,564529] [2021-11-17 12:39:49,642 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[564683,564696] [2021-11-17 12:39:49,643 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[564842,564855] [2021-11-17 12:39:49,643 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[565001,565014] [2021-11-17 12:39:49,643 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[565150,565163] [2021-11-17 12:39:49,644 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[565297,565310] [2021-11-17 12:39:49,644 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[565436,565449] [2021-11-17 12:39:49,644 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[565599,565612] [2021-11-17 12:39:49,645 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[565765,565778] [2021-11-17 12:39:49,646 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[565929,565942] [2021-11-17 12:39:49,646 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[566094,566107] [2021-11-17 12:39:49,646 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[566259,566272] [2021-11-17 12:39:49,647 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[566425,566438] [2021-11-17 12:39:49,647 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[566590,566603] [2021-11-17 12:39:49,647 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[566757,566770] [2021-11-17 12:39:49,648 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[566917,566930] [2021-11-17 12:39:49,648 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[567079,567092] [2021-11-17 12:39:49,654 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[567238,567251] [2021-11-17 12:39:49,655 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[567384,567397] [2021-11-17 12:39:49,655 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[567527,567540] [2021-11-17 12:39:49,656 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[567671,567684] [2021-11-17 12:39:49,656 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[567814,567827] [2021-11-17 12:39:49,656 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[567958,567971] [2021-11-17 12:39:49,657 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[568099,568112] [2021-11-17 12:39:49,657 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[568237,568250] [2021-11-17 12:39:49,657 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[568395,568408] [2021-11-17 12:39:49,657 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[568554,568567] [2021-11-17 12:39:49,658 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[568710,568723] [2021-11-17 12:39:49,658 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[568859,568872] [2021-11-17 12:39:49,658 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[569011,569024] [2021-11-17 12:39:49,658 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[569162,569175] [2021-11-17 12:39:49,659 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[569311,569324] [2021-11-17 12:39:49,659 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[569463,569476] [2021-11-17 12:39:49,659 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[569611,569624] [2021-11-17 12:39:49,660 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[569764,569777] [2021-11-17 12:39:49,660 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[569915,569928] [2021-11-17 12:39:49,660 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[570065,570078] [2021-11-17 12:39:49,660 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[570212,570225] [2021-11-17 12:39:49,661 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[570363,570376] [2021-11-17 12:39:49,661 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[570514,570527] [2021-11-17 12:39:49,661 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[570662,570675] [2021-11-17 12:39:49,661 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[570828,570841] [2021-11-17 12:39:49,662 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[570997,571010] [2021-11-17 12:39:49,662 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[571164,571177] [2021-11-17 12:39:49,662 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[571332,571345] [2021-11-17 12:39:49,663 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[571482,571495] [2021-11-17 12:39:49,663 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[571629,571642] [2021-11-17 12:39:49,663 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[571790,571803] [2021-11-17 12:39:49,663 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[571960,571973] [2021-11-17 12:39:49,664 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[572122,572135] [2021-11-17 12:39:49,671 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-17 12:39:49,722 INFO L203 MainTranslator]: Completed pre-run [2021-11-17 12:39:50,089 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[558734,558747] [2021-11-17 12:39:50,091 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[558879,558892] [2021-11-17 12:39:50,091 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[559025,559038] [2021-11-17 12:39:50,092 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[559190,559203] [2021-11-17 12:39:50,092 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[559348,559361] [2021-11-17 12:39:50,092 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[559506,559519] [2021-11-17 12:39:50,093 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[559664,559677] [2021-11-17 12:39:50,093 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[559824,559837] [2021-11-17 12:39:50,094 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[559983,559996] [2021-11-17 12:39:50,097 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[560122,560135] [2021-11-17 12:39:50,098 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[560264,560277] [2021-11-17 12:39:50,101 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[560413,560426] [2021-11-17 12:39:50,101 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[560552,560565] [2021-11-17 12:39:50,101 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[560707,560720] [2021-11-17 12:39:50,102 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[560867,560880] [2021-11-17 12:39:50,102 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[561018,561031] [2021-11-17 12:39:50,102 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[561169,561182] [2021-11-17 12:39:50,103 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[561321,561334] [2021-11-17 12:39:50,103 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[561470,561483] [2021-11-17 12:39:50,103 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[561618,561631] [2021-11-17 12:39:50,103 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[561775,561788] [2021-11-17 12:39:50,104 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[561924,561937] [2021-11-17 12:39:50,105 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[562080,562093] [2021-11-17 12:39:50,105 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[562233,562246] [2021-11-17 12:39:50,105 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[562379,562392] [2021-11-17 12:39:50,105 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[562522,562535] [2021-11-17 12:39:50,106 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[562674,562687] [2021-11-17 12:39:50,106 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[562820,562833] [2021-11-17 12:39:50,107 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[562965,562978] [2021-11-17 12:39:50,107 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[563119,563132] [2021-11-17 12:39:50,107 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[563270,563283] [2021-11-17 12:39:50,108 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[563425,563438] [2021-11-17 12:39:50,108 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[563577,563590] [2021-11-17 12:39:50,108 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[563732,563745] [2021-11-17 12:39:50,109 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[563896,563909] [2021-11-17 12:39:50,109 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[564052,564065] [2021-11-17 12:39:50,110 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[564216,564229] [2021-11-17 12:39:50,110 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[564358,564371] [2021-11-17 12:39:50,110 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[564516,564529] [2021-11-17 12:39:50,111 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[564683,564696] [2021-11-17 12:39:50,111 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[564842,564855] [2021-11-17 12:39:50,112 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[565001,565014] [2021-11-17 12:39:50,112 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[565150,565163] [2021-11-17 12:39:50,112 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[565297,565310] [2021-11-17 12:39:50,113 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[565436,565449] [2021-11-17 12:39:50,113 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[565599,565612] [2021-11-17 12:39:50,113 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[565765,565778] [2021-11-17 12:39:50,114 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[565929,565942] [2021-11-17 12:39:50,114 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[566094,566107] [2021-11-17 12:39:50,114 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[566259,566272] [2021-11-17 12:39:50,115 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[566425,566438] [2021-11-17 12:39:50,115 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[566590,566603] [2021-11-17 12:39:50,115 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[566757,566770] [2021-11-17 12:39:50,115 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[566917,566930] [2021-11-17 12:39:50,116 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[567079,567092] [2021-11-17 12:39:50,116 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[567238,567251] [2021-11-17 12:39:50,116 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[567384,567397] [2021-11-17 12:39:50,116 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[567527,567540] [2021-11-17 12:39:50,117 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[567671,567684] [2021-11-17 12:39:50,117 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[567814,567827] [2021-11-17 12:39:50,118 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[567958,567971] [2021-11-17 12:39:50,118 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[568099,568112] [2021-11-17 12:39:50,119 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[568237,568250] [2021-11-17 12:39:50,121 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[568395,568408] [2021-11-17 12:39:50,121 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[568554,568567] [2021-11-17 12:39:50,121 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[568710,568723] [2021-11-17 12:39:50,122 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[568859,568872] [2021-11-17 12:39:50,122 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[569011,569024] [2021-11-17 12:39:50,123 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[569162,569175] [2021-11-17 12:39:50,123 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[569311,569324] [2021-11-17 12:39:50,124 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[569463,569476] [2021-11-17 12:39:50,124 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[569611,569624] [2021-11-17 12:39:50,128 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[569764,569777] [2021-11-17 12:39:50,128 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[569915,569928] [2021-11-17 12:39:50,131 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[570065,570078] [2021-11-17 12:39:50,131 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[570212,570225] [2021-11-17 12:39:50,132 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[570363,570376] [2021-11-17 12:39:50,132 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[570514,570527] [2021-11-17 12:39:50,133 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[570662,570675] [2021-11-17 12:39:50,133 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[570828,570841] [2021-11-17 12:39:50,134 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[570997,571010] [2021-11-17 12:39:50,134 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[571164,571177] [2021-11-17 12:39:50,135 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[571332,571345] [2021-11-17 12:39:50,135 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[571482,571495] [2021-11-17 12:39:50,135 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[571629,571642] [2021-11-17 12:39:50,136 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[571790,571803] [2021-11-17 12:39:50,136 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[571960,571973] [2021-11-17 12:39:50,136 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i[572122,572135] [2021-11-17 12:39:50,138 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-17 12:39:50,351 INFO L208 MainTranslator]: Completed translation [2021-11-17 12:39:50,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:39:50 WrapperNode [2021-11-17 12:39:50,352 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-17 12:39:50,353 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-17 12:39:50,353 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-17 12:39:50,353 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-17 12:39:50,357 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:39:50" (1/1) ... [2021-11-17 12:39:50,458 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:39:50" (1/1) ... [2021-11-17 12:39:50,665 INFO L137 Inliner]: procedures = 593, calls = 4545, calls flagged for inlining = 256, calls inlined = 167, statements flattened = 7416 [2021-11-17 12:39:50,666 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-17 12:39:50,667 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-17 12:39:50,667 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-17 12:39:50,667 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-17 12:39:50,673 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:39:50" (1/1) ... [2021-11-17 12:39:50,673 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:39:50" (1/1) ... [2021-11-17 12:39:50,697 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:39:50" (1/1) ... [2021-11-17 12:39:50,698 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:39:50" (1/1) ... [2021-11-17 12:39:50,789 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:39:50" (1/1) ... [2021-11-17 12:39:50,805 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:39:50" (1/1) ... [2021-11-17 12:39:50,837 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:39:50" (1/1) ... [2021-11-17 12:39:50,873 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-17 12:39:50,873 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-17 12:39:50,874 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-17 12:39:50,874 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-17 12:39:50,874 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:39:50" (1/1) ... [2021-11-17 12:39:50,879 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-17 12:39:50,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 12:39:50,897 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-17 12:39:50,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-17 12:39:50,930 INFO L130 BoogieDeclarations]: Found specification of procedure mxl111sf_read_reg [2021-11-17 12:39:50,931 INFO L138 BoogieDeclarations]: Found implementation of procedure mxl111sf_read_reg [2021-11-17 12:39:50,931 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2021-11-17 12:39:50,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2021-11-17 12:39:50,931 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-11-17 12:39:50,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-11-17 12:39:50,932 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2021-11-17 12:39:50,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2021-11-17 12:39:50,932 INFO L130 BoogieDeclarations]: Found specification of procedure mxl111sf_lg2160_frontend_attach [2021-11-17 12:39:50,932 INFO L138 BoogieDeclarations]: Found implementation of procedure mxl111sf_lg2160_frontend_attach [2021-11-17 12:39:50,932 INFO L130 BoogieDeclarations]: Found specification of procedure mxl111sf_i2c_stop [2021-11-17 12:39:50,932 INFO L138 BoogieDeclarations]: Found implementation of procedure mxl111sf_i2c_stop [2021-11-17 12:39:50,932 INFO L130 BoogieDeclarations]: Found specification of procedure mxl111sf_config_pin_mux_modes [2021-11-17 12:39:50,932 INFO L138 BoogieDeclarations]: Found implementation of procedure mxl111sf_config_pin_mux_modes [2021-11-17 12:39:50,932 INFO L130 BoogieDeclarations]: Found specification of procedure mxl111sf_i2c_start [2021-11-17 12:39:50,932 INFO L138 BoogieDeclarations]: Found implementation of procedure mxl111sf_i2c_start [2021-11-17 12:39:50,933 INFO L130 BoogieDeclarations]: Found specification of procedure mxl111sf_i2c_xfer [2021-11-17 12:39:50,933 INFO L138 BoogieDeclarations]: Found implementation of procedure mxl111sf_i2c_xfer [2021-11-17 12:39:50,934 INFO L130 BoogieDeclarations]: Found specification of procedure __symbol_put [2021-11-17 12:39:50,934 INFO L138 BoogieDeclarations]: Found implementation of procedure __symbol_put [2021-11-17 12:39:50,934 INFO L130 BoogieDeclarations]: Found specification of procedure mxl111sf_stream_config_isoc [2021-11-17 12:39:50,934 INFO L138 BoogieDeclarations]: Found implementation of procedure mxl111sf_stream_config_isoc [2021-11-17 12:39:50,934 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2021-11-17 12:39:50,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2021-11-17 12:39:50,934 INFO L130 BoogieDeclarations]: Found specification of procedure mxl111sf_frontend_attach_atsc [2021-11-17 12:39:50,934 INFO L138 BoogieDeclarations]: Found implementation of procedure mxl111sf_frontend_attach_atsc [2021-11-17 12:39:50,934 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2021-11-17 12:39:50,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2021-11-17 12:39:50,935 INFO L130 BoogieDeclarations]: Found specification of procedure mxl111sf_write_reg_mask [2021-11-17 12:39:50,935 INFO L138 BoogieDeclarations]: Found implementation of procedure mxl111sf_write_reg_mask [2021-11-17 12:39:50,935 INFO L130 BoogieDeclarations]: Found specification of procedure mxl1x1sf_soft_reset [2021-11-17 12:39:50,935 INFO L138 BoogieDeclarations]: Found implementation of procedure mxl1x1sf_soft_reset [2021-11-17 12:39:50,935 INFO L130 BoogieDeclarations]: Found specification of procedure mxl111sf_stream_config_bulk [2021-11-17 12:39:50,935 INFO L138 BoogieDeclarations]: Found implementation of procedure mxl111sf_stream_config_bulk [2021-11-17 12:39:50,935 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2021-11-17 12:39:50,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2021-11-17 12:39:50,935 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2021-11-17 12:39:50,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2021-11-17 12:39:50,936 INFO L130 BoogieDeclarations]: Found specification of procedure mxl111sf_init_tuner_demod [2021-11-17 12:39:50,936 INFO L138 BoogieDeclarations]: Found implementation of procedure mxl111sf_init_tuner_demod [2021-11-17 12:39:50,936 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2021-11-17 12:39:50,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2021-11-17 12:39:50,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-17 12:39:50,936 INFO L130 BoogieDeclarations]: Found specification of procedure mxl111sf_lgdt3305_frontend_attach [2021-11-17 12:39:50,936 INFO L138 BoogieDeclarations]: Found implementation of procedure mxl111sf_lgdt3305_frontend_attach [2021-11-17 12:39:50,936 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2021-11-17 12:39:50,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2021-11-17 12:39:50,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-11-17 12:39:50,937 INFO L130 BoogieDeclarations]: Found specification of procedure mxl111sf_ctrl_msg [2021-11-17 12:39:50,937 INFO L138 BoogieDeclarations]: Found implementation of procedure mxl111sf_ctrl_msg [2021-11-17 12:39:50,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-17 12:39:50,937 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2021-11-17 12:39:50,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2021-11-17 12:39:50,937 INFO L130 BoogieDeclarations]: Found specification of procedure mxl111sf_ep4_streaming_ctrl [2021-11-17 12:39:50,937 INFO L138 BoogieDeclarations]: Found implementation of procedure mxl111sf_ep4_streaming_ctrl [2021-11-17 12:39:50,938 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2021-11-17 12:39:50,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2021-11-17 12:39:50,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-17 12:39:50,938 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2021-11-17 12:39:50,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2021-11-17 12:39:50,938 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2021-11-17 12:39:50,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2021-11-17 12:39:50,938 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2021-11-17 12:39:50,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2021-11-17 12:39:50,938 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2021-11-17 12:39:50,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2021-11-17 12:39:50,939 INFO L130 BoogieDeclarations]: Found specification of procedure mxl111sf_hw_set_gpio [2021-11-17 12:39:50,939 INFO L138 BoogieDeclarations]: Found implementation of procedure mxl111sf_hw_set_gpio [2021-11-17 12:39:50,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-17 12:39:50,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-17 12:39:50,939 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2021-11-17 12:39:50,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2021-11-17 12:39:50,942 INFO L130 BoogieDeclarations]: Found specification of procedure mxl111sf_ctrl_program_regs [2021-11-17 12:39:50,942 INFO L138 BoogieDeclarations]: Found implementation of procedure mxl111sf_ctrl_program_regs [2021-11-17 12:39:50,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-17 12:39:50,942 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2021-11-17 12:39:50,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2021-11-17 12:39:50,942 INFO L130 BoogieDeclarations]: Found specification of procedure mxl111sf_gpio_mode_switch [2021-11-17 12:39:50,942 INFO L138 BoogieDeclarations]: Found implementation of procedure mxl111sf_gpio_mode_switch [2021-11-17 12:39:50,943 INFO L130 BoogieDeclarations]: Found specification of procedure mxl111sf_set_ant_path [2021-11-17 12:39:50,943 INFO L138 BoogieDeclarations]: Found implementation of procedure mxl111sf_set_ant_path [2021-11-17 12:39:50,944 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_usbv2_disconnect [2021-11-17 12:39:50,944 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_usbv2_disconnect [2021-11-17 12:39:50,944 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2021-11-17 12:39:50,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2021-11-17 12:39:50,944 INFO L130 BoogieDeclarations]: Found specification of procedure mxl111sf_frontend_attach_atsc_mh [2021-11-17 12:39:50,944 INFO L138 BoogieDeclarations]: Found implementation of procedure mxl111sf_frontend_attach_atsc_mh [2021-11-17 12:39:50,944 INFO L130 BoogieDeclarations]: Found specification of procedure mxl111sf_attach_demod [2021-11-17 12:39:50,944 INFO L138 BoogieDeclarations]: Found implementation of procedure mxl111sf_attach_demod [2021-11-17 12:39:50,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-17 12:39:50,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-17 12:39:50,945 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_fe_lock_of_mxl111sf_state [2021-11-17 12:39:50,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_fe_lock_of_mxl111sf_state [2021-11-17 12:39:50,945 INFO L130 BoogieDeclarations]: Found specification of procedure mxl111sf_streaming_ctrl_mercury_mh [2021-11-17 12:39:50,945 INFO L138 BoogieDeclarations]: Found implementation of procedure mxl111sf_streaming_ctrl_mercury_mh [2021-11-17 12:39:50,945 INFO L130 BoogieDeclarations]: Found specification of procedure mxl111sf_frontend_attach_mercury [2021-11-17 12:39:50,945 INFO L138 BoogieDeclarations]: Found implementation of procedure mxl111sf_frontend_attach_mercury [2021-11-17 12:39:50,945 INFO L130 BoogieDeclarations]: Found specification of procedure msleep [2021-11-17 12:39:50,945 INFO L138 BoogieDeclarations]: Found implementation of procedure msleep [2021-11-17 12:39:50,945 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-17 12:39:50,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-17 12:39:50,946 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2021-11-17 12:39:50,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2021-11-17 12:39:50,946 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_interface [2021-11-17 12:39:50,946 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_interface [2021-11-17 12:39:50,946 INFO L130 BoogieDeclarations]: Found specification of procedure mxl111sf_adap_fe_sleep [2021-11-17 12:39:50,946 INFO L138 BoogieDeclarations]: Found implementation of procedure mxl111sf_adap_fe_sleep [2021-11-17 12:39:50,946 INFO L130 BoogieDeclarations]: Found specification of procedure mxl111sf_frontend_attach_mh [2021-11-17 12:39:50,946 INFO L138 BoogieDeclarations]: Found implementation of procedure mxl111sf_frontend_attach_mh [2021-11-17 12:39:50,946 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2021-11-17 12:39:50,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2021-11-17 12:39:50,946 INFO L130 BoogieDeclarations]: Found specification of procedure mxl111sf_ep6_streaming_ctrl [2021-11-17 12:39:50,947 INFO L138 BoogieDeclarations]: Found implementation of procedure mxl111sf_ep6_streaming_ctrl [2021-11-17 12:39:50,947 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2021-11-17 12:39:50,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2021-11-17 12:39:50,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-17 12:39:50,947 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2021-11-17 12:39:50,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2021-11-17 12:39:50,947 INFO L130 BoogieDeclarations]: Found specification of procedure mxl111sf_init [2021-11-17 12:39:50,947 INFO L138 BoogieDeclarations]: Found implementation of procedure mxl111sf_init [2021-11-17 12:39:50,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-17 12:39:50,948 INFO L130 BoogieDeclarations]: Found specification of procedure mxl111sf_adap_fe_init [2021-11-17 12:39:50,948 INFO L138 BoogieDeclarations]: Found implementation of procedure mxl111sf_adap_fe_init [2021-11-17 12:39:50,948 INFO L130 BoogieDeclarations]: Found specification of procedure mxl111sf_i2c_bitbang_sendbyte [2021-11-17 12:39:50,948 INFO L138 BoogieDeclarations]: Found implementation of procedure mxl111sf_i2c_bitbang_sendbyte [2021-11-17 12:39:50,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-17 12:39:50,948 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2021-11-17 12:39:50,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2021-11-17 12:39:50,949 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2021-11-17 12:39:50,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2021-11-17 12:39:50,949 INFO L130 BoogieDeclarations]: Found specification of procedure mxl111sf_i2c_check_status [2021-11-17 12:39:50,949 INFO L138 BoogieDeclarations]: Found implementation of procedure mxl111sf_i2c_check_status [2021-11-17 12:39:50,949 INFO L130 BoogieDeclarations]: Found specification of procedure mxl111sf_ep5_streaming_ctrl [2021-11-17 12:39:50,949 INFO L138 BoogieDeclarations]: Found implementation of procedure mxl111sf_ep5_streaming_ctrl [2021-11-17 12:39:50,949 INFO L130 BoogieDeclarations]: Found specification of procedure mxl111sf_frontend_attach_dvbt [2021-11-17 12:39:50,949 INFO L138 BoogieDeclarations]: Found implementation of procedure mxl111sf_frontend_attach_dvbt [2021-11-17 12:39:50,949 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2021-11-17 12:39:50,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2021-11-17 12:39:50,950 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2021-11-17 12:39:50,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2021-11-17 12:39:50,950 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2021-11-17 12:39:50,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2021-11-17 12:39:50,950 INFO L130 BoogieDeclarations]: Found specification of procedure mxl111sf_set_gpio [2021-11-17 12:39:50,950 INFO L138 BoogieDeclarations]: Found implementation of procedure mxl111sf_set_gpio [2021-11-17 12:39:50,950 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~$Pointer$ [2021-11-17 12:39:50,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~$Pointer$ [2021-11-17 12:39:50,950 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2021-11-17 12:39:50,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2021-11-17 12:39:50,950 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2021-11-17 12:39:50,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2021-11-17 12:39:50,951 INFO L130 BoogieDeclarations]: Found specification of procedure mxl111sf_lg2161_ep6_frontend_attach [2021-11-17 12:39:50,951 INFO L138 BoogieDeclarations]: Found implementation of procedure mxl111sf_lg2161_ep6_frontend_attach [2021-11-17 12:39:50,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-17 12:39:50,951 INFO L130 BoogieDeclarations]: Found specification of procedure mxl1x1sf_get_chip_info [2021-11-17 12:39:50,951 INFO L138 BoogieDeclarations]: Found implementation of procedure mxl1x1sf_get_chip_info [2021-11-17 12:39:50,951 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2021-11-17 12:39:50,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2021-11-17 12:39:50,951 INFO L130 BoogieDeclarations]: Found specification of procedure mxl111sf_frontend_attach_mercury_mh [2021-11-17 12:39:50,951 INFO L138 BoogieDeclarations]: Found implementation of procedure mxl111sf_frontend_attach_mercury_mh [2021-11-17 12:39:50,951 INFO L130 BoogieDeclarations]: Found specification of procedure mxl111sf_enable_usb_output [2021-11-17 12:39:50,952 INFO L138 BoogieDeclarations]: Found implementation of procedure mxl111sf_enable_usb_output [2021-11-17 12:39:50,952 INFO L130 BoogieDeclarations]: Found specification of procedure i2c_transfer [2021-11-17 12:39:50,952 INFO L138 BoogieDeclarations]: Found implementation of procedure i2c_transfer [2021-11-17 12:39:50,952 INFO L130 BoogieDeclarations]: Found specification of procedure mxl111sf_attach_tuner [2021-11-17 12:39:50,952 INFO L138 BoogieDeclarations]: Found implementation of procedure mxl111sf_attach_tuner [2021-11-17 12:39:50,952 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2021-11-17 12:39:50,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2021-11-17 12:39:50,952 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2021-11-17 12:39:50,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2021-11-17 12:39:50,952 INFO L130 BoogieDeclarations]: Found specification of procedure mxl1x1sf_set_device_mode [2021-11-17 12:39:50,953 INFO L138 BoogieDeclarations]: Found implementation of procedure mxl1x1sf_set_device_mode [2021-11-17 12:39:50,953 INFO L130 BoogieDeclarations]: Found specification of procedure __symbol_get [2021-11-17 12:39:50,953 INFO L138 BoogieDeclarations]: Found implementation of procedure __symbol_get [2021-11-17 12:39:50,953 INFO L130 BoogieDeclarations]: Found specification of procedure mxl111sf_write_reg [2021-11-17 12:39:50,953 INFO L138 BoogieDeclarations]: Found implementation of procedure mxl111sf_write_reg [2021-11-17 12:39:50,953 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2021-11-17 12:39:50,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2021-11-17 12:39:50,953 INFO L130 BoogieDeclarations]: Found specification of procedure mxl111sf_i2c_func [2021-11-17 12:39:50,953 INFO L138 BoogieDeclarations]: Found implementation of procedure mxl111sf_i2c_func [2021-11-17 12:39:50,953 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2021-11-17 12:39:50,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2021-11-17 12:39:50,954 INFO L130 BoogieDeclarations]: Found specification of procedure mxl111sf_ant_hunt [2021-11-17 12:39:50,954 INFO L138 BoogieDeclarations]: Found implementation of procedure mxl111sf_ant_hunt [2021-11-17 12:39:50,954 INFO L130 BoogieDeclarations]: Found specification of procedure mxl111sf_init_port_expander [2021-11-17 12:39:50,954 INFO L138 BoogieDeclarations]: Found implementation of procedure mxl111sf_init_port_expander [2021-11-17 12:39:50,954 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2021-11-17 12:39:50,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2021-11-17 12:39:50,954 INFO L130 BoogieDeclarations]: Found specification of procedure mxl111sf_i2c_send_data [2021-11-17 12:39:50,954 INFO L138 BoogieDeclarations]: Found implementation of procedure mxl111sf_i2c_send_data [2021-11-17 12:39:50,954 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_usbv2_resume [2021-11-17 12:39:50,954 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_usbv2_resume [2021-11-17 12:39:50,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-17 12:39:50,955 INFO L130 BoogieDeclarations]: Found specification of procedure mxl111sf_i2c_get_data [2021-11-17 12:39:50,955 INFO L138 BoogieDeclarations]: Found implementation of procedure mxl111sf_i2c_get_data [2021-11-17 12:39:50,955 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_usbv2_probe [2021-11-17 12:39:50,955 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_usbv2_probe [2021-11-17 12:39:50,955 INFO L130 BoogieDeclarations]: Found specification of procedure mxl1x1sf_top_master_ctrl [2021-11-17 12:39:50,955 INFO L138 BoogieDeclarations]: Found implementation of procedure mxl1x1sf_top_master_ctrl [2021-11-17 12:39:51,711 INFO L236 CfgBuilder]: Building ICFG [2021-11-17 12:39:51,713 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-17 12:39:51,915 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2021-11-17 12:40:08,630 INFO L277 CfgBuilder]: Performing block encoding [2021-11-17 12:40:08,643 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-17 12:40:08,644 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-17 12:40:08,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 12:40:08 BoogieIcfgContainer [2021-11-17 12:40:08,649 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-17 12:40:08,650 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-17 12:40:08,650 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-17 12:40:08,653 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-17 12:40:08,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:39:45" (1/3) ... [2021-11-17 12:40:08,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b266a1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:40:08, skipping insertion in model container [2021-11-17 12:40:08,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:39:50" (2/3) ... [2021-11-17 12:40:08,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b266a1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:40:08, skipping insertion in model container [2021-11-17 12:40:08,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 12:40:08" (3/3) ... [2021-11-17 12:40:08,655 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--media--usb--dvb-usb-v2--dvb-usb-mxl111sf.ko.cil.i [2021-11-17 12:40:08,658 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-17 12:40:08,658 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2021-11-17 12:40:08,703 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-17 12:40:08,707 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-17 12:40:08,707 INFO L340 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2021-11-17 12:40:08,757 INFO L276 IsEmpty]: Start isEmpty. Operand has 2359 states, 1738 states have (on average 1.4200230149597237) internal successors, (2468), 1812 states have internal predecessors, (2468), 505 states have call successors, (505), 91 states have call predecessors, (505), 90 states have return successors, (495), 475 states have call predecessors, (495), 495 states have call successors, (495) [2021-11-17 12:40:08,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-17 12:40:08,764 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:40:08,764 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:40:08,766 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 23 more)] === [2021-11-17 12:40:08,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:40:08,770 INFO L85 PathProgramCache]: Analyzing trace with hash -579921427, now seen corresponding path program 1 times [2021-11-17 12:40:08,775 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:40:08,778 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579141934] [2021-11-17 12:40:08,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:40:08,779 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:40:09,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:40:09,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:40:09,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:40:09,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:40:09,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:40:09,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:40:09,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:40:09,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 12:40:09,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:40:09,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 12:40:09,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:40:09,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 12:40:09,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:40:09,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 12:40:09,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:40:09,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:40:09,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:40:09,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 12:40:09,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:40:09,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 12:40:09,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:40:09,773 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-17 12:40:09,774 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:40:09,774 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579141934] [2021-11-17 12:40:09,774 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579141934] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:40:09,775 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:40:09,775 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:40:09,776 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036473381] [2021-11-17 12:40:09,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:40:09,779 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:40:09,781 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:40:09,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:40:09,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:40:09,805 INFO L87 Difference]: Start difference. First operand has 2359 states, 1738 states have (on average 1.4200230149597237) internal successors, (2468), 1812 states have internal predecessors, (2468), 505 states have call successors, (505), 91 states have call predecessors, (505), 90 states have return successors, (495), 475 states have call predecessors, (495), 495 states have call successors, (495) Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-11-17 12:40:11,906 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:40:13,973 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:40:19,381 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:40:29,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:40:29,174 INFO L93 Difference]: Finished difference Result 4664 states and 6920 transitions. [2021-11-17 12:40:29,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:40:29,177 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (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 71 [2021-11-17 12:40:29,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:40:29,202 INFO L225 Difference]: With dead ends: 4664 [2021-11-17 12:40:29,202 INFO L226 Difference]: Without dead ends: 2336 [2021-11-17 12:40:29,218 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:40:29,221 INFO L933 BasicCegarLoop]: 3127 mSDtfsCounter, 6518 mSDsluCounter, 2142 mSDsCounter, 0 mSdLazyCounter, 2944 mSolverCounterSat, 2244 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6695 SdHoareTripleChecker+Valid, 5269 SdHoareTripleChecker+Invalid, 5191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2244 IncrementalHoareTripleChecker+Valid, 2944 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.8s IncrementalHoareTripleChecker+Time [2021-11-17 12:40:29,221 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6695 Valid, 5269 Invalid, 5191 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2244 Valid, 2944 Invalid, 3 Unknown, 0 Unchecked, 18.8s Time] [2021-11-17 12:40:29,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2336 states. [2021-11-17 12:40:29,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2336 to 2336. [2021-11-17 12:40:29,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2336 states, 1728 states have (on average 1.4016203703703705) internal successors, (2422), 1792 states have internal predecessors, (2422), 495 states have call successors, (495), 90 states have call predecessors, (495), 89 states have return successors, (493), 473 states have call predecessors, (493), 493 states have call successors, (493) [2021-11-17 12:40:29,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2336 states to 2336 states and 3410 transitions. [2021-11-17 12:40:29,354 INFO L78 Accepts]: Start accepts. Automaton has 2336 states and 3410 transitions. Word has length 71 [2021-11-17 12:40:29,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:40:29,357 INFO L470 AbstractCegarLoop]: Abstraction has 2336 states and 3410 transitions. [2021-11-17 12:40:29,358 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-11-17 12:40:29,358 INFO L276 IsEmpty]: Start isEmpty. Operand 2336 states and 3410 transitions. [2021-11-17 12:40:29,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-11-17 12:40:29,362 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:40:29,362 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:40:29,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-17 12:40:29,363 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_linux_block_genhd_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 23 more)] === [2021-11-17 12:40:29,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:40:29,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1225981996, now seen corresponding path program 1 times [2021-11-17 12:40:29,364 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:40:29,364 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25011592] [2021-11-17 12:40:29,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:40:29,364 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:40:29,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:40:29,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:40:29,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:40:29,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:40:29,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:40:29,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:40:29,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:40:29,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 12:40:29,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:40:29,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 12:40:29,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:40:29,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 12:40:29,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:40:29,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 12:40:29,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:40:29,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:40:29,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:40:30,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 12:40:30,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:40:30,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 12:40:30,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:40:30,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-17 12:40:30,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:40:30,046 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-17 12:40:30,046 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:40:30,046 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25011592] [2021-11-17 12:40:30,046 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25011592] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:40:30,046 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:40:30,046 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:40:30,047 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601980072] [2021-11-17 12:40:30,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:40:30,048 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:40:30,048 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:40:30,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:40:30,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:40:30,048 INFO L87 Difference]: Start difference. First operand 2336 states and 3410 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2021-11-17 12:40:32,128 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:40:34,201 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:40:39,265 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:40:40,947 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:40:48,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:40:48,131 INFO L93 Difference]: Finished difference Result 2336 states and 3410 transitions. [2021-11-17 12:40:48,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:40:48,132 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (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 77 [2021-11-17 12:40:48,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:40:48,143 INFO L225 Difference]: With dead ends: 2336 [2021-11-17 12:40:48,144 INFO L226 Difference]: Without dead ends: 2334 [2021-11-17 12:40:48,145 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:40:48,146 INFO L933 BasicCegarLoop]: 3097 mSDtfsCounter, 6474 mSDsluCounter, 2100 mSDsCounter, 0 mSdLazyCounter, 2932 mSolverCounterSat, 2224 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6648 SdHoareTripleChecker+Valid, 5197 SdHoareTripleChecker+Invalid, 5159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2224 IncrementalHoareTripleChecker+Valid, 2932 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.6s IncrementalHoareTripleChecker+Time [2021-11-17 12:40:48,146 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6648 Valid, 5197 Invalid, 5159 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2224 Valid, 2932 Invalid, 3 Unknown, 0 Unchecked, 17.6s Time] [2021-11-17 12:40:48,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2334 states. [2021-11-17 12:40:48,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2334 to 2334. [2021-11-17 12:40:48,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2334 states, 1727 states have (on average 1.4012738853503184) internal successors, (2420), 1790 states have internal predecessors, (2420), 495 states have call successors, (495), 90 states have call predecessors, (495), 89 states have return successors, (493), 473 states have call predecessors, (493), 493 states have call successors, (493) [2021-11-17 12:40:48,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2334 states to 2334 states and 3408 transitions. [2021-11-17 12:40:48,210 INFO L78 Accepts]: Start accepts. Automaton has 2334 states and 3408 transitions. Word has length 77 [2021-11-17 12:40:48,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:40:48,211 INFO L470 AbstractCegarLoop]: Abstraction has 2334 states and 3408 transitions. [2021-11-17 12:40:48,211 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2021-11-17 12:40:48,211 INFO L276 IsEmpty]: Start isEmpty. Operand 2334 states and 3408 transitions. [2021-11-17 12:40:48,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-11-17 12:40:48,212 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:40:48,212 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:40:48,212 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-17 12:40:48,213 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 23 more)] === [2021-11-17 12:40:48,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:40:48,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1700906009, now seen corresponding path program 1 times [2021-11-17 12:40:48,213 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:40:48,213 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719932786] [2021-11-17 12:40:48,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:40:48,214 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:40:48,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:40:48,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:40:48,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:40:48,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:40:48,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:40:48,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:40:48,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:40:48,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 12:40:48,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:40:48,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 12:40:48,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:40:48,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 12:40:48,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:40:48,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 12:40:48,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:40:48,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:40:48,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:40:48,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 12:40:48,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:40:48,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 12:40:48,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:40:48,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-17 12:40:48,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:40:48,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-17 12:40:48,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:40:48,735 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-17 12:40:48,736 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:40:48,736 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719932786] [2021-11-17 12:40:48,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719932786] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:40:48,736 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:40:48,736 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:40:48,736 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083196302] [2021-11-17 12:40:48,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:40:48,737 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:40:48,737 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:40:48,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:40:48,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:40:48,738 INFO L87 Difference]: Start difference. First operand 2334 states and 3408 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2021-11-17 12:40:50,831 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:40:53,031 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:40:59,891 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:41:02,230 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:41:10,301 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:41:12,145 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:41:13,780 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:41:16,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:41:16,378 INFO L93 Difference]: Finished difference Result 2334 states and 3408 transitions. [2021-11-17 12:41:16,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:41:16,378 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (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 83 [2021-11-17 12:41:16,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:41:16,389 INFO L225 Difference]: With dead ends: 2334 [2021-11-17 12:41:16,390 INFO L226 Difference]: Without dead ends: 2332 [2021-11-17 12:41:16,392 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:41:16,392 INFO L933 BasicCegarLoop]: 3095 mSDtfsCounter, 6468 mSDsluCounter, 2100 mSDsCounter, 0 mSdLazyCounter, 2930 mSolverCounterSat, 2224 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6641 SdHoareTripleChecker+Valid, 5195 SdHoareTripleChecker+Invalid, 5157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2224 IncrementalHoareTripleChecker+Valid, 2930 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.1s IncrementalHoareTripleChecker+Time [2021-11-17 12:41:16,392 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6641 Valid, 5195 Invalid, 5157 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2224 Valid, 2930 Invalid, 3 Unknown, 0 Unchecked, 27.1s Time] [2021-11-17 12:41:16,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2332 states. [2021-11-17 12:41:16,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2332 to 2332. [2021-11-17 12:41:16,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2332 states, 1726 states have (on average 1.4009269988412514) internal successors, (2418), 1788 states have internal predecessors, (2418), 495 states have call successors, (495), 90 states have call predecessors, (495), 89 states have return successors, (493), 473 states have call predecessors, (493), 493 states have call successors, (493) [2021-11-17 12:41:16,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2332 states to 2332 states and 3406 transitions. [2021-11-17 12:41:16,454 INFO L78 Accepts]: Start accepts. Automaton has 2332 states and 3406 transitions. Word has length 83 [2021-11-17 12:41:16,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:41:16,455 INFO L470 AbstractCegarLoop]: Abstraction has 2332 states and 3406 transitions. [2021-11-17 12:41:16,455 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2021-11-17 12:41:16,455 INFO L276 IsEmpty]: Start isEmpty. Operand 2332 states and 3406 transitions. [2021-11-17 12:41:16,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-11-17 12:41:16,456 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:41:16,456 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:41:16,456 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-17 12:41:16,456 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 23 more)] === [2021-11-17 12:41:16,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:41:16,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1718836826, now seen corresponding path program 1 times [2021-11-17 12:41:16,457 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:41:16,457 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800939669] [2021-11-17 12:41:16,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:41:16,457 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:41:16,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:16,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:41:16,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:16,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:41:16,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:16,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:41:16,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:16,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 12:41:16,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:16,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 12:41:16,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:16,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 12:41:16,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:16,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 12:41:16,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:16,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:41:16,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:16,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 12:41:17,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:17,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 12:41:17,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:17,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-17 12:41:17,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:17,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-17 12:41:17,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:17,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-17 12:41:17,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:17,070 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-17 12:41:17,071 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:41:17,071 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800939669] [2021-11-17 12:41:17,071 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800939669] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:41:17,071 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:41:17,071 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:41:17,071 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047561003] [2021-11-17 12:41:17,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:41:17,072 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:41:17,072 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:41:17,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:41:17,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:41:17,073 INFO L87 Difference]: Start difference. First operand 2332 states and 3406 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2021-11-17 12:41:19,152 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:41:21,237 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:41:27,423 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:41:30,165 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:41:37,915 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:41:41,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:41:41,027 INFO L93 Difference]: Finished difference Result 2332 states and 3406 transitions. [2021-11-17 12:41:41,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:41:41,028 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (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 89 [2021-11-17 12:41:41,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:41:41,036 INFO L225 Difference]: With dead ends: 2332 [2021-11-17 12:41:41,036 INFO L226 Difference]: Without dead ends: 2330 [2021-11-17 12:41:41,037 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:41:41,038 INFO L933 BasicCegarLoop]: 3093 mSDtfsCounter, 6462 mSDsluCounter, 2100 mSDsCounter, 0 mSdLazyCounter, 2928 mSolverCounterSat, 2224 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6634 SdHoareTripleChecker+Valid, 5193 SdHoareTripleChecker+Invalid, 5155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2224 IncrementalHoareTripleChecker+Valid, 2928 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.5s IncrementalHoareTripleChecker+Time [2021-11-17 12:41:41,038 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6634 Valid, 5193 Invalid, 5155 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2224 Valid, 2928 Invalid, 3 Unknown, 0 Unchecked, 23.5s Time] [2021-11-17 12:41:41,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2330 states. [2021-11-17 12:41:41,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2330 to 2330. [2021-11-17 12:41:41,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2330 states, 1725 states have (on average 1.4005797101449275) internal successors, (2416), 1786 states have internal predecessors, (2416), 495 states have call successors, (495), 90 states have call predecessors, (495), 89 states have return successors, (493), 473 states have call predecessors, (493), 493 states have call successors, (493) [2021-11-17 12:41:41,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2330 states to 2330 states and 3404 transitions. [2021-11-17 12:41:41,091 INFO L78 Accepts]: Start accepts. Automaton has 2330 states and 3404 transitions. Word has length 89 [2021-11-17 12:41:41,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:41:41,092 INFO L470 AbstractCegarLoop]: Abstraction has 2330 states and 3404 transitions. [2021-11-17 12:41:41,092 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2021-11-17 12:41:41,092 INFO L276 IsEmpty]: Start isEmpty. Operand 2330 states and 3404 transitions. [2021-11-17 12:41:41,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-11-17 12:41:41,093 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:41:41,093 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:41:41,093 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-17 12:41:41,094 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 23 more)] === [2021-11-17 12:41:41,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:41:41,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1365418643, now seen corresponding path program 1 times [2021-11-17 12:41:41,094 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:41:41,094 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226525303] [2021-11-17 12:41:41,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:41:41,095 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:41:41,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:41,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:41:41,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:41,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:41:41,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:41,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:41:41,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:41,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 12:41:41,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:41,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 12:41:41,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:41,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 12:41:41,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:41,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 12:41:41,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:41,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:41:41,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:41,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 12:41:41,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:41,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 12:41:41,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:41,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-17 12:41:41,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:41,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-17 12:41:41,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:41,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-17 12:41:41,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:41,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-17 12:41:41,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:41,658 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-17 12:41:41,658 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:41:41,658 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226525303] [2021-11-17 12:41:41,659 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226525303] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:41:41,659 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:41:41,659 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:41:41,659 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570209358] [2021-11-17 12:41:41,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:41:41,659 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:41:41,660 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:41:41,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:41:41,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:41:41,660 INFO L87 Difference]: Start difference. First operand 2330 states and 3404 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-17 12:41:43,738 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:41:45,835 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:41:52,340 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:41:55,006 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:42:06,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:42:06,279 INFO L93 Difference]: Finished difference Result 2330 states and 3404 transitions. [2021-11-17 12:42:06,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:42:06,280 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (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 95 [2021-11-17 12:42:06,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:42:06,290 INFO L225 Difference]: With dead ends: 2330 [2021-11-17 12:42:06,290 INFO L226 Difference]: Without dead ends: 2328 [2021-11-17 12:42:06,291 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:42:06,292 INFO L933 BasicCegarLoop]: 3091 mSDtfsCounter, 6456 mSDsluCounter, 2100 mSDsCounter, 0 mSdLazyCounter, 2926 mSolverCounterSat, 2224 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6627 SdHoareTripleChecker+Valid, 5191 SdHoareTripleChecker+Invalid, 5153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2224 IncrementalHoareTripleChecker+Valid, 2926 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.1s IncrementalHoareTripleChecker+Time [2021-11-17 12:42:06,292 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6627 Valid, 5191 Invalid, 5153 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2224 Valid, 2926 Invalid, 3 Unknown, 0 Unchecked, 24.1s Time] [2021-11-17 12:42:06,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2328 states. [2021-11-17 12:42:06,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2328 to 2328. [2021-11-17 12:42:06,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2328 states, 1724 states have (on average 1.400232018561485) internal successors, (2414), 1784 states have internal predecessors, (2414), 495 states have call successors, (495), 90 states have call predecessors, (495), 89 states have return successors, (493), 473 states have call predecessors, (493), 493 states have call successors, (493) [2021-11-17 12:42:06,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2328 states to 2328 states and 3402 transitions. [2021-11-17 12:42:06,353 INFO L78 Accepts]: Start accepts. Automaton has 2328 states and 3402 transitions. Word has length 95 [2021-11-17 12:42:06,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:42:06,354 INFO L470 AbstractCegarLoop]: Abstraction has 2328 states and 3402 transitions. [2021-11-17 12:42:06,354 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-17 12:42:06,354 INFO L276 IsEmpty]: Start isEmpty. Operand 2328 states and 3402 transitions. [2021-11-17 12:42:06,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-11-17 12:42:06,355 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:42:06,355 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:42:06,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-17 12:42:06,355 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 23 more)] === [2021-11-17 12:42:06,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:42:06,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1715306880, now seen corresponding path program 1 times [2021-11-17 12:42:06,356 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:42:06,356 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095295410] [2021-11-17 12:42:06,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:42:06,356 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:42:06,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:06,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:42:06,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:06,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:42:06,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:06,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:42:06,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:06,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 12:42:06,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:06,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 12:42:06,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:06,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 12:42:06,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:06,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 12:42:06,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:06,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:42:06,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:06,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 12:42:06,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:06,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 12:42:06,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:06,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-17 12:42:06,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:06,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-17 12:42:06,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:06,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-17 12:42:06,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:06,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-17 12:42:06,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:06,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-11-17 12:42:06,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:06,992 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-17 12:42:06,992 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:42:06,992 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095295410] [2021-11-17 12:42:06,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095295410] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:42:06,992 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:42:06,992 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:42:06,993 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581731145] [2021-11-17 12:42:06,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:42:06,993 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:42:06,994 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:42:06,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:42:06,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:42:06,994 INFO L87 Difference]: Start difference. First operand 2328 states and 3402 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-17 12:42:09,076 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:42:11,165 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:42:17,772 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:42:20,294 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:42:30,382 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:42:32,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:42:32,730 INFO L93 Difference]: Finished difference Result 2328 states and 3402 transitions. [2021-11-17 12:42:32,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:42:32,731 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (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 101 [2021-11-17 12:42:32,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:42:32,742 INFO L225 Difference]: With dead ends: 2328 [2021-11-17 12:42:32,742 INFO L226 Difference]: Without dead ends: 2326 [2021-11-17 12:42:32,744 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:42:32,745 INFO L933 BasicCegarLoop]: 3089 mSDtfsCounter, 6450 mSDsluCounter, 2100 mSDsCounter, 0 mSdLazyCounter, 2923 mSolverCounterSat, 2224 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6620 SdHoareTripleChecker+Valid, 5189 SdHoareTripleChecker+Invalid, 5151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2224 IncrementalHoareTripleChecker+Valid, 2923 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.2s IncrementalHoareTripleChecker+Time [2021-11-17 12:42:32,745 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6620 Valid, 5189 Invalid, 5151 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2224 Valid, 2923 Invalid, 4 Unknown, 0 Unchecked, 25.2s Time] [2021-11-17 12:42:32,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2326 states. [2021-11-17 12:42:32,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2326 to 2326. [2021-11-17 12:42:32,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2326 states, 1723 states have (on average 1.3998839233894371) internal successors, (2412), 1782 states have internal predecessors, (2412), 495 states have call successors, (495), 90 states have call predecessors, (495), 89 states have return successors, (493), 473 states have call predecessors, (493), 493 states have call successors, (493) [2021-11-17 12:42:32,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 2326 states and 3400 transitions. [2021-11-17 12:42:32,813 INFO L78 Accepts]: Start accepts. Automaton has 2326 states and 3400 transitions. Word has length 101 [2021-11-17 12:42:32,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:42:32,814 INFO L470 AbstractCegarLoop]: Abstraction has 2326 states and 3400 transitions. [2021-11-17 12:42:32,814 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-17 12:42:32,814 INFO L276 IsEmpty]: Start isEmpty. Operand 2326 states and 3400 transitions. [2021-11-17 12:42:32,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-11-17 12:42:32,815 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:42:32,815 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:42:32,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-17 12:42:32,815 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 23 more)] === [2021-11-17 12:42:32,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:42:32,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1637603133, now seen corresponding path program 1 times [2021-11-17 12:42:32,816 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:42:32,816 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876581294] [2021-11-17 12:42:32,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:42:32,816 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:42:32,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:33,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:42:33,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:33,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:42:33,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:33,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:42:33,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:33,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 12:42:33,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:33,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 12:42:33,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:33,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 12:42:33,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:33,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 12:42:33,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:33,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:42:33,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:33,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 12:42:33,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:33,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 12:42:33,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:33,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-17 12:42:33,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:33,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-17 12:42:33,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:33,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-17 12:42:33,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:33,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-17 12:42:33,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:33,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-11-17 12:42:33,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:33,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-17 12:42:33,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:33,508 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-17 12:42:33,509 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:42:33,509 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876581294] [2021-11-17 12:42:33,509 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876581294] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:42:33,509 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:42:33,509 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:42:33,509 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432156305] [2021-11-17 12:42:33,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:42:33,510 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:42:33,510 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:42:33,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:42:33,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:42:33,511 INFO L87 Difference]: Start difference. First operand 2326 states and 3400 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-17 12:42:35,630 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:42:37,725 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:42:44,093 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:42:46,397 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:42:57,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:42:57,210 INFO L93 Difference]: Finished difference Result 2326 states and 3400 transitions. [2021-11-17 12:42:57,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:42:57,211 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 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 107 [2021-11-17 12:42:57,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:42:57,219 INFO L225 Difference]: With dead ends: 2326 [2021-11-17 12:42:57,220 INFO L226 Difference]: Without dead ends: 2324 [2021-11-17 12:42:57,220 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:42:57,221 INFO L933 BasicCegarLoop]: 3087 mSDtfsCounter, 6444 mSDsluCounter, 2100 mSDsCounter, 0 mSdLazyCounter, 2922 mSolverCounterSat, 2224 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6613 SdHoareTripleChecker+Valid, 5187 SdHoareTripleChecker+Invalid, 5149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2224 IncrementalHoareTripleChecker+Valid, 2922 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.2s IncrementalHoareTripleChecker+Time [2021-11-17 12:42:57,221 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6613 Valid, 5187 Invalid, 5149 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2224 Valid, 2922 Invalid, 3 Unknown, 0 Unchecked, 23.2s Time] [2021-11-17 12:42:57,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2324 states. [2021-11-17 12:42:57,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2324 to 2324. [2021-11-17 12:42:57,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2324 states, 1722 states have (on average 1.3995354239256679) internal successors, (2410), 1780 states have internal predecessors, (2410), 495 states have call successors, (495), 90 states have call predecessors, (495), 89 states have return successors, (493), 473 states have call predecessors, (493), 493 states have call successors, (493) [2021-11-17 12:42:57,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2324 states to 2324 states and 3398 transitions. [2021-11-17 12:42:57,284 INFO L78 Accepts]: Start accepts. Automaton has 2324 states and 3398 transitions. Word has length 107 [2021-11-17 12:42:57,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:42:57,284 INFO L470 AbstractCegarLoop]: Abstraction has 2324 states and 3398 transitions. [2021-11-17 12:42:57,284 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-17 12:42:57,284 INFO L276 IsEmpty]: Start isEmpty. Operand 2324 states and 3398 transitions. [2021-11-17 12:42:57,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-11-17 12:42:57,286 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:42:57,286 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:42:57,286 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-17 12:42:57,286 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 23 more)] === [2021-11-17 12:42:57,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:42:57,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1034765425, now seen corresponding path program 1 times [2021-11-17 12:42:57,287 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:42:57,287 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520772893] [2021-11-17 12:42:57,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:42:57,287 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:42:57,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:57,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:42:57,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:57,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:42:57,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:57,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:42:57,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:57,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 12:42:57,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:57,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 12:42:57,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:57,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 12:42:57,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:57,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 12:42:57,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:57,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:42:57,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:57,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 12:42:57,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:57,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 12:42:57,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:57,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-17 12:42:57,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:57,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-17 12:42:57,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:57,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-17 12:42:57,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:57,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-17 12:42:57,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:57,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-11-17 12:42:57,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:57,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-17 12:42:57,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:57,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-11-17 12:42:57,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:57,836 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-17 12:42:57,836 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:42:57,837 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520772893] [2021-11-17 12:42:57,837 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520772893] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:42:57,837 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:42:57,837 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:42:57,837 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361874358] [2021-11-17 12:42:57,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:42:57,838 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:42:57,838 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:42:57,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:42:57,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:42:57,838 INFO L87 Difference]: Start difference. First operand 2324 states and 3398 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2021-11-17 12:42:59,921 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:43:02,023 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:43:08,433 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:43:11,240 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:43:20,610 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:43:24,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:43:24,478 INFO L93 Difference]: Finished difference Result 2324 states and 3398 transitions. [2021-11-17 12:43:24,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:43:24,478 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 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 113 [2021-11-17 12:43:24,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:43:24,489 INFO L225 Difference]: With dead ends: 2324 [2021-11-17 12:43:24,489 INFO L226 Difference]: Without dead ends: 2322 [2021-11-17 12:43:24,491 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:43:24,492 INFO L933 BasicCegarLoop]: 3085 mSDtfsCounter, 6442 mSDsluCounter, 2100 mSDsCounter, 0 mSdLazyCounter, 2916 mSolverCounterSat, 2224 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6610 SdHoareTripleChecker+Valid, 5185 SdHoareTripleChecker+Invalid, 5143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2224 IncrementalHoareTripleChecker+Valid, 2916 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.1s IncrementalHoareTripleChecker+Time [2021-11-17 12:43:24,492 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6610 Valid, 5185 Invalid, 5143 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2224 Valid, 2916 Invalid, 3 Unknown, 0 Unchecked, 26.1s Time] [2021-11-17 12:43:24,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2322 states. [2021-11-17 12:43:24,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2322 to 2322. [2021-11-17 12:43:24,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2322 states, 1721 states have (on average 1.3991865194654272) internal successors, (2408), 1778 states have internal predecessors, (2408), 495 states have call successors, (495), 90 states have call predecessors, (495), 89 states have return successors, (493), 473 states have call predecessors, (493), 493 states have call successors, (493) [2021-11-17 12:43:24,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2322 states to 2322 states and 3396 transitions. [2021-11-17 12:43:24,567 INFO L78 Accepts]: Start accepts. Automaton has 2322 states and 3396 transitions. Word has length 113 [2021-11-17 12:43:24,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:43:24,568 INFO L470 AbstractCegarLoop]: Abstraction has 2322 states and 3396 transitions. [2021-11-17 12:43:24,569 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2021-11-17 12:43:24,569 INFO L276 IsEmpty]: Start isEmpty. Operand 2322 states and 3396 transitions. [2021-11-17 12:43:24,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-11-17 12:43:24,570 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:43:24,570 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:43:24,570 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-17 12:43:24,571 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 23 more)] === [2021-11-17 12:43:24,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:43:24,571 INFO L85 PathProgramCache]: Analyzing trace with hash 2022973170, now seen corresponding path program 1 times [2021-11-17 12:43:24,571 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:43:24,571 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918863570] [2021-11-17 12:43:24,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:43:24,572 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:43:24,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:24,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:43:24,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:24,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:43:24,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:25,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:43:25,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:25,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 12:43:25,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:25,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 12:43:25,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:25,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 12:43:25,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:25,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 12:43:25,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:25,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:43:25,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:25,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 12:43:25,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:25,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 12:43:25,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:25,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-17 12:43:25,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:25,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-17 12:43:25,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:25,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-17 12:43:25,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:25,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-17 12:43:25,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:25,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-11-17 12:43:25,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:25,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-17 12:43:25,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:25,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-11-17 12:43:25,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:25,250 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-17 12:43:25,250 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:43:25,251 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918863570] [2021-11-17 12:43:25,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918863570] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:43:25,251 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:43:25,251 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:43:25,251 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636477770] [2021-11-17 12:43:25,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:43:25,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:43:25,252 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:43:25,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:43:25,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:43:25,253 INFO L87 Difference]: Start difference. First operand 2322 states and 3396 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2021-11-17 12:43:27,340 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:43:29,437 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:43:35,613 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:43:38,038 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:43:48,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:43:48,508 INFO L93 Difference]: Finished difference Result 2322 states and 3396 transitions. [2021-11-17 12:43:48,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:43:48,508 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (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 115 [2021-11-17 12:43:48,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:43:48,517 INFO L225 Difference]: With dead ends: 2322 [2021-11-17 12:43:48,517 INFO L226 Difference]: Without dead ends: 2320 [2021-11-17 12:43:48,518 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:43:48,518 INFO L933 BasicCegarLoop]: 3083 mSDtfsCounter, 6430 mSDsluCounter, 2100 mSDsCounter, 0 mSdLazyCounter, 2918 mSolverCounterSat, 2224 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6598 SdHoareTripleChecker+Valid, 5183 SdHoareTripleChecker+Invalid, 5145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2224 IncrementalHoareTripleChecker+Valid, 2918 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.7s IncrementalHoareTripleChecker+Time [2021-11-17 12:43:48,518 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6598 Valid, 5183 Invalid, 5145 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2224 Valid, 2918 Invalid, 3 Unknown, 0 Unchecked, 22.7s Time] [2021-11-17 12:43:48,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2320 states. [2021-11-17 12:43:48,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2320 to 2320. [2021-11-17 12:43:48,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2320 states, 1720 states have (on average 1.3988372093023256) internal successors, (2406), 1776 states have internal predecessors, (2406), 495 states have call successors, (495), 90 states have call predecessors, (495), 89 states have return successors, (493), 473 states have call predecessors, (493), 493 states have call successors, (493) [2021-11-17 12:43:48,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2320 states to 2320 states and 3394 transitions. [2021-11-17 12:43:48,591 INFO L78 Accepts]: Start accepts. Automaton has 2320 states and 3394 transitions. Word has length 115 [2021-11-17 12:43:48,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:43:48,592 INFO L470 AbstractCegarLoop]: Abstraction has 2320 states and 3394 transitions. [2021-11-17 12:43:48,592 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2021-11-17 12:43:48,592 INFO L276 IsEmpty]: Start isEmpty. Operand 2320 states and 3394 transitions. [2021-11-17 12:43:48,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-11-17 12:43:48,593 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:43:48,594 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:43:48,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-17 12:43:48,594 INFO L402 AbstractCegarLoop]: === Iteration 10 === 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 23 more)] === [2021-11-17 12:43:48,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:43:48,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1918037552, now seen corresponding path program 1 times [2021-11-17 12:43:48,594 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:43:48,595 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081948321] [2021-11-17 12:43:48,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:43:48,595 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:43:48,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:48,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:43:48,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:48,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:43:48,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:48,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:43:48,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:48,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 12:43:48,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:49,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-17 12:43:49,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:49,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:43:49,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:49,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:43:49,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:49,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:43:49,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:49,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 12:43:49,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:49,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:43:49,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:49,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:43:49,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:49,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:43:49,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:49,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-11-17 12:43:49,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:49,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:43:49,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:49,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:43:49,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:49,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:43:49,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:49,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-17 12:43:49,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:49,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:43:49,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:49,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:43:49,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:49,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:43:49,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:49,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-17 12:43:49,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:49,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:43:49,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:49,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:43:49,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:49,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:43:49,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:49,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-11-17 12:43:49,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:49,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-11-17 12:43:49,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:49,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2021-11-17 12:43:49,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:49,373 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2021-11-17 12:43:49,374 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:43:49,374 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081948321] [2021-11-17 12:43:49,374 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081948321] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:43:49,374 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:43:49,374 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:43:49,374 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017268794] [2021-11-17 12:43:49,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:43:49,375 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:43:49,375 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:43:49,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:43:49,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:43:49,376 INFO L87 Difference]: Start difference. First operand 2320 states and 3394 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-17 12:43:51,470 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:43:53,571 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:43:55,656 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:44:01,976 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:44:05,955 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:44:18,471 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:44:20,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:44:20,730 INFO L93 Difference]: Finished difference Result 4732 states and 6940 transitions. [2021-11-17 12:44:20,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-17 12:44:20,731 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 157 [2021-11-17 12:44:20,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:44:20,744 INFO L225 Difference]: With dead ends: 4732 [2021-11-17 12:44:20,745 INFO L226 Difference]: Without dead ends: 2453 [2021-11-17 12:44:20,755 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-11-17 12:44:20,755 INFO L933 BasicCegarLoop]: 2860 mSDtfsCounter, 6956 mSDsluCounter, 1379 mSDsCounter, 0 mSdLazyCounter, 3244 mSolverCounterSat, 3019 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7144 SdHoareTripleChecker+Valid, 4239 SdHoareTripleChecker+Invalid, 6268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3019 IncrementalHoareTripleChecker+Valid, 3244 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.7s IncrementalHoareTripleChecker+Time [2021-11-17 12:44:20,756 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7144 Valid, 4239 Invalid, 6268 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3019 Valid, 3244 Invalid, 5 Unknown, 0 Unchecked, 30.7s Time] [2021-11-17 12:44:20,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2453 states. [2021-11-17 12:44:20,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2453 to 2392. [2021-11-17 12:44:20,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2392 states, 1778 states have (on average 1.3982002249718786) internal successors, (2486), 1833 states have internal predecessors, (2486), 504 states have call successors, (504), 96 states have call predecessors, (504), 95 states have return successors, (502), 482 states have call predecessors, (502), 502 states have call successors, (502) [2021-11-17 12:44:20,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2392 states to 2392 states and 3492 transitions. [2021-11-17 12:44:20,869 INFO L78 Accepts]: Start accepts. Automaton has 2392 states and 3492 transitions. Word has length 157 [2021-11-17 12:44:20,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:44:20,869 INFO L470 AbstractCegarLoop]: Abstraction has 2392 states and 3492 transitions. [2021-11-17 12:44:20,870 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-17 12:44:20,870 INFO L276 IsEmpty]: Start isEmpty. Operand 2392 states and 3492 transitions. [2021-11-17 12:44:20,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-11-17 12:44:20,871 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:44:20,871 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:44:20,871 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-17 12:44:20,872 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_linux_kernel_module_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 23 more)] === [2021-11-17 12:44:20,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:44:20,872 INFO L85 PathProgramCache]: Analyzing trace with hash -216290564, now seen corresponding path program 1 times [2021-11-17 12:44:20,872 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:44:20,872 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594309533] [2021-11-17 12:44:20,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:44:20,873 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:44:20,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:21,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:44:21,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:21,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:44:21,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:21,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:44:21,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:21,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 12:44:21,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:21,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 12:44:21,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:21,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 12:44:21,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:21,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 12:44:21,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:21,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:44:21,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:21,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 12:44:21,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:21,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 12:44:21,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:21,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-17 12:44:21,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:21,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-17 12:44:21,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:21,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-17 12:44:21,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:21,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-17 12:44:21,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:21,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-11-17 12:44:21,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:21,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-17 12:44:21,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:21,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-11-17 12:44:21,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:21,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-11-17 12:44:21,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:21,448 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-17 12:44:21,448 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:44:21,448 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594309533] [2021-11-17 12:44:21,449 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594309533] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:44:21,449 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:44:21,449 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:44:21,449 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463769104] [2021-11-17 12:44:21,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:44:21,449 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:44:21,449 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:44:21,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:44:21,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:44:21,450 INFO L87 Difference]: Start difference. First operand 2392 states and 3492 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2021-11-17 12:44:23,529 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:44:25,611 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:44:31,680 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:44:34,257 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:44:45,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:44:45,442 INFO L93 Difference]: Finished difference Result 2392 states and 3492 transitions. [2021-11-17 12:44:45,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:44:45,442 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (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 121 [2021-11-17 12:44:45,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:44:45,460 INFO L225 Difference]: With dead ends: 2392 [2021-11-17 12:44:45,460 INFO L226 Difference]: Without dead ends: 2390 [2021-11-17 12:44:45,462 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:44:45,462 INFO L933 BasicCegarLoop]: 3076 mSDtfsCounter, 6421 mSDsluCounter, 2086 mSDsCounter, 0 mSdLazyCounter, 2915 mSolverCounterSat, 2224 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6588 SdHoareTripleChecker+Valid, 5162 SdHoareTripleChecker+Invalid, 5142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2224 IncrementalHoareTripleChecker+Valid, 2915 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.5s IncrementalHoareTripleChecker+Time [2021-11-17 12:44:45,462 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6588 Valid, 5162 Invalid, 5142 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2224 Valid, 2915 Invalid, 3 Unknown, 0 Unchecked, 23.5s Time] [2021-11-17 12:44:45,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2390 states. [2021-11-17 12:44:45,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2390 to 2390. [2021-11-17 12:44:45,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2390 states, 1777 states have (on average 1.39786156443444) internal successors, (2484), 1831 states have internal predecessors, (2484), 504 states have call successors, (504), 96 states have call predecessors, (504), 95 states have return successors, (502), 482 states have call predecessors, (502), 502 states have call successors, (502) [2021-11-17 12:44:45,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2390 states to 2390 states and 3490 transitions. [2021-11-17 12:44:45,542 INFO L78 Accepts]: Start accepts. Automaton has 2390 states and 3490 transitions. Word has length 121 [2021-11-17 12:44:45,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:44:45,543 INFO L470 AbstractCegarLoop]: Abstraction has 2390 states and 3490 transitions. [2021-11-17 12:44:45,543 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2021-11-17 12:44:45,543 INFO L276 IsEmpty]: Start isEmpty. Operand 2390 states and 3490 transitions. [2021-11-17 12:44:45,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-11-17 12:44:45,549 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:44:45,549 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:44:45,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-17 12:44:45,549 INFO L402 AbstractCegarLoop]: === Iteration 12 === 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 23 more)] === [2021-11-17 12:44:45,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:44:45,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1995731297, now seen corresponding path program 1 times [2021-11-17 12:44:45,553 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:44:45,553 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611803643] [2021-11-17 12:44:45,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:44:45,553 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:44:45,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:45,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:44:45,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:45,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:44:45,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:45,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:44:45,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:45,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 12:44:45,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:46,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-17 12:44:46,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:46,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:44:46,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:46,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:44:46,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:46,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:44:46,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:46,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 12:44:46,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:46,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:44:46,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:46,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:44:46,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:46,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:44:46,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:46,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-11-17 12:44:46,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:46,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:44:46,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:46,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:44:46,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:46,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:44:46,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:46,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-17 12:44:46,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:46,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:44:46,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:46,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:44:46,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:46,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:44:46,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:46,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-17 12:44:46,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:46,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:44:46,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:46,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:44:46,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:46,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:44:46,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:46,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-11-17 12:44:46,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:46,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-11-17 12:44:46,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:46,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2021-11-17 12:44:46,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:46,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2021-11-17 12:44:46,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:46,438 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2021-11-17 12:44:46,438 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:44:46,438 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611803643] [2021-11-17 12:44:46,438 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611803643] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 12:44:46,439 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363803864] [2021-11-17 12:44:46,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:44:46,439 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 12:44:46,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 12:44:46,440 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-17 12:44:46,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-17 12:44:47,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:47,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 6909 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-17 12:44:47,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 12:44:48,044 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2021-11-17 12:44:48,044 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-17 12:44:48,045 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363803864] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:44:48,045 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-17 12:44:48,045 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2021-11-17 12:44:48,045 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109329112] [2021-11-17 12:44:48,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:44:48,045 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-17 12:44:48,046 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:44:48,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-17 12:44:48,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:44:48,046 INFO L87 Difference]: Start difference. First operand 2390 states and 3490 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-17 12:44:48,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:44:48,221 INFO L93 Difference]: Finished difference Result 4788 states and 6981 transitions. [2021-11-17 12:44:48,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-17 12:44:48,222 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 163 [2021-11-17 12:44:48,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:44:48,233 INFO L225 Difference]: With dead ends: 4788 [2021-11-17 12:44:48,233 INFO L226 Difference]: Without dead ends: 2442 [2021-11-17 12:44:48,242 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:44:48,243 INFO L933 BasicCegarLoop]: 3446 mSDtfsCounter, 3363 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3363 SdHoareTripleChecker+Valid, 3513 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-17 12:44:48,243 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3363 Valid, 3513 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-17 12:44:48,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2442 states. [2021-11-17 12:44:48,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2442 to 2439. [2021-11-17 12:44:48,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2439 states, 1806 states have (on average 1.3920265780730896) internal successors, (2514), 1863 states have internal predecessors, (2514), 519 states have call successors, (519), 102 states have call predecessors, (519), 101 states have return successors, (517), 495 states have call predecessors, (517), 517 states have call successors, (517) [2021-11-17 12:44:48,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2439 states to 2439 states and 3550 transitions. [2021-11-17 12:44:48,329 INFO L78 Accepts]: Start accepts. Automaton has 2439 states and 3550 transitions. Word has length 163 [2021-11-17 12:44:48,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:44:48,330 INFO L470 AbstractCegarLoop]: Abstraction has 2439 states and 3550 transitions. [2021-11-17 12:44:48,330 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-17 12:44:48,330 INFO L276 IsEmpty]: Start isEmpty. Operand 2439 states and 3550 transitions. [2021-11-17 12:44:48,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-11-17 12:44:48,331 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:44:48,332 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:44:48,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-11-17 12:44:48,541 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-11-17 12:44:48,541 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 23 more)] === [2021-11-17 12:44:48,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:44:48,542 INFO L85 PathProgramCache]: Analyzing trace with hash -986218447, now seen corresponding path program 1 times [2021-11-17 12:44:48,542 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:44:48,542 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38706126] [2021-11-17 12:44:48,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:44:48,542 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:44:48,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:48,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:44:48,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:48,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:44:48,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:49,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:44:49,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:49,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 12:44:49,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:49,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 12:44:49,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:49,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 12:44:49,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:49,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 12:44:49,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:49,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:44:49,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:49,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 12:44:49,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:49,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 12:44:49,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:49,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-17 12:44:49,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:49,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 12:44:49,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:49,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:44:49,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:49,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:44:49,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:49,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:44:49,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:49,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-11-17 12:44:49,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:49,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-11-17 12:44:49,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:49,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:44:49,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:49,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:44:49,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:49,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:44:49,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:49,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2021-11-17 12:44:49,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:49,337 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2021-11-17 12:44:49,338 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:44:49,338 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38706126] [2021-11-17 12:44:49,338 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38706126] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:44:49,338 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:44:49,338 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-17 12:44:49,338 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313702838] [2021-11-17 12:44:49,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:44:49,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-17 12:44:49,339 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:44:49,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-17 12:44:49,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-17 12:44:49,339 INFO L87 Difference]: Start difference. First operand 2439 states and 3550 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2021-11-17 12:44:51,421 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:44:53,503 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:44:55,589 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:45:16,113 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:45:23,178 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:45:24,239 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:45:25,914 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:45:26,966 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:45:28,428 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:45:30,225 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:45:32,240 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:46:02,511 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:46:08,202 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:46:12,407 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:46:22,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:46:22,331 INFO L93 Difference]: Finished difference Result 4493 states and 6621 transitions. [2021-11-17 12:46:22,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-17 12:46:22,332 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 144 [2021-11-17 12:46:22,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:46:22,352 INFO L225 Difference]: With dead ends: 4493 [2021-11-17 12:46:22,352 INFO L226 Difference]: Without dead ends: 4491 [2021-11-17 12:46:22,355 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2021-11-17 12:46:22,356 INFO L933 BasicCegarLoop]: 4432 mSDtfsCounter, 8911 mSDsluCounter, 6840 mSDsCounter, 0 mSdLazyCounter, 13090 mSolverCounterSat, 4135 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 87.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9078 SdHoareTripleChecker+Valid, 11272 SdHoareTripleChecker+Invalid, 17230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.3s SdHoareTripleChecker+Time, 4135 IncrementalHoareTripleChecker+Valid, 13090 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 91.5s IncrementalHoareTripleChecker+Time [2021-11-17 12:46:22,356 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9078 Valid, 11272 Invalid, 17230 Unknown, 0 Unchecked, 0.3s Time], IncrementalHoareTripleChecker [4135 Valid, 13090 Invalid, 5 Unknown, 0 Unchecked, 91.5s Time] [2021-11-17 12:46:22,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4491 states. [2021-11-17 12:46:22,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4491 to 4359. [2021-11-17 12:46:22,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4359 states, 3271 states have (on average 1.40660348517273) internal successors, (4601), 3365 states have internal predecessors, (4601), 898 states have call successors, (898), 178 states have call predecessors, (898), 177 states have return successors, (908), 852 states have call predecessors, (908), 896 states have call successors, (908) [2021-11-17 12:46:22,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4359 states to 4359 states and 6407 transitions. [2021-11-17 12:46:22,523 INFO L78 Accepts]: Start accepts. Automaton has 4359 states and 6407 transitions. Word has length 144 [2021-11-17 12:46:22,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:46:22,523 INFO L470 AbstractCegarLoop]: Abstraction has 4359 states and 6407 transitions. [2021-11-17 12:46:22,523 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2021-11-17 12:46:22,523 INFO L276 IsEmpty]: Start isEmpty. Operand 4359 states and 6407 transitions. [2021-11-17 12:46:22,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-11-17 12:46:22,525 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:46:22,526 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:46:22,526 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-17 12:46:22,526 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 23 more)] === [2021-11-17 12:46:22,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:46:22,526 INFO L85 PathProgramCache]: Analyzing trace with hash -378933361, now seen corresponding path program 1 times [2021-11-17 12:46:22,526 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:46:22,527 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645133843] [2021-11-17 12:46:22,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:46:22,527 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:46:22,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:22,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:46:22,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:22,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:46:22,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:22,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:46:22,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:22,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 12:46:22,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:22,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 12:46:22,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:22,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 12:46:22,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:22,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 12:46:22,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:23,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:46:23,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:23,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 12:46:23,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:23,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 12:46:23,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:23,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-17 12:46:23,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:23,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-17 12:46:23,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:23,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-17 12:46:23,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:23,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-17 12:46:23,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:23,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-11-17 12:46:23,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:23,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-17 12:46:23,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:23,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-11-17 12:46:23,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:23,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-11-17 12:46:23,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:23,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-11-17 12:46:23,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:23,168 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-17 12:46:23,169 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:46:23,169 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645133843] [2021-11-17 12:46:23,169 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645133843] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:46:23,169 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:46:23,169 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:46:23,169 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217238541] [2021-11-17 12:46:23,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:46:23,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:46:23,169 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:46:23,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:46:23,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:46:23,170 INFO L87 Difference]: Start difference. First operand 4359 states and 6407 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2021-11-17 12:46:25,258 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:46:27,351 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:46:34,720 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:46:36,858 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:46:47,326 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:46:48,946 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:46:50,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:46:50,970 INFO L93 Difference]: Finished difference Result 4359 states and 6407 transitions. [2021-11-17 12:46:50,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:46:50,971 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (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 127 [2021-11-17 12:46:50,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:46:50,985 INFO L225 Difference]: With dead ends: 4359 [2021-11-17 12:46:50,986 INFO L226 Difference]: Without dead ends: 4357 [2021-11-17 12:46:50,989 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:46:50,990 INFO L933 BasicCegarLoop]: 3069 mSDtfsCounter, 6410 mSDsluCounter, 2072 mSDsCounter, 0 mSdLazyCounter, 2911 mSolverCounterSat, 2224 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6576 SdHoareTripleChecker+Valid, 5141 SdHoareTripleChecker+Invalid, 5139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2224 IncrementalHoareTripleChecker+Valid, 2911 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.2s IncrementalHoareTripleChecker+Time [2021-11-17 12:46:50,990 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6576 Valid, 5141 Invalid, 5139 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2224 Valid, 2911 Invalid, 4 Unknown, 0 Unchecked, 27.2s Time] [2021-11-17 12:46:50,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4357 states. [2021-11-17 12:46:51,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4357 to 4357. [2021-11-17 12:46:51,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4357 states, 3270 states have (on average 1.4061162079510703) internal successors, (4598), 3363 states have internal predecessors, (4598), 898 states have call successors, (898), 178 states have call predecessors, (898), 177 states have return successors, (908), 852 states have call predecessors, (908), 896 states have call successors, (908) [2021-11-17 12:46:51,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4357 states to 4357 states and 6404 transitions. [2021-11-17 12:46:51,153 INFO L78 Accepts]: Start accepts. Automaton has 4357 states and 6404 transitions. Word has length 127 [2021-11-17 12:46:51,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:46:51,153 INFO L470 AbstractCegarLoop]: Abstraction has 4357 states and 6404 transitions. [2021-11-17 12:46:51,154 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2021-11-17 12:46:51,154 INFO L276 IsEmpty]: Start isEmpty. Operand 4357 states and 6404 transitions. [2021-11-17 12:46:51,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-11-17 12:46:51,157 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:46:51,157 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:46:51,157 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-17 12:46:51,157 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 23 more)] === [2021-11-17 12:46:51,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:46:51,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1895564846, now seen corresponding path program 1 times [2021-11-17 12:46:51,158 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:46:51,158 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250458334] [2021-11-17 12:46:51,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:46:51,159 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:46:51,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:51,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:46:51,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:51,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:46:51,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:51,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:46:51,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:51,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 12:46:51,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:51,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 12:46:51,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:51,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 12:46:51,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:51,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 12:46:51,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:51,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:46:51,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:51,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 12:46:51,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:51,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 12:46:51,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:51,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-17 12:46:51,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:51,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-17 12:46:51,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:51,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-17 12:46:51,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:51,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-17 12:46:51,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:51,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-11-17 12:46:51,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:51,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-17 12:46:51,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:51,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-11-17 12:46:51,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:51,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-11-17 12:46:51,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:51,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-11-17 12:46:51,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:51,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-11-17 12:46:51,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:51,787 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-17 12:46:51,787 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:46:51,788 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250458334] [2021-11-17 12:46:51,788 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250458334] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:46:51,788 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:46:51,788 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:46:51,788 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974406536] [2021-11-17 12:46:51,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:46:51,790 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:46:51,790 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:46:51,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:46:51,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:46:51,791 INFO L87 Difference]: Start difference. First operand 4357 states and 6404 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2021-11-17 12:46:53,877 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:46:55,959 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:47:02,608 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:47:05,675 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:47:16,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:47:16,606 INFO L93 Difference]: Finished difference Result 4357 states and 6404 transitions. [2021-11-17 12:47:16,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:47:16,606 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 133 [2021-11-17 12:47:16,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:47:16,620 INFO L225 Difference]: With dead ends: 4357 [2021-11-17 12:47:16,620 INFO L226 Difference]: Without dead ends: 4355 [2021-11-17 12:47:16,628 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:47:16,629 INFO L933 BasicCegarLoop]: 3067 mSDtfsCounter, 6404 mSDsluCounter, 2072 mSDsCounter, 0 mSdLazyCounter, 2909 mSolverCounterSat, 2224 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6569 SdHoareTripleChecker+Valid, 5139 SdHoareTripleChecker+Invalid, 5137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2224 IncrementalHoareTripleChecker+Valid, 2909 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.2s IncrementalHoareTripleChecker+Time [2021-11-17 12:47:16,629 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6569 Valid, 5139 Invalid, 5137 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2224 Valid, 2909 Invalid, 4 Unknown, 0 Unchecked, 24.2s Time] [2021-11-17 12:47:16,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4355 states. [2021-11-17 12:47:16,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4355 to 4355. [2021-11-17 12:47:16,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4355 states, 3269 states have (on average 1.4056286326093606) internal successors, (4595), 3361 states have internal predecessors, (4595), 898 states have call successors, (898), 178 states have call predecessors, (898), 177 states have return successors, (908), 852 states have call predecessors, (908), 896 states have call successors, (908) [2021-11-17 12:47:16,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4355 states to 4355 states and 6401 transitions. [2021-11-17 12:47:16,793 INFO L78 Accepts]: Start accepts. Automaton has 4355 states and 6401 transitions. Word has length 133 [2021-11-17 12:47:16,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:47:16,795 INFO L470 AbstractCegarLoop]: Abstraction has 4355 states and 6401 transitions. [2021-11-17 12:47:16,795 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2021-11-17 12:47:16,795 INFO L276 IsEmpty]: Start isEmpty. Operand 4355 states and 6401 transitions. [2021-11-17 12:47:16,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-11-17 12:47:16,798 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:47:16,799 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:47:16,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-17 12:47:16,799 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 23 more)] === [2021-11-17 12:47:16,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:47:16,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1420481231, now seen corresponding path program 1 times [2021-11-17 12:47:16,799 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:47:16,800 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879634536] [2021-11-17 12:47:16,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:47:16,800 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:47:16,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:17,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:47:17,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:17,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:47:17,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:17,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:47:17,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:17,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 12:47:17,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:17,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 12:47:17,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:17,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 12:47:17,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:17,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 12:47:17,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:17,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:47:17,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:17,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 12:47:17,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:17,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 12:47:17,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:17,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-17 12:47:17,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:17,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-17 12:47:17,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:17,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-17 12:47:17,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:17,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-17 12:47:17,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:17,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-11-17 12:47:17,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:17,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-17 12:47:17,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:17,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-11-17 12:47:17,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:17,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-11-17 12:47:17,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:17,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-11-17 12:47:17,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:17,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-11-17 12:47:17,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:17,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-11-17 12:47:17,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:17,415 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-17 12:47:17,415 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:47:17,415 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879634536] [2021-11-17 12:47:17,416 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879634536] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:47:17,416 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:47:17,416 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:47:17,416 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068525661] [2021-11-17 12:47:17,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:47:17,416 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:47:17,417 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:47:17,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:47:17,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:47:17,417 INFO L87 Difference]: Start difference. First operand 4355 states and 6401 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2021-11-17 12:47:19,499 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:47:21,592 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:47:28,102 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:47:30,335 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:47:40,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:47:40,750 INFO L93 Difference]: Finished difference Result 4355 states and 6401 transitions. [2021-11-17 12:47:40,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:47:40,750 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 139 [2021-11-17 12:47:40,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:47:40,765 INFO L225 Difference]: With dead ends: 4355 [2021-11-17 12:47:40,766 INFO L226 Difference]: Without dead ends: 4353 [2021-11-17 12:47:40,768 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:47:40,769 INFO L933 BasicCegarLoop]: 3065 mSDtfsCounter, 6398 mSDsluCounter, 2072 mSDsCounter, 0 mSdLazyCounter, 2908 mSolverCounterSat, 2224 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6562 SdHoareTripleChecker+Valid, 5137 SdHoareTripleChecker+Invalid, 5135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2224 IncrementalHoareTripleChecker+Valid, 2908 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.7s IncrementalHoareTripleChecker+Time [2021-11-17 12:47:40,769 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6562 Valid, 5137 Invalid, 5135 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2224 Valid, 2908 Invalid, 3 Unknown, 0 Unchecked, 22.7s Time] [2021-11-17 12:47:40,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4353 states. [2021-11-17 12:47:40,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4353 to 4353. [2021-11-17 12:47:40,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4353 states, 3268 states have (on average 1.405140758873929) internal successors, (4592), 3359 states have internal predecessors, (4592), 898 states have call successors, (898), 178 states have call predecessors, (898), 177 states have return successors, (908), 852 states have call predecessors, (908), 896 states have call successors, (908) [2021-11-17 12:47:40,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4353 states to 4353 states and 6398 transitions. [2021-11-17 12:47:40,932 INFO L78 Accepts]: Start accepts. Automaton has 4353 states and 6398 transitions. Word has length 139 [2021-11-17 12:47:40,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:47:40,933 INFO L470 AbstractCegarLoop]: Abstraction has 4353 states and 6398 transitions. [2021-11-17 12:47:40,933 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2021-11-17 12:47:40,933 INFO L276 IsEmpty]: Start isEmpty. Operand 4353 states and 6398 transitions. [2021-11-17 12:47:40,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-11-17 12:47:40,936 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:47:40,936 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:47:40,936 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-17 12:47:40,936 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 23 more)] === [2021-11-17 12:47:40,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:47:40,937 INFO L85 PathProgramCache]: Analyzing trace with hash -541253637, now seen corresponding path program 1 times [2021-11-17 12:47:40,937 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:47:40,937 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287593263] [2021-11-17 12:47:40,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:47:40,937 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:47:41,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:41,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:47:41,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:41,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:47:41,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:41,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:47:41,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:41,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 12:47:41,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:41,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 12:47:41,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:41,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 12:47:41,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:41,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 12:47:41,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:41,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:47:41,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:41,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 12:47:41,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:41,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 12:47:41,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:41,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-17 12:47:41,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:41,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 12:47:41,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:41,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:47:41,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:41,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:47:41,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:41,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:47:41,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:41,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-11-17 12:47:41,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:41,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-11-17 12:47:41,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:41,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:47:41,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:41,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:47:41,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:41,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:47:41,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:41,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2021-11-17 12:47:41,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:41,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-11-17 12:47:41,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:41,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-11-17 12:47:41,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:41,935 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2021-11-17 12:47:41,936 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:47:41,936 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287593263] [2021-11-17 12:47:41,936 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287593263] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:47:41,936 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:47:41,936 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-17 12:47:41,936 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006416043] [2021-11-17 12:47:41,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:47:41,938 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-17 12:47:41,938 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:47:41,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-17 12:47:41,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-17 12:47:41,938 INFO L87 Difference]: Start difference. First operand 4353 states and 6398 transitions. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (22), 5 states have call predecessors, (22), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2021-11-17 12:47:44,032 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:47:46,130 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:47:48,234 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:47:50,325 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:48:08,675 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:48:13,905 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:48:14,944 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:48:16,957 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:48:19,082 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:48:21,087 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:49:07,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:49:07,348 INFO L93 Difference]: Finished difference Result 4479 states and 6607 transitions. [2021-11-17 12:49:07,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-17 12:49:07,349 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (22), 5 states have call predecessors, (22), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 160 [2021-11-17 12:49:07,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:49:07,363 INFO L225 Difference]: With dead ends: 4479 [2021-11-17 12:49:07,363 INFO L226 Difference]: Without dead ends: 4477 [2021-11-17 12:49:07,365 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-11-17 12:49:07,366 INFO L933 BasicCegarLoop]: 4281 mSDtfsCounter, 8004 mSDsluCounter, 5763 mSDsCounter, 0 mSdLazyCounter, 13621 mSolverCounterSat, 4099 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 80.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8115 SdHoareTripleChecker+Valid, 10044 SdHoareTripleChecker+Invalid, 17728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 4099 IncrementalHoareTripleChecker+Valid, 13621 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 84.0s IncrementalHoareTripleChecker+Time [2021-11-17 12:49:07,366 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8115 Valid, 10044 Invalid, 17728 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [4099 Valid, 13621 Invalid, 8 Unknown, 0 Unchecked, 84.0s Time] [2021-11-17 12:49:07,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4477 states. [2021-11-17 12:49:07,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4477 to 4353. [2021-11-17 12:49:07,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4353 states, 3268 states have (on average 1.4048347613219094) internal successors, (4591), 3359 states have internal predecessors, (4591), 898 states have call successors, (898), 178 states have call predecessors, (898), 177 states have return successors, (908), 852 states have call predecessors, (908), 896 states have call successors, (908) [2021-11-17 12:49:07,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4353 states to 4353 states and 6397 transitions. [2021-11-17 12:49:07,521 INFO L78 Accepts]: Start accepts. Automaton has 4353 states and 6397 transitions. Word has length 160 [2021-11-17 12:49:07,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:49:07,522 INFO L470 AbstractCegarLoop]: Abstraction has 4353 states and 6397 transitions. [2021-11-17 12:49:07,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (22), 5 states have call predecessors, (22), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2021-11-17 12:49:07,522 INFO L276 IsEmpty]: Start isEmpty. Operand 4353 states and 6397 transitions. [2021-11-17 12:49:07,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-11-17 12:49:07,524 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:49:07,525 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:49:07,525 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-17 12:49:07,525 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 23 more)] === [2021-11-17 12:49:07,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:49:07,525 INFO L85 PathProgramCache]: Analyzing trace with hash -934280647, now seen corresponding path program 1 times [2021-11-17 12:49:07,525 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:49:07,526 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407196309] [2021-11-17 12:49:07,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:49:07,527 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:49:07,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:07,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:49:07,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:07,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:49:07,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:07,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:49:07,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:07,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 12:49:07,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:07,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 12:49:07,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:08,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 12:49:08,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:08,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 12:49:08,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:08,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:49:08,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:08,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 12:49:08,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:08,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 12:49:08,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:08,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-17 12:49:08,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:08,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 12:49:08,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:08,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:49:08,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:08,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:49:08,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:08,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:49:08,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:08,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-11-17 12:49:08,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:08,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-11-17 12:49:08,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:08,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:49:08,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:08,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:49:08,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:08,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:49:08,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:08,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2021-11-17 12:49:08,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:08,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-11-17 12:49:08,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:08,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-11-17 12:49:08,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:08,238 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2021-11-17 12:49:08,238 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:49:08,239 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407196309] [2021-11-17 12:49:08,239 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407196309] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:49:08,239 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:49:08,240 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-17 12:49:08,240 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604403721] [2021-11-17 12:49:08,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:49:08,240 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-17 12:49:08,242 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:49:08,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-17 12:49:08,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-17 12:49:08,242 INFO L87 Difference]: Start difference. First operand 4353 states and 6397 transitions. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (22), 5 states have call predecessors, (22), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2021-11-17 12:49:10,336 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:49:12,418 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:49:14,513 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:49:29,989 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:49:35,738 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:49:37,523 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:49:39,485 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:50:06,194 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:50:13,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:50:13,368 INFO L93 Difference]: Finished difference Result 8036 states and 11864 transitions. [2021-11-17 12:50:13,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-17 12:50:13,368 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (22), 5 states have call predecessors, (22), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 160 [2021-11-17 12:50:13,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:50:13,387 INFO L225 Difference]: With dead ends: 8036 [2021-11-17 12:50:13,387 INFO L226 Difference]: Without dead ends: 4094 [2021-11-17 12:50:13,406 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2021-11-17 12:50:13,407 INFO L933 BasicCegarLoop]: 3039 mSDtfsCounter, 4167 mSDsluCounter, 4916 mSDsCounter, 0 mSdLazyCounter, 9579 mSolverCounterSat, 2270 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 61.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4167 SdHoareTripleChecker+Valid, 7955 SdHoareTripleChecker+Invalid, 11854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 2270 IncrementalHoareTripleChecker+Valid, 9579 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 64.0s IncrementalHoareTripleChecker+Time [2021-11-17 12:50:13,407 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4167 Valid, 7955 Invalid, 11854 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [2270 Valid, 9579 Invalid, 5 Unknown, 0 Unchecked, 64.0s Time] [2021-11-17 12:50:13,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4094 states. [2021-11-17 12:50:13,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4094 to 4003. [2021-11-17 12:50:13,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4003 states, 2982 states have (on average 1.3943661971830985) internal successors, (4158), 3074 states have internal predecessors, (4158), 838 states have call successors, (838), 172 states have call predecessors, (838), 173 states have return successors, (860), 793 states have call predecessors, (860), 836 states have call successors, (860) [2021-11-17 12:50:13,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4003 states to 4003 states and 5856 transitions. [2021-11-17 12:50:13,592 INFO L78 Accepts]: Start accepts. Automaton has 4003 states and 5856 transitions. Word has length 160 [2021-11-17 12:50:13,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:50:13,592 INFO L470 AbstractCegarLoop]: Abstraction has 4003 states and 5856 transitions. [2021-11-17 12:50:13,593 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (22), 5 states have call predecessors, (22), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2021-11-17 12:50:13,593 INFO L276 IsEmpty]: Start isEmpty. Operand 4003 states and 5856 transitions. [2021-11-17 12:50:13,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2021-11-17 12:50:13,595 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:50:13,596 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:50:13,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-17 12:50:13,596 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_linux_kernel_rcu_srcu_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 23 more)] === [2021-11-17 12:50:13,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:50:13,596 INFO L85 PathProgramCache]: Analyzing trace with hash 404926717, now seen corresponding path program 1 times [2021-11-17 12:50:13,596 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:50:13,596 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932693329] [2021-11-17 12:50:13,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:50:13,597 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:50:13,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:13,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:50:13,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:13,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:50:13,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:13,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:50:13,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:13,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 12:50:13,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:13,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 12:50:13,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:14,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 12:50:14,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:14,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 12:50:14,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:14,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:50:14,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:14,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 12:50:14,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:14,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 12:50:14,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:14,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-17 12:50:14,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:14,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-17 12:50:14,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:14,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-17 12:50:14,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:14,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-17 12:50:14,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:14,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-11-17 12:50:14,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:14,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-17 12:50:14,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:14,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-11-17 12:50:14,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:14,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-11-17 12:50:14,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:14,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-11-17 12:50:14,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:14,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-11-17 12:50:14,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:14,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-11-17 12:50:14,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:14,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-11-17 12:50:14,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:14,183 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-17 12:50:14,183 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:50:14,183 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932693329] [2021-11-17 12:50:14,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932693329] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:50:14,183 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:50:14,184 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:50:14,184 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490052142] [2021-11-17 12:50:14,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:50:14,185 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:50:14,185 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:50:14,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:50:14,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:50:14,186 INFO L87 Difference]: Start difference. First operand 4003 states and 5856 transitions. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2021-11-17 12:50:16,274 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:50:18,375 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:50:25,132 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:50:27,959 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:50:38,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:50:38,032 INFO L93 Difference]: Finished difference Result 4003 states and 5856 transitions. [2021-11-17 12:50:38,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:50:38,033 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 145 [2021-11-17 12:50:38,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:50:38,049 INFO L225 Difference]: With dead ends: 4003 [2021-11-17 12:50:38,049 INFO L226 Difference]: Without dead ends: 4001 [2021-11-17 12:50:38,053 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:50:38,054 INFO L933 BasicCegarLoop]: 3063 mSDtfsCounter, 6392 mSDsluCounter, 2072 mSDsCounter, 0 mSdLazyCounter, 2906 mSolverCounterSat, 2224 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6555 SdHoareTripleChecker+Valid, 5135 SdHoareTripleChecker+Invalid, 5133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2224 IncrementalHoareTripleChecker+Valid, 2906 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.3s IncrementalHoareTripleChecker+Time [2021-11-17 12:50:38,054 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6555 Valid, 5135 Invalid, 5133 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2224 Valid, 2906 Invalid, 3 Unknown, 0 Unchecked, 23.3s Time] [2021-11-17 12:50:38,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4001 states. [2021-11-17 12:50:38,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4001 to 4001. [2021-11-17 12:50:38,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4001 states, 2981 states have (on average 1.3938275746393827) internal successors, (4155), 3072 states have internal predecessors, (4155), 838 states have call successors, (838), 172 states have call predecessors, (838), 173 states have return successors, (860), 793 states have call predecessors, (860), 836 states have call successors, (860) [2021-11-17 12:50:38,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4001 states to 4001 states and 5853 transitions. [2021-11-17 12:50:38,244 INFO L78 Accepts]: Start accepts. Automaton has 4001 states and 5853 transitions. Word has length 145 [2021-11-17 12:50:38,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:50:38,245 INFO L470 AbstractCegarLoop]: Abstraction has 4001 states and 5853 transitions. [2021-11-17 12:50:38,245 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2021-11-17 12:50:38,245 INFO L276 IsEmpty]: Start isEmpty. Operand 4001 states and 5853 transitions. [2021-11-17 12:50:38,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2021-11-17 12:50:38,248 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:50:38,248 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:50:38,248 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-17 12:50:38,248 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_linux_lib_idr_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 23 more)] === [2021-11-17 12:50:38,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:50:38,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1811579280, now seen corresponding path program 1 times [2021-11-17 12:50:38,250 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:50:38,250 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570088336] [2021-11-17 12:50:38,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:50:38,250 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:50:38,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:38,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:50:38,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:38,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:50:38,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:38,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:50:38,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:38,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 12:50:38,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:38,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 12:50:38,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:38,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 12:50:38,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:38,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 12:50:38,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:38,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:50:38,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:38,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 12:50:38,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:38,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 12:50:38,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:38,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-17 12:50:38,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:38,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-17 12:50:38,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:38,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-17 12:50:38,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:38,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-17 12:50:38,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:38,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-11-17 12:50:38,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:38,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-17 12:50:38,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:38,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-11-17 12:50:38,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:38,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-11-17 12:50:38,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:38,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-11-17 12:50:38,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:38,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-11-17 12:50:38,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:38,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-11-17 12:50:38,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:38,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-11-17 12:50:38,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:38,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-11-17 12:50:38,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:38,859 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-17 12:50:38,859 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:50:38,860 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570088336] [2021-11-17 12:50:38,860 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570088336] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:50:38,860 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:50:38,860 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:50:38,860 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999123123] [2021-11-17 12:50:38,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:50:38,860 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:50:38,861 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:50:38,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:50:38,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:50:38,861 INFO L87 Difference]: Start difference. First operand 4001 states and 5853 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2021-11-17 12:50:40,949 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:50:43,047 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:50:49,864 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:50:52,420 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:51:03,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:51:03,653 INFO L93 Difference]: Finished difference Result 4001 states and 5853 transitions. [2021-11-17 12:51:03,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:51:03,653 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 151 [2021-11-17 12:51:03,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:51:03,667 INFO L225 Difference]: With dead ends: 4001 [2021-11-17 12:51:03,667 INFO L226 Difference]: Without dead ends: 3999 [2021-11-17 12:51:03,670 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:51:03,671 INFO L933 BasicCegarLoop]: 3061 mSDtfsCounter, 6386 mSDsluCounter, 2072 mSDsCounter, 0 mSdLazyCounter, 2904 mSolverCounterSat, 2224 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6548 SdHoareTripleChecker+Valid, 5133 SdHoareTripleChecker+Invalid, 5131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2224 IncrementalHoareTripleChecker+Valid, 2904 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.1s IncrementalHoareTripleChecker+Time [2021-11-17 12:51:03,671 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6548 Valid, 5133 Invalid, 5131 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2224 Valid, 2904 Invalid, 3 Unknown, 0 Unchecked, 24.1s Time] [2021-11-17 12:51:03,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3999 states. [2021-11-17 12:51:03,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3999 to 3999. [2021-11-17 12:51:03,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3999 states, 2980 states have (on average 1.3932885906040269) internal successors, (4152), 3070 states have internal predecessors, (4152), 838 states have call successors, (838), 172 states have call predecessors, (838), 173 states have return successors, (860), 793 states have call predecessors, (860), 836 states have call successors, (860) [2021-11-17 12:51:03,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3999 states to 3999 states and 5850 transitions. [2021-11-17 12:51:03,864 INFO L78 Accepts]: Start accepts. Automaton has 3999 states and 5850 transitions. Word has length 151 [2021-11-17 12:51:03,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:51:03,864 INFO L470 AbstractCegarLoop]: Abstraction has 3999 states and 5850 transitions. [2021-11-17 12:51:03,865 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2021-11-17 12:51:03,865 INFO L276 IsEmpty]: Start isEmpty. Operand 3999 states and 5850 transitions. [2021-11-17 12:51:03,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2021-11-17 12:51:03,868 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:51:03,868 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:51:03,868 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-17 12:51:03,869 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 23 more)] === [2021-11-17 12:51:03,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:51:03,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1842344600, now seen corresponding path program 1 times [2021-11-17 12:51:03,870 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:51:03,870 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023585707] [2021-11-17 12:51:03,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:51:03,870 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:51:03,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:04,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:51:04,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:04,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:51:04,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:04,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:51:04,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:04,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 12:51:04,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:04,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 12:51:04,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:04,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 12:51:04,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:04,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 12:51:04,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:04,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:51:04,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:04,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 12:51:04,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:04,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 12:51:04,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:04,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-17 12:51:04,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:04,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 12:51:04,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:04,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:51:04,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:04,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:51:04,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:04,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:51:04,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:04,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-11-17 12:51:04,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:04,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-11-17 12:51:04,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:04,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:51:04,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:04,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:51:04,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:04,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:51:04,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:04,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2021-11-17 12:51:04,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:04,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-11-17 12:51:04,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:04,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-17 12:51:04,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:04,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-11-17 12:51:04,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:04,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2021-11-17 12:51:04,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:04,606 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2021-11-17 12:51:04,606 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:51:04,606 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023585707] [2021-11-17 12:51:04,606 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023585707] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:51:04,606 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:51:04,607 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-17 12:51:04,607 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302608226] [2021-11-17 12:51:04,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:51:04,607 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-17 12:51:04,607 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:51:04,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-17 12:51:04,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-11-17 12:51:04,608 INFO L87 Difference]: Start difference. First operand 3999 states and 5850 transitions. Second operand has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (24), 6 states have call predecessors, (24), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2021-11-17 12:51:06,688 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:51:08,785 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:51:10,885 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:51:24,138 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:51:27,913 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:51:28,989 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:51:30,117 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:52:00,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:52:00,269 INFO L93 Difference]: Finished difference Result 6133 states and 9005 transitions. [2021-11-17 12:52:00,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-17 12:52:00,270 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (24), 6 states have call predecessors, (24), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 175 [2021-11-17 12:52:00,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:52:00,280 INFO L225 Difference]: With dead ends: 6133 [2021-11-17 12:52:00,280 INFO L226 Difference]: Without dead ends: 2551 [2021-11-17 12:52:00,292 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2021-11-17 12:52:00,293 INFO L933 BasicCegarLoop]: 3023 mSDtfsCounter, 5460 mSDsluCounter, 4916 mSDsCounter, 0 mSdLazyCounter, 8495 mSolverCounterSat, 2912 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 52.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5460 SdHoareTripleChecker+Valid, 7939 SdHoareTripleChecker+Invalid, 11412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2912 IncrementalHoareTripleChecker+Valid, 8495 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 54.5s IncrementalHoareTripleChecker+Time [2021-11-17 12:52:00,293 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5460 Valid, 7939 Invalid, 11412 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2912 Valid, 8495 Invalid, 5 Unknown, 0 Unchecked, 54.5s Time] [2021-11-17 12:52:00,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2551 states. [2021-11-17 12:52:00,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2551 to 2488. [2021-11-17 12:52:00,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2488 states, 1849 states have (on average 1.3877771768523526) internal successors, (2566), 1901 states have internal predecessors, (2566), 524 states have call successors, (524), 108 states have call predecessors, (524), 107 states have return successors, (522), 500 states have call predecessors, (522), 522 states have call successors, (522) [2021-11-17 12:52:00,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2488 states to 2488 states and 3612 transitions. [2021-11-17 12:52:00,385 INFO L78 Accepts]: Start accepts. Automaton has 2488 states and 3612 transitions. Word has length 175 [2021-11-17 12:52:00,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:52:00,385 INFO L470 AbstractCegarLoop]: Abstraction has 2488 states and 3612 transitions. [2021-11-17 12:52:00,385 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (24), 6 states have call predecessors, (24), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2021-11-17 12:52:00,385 INFO L276 IsEmpty]: Start isEmpty. Operand 2488 states and 3612 transitions. [2021-11-17 12:52:00,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-11-17 12:52:00,388 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:52:00,389 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:52:00,389 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-17 12:52:00,389 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 23 more)] === [2021-11-17 12:52:00,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:52:00,389 INFO L85 PathProgramCache]: Analyzing trace with hash -992302049, now seen corresponding path program 1 times [2021-11-17 12:52:00,389 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:52:00,390 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182295951] [2021-11-17 12:52:00,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:52:00,390 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:52:00,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:00,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:52:00,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:00,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:52:00,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:00,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:52:00,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:00,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 12:52:00,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:00,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 12:52:00,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:00,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 12:52:00,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:00,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 12:52:00,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:00,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:52:00,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:00,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 12:52:00,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:00,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 12:52:00,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:00,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-17 12:52:00,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:00,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-17 12:52:00,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:00,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-17 12:52:00,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:00,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-17 12:52:00,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:00,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-11-17 12:52:00,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:00,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-17 12:52:00,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:00,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-11-17 12:52:00,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:00,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-11-17 12:52:00,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:00,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-11-17 12:52:00,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:00,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-11-17 12:52:00,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:00,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-11-17 12:52:00,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:00,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-11-17 12:52:00,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:00,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-11-17 12:52:00,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:00,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2021-11-17 12:52:00,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:00,967 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-17 12:52:00,967 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:52:00,967 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182295951] [2021-11-17 12:52:00,968 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182295951] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:52:00,968 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:52:00,968 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:52:00,969 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812249433] [2021-11-17 12:52:00,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:52:00,969 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:52:00,969 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:52:00,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:52:00,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:52:00,970 INFO L87 Difference]: Start difference. First operand 2488 states and 3612 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2021-11-17 12:52:03,056 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:52:05,156 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:52:12,278 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:52:14,440 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:52:24,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:52:24,889 INFO L93 Difference]: Finished difference Result 2488 states and 3612 transitions. [2021-11-17 12:52:24,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:52:24,890 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 157 [2021-11-17 12:52:24,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:52:24,899 INFO L225 Difference]: With dead ends: 2488 [2021-11-17 12:52:24,899 INFO L226 Difference]: Without dead ends: 2486 [2021-11-17 12:52:24,900 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:52:24,900 INFO L933 BasicCegarLoop]: 3059 mSDtfsCounter, 6380 mSDsluCounter, 2072 mSDsCounter, 0 mSdLazyCounter, 2902 mSolverCounterSat, 2224 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6541 SdHoareTripleChecker+Valid, 5131 SdHoareTripleChecker+Invalid, 5129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2224 IncrementalHoareTripleChecker+Valid, 2902 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.4s IncrementalHoareTripleChecker+Time [2021-11-17 12:52:24,900 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6541 Valid, 5131 Invalid, 5129 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2224 Valid, 2902 Invalid, 3 Unknown, 0 Unchecked, 23.4s Time] [2021-11-17 12:52:24,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2486 states. [2021-11-17 12:52:25,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2486 to 2486. [2021-11-17 12:52:25,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2486 states, 1848 states have (on average 1.3874458874458875) internal successors, (2564), 1899 states have internal predecessors, (2564), 524 states have call successors, (524), 108 states have call predecessors, (524), 107 states have return successors, (522), 500 states have call predecessors, (522), 522 states have call successors, (522) [2021-11-17 12:52:25,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2486 states to 2486 states and 3610 transitions. [2021-11-17 12:52:25,026 INFO L78 Accepts]: Start accepts. Automaton has 2486 states and 3610 transitions. Word has length 157 [2021-11-17 12:52:25,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:52:25,026 INFO L470 AbstractCegarLoop]: Abstraction has 2486 states and 3610 transitions. [2021-11-17 12:52:25,026 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2021-11-17 12:52:25,026 INFO L276 IsEmpty]: Start isEmpty. Operand 2486 states and 3610 transitions. [2021-11-17 12:52:25,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-11-17 12:52:25,029 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:52:25,029 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:52:25,030 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-17 12:52:25,030 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_linux_net_rtnetlink_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 23 more)] === [2021-11-17 12:52:25,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:52:25,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1554495602, now seen corresponding path program 1 times [2021-11-17 12:52:25,030 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:52:25,030 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933771902] [2021-11-17 12:52:25,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:52:25,031 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:52:25,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:25,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:52:25,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:25,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:52:25,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:25,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:52:25,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:25,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 12:52:25,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:25,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 12:52:25,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:25,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 12:52:25,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:25,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 12:52:25,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:25,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:52:25,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:25,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 12:52:25,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:25,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 12:52:25,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:25,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-17 12:52:25,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:25,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-17 12:52:25,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:25,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-17 12:52:25,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:25,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-17 12:52:25,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:25,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-11-17 12:52:25,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:25,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-17 12:52:25,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:25,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-11-17 12:52:25,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:25,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-11-17 12:52:25,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:25,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-11-17 12:52:25,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:25,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-11-17 12:52:25,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:25,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-11-17 12:52:25,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:25,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-11-17 12:52:25,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:25,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-11-17 12:52:25,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:25,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2021-11-17 12:52:25,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:25,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2021-11-17 12:52:25,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:25,644 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-17 12:52:25,644 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:52:25,644 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933771902] [2021-11-17 12:52:25,644 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933771902] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:52:25,644 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:52:25,645 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:52:25,645 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483063276] [2021-11-17 12:52:25,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:52:25,645 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:52:25,646 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:52:25,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:52:25,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:52:25,646 INFO L87 Difference]: Start difference. First operand 2486 states and 3610 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2021-11-17 12:52:27,731 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:52:29,849 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:52:36,706 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:52:38,622 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:52:48,274 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:52:50,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:52:50,657 INFO L93 Difference]: Finished difference Result 2486 states and 3610 transitions. [2021-11-17 12:52:50,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:52:50,658 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 163 [2021-11-17 12:52:50,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:52:50,666 INFO L225 Difference]: With dead ends: 2486 [2021-11-17 12:52:50,666 INFO L226 Difference]: Without dead ends: 2484 [2021-11-17 12:52:50,668 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:52:50,677 INFO L933 BasicCegarLoop]: 3057 mSDtfsCounter, 6374 mSDsluCounter, 2072 mSDsCounter, 0 mSdLazyCounter, 2900 mSolverCounterSat, 2224 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6534 SdHoareTripleChecker+Valid, 5129 SdHoareTripleChecker+Invalid, 5127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2224 IncrementalHoareTripleChecker+Valid, 2900 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.5s IncrementalHoareTripleChecker+Time [2021-11-17 12:52:50,678 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6534 Valid, 5129 Invalid, 5127 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2224 Valid, 2900 Invalid, 3 Unknown, 0 Unchecked, 24.5s Time] [2021-11-17 12:52:50,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2484 states. [2021-11-17 12:52:50,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2484 to 2484. [2021-11-17 12:52:50,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2484 states, 1847 states have (on average 1.3871142393069844) internal successors, (2562), 1897 states have internal predecessors, (2562), 524 states have call successors, (524), 108 states have call predecessors, (524), 107 states have return successors, (522), 500 states have call predecessors, (522), 522 states have call successors, (522) [2021-11-17 12:52:50,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2484 states to 2484 states and 3608 transitions. [2021-11-17 12:52:50,776 INFO L78 Accepts]: Start accepts. Automaton has 2484 states and 3608 transitions. Word has length 163 [2021-11-17 12:52:50,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:52:50,777 INFO L470 AbstractCegarLoop]: Abstraction has 2484 states and 3608 transitions. [2021-11-17 12:52:50,777 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2021-11-17 12:52:50,777 INFO L276 IsEmpty]: Start isEmpty. Operand 2484 states and 3608 transitions. [2021-11-17 12:52:50,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-11-17 12:52:50,780 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:52:50,780 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:52:50,780 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-17 12:52:50,781 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_linux_net_sock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 23 more)] === [2021-11-17 12:52:50,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:52:50,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1957492940, now seen corresponding path program 1 times [2021-11-17 12:52:50,781 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:52:50,781 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749205997] [2021-11-17 12:52:50,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:52:50,782 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:52:50,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:51,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:52:51,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:51,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:52:51,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:51,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:52:51,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:51,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 12:52:51,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:51,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 12:52:51,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:51,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 12:52:51,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:51,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 12:52:51,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:51,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:52:51,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:51,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 12:52:51,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:51,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 12:52:51,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:51,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-17 12:52:51,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:51,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-17 12:52:51,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:51,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-17 12:52:51,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:51,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-17 12:52:51,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:51,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-11-17 12:52:51,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:51,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-17 12:52:51,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:51,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-11-17 12:52:51,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:51,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-11-17 12:52:51,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:51,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-11-17 12:52:51,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:51,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-11-17 12:52:51,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:51,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-11-17 12:52:51,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:51,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-11-17 12:52:51,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:51,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-11-17 12:52:51,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:51,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2021-11-17 12:52:51,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:51,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2021-11-17 12:52:51,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:51,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2021-11-17 12:52:51,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:51,366 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-17 12:52:51,366 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:52:51,366 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749205997] [2021-11-17 12:52:51,366 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749205997] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:52:51,366 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:52:51,367 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:52:51,367 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694273857] [2021-11-17 12:52:51,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:52:51,367 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:52:51,367 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:52:51,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:52:51,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:52:51,368 INFO L87 Difference]: Start difference. First operand 2484 states and 3608 transitions. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2021-11-17 12:52:53,450 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:52:55,529 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:53:03,041 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:53:05,187 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:53:15,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:53:15,987 INFO L93 Difference]: Finished difference Result 2484 states and 3608 transitions. [2021-11-17 12:53:15,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:53:15,988 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 169 [2021-11-17 12:53:15,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:53:15,996 INFO L225 Difference]: With dead ends: 2484 [2021-11-17 12:53:15,996 INFO L226 Difference]: Without dead ends: 2482 [2021-11-17 12:53:15,998 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:53:15,998 INFO L933 BasicCegarLoop]: 3055 mSDtfsCounter, 6368 mSDsluCounter, 2072 mSDsCounter, 0 mSdLazyCounter, 2898 mSolverCounterSat, 2224 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6527 SdHoareTripleChecker+Valid, 5127 SdHoareTripleChecker+Invalid, 5125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2224 IncrementalHoareTripleChecker+Valid, 2898 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.1s IncrementalHoareTripleChecker+Time [2021-11-17 12:53:15,998 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6527 Valid, 5127 Invalid, 5125 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2224 Valid, 2898 Invalid, 3 Unknown, 0 Unchecked, 24.1s Time] [2021-11-17 12:53:16,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2482 states. [2021-11-17 12:53:16,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2482 to 2482. [2021-11-17 12:53:16,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2482 states, 1846 states have (on average 1.3867822318526544) internal successors, (2560), 1895 states have internal predecessors, (2560), 524 states have call successors, (524), 108 states have call predecessors, (524), 107 states have return successors, (522), 500 states have call predecessors, (522), 522 states have call successors, (522) [2021-11-17 12:53:16,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2482 states to 2482 states and 3606 transitions. [2021-11-17 12:53:16,097 INFO L78 Accepts]: Start accepts. Automaton has 2482 states and 3606 transitions. Word has length 169 [2021-11-17 12:53:16,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:53:16,097 INFO L470 AbstractCegarLoop]: Abstraction has 2482 states and 3606 transitions. [2021-11-17 12:53:16,097 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2021-11-17 12:53:16,098 INFO L276 IsEmpty]: Start isEmpty. Operand 2482 states and 3606 transitions. [2021-11-17 12:53:16,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2021-11-17 12:53:16,101 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:53:16,101 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:53:16,101 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-17 12:53:16,102 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 23 more)] === [2021-11-17 12:53:16,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:53:16,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1627790189, now seen corresponding path program 1 times [2021-11-17 12:53:16,102 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:53:16,102 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245034828] [2021-11-17 12:53:16,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:53:16,103 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:53:16,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:16,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:53:16,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:16,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:53:16,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:16,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:53:16,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:16,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 12:53:16,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:16,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 12:53:16,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:16,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 12:53:16,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:16,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 12:53:16,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:16,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:53:16,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:16,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 12:53:16,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:16,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 12:53:16,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:16,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-17 12:53:16,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:16,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-17 12:53:16,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:16,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-17 12:53:16,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:16,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-17 12:53:16,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:16,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-11-17 12:53:16,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:16,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-17 12:53:16,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:16,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-11-17 12:53:16,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:16,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-11-17 12:53:16,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:16,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-11-17 12:53:16,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:16,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-11-17 12:53:16,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:16,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-11-17 12:53:16,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:16,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-11-17 12:53:16,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:16,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-11-17 12:53:16,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:16,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2021-11-17 12:53:16,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:16,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2021-11-17 12:53:16,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:16,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2021-11-17 12:53:16,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:16,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2021-11-17 12:53:16,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:16,758 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-17 12:53:16,759 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:53:16,759 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245034828] [2021-11-17 12:53:16,759 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245034828] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:53:16,759 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:53:16,759 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:53:16,759 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288392099] [2021-11-17 12:53:16,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:53:16,759 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:53:16,759 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:53:16,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:53:16,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:53:16,760 INFO L87 Difference]: Start difference. First operand 2482 states and 3606 transitions. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2021-11-17 12:53:18,851 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:53:20,943 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] Killed by 15