./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--block--rsxx--rsxx.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--block--rsxx--rsxx.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 017a921c8c43c4a2a11daf67a2d7f6c852b9597686d5b2eb3df4edf6699bf55b --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-17 12:21:43,234 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-17 12:21:43,235 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-17 12:21:43,260 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-17 12:21:43,264 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-17 12:21:43,265 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-17 12:21:43,266 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-17 12:21:43,277 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-17 12:21:43,279 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-17 12:21:43,280 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-17 12:21:43,281 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-17 12:21:43,281 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-17 12:21:43,282 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-17 12:21:43,283 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-17 12:21:43,284 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-17 12:21:43,285 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-17 12:21:43,285 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-17 12:21:43,286 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-17 12:21:43,288 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-17 12:21:43,289 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-17 12:21:43,291 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-17 12:21:43,292 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-17 12:21:43,293 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-17 12:21:43,293 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-17 12:21:43,296 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-17 12:21:43,296 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-17 12:21:43,296 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-17 12:21:43,297 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-17 12:21:43,298 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-17 12:21:43,298 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-17 12:21:43,299 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-17 12:21:43,299 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-17 12:21:43,300 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-17 12:21:43,301 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-17 12:21:43,301 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-17 12:21:43,302 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-17 12:21:43,302 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-17 12:21:43,303 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-17 12:21:43,303 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-17 12:21:43,304 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-17 12:21:43,304 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-17 12:21:43,305 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:21:43,327 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-17 12:21:43,328 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-17 12:21:43,328 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-17 12:21:43,329 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-17 12:21:43,329 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-17 12:21:43,330 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-17 12:21:43,330 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-17 12:21:43,330 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-17 12:21:43,330 INFO L138 SettingsManager]: * Use SBE=true [2021-11-17 12:21:43,331 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-17 12:21:43,331 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-17 12:21:43,331 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-17 12:21:43,332 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-17 12:21:43,332 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-17 12:21:43,332 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-17 12:21:43,332 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-17 12:21:43,332 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-17 12:21:43,332 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-17 12:21:43,333 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-17 12:21:43,333 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-17 12:21:43,333 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-17 12:21:43,333 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-17 12:21:43,333 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-17 12:21:43,334 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-17 12:21:43,334 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-17 12:21:43,334 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-17 12:21:43,334 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-17 12:21:43,334 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-17 12:21:43,334 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-17 12:21:43,335 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-17 12:21:43,335 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-17 12:21:43,335 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 -> 017a921c8c43c4a2a11daf67a2d7f6c852b9597686d5b2eb3df4edf6699bf55b [2021-11-17 12:21:43,594 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-17 12:21:43,617 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-17 12:21:43,620 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-17 12:21:43,621 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-17 12:21:43,621 INFO L275 PluginConnector]: CDTParser initialized [2021-11-17 12:21:43,622 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--block--rsxx--rsxx.ko.cil.i [2021-11-17 12:21:43,680 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a174c622a/f44145dd6fb04c688ecb0bf44e52a515/FLAG99b31bff5 [2021-11-17 12:21:44,422 INFO L306 CDTParser]: Found 1 translation units. [2021-11-17 12:21:44,423 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i [2021-11-17 12:21:44,480 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a174c622a/f44145dd6fb04c688ecb0bf44e52a515/FLAG99b31bff5 [2021-11-17 12:21:44,961 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a174c622a/f44145dd6fb04c688ecb0bf44e52a515 [2021-11-17 12:21:44,963 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-17 12:21:44,965 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-17 12:21:44,966 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-17 12:21:44,966 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-17 12:21:44,968 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-17 12:21:44,969 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:21:44" (1/1) ... [2021-11-17 12:21:44,970 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3520715 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:21:44, skipping insertion in model container [2021-11-17 12:21:44,970 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:21:44" (1/1) ... [2021-11-17 12:21:44,976 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-17 12:21:45,142 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-17 12:21:48,981 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[475253,475266] [2021-11-17 12:21:48,984 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[475398,475411] [2021-11-17 12:21:48,984 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[475544,475557] [2021-11-17 12:21:48,985 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[475709,475722] [2021-11-17 12:21:48,985 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[475867,475880] [2021-11-17 12:21:48,986 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[476025,476038] [2021-11-17 12:21:48,986 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[476183,476196] [2021-11-17 12:21:48,987 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[476343,476356] [2021-11-17 12:21:48,987 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[476502,476515] [2021-11-17 12:21:48,987 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[476641,476654] [2021-11-17 12:21:48,988 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[476783,476796] [2021-11-17 12:21:48,988 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[476932,476945] [2021-11-17 12:21:48,989 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[477071,477084] [2021-11-17 12:21:48,989 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[477226,477239] [2021-11-17 12:21:48,989 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[477386,477399] [2021-11-17 12:21:48,990 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[477537,477550] [2021-11-17 12:21:48,990 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[477688,477701] [2021-11-17 12:21:48,990 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[477840,477853] [2021-11-17 12:21:48,991 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[477989,478002] [2021-11-17 12:21:48,991 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[478137,478150] [2021-11-17 12:21:48,992 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[478294,478307] [2021-11-17 12:21:48,992 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[478443,478456] [2021-11-17 12:21:48,992 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[478599,478612] [2021-11-17 12:21:48,993 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[478752,478765] [2021-11-17 12:21:48,993 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[478898,478911] [2021-11-17 12:21:48,994 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[479041,479054] [2021-11-17 12:21:48,994 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[479193,479206] [2021-11-17 12:21:48,994 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[479339,479352] [2021-11-17 12:21:48,995 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[479484,479497] [2021-11-17 12:21:48,995 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[479638,479651] [2021-11-17 12:21:48,996 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[479789,479802] [2021-11-17 12:21:48,996 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[479944,479957] [2021-11-17 12:21:48,996 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[480096,480109] [2021-11-17 12:21:48,997 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[480251,480264] [2021-11-17 12:21:48,997 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[480415,480428] [2021-11-17 12:21:48,997 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[480571,480584] [2021-11-17 12:21:48,998 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[480735,480748] [2021-11-17 12:21:48,998 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[480877,480890] [2021-11-17 12:21:48,998 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[481035,481048] [2021-11-17 12:21:48,999 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[481202,481215] [2021-11-17 12:21:48,999 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[481361,481374] [2021-11-17 12:21:48,999 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[481520,481533] [2021-11-17 12:21:49,000 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[481669,481682] [2021-11-17 12:21:49,000 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[481816,481829] [2021-11-17 12:21:49,000 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[481955,481968] [2021-11-17 12:21:49,001 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[482118,482131] [2021-11-17 12:21:49,001 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[482284,482297] [2021-11-17 12:21:49,002 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[482448,482461] [2021-11-17 12:21:49,002 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[482613,482626] [2021-11-17 12:21:49,002 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[482778,482791] [2021-11-17 12:21:49,003 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[482944,482957] [2021-11-17 12:21:49,003 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[483109,483122] [2021-11-17 12:21:49,003 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[483276,483289] [2021-11-17 12:21:49,004 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[483436,483449] [2021-11-17 12:21:49,004 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[483598,483611] [2021-11-17 12:21:49,004 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[483757,483770] [2021-11-17 12:21:49,005 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[483903,483916] [2021-11-17 12:21:49,005 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[484046,484059] [2021-11-17 12:21:49,005 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[484190,484203] [2021-11-17 12:21:49,006 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[484333,484346] [2021-11-17 12:21:49,006 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[484477,484490] [2021-11-17 12:21:49,006 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[484618,484631] [2021-11-17 12:21:49,007 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[484756,484769] [2021-11-17 12:21:49,007 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[484914,484927] [2021-11-17 12:21:49,007 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[485073,485086] [2021-11-17 12:21:49,008 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[485229,485242] [2021-11-17 12:21:49,008 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[485378,485391] [2021-11-17 12:21:49,008 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[485530,485543] [2021-11-17 12:21:49,009 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[485681,485694] [2021-11-17 12:21:49,009 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[485830,485843] [2021-11-17 12:21:49,009 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[485982,485995] [2021-11-17 12:21:49,010 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[486130,486143] [2021-11-17 12:21:49,010 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[486283,486296] [2021-11-17 12:21:49,010 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[486434,486447] [2021-11-17 12:21:49,011 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[486584,486597] [2021-11-17 12:21:49,011 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[486731,486744] [2021-11-17 12:21:49,011 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[486882,486895] [2021-11-17 12:21:49,011 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[487033,487046] [2021-11-17 12:21:49,012 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[487181,487194] [2021-11-17 12:21:49,012 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[487347,487360] [2021-11-17 12:21:49,012 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[487516,487529] [2021-11-17 12:21:49,013 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[487683,487696] [2021-11-17 12:21:49,013 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[487851,487864] [2021-11-17 12:21:49,013 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[488001,488014] [2021-11-17 12:21:49,014 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[488148,488161] [2021-11-17 12:21:49,014 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[488309,488322] [2021-11-17 12:21:49,014 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[488479,488492] [2021-11-17 12:21:49,015 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[488641,488654] [2021-11-17 12:21:49,032 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-17 12:21:49,053 INFO L203 MainTranslator]: Completed pre-run [2021-11-17 12:21:49,542 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[475253,475266] [2021-11-17 12:21:49,544 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[475398,475411] [2021-11-17 12:21:49,544 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[475544,475557] [2021-11-17 12:21:49,545 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[475709,475722] [2021-11-17 12:21:49,546 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[475867,475880] [2021-11-17 12:21:49,546 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[476025,476038] [2021-11-17 12:21:49,547 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[476183,476196] [2021-11-17 12:21:49,547 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[476343,476356] [2021-11-17 12:21:49,548 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[476502,476515] [2021-11-17 12:21:49,549 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[476641,476654] [2021-11-17 12:21:49,549 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[476783,476796] [2021-11-17 12:21:49,550 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[476932,476945] [2021-11-17 12:21:49,550 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[477071,477084] [2021-11-17 12:21:49,550 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[477226,477239] [2021-11-17 12:21:49,550 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[477386,477399] [2021-11-17 12:21:49,551 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[477537,477550] [2021-11-17 12:21:49,551 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[477688,477701] [2021-11-17 12:21:49,551 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[477840,477853] [2021-11-17 12:21:49,552 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[477989,478002] [2021-11-17 12:21:49,552 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[478137,478150] [2021-11-17 12:21:49,552 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[478294,478307] [2021-11-17 12:21:49,553 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[478443,478456] [2021-11-17 12:21:49,553 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[478599,478612] [2021-11-17 12:21:49,554 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[478752,478765] [2021-11-17 12:21:49,554 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[478898,478911] [2021-11-17 12:21:49,554 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[479041,479054] [2021-11-17 12:21:49,555 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[479193,479206] [2021-11-17 12:21:49,555 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[479339,479352] [2021-11-17 12:21:49,555 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[479484,479497] [2021-11-17 12:21:49,556 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[479638,479651] [2021-11-17 12:21:49,556 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[479789,479802] [2021-11-17 12:21:49,556 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[479944,479957] [2021-11-17 12:21:49,556 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[480096,480109] [2021-11-17 12:21:49,557 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[480251,480264] [2021-11-17 12:21:49,557 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[480415,480428] [2021-11-17 12:21:49,558 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[480571,480584] [2021-11-17 12:21:49,558 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[480735,480748] [2021-11-17 12:21:49,558 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[480877,480890] [2021-11-17 12:21:49,559 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[481035,481048] [2021-11-17 12:21:49,559 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[481202,481215] [2021-11-17 12:21:49,560 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[481361,481374] [2021-11-17 12:21:49,560 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[481520,481533] [2021-11-17 12:21:49,561 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[481669,481682] [2021-11-17 12:21:49,561 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[481816,481829] [2021-11-17 12:21:49,561 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[481955,481968] [2021-11-17 12:21:49,562 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[482118,482131] [2021-11-17 12:21:49,562 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[482284,482297] [2021-11-17 12:21:49,563 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[482448,482461] [2021-11-17 12:21:49,563 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[482613,482626] [2021-11-17 12:21:49,564 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[482778,482791] [2021-11-17 12:21:49,564 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[482944,482957] [2021-11-17 12:21:49,564 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[483109,483122] [2021-11-17 12:21:49,565 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[483276,483289] [2021-11-17 12:21:49,565 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[483436,483449] [2021-11-17 12:21:49,565 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[483598,483611] [2021-11-17 12:21:49,566 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[483757,483770] [2021-11-17 12:21:49,567 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[483903,483916] [2021-11-17 12:21:49,567 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[484046,484059] [2021-11-17 12:21:49,567 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[484190,484203] [2021-11-17 12:21:49,568 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[484333,484346] [2021-11-17 12:21:49,571 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[484477,484490] [2021-11-17 12:21:49,572 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[484618,484631] [2021-11-17 12:21:49,573 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[484756,484769] [2021-11-17 12:21:49,575 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[484914,484927] [2021-11-17 12:21:49,575 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[485073,485086] [2021-11-17 12:21:49,575 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[485229,485242] [2021-11-17 12:21:49,576 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[485378,485391] [2021-11-17 12:21:49,576 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[485530,485543] [2021-11-17 12:21:49,577 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[485681,485694] [2021-11-17 12:21:49,577 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[485830,485843] [2021-11-17 12:21:49,578 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[485982,485995] [2021-11-17 12:21:49,578 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[486130,486143] [2021-11-17 12:21:49,582 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[486283,486296] [2021-11-17 12:21:49,583 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[486434,486447] [2021-11-17 12:21:49,583 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[486584,486597] [2021-11-17 12:21:49,583 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[486731,486744] [2021-11-17 12:21:49,583 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[486882,486895] [2021-11-17 12:21:49,584 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[487033,487046] [2021-11-17 12:21:49,585 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[487181,487194] [2021-11-17 12:21:49,585 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[487347,487360] [2021-11-17 12:21:49,586 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[487516,487529] [2021-11-17 12:21:49,586 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[487683,487696] [2021-11-17 12:21:49,587 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[487851,487864] [2021-11-17 12:21:49,587 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[488001,488014] [2021-11-17 12:21:49,588 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[488148,488161] [2021-11-17 12:21:49,588 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[488309,488322] [2021-11-17 12:21:49,588 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[488479,488492] [2021-11-17 12:21:49,588 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i[488641,488654] [2021-11-17 12:21:49,594 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-17 12:21:49,836 INFO L208 MainTranslator]: Completed translation [2021-11-17 12:21:49,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:21:49 WrapperNode [2021-11-17 12:21:49,836 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-17 12:21:49,837 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-17 12:21:49,837 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-17 12:21:49,837 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-17 12:21:49,843 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:21:49" (1/1) ... [2021-11-17 12:21:49,975 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:21:49" (1/1) ... [2021-11-17 12:21:50,191 INFO L137 Inliner]: procedures = 858, calls = 4033, calls flagged for inlining = 408, calls inlined = 286, statements flattened = 7197 [2021-11-17 12:21:50,192 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-17 12:21:50,192 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-17 12:21:50,192 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-17 12:21:50,192 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-17 12:21:50,200 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:21:49" (1/1) ... [2021-11-17 12:21:50,200 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:21:49" (1/1) ... [2021-11-17 12:21:50,285 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:21:49" (1/1) ... [2021-11-17 12:21:50,286 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:21:49" (1/1) ... [2021-11-17 12:21:50,397 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:21:49" (1/1) ... [2021-11-17 12:21:50,413 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:21:49" (1/1) ... [2021-11-17 12:21:50,444 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:21:49" (1/1) ... [2021-11-17 12:21:50,475 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-17 12:21:50,476 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-17 12:21:50,476 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-17 12:21:50,476 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-17 12:21:50,477 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:21:49" (1/1) ... [2021-11-17 12:21:50,531 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-17 12:21:50,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 12:21:50,551 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:21:50,562 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:21:50,584 INFO L130 BoogieDeclarations]: Found specification of procedure bio_endio [2021-11-17 12:21:50,584 INFO L138 BoogieDeclarations]: Found implementation of procedure bio_endio [2021-11-17 12:21:50,585 INFO L130 BoogieDeclarations]: Found specification of procedure kmem_cache_create [2021-11-17 12:21:50,585 INFO L138 BoogieDeclarations]: Found implementation of procedure kmem_cache_create [2021-11-17 12:21:50,585 INFO L130 BoogieDeclarations]: Found specification of procedure __disable_intr [2021-11-17 12:21:50,585 INFO L138 BoogieDeclarations]: Found implementation of procedure __disable_intr [2021-11-17 12:21:50,585 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2021-11-17 12:21:50,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2021-11-17 12:21:50,585 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2021-11-17 12:21:50,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2021-11-17 12:21:50,586 INFO L130 BoogieDeclarations]: Found specification of procedure rsxx_cleanup_dma_queue [2021-11-17 12:21:50,586 INFO L138 BoogieDeclarations]: Found implementation of procedure rsxx_cleanup_dma_queue [2021-11-17 12:21:50,586 INFO L130 BoogieDeclarations]: Found specification of procedure valid_dma_direction [2021-11-17 12:21:50,587 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_dma_direction [2021-11-17 12:21:50,587 INFO L130 BoogieDeclarations]: Found specification of procedure queue_flag_set_unlocked [2021-11-17 12:21:50,587 INFO L138 BoogieDeclarations]: Found implementation of procedure queue_flag_set_unlocked [2021-11-17 12:21:50,587 INFO L130 BoogieDeclarations]: Found specification of procedure ioread32 [2021-11-17 12:21:50,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ioread32 [2021-11-17 12:21:50,588 INFO L130 BoogieDeclarations]: Found specification of procedure rsxx_dev_cleanup [2021-11-17 12:21:50,588 INFO L138 BoogieDeclarations]: Found implementation of procedure rsxx_dev_cleanup [2021-11-17 12:21:50,589 INFO L130 BoogieDeclarations]: Found specification of procedure rsxx_cram_write [2021-11-17 12:21:50,589 INFO L138 BoogieDeclarations]: Found implementation of procedure rsxx_cram_write [2021-11-17 12:21:50,589 INFO L130 BoogieDeclarations]: Found specification of procedure pci_get_drvdata [2021-11-17 12:21:50,589 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_get_drvdata [2021-11-17 12:21:50,589 INFO L130 BoogieDeclarations]: Found specification of procedure config_data_swab [2021-11-17 12:21:50,589 INFO L138 BoogieDeclarations]: Found implementation of procedure config_data_swab [2021-11-17 12:21:50,589 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_108 [2021-11-17 12:21:50,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_108 [2021-11-17 12:21:50,590 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_105 [2021-11-17 12:21:50,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_105 [2021-11-17 12:21:50,590 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_101 [2021-11-17 12:21:50,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_101 [2021-11-17 12:21:50,590 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mod_timer_102 [2021-11-17 12:21:50,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mod_timer_102 [2021-11-17 12:21:50,590 INFO L130 BoogieDeclarations]: Found specification of procedure rsxx_detach_dev [2021-11-17 12:21:50,591 INFO L138 BoogieDeclarations]: Found implementation of procedure rsxx_detach_dev [2021-11-17 12:21:50,591 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2021-11-17 12:21:50,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2021-11-17 12:21:50,591 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2021-11-17 12:21:50,591 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2021-11-17 12:21:50,591 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2021-11-17 12:21:50,591 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2021-11-17 12:21:50,592 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_ops [2021-11-17 12:21:50,592 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_ops [2021-11-17 12:21:50,592 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_irq_lock_of_rsxx_cardinfo [2021-11-17 12:21:50,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_irq_lock_of_rsxx_cardinfo [2021-11-17 12:21:50,592 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2021-11-17 12:21:50,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2021-11-17 12:21:50,592 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irq_110 [2021-11-17 12:21:50,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irq_110 [2021-11-17 12:21:50,593 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2021-11-17 12:21:50,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2021-11-17 12:21:50,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-17 12:21:50,593 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2021-11-17 12:21:50,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2021-11-17 12:21:50,593 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2021-11-17 12:21:50,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2021-11-17 12:21:50,594 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_blkdev [2021-11-17 12:21:50,594 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_blkdev [2021-11-17 12:21:50,594 INFO L130 BoogieDeclarations]: Found specification of procedure pci_free_consistent [2021-11-17 12:21:50,594 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_free_consistent [2021-11-17 12:21:50,594 INFO L130 BoogieDeclarations]: Found specification of procedure pci_disable_device [2021-11-17 12:21:50,594 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_disable_device [2021-11-17 12:21:50,595 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2021-11-17 12:21:50,595 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2021-11-17 12:21:50,595 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2021-11-17 12:21:50,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2021-11-17 12:21:50,595 INFO L130 BoogieDeclarations]: Found specification of procedure timer_pending [2021-11-17 12:21:50,595 INFO L138 BoogieDeclarations]: Found implementation of procedure timer_pending [2021-11-17 12:21:50,595 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-17 12:21:50,596 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mod_timer [2021-11-17 12:21:50,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mod_timer [2021-11-17 12:21:50,599 INFO L130 BoogieDeclarations]: Found specification of procedure __list_add [2021-11-17 12:21:50,599 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_add [2021-11-17 12:21:50,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-17 12:21:50,599 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_lock_of_NOT_ARG_SIGN [2021-11-17 12:21:50,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_lock_of_NOT_ARG_SIGN [2021-11-17 12:21:50,599 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2021-11-17 12:21:50,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2021-11-17 12:21:50,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-17 12:21:50,600 INFO L130 BoogieDeclarations]: Found specification of procedure blk_cleanup_queue [2021-11-17 12:21:50,601 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_cleanup_queue [2021-11-17 12:21:50,601 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2021-11-17 12:21:50,601 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2021-11-17 12:21:50,601 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2021-11-17 12:21:50,601 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2021-11-17 12:21:50,602 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2021-11-17 12:21:50,602 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2021-11-17 12:21:50,602 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~TO~VOID [2021-11-17 12:21:50,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~TO~VOID [2021-11-17 12:21:50,602 INFO L130 BoogieDeclarations]: Found specification of procedure __issue_creg_rw [2021-11-17 12:21:50,602 INFO L138 BoogieDeclarations]: Found implementation of procedure __issue_creg_rw [2021-11-17 12:21:50,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-17 12:21:50,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-17 12:21:50,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-17 12:21:50,603 INFO L130 BoogieDeclarations]: Found specification of procedure file_inode [2021-11-17 12:21:50,603 INFO L138 BoogieDeclarations]: Found implementation of procedure file_inode [2021-11-17 12:21:50,603 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_dev_lock_of_rsxx_cardinfo [2021-11-17 12:21:50,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_dev_lock_of_rsxx_cardinfo [2021-11-17 12:21:50,603 INFO L130 BoogieDeclarations]: Found specification of procedure destroy_workqueue [2021-11-17 12:21:50,603 INFO L138 BoogieDeclarations]: Found implementation of procedure destroy_workqueue [2021-11-17 12:21:50,604 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_to_process_context [2021-11-17 12:21:50,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_to_process_context [2021-11-17 12:21:50,604 INFO L130 BoogieDeclarations]: Found specification of procedure rsxx_getgeo [2021-11-17 12:21:50,604 INFO L138 BoogieDeclarations]: Found implementation of procedure rsxx_getgeo [2021-11-17 12:21:50,604 INFO L130 BoogieDeclarations]: Found specification of procedure set_capacity [2021-11-17 12:21:50,604 INFO L138 BoogieDeclarations]: Found implementation of procedure set_capacity [2021-11-17 12:21:50,604 INFO L130 BoogieDeclarations]: Found specification of procedure rsxx_complete_dma [2021-11-17 12:21:50,604 INFO L138 BoogieDeclarations]: Found implementation of procedure rsxx_complete_dma [2021-11-17 12:21:50,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2021-11-17 12:21:50,605 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2021-11-17 12:21:50,605 INFO L130 BoogieDeclarations]: Found specification of procedure pci_alloc_consistent [2021-11-17 12:21:50,605 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_alloc_consistent [2021-11-17 12:21:50,605 INFO L130 BoogieDeclarations]: Found specification of procedure rsxx_eeh_failure [2021-11-17 12:21:50,605 INFO L138 BoogieDeclarations]: Found implementation of procedure rsxx_eeh_failure [2021-11-17 12:21:50,605 INFO L130 BoogieDeclarations]: Found specification of procedure card_shutdown [2021-11-17 12:21:50,606 INFO L138 BoogieDeclarations]: Found implementation of procedure card_shutdown [2021-11-17 12:21:50,606 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2021-11-17 12:21:50,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2021-11-17 12:21:50,606 INFO L130 BoogieDeclarations]: Found specification of procedure rsxx_cram_read [2021-11-17 12:21:50,607 INFO L138 BoogieDeclarations]: Found implementation of procedure rsxx_cram_read [2021-11-17 12:21:50,607 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2021-11-17 12:21:50,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2021-11-17 12:21:50,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-17 12:21:50,607 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2021-11-17 12:21:50,607 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2021-11-17 12:21:50,607 INFO L130 BoogieDeclarations]: Found specification of procedure creg_cmd_timed_out [2021-11-17 12:21:50,608 INFO L138 BoogieDeclarations]: Found implementation of procedure creg_cmd_timed_out [2021-11-17 12:21:50,608 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2021-11-17 12:21:50,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2021-11-17 12:21:50,608 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-17 12:21:50,608 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dispatch_instance_register_8_2 [2021-11-17 12:21:50,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dispatch_instance_register_8_2 [2021-11-17 12:21:50,608 INFO L130 BoogieDeclarations]: Found specification of procedure creg_kick_queue [2021-11-17 12:21:50,608 INFO L138 BoogieDeclarations]: Found implementation of procedure creg_kick_queue [2021-11-17 12:21:50,609 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2021-11-17 12:21:50,609 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2021-11-17 12:21:50,609 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2021-11-17 12:21:50,609 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2021-11-17 12:21:50,609 INFO L130 BoogieDeclarations]: Found specification of procedure rsxx_dma_cleanup [2021-11-17 12:21:50,609 INFO L138 BoogieDeclarations]: Found implementation of procedure rsxx_dma_cleanup [2021-11-17 12:21:50,609 INFO L130 BoogieDeclarations]: Found specification of procedure lockdep_init_map [2021-11-17 12:21:50,610 INFO L138 BoogieDeclarations]: Found implementation of procedure lockdep_init_map [2021-11-17 12:21:50,610 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2021-11-17 12:21:50,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2021-11-17 12:21:50,610 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_bh_100 [2021-11-17 12:21:50,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_bh_100 [2021-11-17 12:21:50,610 INFO L130 BoogieDeclarations]: Found specification of procedure list_empty [2021-11-17 12:21:50,610 INFO L138 BoogieDeclarations]: Found implementation of procedure list_empty [2021-11-17 12:21:50,610 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2021-11-17 12:21:50,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2021-11-17 12:21:50,611 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2021-11-17 12:21:50,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2021-11-17 12:21:50,611 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer_sync [2021-11-17 12:21:50,611 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer_sync [2021-11-17 12:21:50,611 INFO L130 BoogieDeclarations]: Found specification of procedure rsxx_pci_shutdown [2021-11-17 12:21:50,611 INFO L138 BoogieDeclarations]: Found implementation of procedure rsxx_pci_shutdown [2021-11-17 12:21:50,611 INFO L130 BoogieDeclarations]: Found specification of procedure issue_creg_rw [2021-11-17 12:21:50,612 INFO L138 BoogieDeclarations]: Found implementation of procedure issue_creg_rw [2021-11-17 12:21:50,612 INFO L130 BoogieDeclarations]: Found specification of procedure rsxx_card_state_to_str [2021-11-17 12:21:50,612 INFO L138 BoogieDeclarations]: Found implementation of procedure rsxx_card_state_to_str [2021-11-17 12:21:50,612 INFO L130 BoogieDeclarations]: Found specification of procedure rsxx_disable_ier [2021-11-17 12:21:50,612 INFO L138 BoogieDeclarations]: Found implementation of procedure rsxx_disable_ier [2021-11-17 12:21:50,612 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2021-11-17 12:21:50,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2021-11-17 12:21:50,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-17 12:21:50,613 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2021-11-17 12:21:50,613 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2021-11-17 12:21:50,613 INFO L130 BoogieDeclarations]: Found specification of procedure kmem_cache_destroy [2021-11-17 12:21:50,613 INFO L138 BoogieDeclarations]: Found implementation of procedure kmem_cache_destroy [2021-11-17 12:21:50,613 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_104 [2021-11-17 12:21:50,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_104 [2021-11-17 12:21:50,614 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_100 [2021-11-17 12:21:50,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_100 [2021-11-17 12:21:50,614 INFO L130 BoogieDeclarations]: Found specification of procedure pci_enable_device [2021-11-17 12:21:50,614 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_enable_device [2021-11-17 12:21:50,614 INFO L130 BoogieDeclarations]: Found specification of procedure rsxx_enable_ier_and_isr [2021-11-17 12:21:50,614 INFO L138 BoogieDeclarations]: Found implementation of procedure rsxx_enable_ier_and_isr [2021-11-17 12:21:50,615 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec [2021-11-17 12:21:50,615 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec [2021-11-17 12:21:50,615 INFO L130 BoogieDeclarations]: Found specification of procedure rsxx_get_card_size8 [2021-11-17 12:21:50,615 INFO L138 BoogieDeclarations]: Found implementation of procedure rsxx_get_card_size8 [2021-11-17 12:21:50,615 INFO L130 BoogieDeclarations]: Found specification of procedure ffs [2021-11-17 12:21:50,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ffs [2021-11-17 12:21:50,615 INFO L130 BoogieDeclarations]: Found specification of procedure pci_disable_msi [2021-11-17 12:21:50,615 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_disable_msi [2021-11-17 12:21:50,616 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_size [2021-11-17 12:21:50,616 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_size [2021-11-17 12:21:50,616 INFO L130 BoogieDeclarations]: Found specification of procedure __enable_intr [2021-11-17 12:21:50,616 INFO L138 BoogieDeclarations]: Found implementation of procedure __enable_intr [2021-11-17 12:21:50,616 INFO L130 BoogieDeclarations]: Found specification of procedure queue_work [2021-11-17 12:21:50,616 INFO L138 BoogieDeclarations]: Found implementation of procedure queue_work [2021-11-17 12:21:50,616 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_queue_lock_of_rsxx_dma_ctrl [2021-11-17 12:21:50,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_queue_lock_of_rsxx_dma_ctrl [2021-11-17 12:21:50,617 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_107 [2021-11-17 12:21:50,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_107 [2021-11-17 12:21:50,617 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_bh_98 [2021-11-17 12:21:50,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_bh_98 [2021-11-17 12:21:50,617 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_set [2021-11-17 12:21:50,617 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_set [2021-11-17 12:21:50,617 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_99 [2021-11-17 12:21:50,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_99 [2021-11-17 12:21:50,618 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2021-11-17 12:21:50,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2021-11-17 12:21:50,618 INFO L130 BoogieDeclarations]: Found specification of procedure pci_release_regions [2021-11-17 12:21:50,618 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_release_regions [2021-11-17 12:21:50,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2021-11-17 12:21:50,618 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2021-11-17 12:21:50,618 INFO L130 BoogieDeclarations]: Found specification of procedure rsxx_hw_buffers_init [2021-11-17 12:21:50,619 INFO L138 BoogieDeclarations]: Found implementation of procedure rsxx_hw_buffers_init [2021-11-17 12:21:50,619 INFO L130 BoogieDeclarations]: Found specification of procedure pci_unmap_page [2021-11-17 12:21:50,619 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_unmap_page [2021-11-17 12:21:50,619 INFO L130 BoogieDeclarations]: Found specification of procedure config_data_crc32 [2021-11-17 12:21:50,619 INFO L138 BoogieDeclarations]: Found implementation of procedure config_data_crc32 [2021-11-17 12:21:50,619 INFO L130 BoogieDeclarations]: Found specification of procedure rsxx_attr_pci_regs_open [2021-11-17 12:21:50,619 INFO L138 BoogieDeclarations]: Found implementation of procedure rsxx_attr_pci_regs_open [2021-11-17 12:21:50,619 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-11-17 12:21:50,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-11-17 12:21:50,620 INFO L130 BoogieDeclarations]: Found specification of procedure rsxx_dma_configure [2021-11-17 12:21:50,620 INFO L138 BoogieDeclarations]: Found implementation of procedure rsxx_dma_configure [2021-11-17 12:21:50,620 INFO L130 BoogieDeclarations]: Found specification of procedure free_irq [2021-11-17 12:21:50,620 INFO L138 BoogieDeclarations]: Found implementation of procedure free_irq [2021-11-17 12:21:50,620 INFO L130 BoogieDeclarations]: Found specification of procedure creg_queue_cmd [2021-11-17 12:21:50,620 INFO L138 BoogieDeclarations]: Found implementation of procedure creg_queue_cmd [2021-11-17 12:21:50,621 INFO L130 BoogieDeclarations]: Found specification of procedure rsxx_free_dma [2021-11-17 12:21:50,621 INFO L138 BoogieDeclarations]: Found implementation of procedure rsxx_free_dma [2021-11-17 12:21:50,621 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2021-11-17 12:21:50,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2021-11-17 12:21:50,621 INFO L130 BoogieDeclarations]: Found specification of procedure rsxx_dma_cancel [2021-11-17 12:21:50,622 INFO L138 BoogieDeclarations]: Found implementation of procedure rsxx_dma_cancel [2021-11-17 12:21:50,622 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2021-11-17 12:21:50,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2021-11-17 12:21:50,622 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_timer_timer_instance_5 [2021-11-17 12:21:50,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_timer_timer_instance_5 [2021-11-17 12:21:50,622 INFO L130 BoogieDeclarations]: Found specification of procedure rsxx_get_card_state [2021-11-17 12:21:50,622 INFO L138 BoogieDeclarations]: Found implementation of procedure rsxx_get_card_state [2021-11-17 12:21:50,622 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2021-11-17 12:21:50,623 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2021-11-17 12:21:50,623 INFO L130 BoogieDeclarations]: Found specification of procedure ssleep [2021-11-17 12:21:50,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ssleep [2021-11-17 12:21:50,623 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2021-11-17 12:21:50,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2021-11-17 12:21:50,623 INFO L130 BoogieDeclarations]: Found specification of procedure iowrite32 [2021-11-17 12:21:50,623 INFO L138 BoogieDeclarations]: Found implementation of procedure iowrite32 [2021-11-17 12:21:50,624 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2021-11-17 12:21:50,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2021-11-17 12:21:50,624 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2021-11-17 12:21:50,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2021-11-17 12:21:50,624 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock_try [2021-11-17 12:21:50,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock_try [2021-11-17 12:21:50,624 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_timer_instance_callback_5_2 [2021-11-17 12:21:50,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_timer_instance_callback_5_2 [2021-11-17 12:21:50,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-17 12:21:50,625 INFO L130 BoogieDeclarations]: Found specification of procedure debugfs_remove [2021-11-17 12:21:50,625 INFO L138 BoogieDeclarations]: Found implementation of procedure debugfs_remove [2021-11-17 12:21:50,625 INFO L130 BoogieDeclarations]: Found specification of procedure rsxx_issue_card_cmd [2021-11-17 12:21:50,625 INFO L138 BoogieDeclarations]: Found implementation of procedure rsxx_issue_card_cmd [2021-11-17 12:21:50,625 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_del_timer_sync [2021-11-17 12:21:50,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_del_timer_sync [2021-11-17 12:21:50,625 INFO L130 BoogieDeclarations]: Found specification of procedure cancel_work_sync [2021-11-17 12:21:50,626 INFO L138 BoogieDeclarations]: Found implementation of procedure cancel_work_sync [2021-11-17 12:21:50,626 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2021-11-17 12:21:50,626 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2021-11-17 12:21:50,626 INFO L130 BoogieDeclarations]: Found specification of procedure CR_INTR_DMA [2021-11-17 12:21:50,626 INFO L138 BoogieDeclarations]: Found implementation of procedure CR_INTR_DMA [2021-11-17 12:21:50,626 INFO L130 BoogieDeclarations]: Found specification of procedure push_tracker [2021-11-17 12:21:50,626 INFO L138 BoogieDeclarations]: Found implementation of procedure push_tracker [2021-11-17 12:21:50,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-11-17 12:21:50,627 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2021-11-17 12:21:50,627 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2021-11-17 12:21:50,627 INFO L130 BoogieDeclarations]: Found specification of procedure rsxx_pci_probe [2021-11-17 12:21:50,627 INFO L138 BoogieDeclarations]: Found implementation of procedure rsxx_pci_probe [2021-11-17 12:21:50,627 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2021-11-17 12:21:50,627 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2021-11-17 12:21:50,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-17 12:21:50,628 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_blk_cleanup_queue [2021-11-17 12:21:50,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_blk_cleanup_queue [2021-11-17 12:21:50,628 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2021-11-17 12:21:50,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2021-11-17 12:21:50,628 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2021-11-17 12:21:50,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2021-11-17 12:21:50,628 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_to_interrupt_context [2021-11-17 12:21:50,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_to_interrupt_context [2021-11-17 12:21:50,629 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2021-11-17 12:21:50,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2021-11-17 12:21:50,629 INFO L130 BoogieDeclarations]: Found specification of procedure CREG_DATA [2021-11-17 12:21:50,629 INFO L138 BoogieDeclarations]: Found implementation of procedure CREG_DATA [2021-11-17 12:21:50,629 INFO L130 BoogieDeclarations]: Found specification of procedure vfree [2021-11-17 12:21:50,629 INFO L138 BoogieDeclarations]: Found implementation of procedure vfree [2021-11-17 12:21:50,629 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2021-11-17 12:21:50,630 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2021-11-17 12:21:50,630 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_bh_99 [2021-11-17 12:21:50,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_bh_99 [2021-11-17 12:21:50,630 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2021-11-17 12:21:50,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2021-11-17 12:21:50,630 INFO L130 BoogieDeclarations]: Found specification of procedure rsxx_creg_write [2021-11-17 12:21:50,630 INFO L138 BoogieDeclarations]: Found implementation of procedure rsxx_creg_write [2021-11-17 12:21:50,630 INFO L130 BoogieDeclarations]: Found specification of procedure seq_lseek [2021-11-17 12:21:50,631 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_lseek [2021-11-17 12:21:50,631 INFO L130 BoogieDeclarations]: Found specification of procedure dma_intr_coal_val [2021-11-17 12:21:50,631 INFO L138 BoogieDeclarations]: Found implementation of procedure dma_intr_coal_val [2021-11-17 12:21:50,631 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2021-11-17 12:21:50,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2021-11-17 12:21:50,631 INFO L130 BoogieDeclarations]: Found specification of procedure rsxx_pci_remove [2021-11-17 12:21:50,631 INFO L138 BoogieDeclarations]: Found implementation of procedure rsxx_pci_remove [2021-11-17 12:21:50,631 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mod_timer_96 [2021-11-17 12:21:50,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mod_timer_96 [2021-11-17 12:21:50,632 INFO L130 BoogieDeclarations]: Found specification of procedure __list_splice [2021-11-17 12:21:50,632 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_splice [2021-11-17 12:21:50,632 INFO L130 BoogieDeclarations]: Found specification of procedure read_hw_log_done [2021-11-17 12:21:50,632 INFO L138 BoogieDeclarations]: Found implementation of procedure read_hw_log_done [2021-11-17 12:21:50,632 INFO L130 BoogieDeclarations]: Found specification of procedure __init_work [2021-11-17 12:21:50,632 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_work [2021-11-17 12:21:50,633 INFO L130 BoogieDeclarations]: Found specification of procedure rsxx_dma_destroy [2021-11-17 12:21:50,633 INFO L138 BoogieDeclarations]: Found implementation of procedure rsxx_dma_destroy [2021-11-17 12:21:50,633 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2021-11-17 12:21:50,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2021-11-17 12:21:50,633 INFO L130 BoogieDeclarations]: Found specification of procedure rsxx_dma_queue_reset [2021-11-17 12:21:50,633 INFO L138 BoogieDeclarations]: Found implementation of procedure rsxx_dma_queue_reset [2021-11-17 12:21:50,633 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_96___0 [2021-11-17 12:21:50,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_96___0 [2021-11-17 12:21:50,634 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2021-11-17 12:21:50,634 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2021-11-17 12:21:50,634 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2021-11-17 12:21:50,634 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2021-11-17 12:21:50,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-17 12:21:50,634 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2021-11-17 12:21:50,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2021-11-17 12:21:50,634 INFO L130 BoogieDeclarations]: Found specification of procedure rsxx_creg_read [2021-11-17 12:21:50,635 INFO L138 BoogieDeclarations]: Found implementation of procedure rsxx_creg_read [2021-11-17 12:21:50,635 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2021-11-17 12:21:50,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2021-11-17 12:21:50,635 INFO L130 BoogieDeclarations]: Found specification of procedure seq_read [2021-11-17 12:21:50,635 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_read [2021-11-17 12:21:50,635 INFO L130 BoogieDeclarations]: Found specification of procedure pci_read_config_byte [2021-11-17 12:21:50,635 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_read_config_byte [2021-11-17 12:21:50,636 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_NOT_ARG_SIGN [2021-11-17 12:21:50,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_NOT_ARG_SIGN [2021-11-17 12:21:50,636 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_irq_lock_of_rsxx_cardinfo [2021-11-17 12:21:50,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_irq_lock_of_rsxx_cardinfo [2021-11-17 12:21:50,636 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_read [2021-11-17 12:21:50,636 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_read [2021-11-17 12:21:50,636 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR_OR_NULL [2021-11-17 12:21:50,636 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR_OR_NULL [2021-11-17 12:21:50,637 INFO L130 BoogieDeclarations]: Found specification of procedure dma_engine_stalled [2021-11-17 12:21:50,637 INFO L138 BoogieDeclarations]: Found implementation of procedure dma_engine_stalled [2021-11-17 12:21:50,637 INFO L130 BoogieDeclarations]: Found specification of procedure pci_set_master [2021-11-17 12:21:50,637 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_set_master [2021-11-17 12:21:50,637 INFO L130 BoogieDeclarations]: Found specification of procedure rsxx_reg_access [2021-11-17 12:21:50,637 INFO L138 BoogieDeclarations]: Found implementation of procedure rsxx_reg_access [2021-11-17 12:21:50,637 INFO L130 BoogieDeclarations]: Found specification of procedure rsxx_attr_stats_open [2021-11-17 12:21:50,637 INFO L138 BoogieDeclarations]: Found implementation of procedure rsxx_attr_stats_open [2021-11-17 12:21:50,638 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~$Pointer$~TO~int [2021-11-17 12:21:50,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~$Pointer$~TO~int [2021-11-17 12:21:50,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-17 12:21:50,638 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2021-11-17 12:21:50,638 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2021-11-17 12:21:50,638 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_sched_completion__wait_without_init [2021-11-17 12:21:50,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_sched_completion__wait_without_init [2021-11-17 12:21:50,639 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2021-11-17 12:21:50,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2021-11-17 12:21:50,639 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_dev_lock_of_rsxx_cardinfo [2021-11-17 12:21:50,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_dev_lock_of_rsxx_cardinfo [2021-11-17 12:21:50,639 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2021-11-17 12:21:50,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2021-11-17 12:21:50,639 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_97___0 [2021-11-17 12:21:50,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_97___0 [2021-11-17 12:21:50,640 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_irq [2021-11-17 12:21:50,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_irq [2021-11-17 12:21:50,640 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_irq_109 [2021-11-17 12:21:50,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_irq_109 [2021-11-17 12:21:50,640 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2021-11-17 12:21:50,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2021-11-17 12:21:50,640 INFO L130 BoogieDeclarations]: Found specification of procedure single_open [2021-11-17 12:21:50,641 INFO L138 BoogieDeclarations]: Found implementation of procedure single_open [2021-11-17 12:21:50,641 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2021-11-17 12:21:50,641 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2021-11-17 12:21:50,641 INFO L130 BoogieDeclarations]: Found specification of procedure pci_dma_mapping_error [2021-11-17 12:21:50,641 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_dma_mapping_error [2021-11-17 12:21:50,641 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2021-11-17 12:21:50,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2021-11-17 12:21:50,641 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~VOID [2021-11-17 12:21:50,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~VOID [2021-11-17 12:21:50,642 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2021-11-17 12:21:50,642 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2021-11-17 12:21:50,642 INFO L130 BoogieDeclarations]: Found specification of procedure debugfs_create_file [2021-11-17 12:21:50,642 INFO L138 BoogieDeclarations]: Found implementation of procedure debugfs_create_file [2021-11-17 12:21:50,642 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2021-11-17 12:21:50,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2021-11-17 12:21:50,642 INFO L130 BoogieDeclarations]: Found specification of procedure single_release [2021-11-17 12:21:50,643 INFO L138 BoogieDeclarations]: Found implementation of procedure single_release [2021-11-17 12:21:50,643 INFO L130 BoogieDeclarations]: Found specification of procedure rsxx_blkdev_ioctl [2021-11-17 12:21:50,643 INFO L138 BoogieDeclarations]: Found implementation of procedure rsxx_blkdev_ioctl [2021-11-17 12:21:50,643 INFO L130 BoogieDeclarations]: Found specification of procedure rsxx_disable_ier_and_isr [2021-11-17 12:21:50,643 INFO L138 BoogieDeclarations]: Found implementation of procedure rsxx_disable_ier_and_isr [2021-11-17 12:21:50,643 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2021-11-17 12:21:50,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2021-11-17 12:21:50,644 INFO L130 BoogieDeclarations]: Found specification of procedure get_tracker_dma [2021-11-17 12:21:50,644 INFO L138 BoogieDeclarations]: Found implementation of procedure get_tracker_dma [2021-11-17 12:21:50,644 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2021-11-17 12:21:50,644 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2021-11-17 12:21:50,644 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_queue_lock_of_rsxx_dma_ctrl [2021-11-17 12:21:50,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_queue_lock_of_rsxx_dma_ctrl [2021-11-17 12:21:50,644 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_bh_101 [2021-11-17 12:21:50,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_bh_101 [2021-11-17 12:21:50,645 INFO L130 BoogieDeclarations]: Found specification of procedure rsxx_read_hw_log [2021-11-17 12:21:50,645 INFO L138 BoogieDeclarations]: Found implementation of procedure rsxx_read_hw_log [2021-11-17 12:21:50,645 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2021-11-17 12:21:50,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2021-11-17 12:21:50,645 INFO L130 BoogieDeclarations]: Found specification of procedure init_timer_key [2021-11-17 12:21:50,645 INFO L138 BoogieDeclarations]: Found implementation of procedure init_timer_key [2021-11-17 12:21:50,645 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2021-11-17 12:21:50,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2021-11-17 12:21:50,646 INFO L130 BoogieDeclarations]: Found specification of procedure pci_iounmap [2021-11-17 12:21:50,646 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_iounmap [2021-11-17 12:21:50,646 INFO L130 BoogieDeclarations]: Found specification of procedure msecs_to_jiffies [2021-11-17 12:21:50,646 INFO L138 BoogieDeclarations]: Found implementation of procedure msecs_to_jiffies [2021-11-17 12:21:50,646 INFO L130 BoogieDeclarations]: Found specification of procedure kmem_cache_free [2021-11-17 12:21:50,646 INFO L138 BoogieDeclarations]: Found implementation of procedure kmem_cache_free [2021-11-17 12:21:50,647 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2021-11-17 12:21:50,647 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2021-11-17 12:21:50,647 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2021-11-17 12:21:50,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2021-11-17 12:21:50,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-17 12:21:51,532 INFO L236 CfgBuilder]: Building ICFG [2021-11-17 12:21:51,535 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-17 12:21:51,601 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2021-11-17 12:22:01,156 INFO L277 CfgBuilder]: Performing block encoding [2021-11-17 12:22:01,182 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-17 12:22:01,182 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-17 12:22:01,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 12:22:01 BoogieIcfgContainer [2021-11-17 12:22:01,187 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-17 12:22:01,190 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-17 12:22:01,190 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-17 12:22:01,193 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-17 12:22:01,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:21:44" (1/3) ... [2021-11-17 12:22:01,194 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@675aae52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:22:01, skipping insertion in model container [2021-11-17 12:22:01,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:21:49" (2/3) ... [2021-11-17 12:22:01,194 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@675aae52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:22:01, skipping insertion in model container [2021-11-17 12:22:01,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 12:22:01" (3/3) ... [2021-11-17 12:22:01,195 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--block--rsxx--rsxx.ko.cil.i [2021-11-17 12:22:01,199 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-17 12:22:01,200 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 39 error locations. [2021-11-17 12:22:01,254 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-17 12:22:01,259 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:22:01,259 INFO L340 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2021-11-17 12:22:01,322 INFO L276 IsEmpty]: Start isEmpty. Operand has 2783 states, 1799 states have (on average 1.2506948304613674) internal successors, (2250), 1881 states have internal predecessors, (2250), 741 states have call successors, (741), 204 states have call predecessors, (741), 203 states have return successors, (735), 726 states have call predecessors, (735), 735 states have call successors, (735) [2021-11-17 12:22:01,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-11-17 12:22:01,329 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:22:01,330 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:22:01,332 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_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-11-17 12:22:01,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:22:01,337 INFO L85 PathProgramCache]: Analyzing trace with hash -994980631, now seen corresponding path program 1 times [2021-11-17 12:22:01,347 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:22:01,348 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061392384] [2021-11-17 12:22:01,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:22:01,349 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:22:01,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:22:01,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:22:01,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:22:01,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 12:22:01,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:22:01,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:22:01,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:22:01,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:22:01,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:22:01,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-17 12:22:01,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:22:01,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-17 12:22:01,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:22:01,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-17 12:22:01,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:22:01,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:22:01,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:22:01,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 12:22:01,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:22:01,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-11-17 12:22:01,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:22:01,996 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-17 12:22:01,996 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:22:01,996 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061392384] [2021-11-17 12:22:01,997 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061392384] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:22:01,997 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:22:01,997 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 12:22:01,999 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140042730] [2021-11-17 12:22:01,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:22:02,003 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 12:22:02,003 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:22:02,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 12:22:02,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-17 12:22:02,042 INFO L87 Difference]: Start difference. First operand has 2783 states, 1799 states have (on average 1.2506948304613674) internal successors, (2250), 1881 states have internal predecessors, (2250), 741 states have call successors, (741), 204 states have call predecessors, (741), 203 states have return successors, (735), 726 states have call predecessors, (735), 735 states have call successors, (735) Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (11), 5 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:22:04,100 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:22:06,182 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:22:08,269 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:22:12,380 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:22:14,411 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:22:16,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:22:27,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:22:27,648 INFO L93 Difference]: Finished difference Result 6896 states and 10015 transitions. [2021-11-17 12:22:27,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-17 12:22:27,657 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 68 [2021-11-17 12:22:27,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:22:27,707 INFO L225 Difference]: With dead ends: 6896 [2021-11-17 12:22:27,708 INFO L226 Difference]: Without dead ends: 4127 [2021-11-17 12:22:27,730 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-11-17 12:22:27,733 INFO L933 BasicCegarLoop]: 4642 mSDtfsCounter, 5905 mSDsluCounter, 7102 mSDsCounter, 0 mSdLazyCounter, 8655 mSolverCounterSat, 4484 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6280 SdHoareTripleChecker+Valid, 11744 SdHoareTripleChecker+Invalid, 13145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4484 IncrementalHoareTripleChecker+Valid, 8655 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.9s IncrementalHoareTripleChecker+Time [2021-11-17 12:22:27,734 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6280 Valid, 11744 Invalid, 13145 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4484 Valid, 8655 Invalid, 6 Unknown, 0 Unchecked, 24.9s Time] [2021-11-17 12:22:27,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4127 states. [2021-11-17 12:22:28,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4127 to 2766. [2021-11-17 12:22:28,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2766 states, 1790 states have (on average 1.222905027932961) internal successors, (2189), 1868 states have internal predecessors, (2189), 735 states have call successors, (735), 203 states have call predecessors, (735), 202 states have return successors, (733), 724 states have call predecessors, (733), 733 states have call successors, (733) [2021-11-17 12:22:28,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3657 transitions. [2021-11-17 12:22:28,053 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3657 transitions. Word has length 68 [2021-11-17 12:22:28,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:22:28,054 INFO L470 AbstractCegarLoop]: Abstraction has 2766 states and 3657 transitions. [2021-11-17 12:22:28,054 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (11), 5 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:22:28,054 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3657 transitions. [2021-11-17 12:22:28,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-11-17 12:22:28,057 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:22:28,057 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:22:28,058 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-17 12:22:28,058 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-11-17 12:22:28,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:22:28,058 INFO L85 PathProgramCache]: Analyzing trace with hash -97587353, now seen corresponding path program 1 times [2021-11-17 12:22:28,059 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:22:28,059 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197243975] [2021-11-17 12:22:28,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:22:28,059 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:22:28,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:22:28,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:22:28,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:22:28,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 12:22:28,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:22:28,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:22:28,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:22:28,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:22:28,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:22:28,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-17 12:22:28,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:22:28,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-17 12:22:28,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:22:28,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-17 12:22:28,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:22:28,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:22:28,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:22:28,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 12:22:28,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:22:28,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-11-17 12:22:28,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:22:28,387 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-17 12:22:28,387 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:22:28,388 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197243975] [2021-11-17 12:22:28,389 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197243975] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:22:28,389 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:22:28,389 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 12:22:28,389 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357938284] [2021-11-17 12:22:28,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:22:28,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 12:22:28,390 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:22:28,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 12:22:28,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-17 12:22:28,391 INFO L87 Difference]: Start difference. First operand 2766 states and 3657 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (11), 5 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:22:30,423 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:22:34,522 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:22:36,545 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:22:45,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:22:45,158 INFO L93 Difference]: Finished difference Result 3007 states and 4044 transitions. [2021-11-17 12:22:45,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-17 12:22:45,159 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 68 [2021-11-17 12:22:45,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:22:45,174 INFO L225 Difference]: With dead ends: 3007 [2021-11-17 12:22:45,174 INFO L226 Difference]: Without dead ends: 3005 [2021-11-17 12:22:45,176 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-11-17 12:22:45,177 INFO L933 BasicCegarLoop]: 3141 mSDtfsCounter, 7421 mSDsluCounter, 2670 mSDsCounter, 0 mSdLazyCounter, 4876 mSolverCounterSat, 5127 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7645 SdHoareTripleChecker+Valid, 5811 SdHoareTripleChecker+Invalid, 10006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 5127 IncrementalHoareTripleChecker+Valid, 4876 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.3s IncrementalHoareTripleChecker+Time [2021-11-17 12:22:45,177 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7645 Valid, 5811 Invalid, 10006 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [5127 Valid, 4876 Invalid, 3 Unknown, 0 Unchecked, 16.3s Time] [2021-11-17 12:22:45,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3005 states. [2021-11-17 12:22:45,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3005 to 2764. [2021-11-17 12:22:45,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2764 states, 1789 states have (on average 1.2224706539966461) internal successors, (2187), 1866 states have internal predecessors, (2187), 735 states have call successors, (735), 203 states have call predecessors, (735), 202 states have return successors, (733), 724 states have call predecessors, (733), 733 states have call successors, (733) [2021-11-17 12:22:45,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2764 states to 2764 states and 3655 transitions. [2021-11-17 12:22:45,283 INFO L78 Accepts]: Start accepts. Automaton has 2764 states and 3655 transitions. Word has length 68 [2021-11-17 12:22:45,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:22:45,284 INFO L470 AbstractCegarLoop]: Abstraction has 2764 states and 3655 transitions. [2021-11-17 12:22:45,284 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (11), 5 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:22:45,284 INFO L276 IsEmpty]: Start isEmpty. Operand 2764 states and 3655 transitions. [2021-11-17 12:22:45,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-11-17 12:22:45,290 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:22:45,291 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:22:45,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-17 12:22:45,291 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_linux_block_genhd_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-11-17 12:22:45,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:22:45,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1539045964, now seen corresponding path program 1 times [2021-11-17 12:22:45,292 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:22:45,292 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944559456] [2021-11-17 12:22:45,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:22:45,292 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:22:45,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:22:45,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:22:45,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:22:45,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 12:22:45,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:22:45,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:22:45,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:22:45,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:22:45,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:22:45,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-17 12:22:45,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:22:45,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-17 12:22:45,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:22:45,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-17 12:22:45,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:22:45,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:22:45,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:22:45,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 12:22:45,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:22:45,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-11-17 12:22:45,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:22:45,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-17 12:22:45,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:22:45,569 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-17 12:22:45,569 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:22:45,570 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944559456] [2021-11-17 12:22:45,570 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944559456] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:22:45,570 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:22:45,570 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 12:22:45,570 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066404583] [2021-11-17 12:22:45,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:22:45,571 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 12:22:45,571 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:22:45,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 12:22:45,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-17 12:22:45,572 INFO L87 Difference]: Start difference. First operand 2764 states and 3655 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (12), 5 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:22:47,606 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:22:49,679 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:22:51,749 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:22:54,983 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:22:57,004 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:22:59,635 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:23:01,656 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:23:03,671 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:23:17,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:23:17,756 INFO L93 Difference]: Finished difference Result 5955 states and 8014 transitions. [2021-11-17 12:23:17,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-17 12:23:17,757 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 74 [2021-11-17 12:23:17,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:23:17,786 INFO L225 Difference]: With dead ends: 5955 [2021-11-17 12:23:17,786 INFO L226 Difference]: Without dead ends: 5953 [2021-11-17 12:23:17,788 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2021-11-17 12:23:17,789 INFO L933 BasicCegarLoop]: 3833 mSDtfsCounter, 11220 mSDsluCounter, 4400 mSDsCounter, 0 mSdLazyCounter, 9904 mSolverCounterSat, 8513 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11433 SdHoareTripleChecker+Valid, 8233 SdHoareTripleChecker+Invalid, 18425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 8513 IncrementalHoareTripleChecker+Valid, 9904 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.6s IncrementalHoareTripleChecker+Time [2021-11-17 12:23:17,789 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11433 Valid, 8233 Invalid, 18425 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [8513 Valid, 9904 Invalid, 8 Unknown, 0 Unchecked, 31.6s Time] [2021-11-17 12:23:17,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5953 states. [2021-11-17 12:23:17,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5953 to 5269. [2021-11-17 12:23:17,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5269 states, 3424 states have (on average 1.2234228971962617) internal successors, (4189), 3542 states have internal predecessors, (4189), 1418 states have call successors, (1418), 386 states have call predecessors, (1418), 389 states have return successors, (1430), 1396 states have call predecessors, (1430), 1416 states have call successors, (1430) [2021-11-17 12:23:18,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5269 states to 5269 states and 7037 transitions. [2021-11-17 12:23:18,004 INFO L78 Accepts]: Start accepts. Automaton has 5269 states and 7037 transitions. Word has length 74 [2021-11-17 12:23:18,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:23:18,005 INFO L470 AbstractCegarLoop]: Abstraction has 5269 states and 7037 transitions. [2021-11-17 12:23:18,005 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (12), 5 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:23:18,005 INFO L276 IsEmpty]: Start isEmpty. Operand 5269 states and 7037 transitions. [2021-11-17 12:23:18,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-11-17 12:23:18,007 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:23:18,008 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:23:18,008 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-17 12:23:18,008 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-11-17 12:23:18,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:23:18,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1095071842, now seen corresponding path program 1 times [2021-11-17 12:23:18,009 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:23:18,009 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124864888] [2021-11-17 12:23:18,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:23:18,009 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:23:18,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:23:18,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:23:18,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:23:18,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 12:23:18,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:23:18,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:23:18,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:23:18,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:23:18,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:23:18,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-17 12:23:18,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:23:18,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-17 12:23:18,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:23:18,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-17 12:23:18,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:23:18,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:23:18,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:23:18,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 12:23:18,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:23:18,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-11-17 12:23:18,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:23:18,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-17 12:23:18,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:23:18,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-11-17 12:23:18,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:23:18,287 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-17 12:23:18,287 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:23:18,287 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124864888] [2021-11-17 12:23:18,287 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124864888] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:23:18,288 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:23:18,288 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 12:23:18,288 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917766412] [2021-11-17 12:23:18,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:23:18,289 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 12:23:18,289 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:23:18,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 12:23:18,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-17 12:23:18,290 INFO L87 Difference]: Start difference. First operand 5269 states and 7037 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (13), 5 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:23:20,326 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:23:22,392 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:23:24,463 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:23:27,694 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:23:29,710 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:23:38,251 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:23:46,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:23:46,722 INFO L93 Difference]: Finished difference Result 11403 states and 15514 transitions. [2021-11-17 12:23:46,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-17 12:23:46,722 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 80 [2021-11-17 12:23:46,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:23:46,783 INFO L225 Difference]: With dead ends: 11403 [2021-11-17 12:23:46,784 INFO L226 Difference]: Without dead ends: 11401 [2021-11-17 12:23:46,791 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2021-11-17 12:23:46,792 INFO L933 BasicCegarLoop]: 3458 mSDtfsCounter, 12061 mSDsluCounter, 4281 mSDsCounter, 0 mSdLazyCounter, 9472 mSolverCounterSat, 8952 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12277 SdHoareTripleChecker+Valid, 7739 SdHoareTripleChecker+Invalid, 18430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 8952 IncrementalHoareTripleChecker+Valid, 9472 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.8s IncrementalHoareTripleChecker+Time [2021-11-17 12:23:46,793 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12277 Valid, 7739 Invalid, 18430 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [8952 Valid, 9472 Invalid, 6 Unknown, 0 Unchecked, 27.8s Time] [2021-11-17 12:23:46,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11401 states. [2021-11-17 12:23:47,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11401 to 10256. [2021-11-17 12:23:47,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10256 states, 6684 states have (on average 1.2242669060442848) internal successors, (8183), 6884 states have internal predecessors, (8183), 2776 states have call successors, (2776), 750 states have call predecessors, (2776), 758 states have return successors, (2832), 2732 states have call predecessors, (2832), 2774 states have call successors, (2832) [2021-11-17 12:23:47,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10256 states to 10256 states and 13791 transitions. [2021-11-17 12:23:47,308 INFO L78 Accepts]: Start accepts. Automaton has 10256 states and 13791 transitions. Word has length 80 [2021-11-17 12:23:47,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:23:47,310 INFO L470 AbstractCegarLoop]: Abstraction has 10256 states and 13791 transitions. [2021-11-17 12:23:47,311 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (13), 5 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:23:47,311 INFO L276 IsEmpty]: Start isEmpty. Operand 10256 states and 13791 transitions. [2021-11-17 12:23:47,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-11-17 12:23:47,312 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:23:47,312 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:23:47,312 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-17 12:23:47,312 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-11-17 12:23:47,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:23:47,313 INFO L85 PathProgramCache]: Analyzing trace with hash -252377095, now seen corresponding path program 1 times [2021-11-17 12:23:47,313 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:23:47,313 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102622160] [2021-11-17 12:23:47,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:23:47,314 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:23:47,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:23:47,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:23:47,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:23:47,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 12:23:47,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:23:47,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:23:47,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:23:47,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:23:47,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:23:47,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-17 12:23:47,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:23:47,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-17 12:23:47,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:23:47,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-17 12:23:47,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:23:47,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:23:47,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:23:47,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 12:23:47,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:23:47,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-11-17 12:23:47,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:23:47,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-17 12:23:47,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:23:47,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-11-17 12:23:47,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:23:47,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-17 12:23:47,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:23:47,566 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-17 12:23:47,566 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:23:47,566 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102622160] [2021-11-17 12:23:47,566 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102622160] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:23:47,566 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:23:47,566 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 12:23:47,567 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729509267] [2021-11-17 12:23:47,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:23:47,567 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 12:23:47,567 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:23:47,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 12:23:47,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-17 12:23:47,568 INFO L87 Difference]: Start difference. First operand 10256 states and 13791 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2021-11-17 12:23:49,603 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:23:51,639 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:23:54,800 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:23:56,825 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:24:04,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:24:04,094 INFO L93 Difference]: Finished difference Result 11189 states and 15295 transitions. [2021-11-17 12:24:04,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-17 12:24:04,095 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 86 [2021-11-17 12:24:04,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:24:04,147 INFO L225 Difference]: With dead ends: 11189 [2021-11-17 12:24:04,147 INFO L226 Difference]: Without dead ends: 11187 [2021-11-17 12:24:04,155 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-11-17 12:24:04,156 INFO L933 BasicCegarLoop]: 3134 mSDtfsCounter, 7419 mSDsluCounter, 2665 mSDsCounter, 0 mSdLazyCounter, 4861 mSolverCounterSat, 5140 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7642 SdHoareTripleChecker+Valid, 5799 SdHoareTripleChecker+Invalid, 10004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5140 IncrementalHoareTripleChecker+Valid, 4861 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.1s IncrementalHoareTripleChecker+Time [2021-11-17 12:24:04,156 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7642 Valid, 5799 Invalid, 10004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5140 Valid, 4861 Invalid, 3 Unknown, 0 Unchecked, 16.1s Time] [2021-11-17 12:24:04,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11187 states. [2021-11-17 12:24:04,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11187 to 10254. [2021-11-17 12:24:04,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10254 states, 6683 states have (on average 1.2241508304653599) internal successors, (8181), 6882 states have internal predecessors, (8181), 2776 states have call successors, (2776), 750 states have call predecessors, (2776), 758 states have return successors, (2832), 2732 states have call predecessors, (2832), 2774 states have call successors, (2832) [2021-11-17 12:24:04,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10254 states to 10254 states and 13789 transitions. [2021-11-17 12:24:04,634 INFO L78 Accepts]: Start accepts. Automaton has 10254 states and 13789 transitions. Word has length 86 [2021-11-17 12:24:04,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:24:04,635 INFO L470 AbstractCegarLoop]: Abstraction has 10254 states and 13789 transitions. [2021-11-17 12:24:04,635 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2021-11-17 12:24:04,635 INFO L276 IsEmpty]: Start isEmpty. Operand 10254 states and 13789 transitions. [2021-11-17 12:24:04,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-11-17 12:24:04,640 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:24:04,641 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:24:04,641 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-17 12:24:04,641 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-11-17 12:24:04,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:24:04,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1700384471, now seen corresponding path program 1 times [2021-11-17 12:24:04,642 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:24:04,642 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856473502] [2021-11-17 12:24:04,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:24:04,642 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:24:04,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:24:04,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:24:04,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:24:04,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 12:24:04,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:24:04,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:24:04,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:24:04,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:24:04,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:24:04,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-17 12:24:04,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:24:04,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-17 12:24:04,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:24:04,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-17 12:24:04,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:24:04,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:24:04,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:24:04,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 12:24:04,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:24:04,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-11-17 12:24:04,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:24:04,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-17 12:24:04,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:24:04,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-11-17 12:24:04,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:24:04,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-17 12:24:04,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:24:04,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-11-17 12:24:04,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:24:04,876 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-17 12:24:04,876 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:24:04,877 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856473502] [2021-11-17 12:24:04,877 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856473502] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:24:04,877 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:24:04,877 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 12:24:04,877 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38945545] [2021-11-17 12:24:04,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:24:04,878 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 12:24:04,878 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:24:04,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 12:24:04,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-17 12:24:04,879 INFO L87 Difference]: Start difference. First operand 10254 states and 13789 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-17 12:24:06,914 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:24:08,982 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:24:11,048 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:24:14,146 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:24:16,176 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:24:23,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:24:23,617 INFO L93 Difference]: Finished difference Result 11187 states and 15293 transitions. [2021-11-17 12:24:23,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-17 12:24:23,618 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 92 [2021-11-17 12:24:23,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:24:23,662 INFO L225 Difference]: With dead ends: 11187 [2021-11-17 12:24:23,663 INFO L226 Difference]: Without dead ends: 11185 [2021-11-17 12:24:23,671 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-11-17 12:24:23,673 INFO L933 BasicCegarLoop]: 3131 mSDtfsCounter, 7414 mSDsluCounter, 2666 mSDsCounter, 0 mSdLazyCounter, 4856 mSolverCounterSat, 5147 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7635 SdHoareTripleChecker+Valid, 5797 SdHoareTripleChecker+Invalid, 10008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5147 IncrementalHoareTripleChecker+Valid, 4856 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.3s IncrementalHoareTripleChecker+Time [2021-11-17 12:24:23,674 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7635 Valid, 5797 Invalid, 10008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5147 Valid, 4856 Invalid, 5 Unknown, 0 Unchecked, 18.3s Time] [2021-11-17 12:24:23,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11185 states. [2021-11-17 12:24:24,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11185 to 10252. [2021-11-17 12:24:24,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10252 states, 6682 states have (on average 1.2240347201436697) internal successors, (8179), 6880 states have internal predecessors, (8179), 2776 states have call successors, (2776), 750 states have call predecessors, (2776), 758 states have return successors, (2832), 2732 states have call predecessors, (2832), 2774 states have call successors, (2832) [2021-11-17 12:24:24,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10252 states to 10252 states and 13787 transitions. [2021-11-17 12:24:24,176 INFO L78 Accepts]: Start accepts. Automaton has 10252 states and 13787 transitions. Word has length 92 [2021-11-17 12:24:24,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:24:24,177 INFO L470 AbstractCegarLoop]: Abstraction has 10252 states and 13787 transitions. [2021-11-17 12:24:24,177 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-17 12:24:24,177 INFO L276 IsEmpty]: Start isEmpty. Operand 10252 states and 13787 transitions. [2021-11-17 12:24:24,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-11-17 12:24:24,179 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:24:24,179 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:24:24,179 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-17 12:24:24,179 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-11-17 12:24:24,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:24:24,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1247974603, now seen corresponding path program 1 times [2021-11-17 12:24:24,180 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:24:24,180 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479242091] [2021-11-17 12:24:24,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:24:24,180 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:24:24,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:24:24,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:24:24,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:24:24,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 12:24:24,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:24:24,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:24:24,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:24:24,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:24:24,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:24:24,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-17 12:24:24,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:24:24,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-17 12:24:24,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:24:24,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-17 12:24:24,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:24:24,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:24:24,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:24:24,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 12:24:24,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:24:24,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-11-17 12:24:24,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:24:24,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-17 12:24:24,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:24:24,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-11-17 12:24:24,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:24:24,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-17 12:24:24,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:24:24,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-11-17 12:24:24,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:24:24,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-17 12:24:24,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:24:24,474 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-17 12:24:24,474 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:24:24,474 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479242091] [2021-11-17 12:24:24,475 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479242091] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:24:24,475 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:24:24,475 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 12:24:24,475 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134881562] [2021-11-17 12:24:24,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:24:24,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 12:24:24,476 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:24:24,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 12:24:24,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-17 12:24:24,477 INFO L87 Difference]: Start difference. First operand 10252 states and 13787 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-17 12:24:26,512 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:24:30,336 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:24:32,350 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:24:40,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:24:40,020 INFO L93 Difference]: Finished difference Result 11185 states and 15291 transitions. [2021-11-17 12:24:40,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-17 12:24:40,020 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 98 [2021-11-17 12:24:40,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:24:40,067 INFO L225 Difference]: With dead ends: 11185 [2021-11-17 12:24:40,067 INFO L226 Difference]: Without dead ends: 11183 [2021-11-17 12:24:40,077 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-11-17 12:24:40,078 INFO L933 BasicCegarLoop]: 3133 mSDtfsCounter, 7397 mSDsluCounter, 2668 mSDsCounter, 0 mSdLazyCounter, 4862 mSolverCounterSat, 5144 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7616 SdHoareTripleChecker+Valid, 5801 SdHoareTripleChecker+Invalid, 10009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5144 IncrementalHoareTripleChecker+Valid, 4862 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.1s IncrementalHoareTripleChecker+Time [2021-11-17 12:24:40,078 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7616 Valid, 5801 Invalid, 10009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5144 Valid, 4862 Invalid, 3 Unknown, 0 Unchecked, 15.1s Time] [2021-11-17 12:24:40,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11183 states. [2021-11-17 12:24:40,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11183 to 10250. [2021-11-17 12:24:40,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10250 states, 6681 states have (on average 1.2239185750636132) internal successors, (8177), 6878 states have internal predecessors, (8177), 2776 states have call successors, (2776), 750 states have call predecessors, (2776), 758 states have return successors, (2832), 2732 states have call predecessors, (2832), 2774 states have call successors, (2832) [2021-11-17 12:24:40,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10250 states to 10250 states and 13785 transitions. [2021-11-17 12:24:40,565 INFO L78 Accepts]: Start accepts. Automaton has 10250 states and 13785 transitions. Word has length 98 [2021-11-17 12:24:40,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:24:40,565 INFO L470 AbstractCegarLoop]: Abstraction has 10250 states and 13785 transitions. [2021-11-17 12:24:40,566 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-17 12:24:40,566 INFO L276 IsEmpty]: Start isEmpty. Operand 10250 states and 13785 transitions. [2021-11-17 12:24:40,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-11-17 12:24:40,567 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:24:40,567 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:24:40,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-17 12:24:40,568 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-11-17 12:24:40,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:24:40,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1847478073, now seen corresponding path program 1 times [2021-11-17 12:24:40,568 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:24:40,568 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174868145] [2021-11-17 12:24:40,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:24:40,569 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:24:40,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:24:40,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:24:40,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:24:40,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 12:24:40,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:24:40,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:24:40,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:24:40,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:24:40,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:24:40,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-17 12:24:40,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:24:40,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-17 12:24:40,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:24:40,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-17 12:24:40,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:24:40,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:24:40,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:24:40,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 12:24:40,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:24:40,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-11-17 12:24:40,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:24:40,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-17 12:24:40,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:24:40,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-11-17 12:24:40,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:24:40,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-17 12:24:40,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:24:40,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-11-17 12:24:40,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:24:40,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-17 12:24:40,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:24:40,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-11-17 12:24:40,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:24:40,800 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-17 12:24:40,801 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:24:40,801 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174868145] [2021-11-17 12:24:40,801 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174868145] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:24:40,801 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:24:40,801 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 12:24:40,801 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41142017] [2021-11-17 12:24:40,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:24:40,802 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 12:24:40,802 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:24:40,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 12:24:40,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-17 12:24:40,803 INFO L87 Difference]: Start difference. First operand 10250 states and 13785 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-17 12:24:42,834 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:24:44,897 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:24:46,970 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:24:50,145 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:24:52,180 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:25:00,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:25:00,054 INFO L93 Difference]: Finished difference Result 11183 states and 15289 transitions. [2021-11-17 12:25:00,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-17 12:25:00,055 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 104 [2021-11-17 12:25:00,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:25:00,092 INFO L225 Difference]: With dead ends: 11183 [2021-11-17 12:25:00,093 INFO L226 Difference]: Without dead ends: 11181 [2021-11-17 12:25:00,097 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-11-17 12:25:00,098 INFO L933 BasicCegarLoop]: 3134 mSDtfsCounter, 7380 mSDsluCounter, 2667 mSDsCounter, 0 mSdLazyCounter, 4862 mSolverCounterSat, 5137 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7599 SdHoareTripleChecker+Valid, 5801 SdHoareTripleChecker+Invalid, 10004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5137 IncrementalHoareTripleChecker+Valid, 4862 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.7s IncrementalHoareTripleChecker+Time [2021-11-17 12:25:00,098 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7599 Valid, 5801 Invalid, 10004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5137 Valid, 4862 Invalid, 5 Unknown, 0 Unchecked, 18.7s Time] [2021-11-17 12:25:00,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11181 states. [2021-11-17 12:25:00,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11181 to 10248. [2021-11-17 12:25:00,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10248 states, 6680 states have (on average 1.223802395209581) internal successors, (8175), 6876 states have internal predecessors, (8175), 2776 states have call successors, (2776), 750 states have call predecessors, (2776), 758 states have return successors, (2832), 2732 states have call predecessors, (2832), 2774 states have call successors, (2832) [2021-11-17 12:25:00,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10248 states to 10248 states and 13783 transitions. [2021-11-17 12:25:00,557 INFO L78 Accepts]: Start accepts. Automaton has 10248 states and 13783 transitions. Word has length 104 [2021-11-17 12:25:00,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:25:00,558 INFO L470 AbstractCegarLoop]: Abstraction has 10248 states and 13783 transitions. [2021-11-17 12:25:00,558 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-17 12:25:00,559 INFO L276 IsEmpty]: Start isEmpty. Operand 10248 states and 13783 transitions. [2021-11-17 12:25:00,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-11-17 12:25:00,560 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:25:00,561 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:25:00,561 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-17 12:25:00,561 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-11-17 12:25:00,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:25:00,561 INFO L85 PathProgramCache]: Analyzing trace with hash 554127251, now seen corresponding path program 1 times [2021-11-17 12:25:00,561 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:25:00,562 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388291161] [2021-11-17 12:25:00,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:25:00,562 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:25:00,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:00,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:25:00,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:00,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 12:25:00,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:00,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:25:00,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:00,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:25:00,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:00,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-17 12:25:00,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:00,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-17 12:25:00,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:00,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-17 12:25:00,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:00,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:25:00,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:00,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 12:25:00,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:00,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-11-17 12:25:00,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:00,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-17 12:25:00,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:00,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-11-17 12:25:00,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:00,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-17 12:25:00,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:00,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-11-17 12:25:00,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:00,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-17 12:25:00,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:00,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-11-17 12:25:00,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:00,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-11-17 12:25:00,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:00,831 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-17 12:25:00,831 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:25:00,831 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388291161] [2021-11-17 12:25:00,831 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388291161] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:25:00,832 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:25:00,832 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 12:25:00,832 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096546441] [2021-11-17 12:25:00,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:25:00,833 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 12:25:00,833 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:25:00,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 12:25:00,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-17 12:25:00,834 INFO L87 Difference]: Start difference. First operand 10248 states and 13783 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (18), 5 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2021-11-17 12:25:02,869 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:25:04,933 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:25:08,135 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:25:10,154 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:25:17,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:25:17,980 INFO L93 Difference]: Finished difference Result 11181 states and 15287 transitions. [2021-11-17 12:25:17,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-17 12:25:17,980 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (18), 5 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 110 [2021-11-17 12:25:17,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:25:18,019 INFO L225 Difference]: With dead ends: 11181 [2021-11-17 12:25:18,019 INFO L226 Difference]: Without dead ends: 11179 [2021-11-17 12:25:18,026 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-11-17 12:25:18,026 INFO L933 BasicCegarLoop]: 3116 mSDtfsCounter, 7415 mSDsluCounter, 2663 mSDsCounter, 0 mSdLazyCounter, 4838 mSolverCounterSat, 5151 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7634 SdHoareTripleChecker+Valid, 5779 SdHoareTripleChecker+Invalid, 9993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5151 IncrementalHoareTripleChecker+Valid, 4838 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.6s IncrementalHoareTripleChecker+Time [2021-11-17 12:25:18,027 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7634 Valid, 5779 Invalid, 9993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5151 Valid, 4838 Invalid, 4 Unknown, 0 Unchecked, 16.6s Time] [2021-11-17 12:25:18,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11179 states. [2021-11-17 12:25:18,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11179 to 10246. [2021-11-17 12:25:18,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10246 states, 6679 states have (on average 1.223686180565953) internal successors, (8173), 6874 states have internal predecessors, (8173), 2776 states have call successors, (2776), 750 states have call predecessors, (2776), 758 states have return successors, (2832), 2732 states have call predecessors, (2832), 2774 states have call successors, (2832) [2021-11-17 12:25:18,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10246 states to 10246 states and 13781 transitions. [2021-11-17 12:25:18,493 INFO L78 Accepts]: Start accepts. Automaton has 10246 states and 13781 transitions. Word has length 110 [2021-11-17 12:25:18,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:25:18,494 INFO L470 AbstractCegarLoop]: Abstraction has 10246 states and 13781 transitions. [2021-11-17 12:25:18,494 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (18), 5 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2021-11-17 12:25:18,494 INFO L276 IsEmpty]: Start isEmpty. Operand 10246 states and 13781 transitions. [2021-11-17 12:25:18,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-11-17 12:25:18,496 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:25:18,496 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:25:18,497 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-17 12:25:18,497 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-11-17 12:25:18,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:25:18,497 INFO L85 PathProgramCache]: Analyzing trace with hash -59449034, now seen corresponding path program 1 times [2021-11-17 12:25:18,497 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:25:18,498 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074397697] [2021-11-17 12:25:18,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:25:18,498 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:25:18,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:18,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:25:18,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:18,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 12:25:18,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:18,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:25:18,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:18,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:25:18,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:18,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-17 12:25:18,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:18,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-17 12:25:18,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:18,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-17 12:25:18,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:18,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:25:18,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:18,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 12:25:18,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:18,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-11-17 12:25:18,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:18,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-17 12:25:18,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:18,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-11-17 12:25:18,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:18,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-17 12:25:18,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:18,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-11-17 12:25:18,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:18,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-17 12:25:18,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:18,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-11-17 12:25:18,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:18,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-11-17 12:25:18,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:18,816 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-17 12:25:18,816 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:25:18,817 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074397697] [2021-11-17 12:25:18,817 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074397697] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:25:18,817 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:25:18,817 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 12:25:18,817 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949700033] [2021-11-17 12:25:18,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:25:18,818 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 12:25:18,818 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:25:18,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 12:25:18,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-17 12:25:18,819 INFO L87 Difference]: Start difference. First operand 10246 states and 13781 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (18), 5 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2021-11-17 12:25:20,854 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:25:22,921 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:25:25,004 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:25:28,144 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:25:30,170 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:25:37,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:25:37,912 INFO L93 Difference]: Finished difference Result 11179 states and 15285 transitions. [2021-11-17 12:25:37,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-17 12:25:37,913 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (18), 5 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 112 [2021-11-17 12:25:37,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:25:37,959 INFO L225 Difference]: With dead ends: 11179 [2021-11-17 12:25:37,959 INFO L226 Difference]: Without dead ends: 11177 [2021-11-17 12:25:37,969 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-11-17 12:25:37,970 INFO L933 BasicCegarLoop]: 3128 mSDtfsCounter, 7368 mSDsluCounter, 2668 mSDsCounter, 0 mSdLazyCounter, 4852 mSolverCounterSat, 5147 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7585 SdHoareTripleChecker+Valid, 5796 SdHoareTripleChecker+Invalid, 10004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5147 IncrementalHoareTripleChecker+Valid, 4852 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.6s IncrementalHoareTripleChecker+Time [2021-11-17 12:25:37,970 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7585 Valid, 5796 Invalid, 10004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5147 Valid, 4852 Invalid, 5 Unknown, 0 Unchecked, 18.6s Time] [2021-11-17 12:25:37,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11177 states. [2021-11-17 12:25:38,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11177 to 10244. [2021-11-17 12:25:38,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10244 states, 6678 states have (on average 1.2235699311171009) internal successors, (8171), 6872 states have internal predecessors, (8171), 2776 states have call successors, (2776), 750 states have call predecessors, (2776), 758 states have return successors, (2832), 2732 states have call predecessors, (2832), 2774 states have call successors, (2832) [2021-11-17 12:25:38,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10244 states to 10244 states and 13779 transitions. [2021-11-17 12:25:38,500 INFO L78 Accepts]: Start accepts. Automaton has 10244 states and 13779 transitions. Word has length 112 [2021-11-17 12:25:38,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:25:38,500 INFO L470 AbstractCegarLoop]: Abstraction has 10244 states and 13779 transitions. [2021-11-17 12:25:38,501 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (18), 5 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2021-11-17 12:25:38,501 INFO L276 IsEmpty]: Start isEmpty. Operand 10244 states and 13779 transitions. [2021-11-17 12:25:38,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-11-17 12:25:38,502 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:25:38,502 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:25:38,503 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-17 12:25:38,503 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_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-11-17 12:25:38,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:25:38,503 INFO L85 PathProgramCache]: Analyzing trace with hash -917700322, now seen corresponding path program 1 times [2021-11-17 12:25:38,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:25:38,504 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449936648] [2021-11-17 12:25:38,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:25:38,504 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:25:38,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:38,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:25:38,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:38,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 12:25:38,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:38,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:25:38,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:38,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:25:38,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:38,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-17 12:25:38,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:38,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-17 12:25:38,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:38,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-17 12:25:38,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:38,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:25:38,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:38,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 12:25:38,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:38,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-11-17 12:25:38,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:38,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-17 12:25:38,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:38,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-11-17 12:25:38,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:38,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-17 12:25:38,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:38,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-11-17 12:25:38,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:38,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-17 12:25:38,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:38,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-11-17 12:25:38,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:38,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-11-17 12:25:38,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:38,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-11-17 12:25:38,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:38,722 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-17 12:25:38,722 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:25:38,722 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449936648] [2021-11-17 12:25:38,722 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449936648] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:25:38,722 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:25:38,723 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 12:25:38,723 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973596899] [2021-11-17 12:25:38,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:25:38,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 12:25:38,723 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:25:38,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 12:25:38,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-17 12:25:38,724 INFO L87 Difference]: Start difference. First operand 10244 states and 13779 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2021-11-17 12:25:40,756 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:25:42,821 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:25:44,892 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:25:48,012 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:25:50,027 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:25:58,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:25:58,033 INFO L93 Difference]: Finished difference Result 11177 states and 15283 transitions. [2021-11-17 12:25:58,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-17 12:25:58,034 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 118 [2021-11-17 12:25:58,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:25:58,130 INFO L225 Difference]: With dead ends: 11177 [2021-11-17 12:25:58,130 INFO L226 Difference]: Without dead ends: 11175 [2021-11-17 12:25:58,133 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-11-17 12:25:58,133 INFO L933 BasicCegarLoop]: 3123 mSDtfsCounter, 7368 mSDsluCounter, 2667 mSDsCounter, 0 mSdLazyCounter, 4860 mSolverCounterSat, 5139 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7584 SdHoareTripleChecker+Valid, 5790 SdHoareTripleChecker+Invalid, 10004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5139 IncrementalHoareTripleChecker+Valid, 4860 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.8s IncrementalHoareTripleChecker+Time [2021-11-17 12:25:58,133 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7584 Valid, 5790 Invalid, 10004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5139 Valid, 4860 Invalid, 5 Unknown, 0 Unchecked, 18.8s Time] [2021-11-17 12:25:58,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11175 states. [2021-11-17 12:25:58,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11175 to 10242. [2021-11-17 12:25:58,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10242 states, 6677 states have (on average 1.2234536468473864) internal successors, (8169), 6870 states have internal predecessors, (8169), 2776 states have call successors, (2776), 750 states have call predecessors, (2776), 758 states have return successors, (2832), 2732 states have call predecessors, (2832), 2774 states have call successors, (2832) [2021-11-17 12:25:58,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10242 states to 10242 states and 13777 transitions. [2021-11-17 12:25:58,535 INFO L78 Accepts]: Start accepts. Automaton has 10242 states and 13777 transitions. Word has length 118 [2021-11-17 12:25:58,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:25:58,535 INFO L470 AbstractCegarLoop]: Abstraction has 10242 states and 13777 transitions. [2021-11-17 12:25:58,536 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2021-11-17 12:25:58,536 INFO L276 IsEmpty]: Start isEmpty. Operand 10242 states and 13777 transitions. [2021-11-17 12:25:58,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-11-17 12:25:58,538 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:25:58,538 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:25:58,539 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-17 12:25:58,539 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-11-17 12:25:58,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:25:58,539 INFO L85 PathProgramCache]: Analyzing trace with hash 949892871, now seen corresponding path program 1 times [2021-11-17 12:25:58,539 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:25:58,540 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174678813] [2021-11-17 12:25:58,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:25:58,540 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:25:58,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:58,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:25:58,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:58,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 12:25:58,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:58,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:25:58,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:58,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:25:58,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:58,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-17 12:25:58,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:58,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-17 12:25:58,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:58,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-17 12:25:58,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:58,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:25:58,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:58,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 12:25:58,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:58,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-11-17 12:25:58,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:58,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-17 12:25:58,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:58,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-11-17 12:25:58,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:58,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-17 12:25:58,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:58,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-11-17 12:25:58,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:58,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-17 12:25:58,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:58,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-11-17 12:25:58,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:58,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-11-17 12:25:58,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:58,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-11-17 12:25:58,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:58,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-11-17 12:25:58,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:58,796 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-17 12:25:58,796 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:25:58,796 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174678813] [2021-11-17 12:25:58,797 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174678813] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:25:58,797 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:25:58,797 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 12:25:58,797 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947287986] [2021-11-17 12:25:58,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:25:58,798 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 12:25:58,798 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:25:58,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 12:25:58,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-17 12:25:58,799 INFO L87 Difference]: Start difference. First operand 10242 states and 13777 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2021-11-17 12:26:00,834 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:26:01,856 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:26:05,099 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:26:07,123 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:26:15,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:26:15,091 INFO L93 Difference]: Finished difference Result 11175 states and 15281 transitions. [2021-11-17 12:26:15,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-17 12:26:15,092 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 124 [2021-11-17 12:26:15,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:26:15,118 INFO L225 Difference]: With dead ends: 11175 [2021-11-17 12:26:15,118 INFO L226 Difference]: Without dead ends: 11173 [2021-11-17 12:26:15,123 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-11-17 12:26:15,123 INFO L933 BasicCegarLoop]: 3127 mSDtfsCounter, 7354 mSDsluCounter, 2671 mSDsCounter, 0 mSdLazyCounter, 4854 mSolverCounterSat, 5132 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7569 SdHoareTripleChecker+Valid, 5798 SdHoareTripleChecker+Invalid, 9989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5132 IncrementalHoareTripleChecker+Valid, 4854 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.7s IncrementalHoareTripleChecker+Time [2021-11-17 12:26:15,124 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7569 Valid, 5798 Invalid, 9989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5132 Valid, 4854 Invalid, 3 Unknown, 0 Unchecked, 15.7s Time] [2021-11-17 12:26:15,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11173 states. [2021-11-17 12:26:15,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11173 to 10240. [2021-11-17 12:26:15,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10240 states, 6676 states have (on average 1.2233373277411623) internal successors, (8167), 6868 states have internal predecessors, (8167), 2776 states have call successors, (2776), 750 states have call predecessors, (2776), 758 states have return successors, (2832), 2732 states have call predecessors, (2832), 2774 states have call successors, (2832) [2021-11-17 12:26:15,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10240 states to 10240 states and 13775 transitions. [2021-11-17 12:26:15,566 INFO L78 Accepts]: Start accepts. Automaton has 10240 states and 13775 transitions. Word has length 124 [2021-11-17 12:26:15,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:26:15,567 INFO L470 AbstractCegarLoop]: Abstraction has 10240 states and 13775 transitions. [2021-11-17 12:26:15,567 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2021-11-17 12:26:15,567 INFO L276 IsEmpty]: Start isEmpty. Operand 10240 states and 13775 transitions. [2021-11-17 12:26:15,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-11-17 12:26:15,568 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:26:15,569 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:26:15,569 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-17 12:26:15,569 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-11-17 12:26:15,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:26:15,570 INFO L85 PathProgramCache]: Analyzing trace with hash -499444293, now seen corresponding path program 1 times [2021-11-17 12:26:15,570 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:26:15,570 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785417936] [2021-11-17 12:26:15,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:26:15,570 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:26:15,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:15,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:26:15,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:15,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 12:26:15,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:15,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:26:15,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:15,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:26:15,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:15,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-17 12:26:15,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:15,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-17 12:26:15,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:15,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-17 12:26:15,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:15,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:26:15,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:15,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 12:26:15,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:15,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-11-17 12:26:15,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:15,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-17 12:26:15,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:15,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-11-17 12:26:15,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:15,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-17 12:26:15,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:15,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-11-17 12:26:15,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:15,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-17 12:26:15,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:15,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-11-17 12:26:15,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:15,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-11-17 12:26:15,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:15,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-11-17 12:26:15,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:15,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-11-17 12:26:15,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:15,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-11-17 12:26:15,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:15,816 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-17 12:26:15,816 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:26:15,817 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785417936] [2021-11-17 12:26:15,817 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785417936] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:26:15,817 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:26:15,817 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 12:26:15,817 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620146997] [2021-11-17 12:26:15,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:26:15,818 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 12:26:15,818 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:26:15,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 12:26:15,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-17 12:26:15,819 INFO L87 Difference]: Start difference. First operand 10240 states and 13775 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2021-11-17 12:26:17,853 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:26:19,924 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:26:21,064 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:26:24,276 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:26:26,298 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:26:34,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:26:34,411 INFO L93 Difference]: Finished difference Result 11173 states and 15279 transitions. [2021-11-17 12:26:34,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-17 12:26:34,412 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 130 [2021-11-17 12:26:34,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:26:34,438 INFO L225 Difference]: With dead ends: 11173 [2021-11-17 12:26:34,438 INFO L226 Difference]: Without dead ends: 11171 [2021-11-17 12:26:34,441 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-11-17 12:26:34,441 INFO L933 BasicCegarLoop]: 3124 mSDtfsCounter, 7346 mSDsluCounter, 2670 mSDsCounter, 0 mSdLazyCounter, 4849 mSolverCounterSat, 5136 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7560 SdHoareTripleChecker+Valid, 5794 SdHoareTripleChecker+Invalid, 9989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5136 IncrementalHoareTripleChecker+Valid, 4849 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.0s IncrementalHoareTripleChecker+Time [2021-11-17 12:26:34,442 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7560 Valid, 5794 Invalid, 9989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5136 Valid, 4849 Invalid, 4 Unknown, 0 Unchecked, 18.0s Time] [2021-11-17 12:26:34,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11171 states. [2021-11-17 12:26:34,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11171 to 10238. [2021-11-17 12:26:34,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10238 states, 6675 states have (on average 1.2232209737827715) internal successors, (8165), 6866 states have internal predecessors, (8165), 2776 states have call successors, (2776), 750 states have call predecessors, (2776), 758 states have return successors, (2832), 2732 states have call predecessors, (2832), 2774 states have call successors, (2832) [2021-11-17 12:26:34,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10238 states to 10238 states and 13773 transitions. [2021-11-17 12:26:34,832 INFO L78 Accepts]: Start accepts. Automaton has 10238 states and 13773 transitions. Word has length 130 [2021-11-17 12:26:34,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:26:34,832 INFO L470 AbstractCegarLoop]: Abstraction has 10238 states and 13773 transitions. [2021-11-17 12:26:34,832 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2021-11-17 12:26:34,832 INFO L276 IsEmpty]: Start isEmpty. Operand 10238 states and 13773 transitions. [2021-11-17 12:26:34,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2021-11-17 12:26:34,834 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:26:34,834 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:26:34,834 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-17 12:26:34,835 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-11-17 12:26:34,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:26:34,835 INFO L85 PathProgramCache]: Analyzing trace with hash 903000778, now seen corresponding path program 1 times [2021-11-17 12:26:34,835 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:26:34,835 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828915124] [2021-11-17 12:26:34,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:26:34,836 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:26:34,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:34,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:26:34,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:34,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 12:26:34,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:34,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:26:34,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:34,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:26:34,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:34,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-11-17 12:26:35,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:35,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:26:35,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:35,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:26:35,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:35,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-17 12:26:35,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:35,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:26:35,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:35,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:26:35,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:35,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-17 12:26:35,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:35,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-17 12:26:35,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:35,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-17 12:26:35,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:35,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:26:35,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:35,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:26:35,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:35,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:26:35,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:35,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-11-17 12:26:35,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:35,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:26:35,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:35,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:26:35,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:35,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:26:35,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:35,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-11-17 12:26:35,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:35,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:26:35,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:35,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:26:35,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:35,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:26:35,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:35,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-17 12:26:35,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:35,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-11-17 12:26:35,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:35,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2021-11-17 12:26:35,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:35,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2021-11-17 12:26:35,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:35,157 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2021-11-17 12:26:35,157 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:26:35,158 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828915124] [2021-11-17 12:26:35,158 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828915124] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:26:35,158 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:26:35,158 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 12:26:35,158 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326584600] [2021-11-17 12:26:35,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:26:35,159 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 12:26:35,159 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:26:35,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 12:26:35,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-17 12:26:35,160 INFO L87 Difference]: Start difference. First operand 10238 states and 13773 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2021-11-17 12:26:37,196 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:26:41,702 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:26:43,728 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:26:45,750 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:26:55,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:26:55,596 INFO L93 Difference]: Finished difference Result 22347 states and 30546 transitions. [2021-11-17 12:26:55,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-17 12:26:55,597 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 175 [2021-11-17 12:26:55,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:26:55,624 INFO L225 Difference]: With dead ends: 22347 [2021-11-17 12:26:55,624 INFO L226 Difference]: Without dead ends: 12126 [2021-11-17 12:26:55,663 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-11-17 12:26:55,663 INFO L933 BasicCegarLoop]: 3566 mSDtfsCounter, 5192 mSDsluCounter, 4868 mSDsCounter, 0 mSdLazyCounter, 7583 mSolverCounterSat, 4217 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5192 SdHoareTripleChecker+Valid, 8434 SdHoareTripleChecker+Invalid, 11804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4217 IncrementalHoareTripleChecker+Valid, 7583 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.6s IncrementalHoareTripleChecker+Time [2021-11-17 12:26:55,664 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5192 Valid, 8434 Invalid, 11804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4217 Valid, 7583 Invalid, 4 Unknown, 0 Unchecked, 19.6s Time] [2021-11-17 12:26:55,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12126 states. [2021-11-17 12:26:56,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12126 to 10240. [2021-11-17 12:26:56,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10240 states, 6677 states have (on average 1.223154111127752) internal successors, (8167), 6868 states have internal predecessors, (8167), 2776 states have call successors, (2776), 750 states have call predecessors, (2776), 758 states have return successors, (2832), 2732 states have call predecessors, (2832), 2774 states have call successors, (2832) [2021-11-17 12:26:56,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10240 states to 10240 states and 13775 transitions. [2021-11-17 12:26:56,149 INFO L78 Accepts]: Start accepts. Automaton has 10240 states and 13775 transitions. Word has length 175 [2021-11-17 12:26:56,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:26:56,150 INFO L470 AbstractCegarLoop]: Abstraction has 10240 states and 13775 transitions. [2021-11-17 12:26:56,150 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2021-11-17 12:26:56,150 INFO L276 IsEmpty]: Start isEmpty. Operand 10240 states and 13775 transitions. [2021-11-17 12:26:56,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2021-11-17 12:26:56,157 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:26:56,157 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:26:56,158 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-17 12:26:56,158 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-11-17 12:26:56,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:26:56,158 INFO L85 PathProgramCache]: Analyzing trace with hash 358128204, now seen corresponding path program 1 times [2021-11-17 12:26:56,158 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:26:56,159 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702504134] [2021-11-17 12:26:56,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:26:56,159 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:26:56,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:56,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:26:56,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:56,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 12:26:56,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:56,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:26:56,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:56,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:26:56,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:56,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-11-17 12:26:56,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:56,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:26:56,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:56,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:26:56,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:56,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-17 12:26:56,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:56,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:26:56,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:56,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:26:56,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:56,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-17 12:26:56,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:56,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-17 12:26:56,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:56,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-17 12:26:56,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:56,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:26:56,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:56,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:26:56,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:56,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:26:56,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:56,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-11-17 12:26:56,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:56,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:26:56,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:56,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:26:56,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:56,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:26:56,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:56,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-11-17 12:26:56,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:56,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:26:56,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:56,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:26:56,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:56,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:26:56,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:56,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-17 12:26:56,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:56,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-11-17 12:26:56,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:56,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2021-11-17 12:26:56,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:56,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2021-11-17 12:26:56,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:56,433 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2021-11-17 12:26:56,433 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:26:56,434 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702504134] [2021-11-17 12:26:56,434 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702504134] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:26:56,434 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:26:56,434 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 12:26:56,434 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115835015] [2021-11-17 12:26:56,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:26:56,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 12:26:56,435 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:26:56,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 12:26:56,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-17 12:26:56,436 INFO L87 Difference]: Start difference. First operand 10240 states and 13775 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2021-11-17 12:26:58,470 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:27:00,543 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:27:02,618 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:27:06,064 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:27:08,092 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:27:10,100 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:27:21,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:27:21,022 INFO L93 Difference]: Finished difference Result 22337 states and 30532 transitions. [2021-11-17 12:27:21,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-17 12:27:21,022 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 175 [2021-11-17 12:27:21,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:27:21,069 INFO L225 Difference]: With dead ends: 22337 [2021-11-17 12:27:21,069 INFO L226 Difference]: Without dead ends: 12129 [2021-11-17 12:27:21,104 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-11-17 12:27:21,105 INFO L933 BasicCegarLoop]: 3586 mSDtfsCounter, 5170 mSDsluCounter, 4886 mSDsCounter, 0 mSdLazyCounter, 7615 mSolverCounterSat, 4205 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5170 SdHoareTripleChecker+Valid, 8472 SdHoareTripleChecker+Invalid, 11826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4205 IncrementalHoareTripleChecker+Valid, 7615 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.8s IncrementalHoareTripleChecker+Time [2021-11-17 12:27:21,105 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5170 Valid, 8472 Invalid, 11826 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4205 Valid, 7615 Invalid, 6 Unknown, 0 Unchecked, 23.8s Time] [2021-11-17 12:27:21,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12129 states. [2021-11-17 12:27:21,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12129 to 10242. [2021-11-17 12:27:21,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10242 states, 6679 states have (on average 1.223087288516245) internal successors, (8169), 6870 states have internal predecessors, (8169), 2776 states have call successors, (2776), 750 states have call predecessors, (2776), 758 states have return successors, (2832), 2732 states have call predecessors, (2832), 2774 states have call successors, (2832) [2021-11-17 12:27:21,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10242 states to 10242 states and 13777 transitions. [2021-11-17 12:27:21,596 INFO L78 Accepts]: Start accepts. Automaton has 10242 states and 13777 transitions. Word has length 175 [2021-11-17 12:27:21,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:27:21,596 INFO L470 AbstractCegarLoop]: Abstraction has 10242 states and 13777 transitions. [2021-11-17 12:27:21,596 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2021-11-17 12:27:21,596 INFO L276 IsEmpty]: Start isEmpty. Operand 10242 states and 13777 transitions. [2021-11-17 12:27:21,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2021-11-17 12:27:21,598 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:27:21,598 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:27:21,598 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-17 12:27:21,598 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-11-17 12:27:21,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:27:21,598 INFO L85 PathProgramCache]: Analyzing trace with hash 829484554, now seen corresponding path program 1 times [2021-11-17 12:27:21,599 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:27:21,599 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363485434] [2021-11-17 12:27:21,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:27:21,599 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:27:21,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:21,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:27:21,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:21,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 12:27:21,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:21,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:27:21,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:21,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:27:21,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:21,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-11-17 12:27:21,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:21,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:27:21,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:21,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:27:21,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:21,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-17 12:27:21,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:21,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:27:21,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:21,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:27:21,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:21,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-17 12:27:21,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:21,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-17 12:27:21,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:21,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-17 12:27:21,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:21,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:27:21,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:21,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:27:21,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:21,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:27:21,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:21,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-11-17 12:27:21,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:21,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:27:21,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:21,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:27:21,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:21,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:27:21,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:21,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-11-17 12:27:21,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:21,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:27:21,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:21,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:27:21,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:21,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:27:21,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:21,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-17 12:27:21,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:22,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-11-17 12:27:22,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:22,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2021-11-17 12:27:22,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:22,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2021-11-17 12:27:22,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:22,054 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2021-11-17 12:27:22,054 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:27:22,054 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363485434] [2021-11-17 12:27:22,056 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363485434] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 12:27:22,056 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992519981] [2021-11-17 12:27:22,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:27:22,056 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 12:27:22,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 12:27:22,058 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:27:22,059 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:27:23,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:23,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 3286 conjuncts, 21 conjunts are in the unsatisfiable core [2021-11-17 12:27:23,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 12:27:23,855 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2021-11-17 12:27:23,855 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-17 12:27:23,855 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992519981] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:27:23,856 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-17 12:27:23,856 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 12 [2021-11-17 12:27:23,856 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041363552] [2021-11-17 12:27:23,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:27:23,857 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 12:27:23,857 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:27:23,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 12:27:23,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2021-11-17 12:27:23,858 INFO L87 Difference]: Start difference. First operand 10242 states and 13777 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 5 states have internal predecessors, (77), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (21), 4 states have call predecessors, (21), 2 states have call successors, (21) [2021-11-17 12:27:25,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:27:25,293 INFO L93 Difference]: Finished difference Result 28951 states and 38795 transitions. [2021-11-17 12:27:25,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-17 12:27:25,293 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 5 states have internal predecessors, (77), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (21), 4 states have call predecessors, (21), 2 states have call successors, (21) Word has length 175 [2021-11-17 12:27:25,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:27:25,350 INFO L225 Difference]: With dead ends: 28951 [2021-11-17 12:27:25,350 INFO L226 Difference]: Without dead ends: 18726 [2021-11-17 12:27:25,380 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 226 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2021-11-17 12:27:25,381 INFO L933 BasicCegarLoop]: 5619 mSDtfsCounter, 2993 mSDsluCounter, 26088 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3005 SdHoareTripleChecker+Valid, 31707 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-17 12:27:25,381 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3005 Valid, 31707 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-17 12:27:25,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18726 states. [2021-11-17 12:27:26,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18726 to 18517. [2021-11-17 12:27:26,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18517 states, 12085 states have (on average 1.221514273893256) internal successors, (14762), 12397 states have internal predecessors, (14762), 4955 states have call successors, (4955), 1434 states have call predecessors, (4955), 1448 states have return successors, (5055), 4876 states have call predecessors, (5055), 4953 states have call successors, (5055) [2021-11-17 12:27:26,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18517 states to 18517 states and 24772 transitions. [2021-11-17 12:27:26,372 INFO L78 Accepts]: Start accepts. Automaton has 18517 states and 24772 transitions. Word has length 175 [2021-11-17 12:27:26,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:27:26,372 INFO L470 AbstractCegarLoop]: Abstraction has 18517 states and 24772 transitions. [2021-11-17 12:27:26,372 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 5 states have internal predecessors, (77), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (21), 4 states have call predecessors, (21), 2 states have call successors, (21) [2021-11-17 12:27:26,372 INFO L276 IsEmpty]: Start isEmpty. Operand 18517 states and 24772 transitions. [2021-11-17 12:27:26,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-11-17 12:27:26,373 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:27:26,374 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:27:26,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-17 12:27:26,574 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,SelfDestructingSolverStorable15 [2021-11-17 12:27:26,575 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-11-17 12:27:26,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:27:26,575 INFO L85 PathProgramCache]: Analyzing trace with hash 557273321, now seen corresponding path program 1 times [2021-11-17 12:27:26,575 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:27:26,575 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155674999] [2021-11-17 12:27:26,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:27:26,576 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:27:26,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:26,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:27:26,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:26,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 12:27:26,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:26,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:27:26,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:26,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:27:26,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:26,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-17 12:27:26,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:26,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-17 12:27:26,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:26,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-17 12:27:26,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:26,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:27:26,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:26,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 12:27:26,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:26,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-11-17 12:27:26,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:26,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-17 12:27:26,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:26,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-11-17 12:27:26,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:26,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-17 12:27:26,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:26,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-11-17 12:27:26,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:26,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-17 12:27:26,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:26,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-11-17 12:27:26,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:26,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-11-17 12:27:26,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:26,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-11-17 12:27:26,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:26,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-11-17 12:27:26,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:26,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-11-17 12:27:26,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:26,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-11-17 12:27:26,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:26,810 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-17 12:27:26,810 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:27:26,810 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155674999] [2021-11-17 12:27:26,811 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155674999] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:27:26,811 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:27:26,811 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 12:27:26,811 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910990777] [2021-11-17 12:27:26,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:27:26,811 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 12:27:26,812 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:27:26,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 12:27:26,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-17 12:27:26,812 INFO L87 Difference]: Start difference. First operand 18517 states and 24772 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (22), 5 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2021-11-17 12:27:28,847 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:27:30,913 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:27:32,991 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:27:36,358 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:27:38,376 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:27:47,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:27:47,057 INFO L93 Difference]: Finished difference Result 20248 states and 27524 transitions. [2021-11-17 12:27:47,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-17 12:27:47,058 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (22), 5 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 136 [2021-11-17 12:27:47,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:27:47,172 INFO L225 Difference]: With dead ends: 20248 [2021-11-17 12:27:47,174 INFO L226 Difference]: Without dead ends: 20246 [2021-11-17 12:27:47,180 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-11-17 12:27:47,181 INFO L933 BasicCegarLoop]: 3110 mSDtfsCounter, 7359 mSDsluCounter, 2662 mSDsCounter, 0 mSdLazyCounter, 4833 mSolverCounterSat, 5147 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7575 SdHoareTripleChecker+Valid, 5772 SdHoareTripleChecker+Invalid, 9985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5147 IncrementalHoareTripleChecker+Valid, 4833 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.2s IncrementalHoareTripleChecker+Time [2021-11-17 12:27:47,181 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7575 Valid, 5772 Invalid, 9985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5147 Valid, 4833 Invalid, 5 Unknown, 0 Unchecked, 19.2s Time] [2021-11-17 12:27:47,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20246 states. [2021-11-17 12:27:47,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20246 to 18515. [2021-11-17 12:27:47,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18515 states, 12084 states have (on average 1.221449851042701) internal successors, (14760), 12395 states have internal predecessors, (14760), 4955 states have call successors, (4955), 1434 states have call predecessors, (4955), 1448 states have return successors, (5055), 4876 states have call predecessors, (5055), 4953 states have call successors, (5055) [2021-11-17 12:27:48,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18515 states to 18515 states and 24770 transitions. [2021-11-17 12:27:48,053 INFO L78 Accepts]: Start accepts. Automaton has 18515 states and 24770 transitions. Word has length 136 [2021-11-17 12:27:48,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:27:48,053 INFO L470 AbstractCegarLoop]: Abstraction has 18515 states and 24770 transitions. [2021-11-17 12:27:48,053 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (22), 5 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2021-11-17 12:27:48,054 INFO L276 IsEmpty]: Start isEmpty. Operand 18515 states and 24770 transitions. [2021-11-17 12:27:48,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2021-11-17 12:27:48,055 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:27:48,056 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:27:48,056 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-17 12:27:48,056 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_linux_kernel_rcu_srcu_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-11-17 12:27:48,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:27:48,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1322659540, now seen corresponding path program 1 times [2021-11-17 12:27:48,058 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:27:48,058 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841745894] [2021-11-17 12:27:48,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:27:48,059 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:27:48,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:48,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:27:48,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:48,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 12:27:48,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:48,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:27:48,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:48,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:27:48,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:48,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-17 12:27:48,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:48,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-17 12:27:48,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:48,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-17 12:27:48,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:48,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:27:48,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:48,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 12:27:48,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:48,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-11-17 12:27:48,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:48,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-17 12:27:48,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:48,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-11-17 12:27:48,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:48,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-17 12:27:48,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:48,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-11-17 12:27:48,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:48,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-17 12:27:48,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:48,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-11-17 12:27:48,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:48,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-11-17 12:27:48,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:48,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-11-17 12:27:48,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:48,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-11-17 12:27:48,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:48,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-11-17 12:27:48,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:48,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-11-17 12:27:48,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:48,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2021-11-17 12:27:48,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:48,405 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-17 12:27:48,405 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:27:48,405 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841745894] [2021-11-17 12:27:48,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841745894] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:27:48,406 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:27:48,406 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 12:27:48,406 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920264851] [2021-11-17 12:27:48,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:27:48,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 12:27:48,407 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:27:48,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 12:27:48,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-17 12:27:48,408 INFO L87 Difference]: Start difference. First operand 18515 states and 24770 transitions. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (23), 5 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2021-11-17 12:27:50,440 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:27:52,517 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:27:54,586 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:27:57,816 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:27:59,839 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:28:08,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:28:08,693 INFO L93 Difference]: Finished difference Result 20246 states and 27522 transitions. [2021-11-17 12:28:08,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-17 12:28:08,694 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (23), 5 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 142 [2021-11-17 12:28:08,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:28:08,742 INFO L225 Difference]: With dead ends: 20246 [2021-11-17 12:28:08,742 INFO L226 Difference]: Without dead ends: 20244 [2021-11-17 12:28:08,751 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-11-17 12:28:08,751 INFO L933 BasicCegarLoop]: 3122 mSDtfsCounter, 7324 mSDsluCounter, 2669 mSDsCounter, 0 mSdLazyCounter, 4850 mSolverCounterSat, 5126 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7537 SdHoareTripleChecker+Valid, 5791 SdHoareTripleChecker+Invalid, 9981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5126 IncrementalHoareTripleChecker+Valid, 4850 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.3s IncrementalHoareTripleChecker+Time [2021-11-17 12:28:08,751 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7537 Valid, 5791 Invalid, 9981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5126 Valid, 4850 Invalid, 5 Unknown, 0 Unchecked, 19.3s Time] [2021-11-17 12:28:08,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20244 states. [2021-11-17 12:28:09,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20244 to 18513. [2021-11-17 12:28:09,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18513 states, 12083 states have (on average 1.2213854175287595) internal successors, (14758), 12393 states have internal predecessors, (14758), 4955 states have call successors, (4955), 1434 states have call predecessors, (4955), 1448 states have return successors, (5055), 4876 states have call predecessors, (5055), 4953 states have call successors, (5055) [2021-11-17 12:28:09,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18513 states to 18513 states and 24768 transitions. [2021-11-17 12:28:09,643 INFO L78 Accepts]: Start accepts. Automaton has 18513 states and 24768 transitions. Word has length 142 [2021-11-17 12:28:09,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:28:09,644 INFO L470 AbstractCegarLoop]: Abstraction has 18513 states and 24768 transitions. [2021-11-17 12:28:09,644 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (23), 5 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2021-11-17 12:28:09,644 INFO L276 IsEmpty]: Start isEmpty. Operand 18513 states and 24768 transitions. [2021-11-17 12:28:09,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-11-17 12:28:09,646 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:28:09,646 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:28:09,647 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-17 12:28:09,647 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_linux_lib_idr_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-11-17 12:28:09,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:28:09,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1121223339, now seen corresponding path program 1 times [2021-11-17 12:28:09,647 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:28:09,648 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865641649] [2021-11-17 12:28:09,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:28:09,648 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:28:09,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:09,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:28:09,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:09,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 12:28:09,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:09,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:28:09,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:09,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:28:09,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:09,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-17 12:28:09,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:09,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-17 12:28:09,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:09,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-17 12:28:09,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:09,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:28:09,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:09,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 12:28:09,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:09,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-11-17 12:28:09,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:09,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-17 12:28:09,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:09,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-11-17 12:28:09,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:09,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-17 12:28:09,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:09,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-11-17 12:28:09,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:09,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-17 12:28:09,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:09,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-11-17 12:28:09,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:09,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-11-17 12:28:09,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:09,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-11-17 12:28:09,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:09,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-11-17 12:28:09,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:09,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-11-17 12:28:09,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:09,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-11-17 12:28:09,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:09,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2021-11-17 12:28:09,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:09,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2021-11-17 12:28:09,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:09,912 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-17 12:28:09,912 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:28:09,912 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865641649] [2021-11-17 12:28:09,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865641649] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:28:09,913 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:28:09,913 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 12:28:09,913 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413917516] [2021-11-17 12:28:09,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:28:09,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 12:28:09,914 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:28:09,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 12:28:09,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-17 12:28:09,915 INFO L87 Difference]: Start difference. First operand 18513 states and 24768 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (24), 5 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2021-11-17 12:28:11,953 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:28:14,029 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:28:16,103 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:28:19,352 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:28:21,381 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:28:30,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:28:30,675 INFO L93 Difference]: Finished difference Result 20244 states and 27520 transitions. [2021-11-17 12:28:30,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-17 12:28:30,676 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (24), 5 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 148 [2021-11-17 12:28:30,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:28:30,731 INFO L225 Difference]: With dead ends: 20244 [2021-11-17 12:28:30,731 INFO L226 Difference]: Without dead ends: 20242 [2021-11-17 12:28:30,742 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-11-17 12:28:30,742 INFO L933 BasicCegarLoop]: 3123 mSDtfsCounter, 7307 mSDsluCounter, 2669 mSDsCounter, 0 mSdLazyCounter, 4855 mSolverCounterSat, 5120 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7519 SdHoareTripleChecker+Valid, 5792 SdHoareTripleChecker+Invalid, 9980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5120 IncrementalHoareTripleChecker+Valid, 4855 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.6s IncrementalHoareTripleChecker+Time [2021-11-17 12:28:30,742 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7519 Valid, 5792 Invalid, 9980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5120 Valid, 4855 Invalid, 5 Unknown, 0 Unchecked, 19.6s Time] [2021-11-17 12:28:30,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20242 states. [2021-11-17 12:28:31,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20242 to 18511. [2021-11-17 12:28:31,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18511 states, 12082 states have (on average 1.2213209733487833) internal successors, (14756), 12391 states have internal predecessors, (14756), 4955 states have call successors, (4955), 1434 states have call predecessors, (4955), 1448 states have return successors, (5055), 4876 states have call predecessors, (5055), 4953 states have call successors, (5055) [2021-11-17 12:28:31,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18511 states to 18511 states and 24766 transitions. [2021-11-17 12:28:31,753 INFO L78 Accepts]: Start accepts. Automaton has 18511 states and 24766 transitions. Word has length 148 [2021-11-17 12:28:31,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:28:31,753 INFO L470 AbstractCegarLoop]: Abstraction has 18511 states and 24766 transitions. [2021-11-17 12:28:31,753 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (24), 5 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2021-11-17 12:28:31,753 INFO L276 IsEmpty]: Start isEmpty. Operand 18511 states and 24766 transitions. [2021-11-17 12:28:31,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2021-11-17 12:28:31,755 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:28:31,755 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:28:31,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-17 12:28:31,755 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-11-17 12:28:31,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:28:31,756 INFO L85 PathProgramCache]: Analyzing trace with hash 9452490, now seen corresponding path program 1 times [2021-11-17 12:28:31,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:28:31,756 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848723576] [2021-11-17 12:28:31,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:28:31,756 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:28:31,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:31,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:28:31,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:31,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 12:28:31,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:31,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:28:31,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:31,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:28:31,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:32,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-11-17 12:28:32,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:32,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:28:32,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:32,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:28:32,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:32,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-17 12:28:32,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:32,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-17 12:28:32,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:32,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:28:32,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:32,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-11-17 12:28:32,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:32,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:28:32,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:32,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:28:32,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:32,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-11-17 12:28:32,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:32,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-11-17 12:28:32,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:32,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-17 12:28:32,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:32,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:28:32,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:32,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:28:32,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:32,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:28:32,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:32,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-11-17 12:28:32,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:32,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:28:32,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:32,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:28:32,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:32,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:28:32,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:32,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2021-11-17 12:28:32,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:32,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:28:32,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:32,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:28:32,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:32,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:28:32,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:32,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2021-11-17 12:28:32,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:32,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2021-11-17 12:28:32,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:32,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2021-11-17 12:28:32,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:32,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2021-11-17 12:28:32,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:32,146 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2021-11-17 12:28:32,146 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:28:32,146 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848723576] [2021-11-17 12:28:32,147 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848723576] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 12:28:32,147 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611580477] [2021-11-17 12:28:32,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:28:32,147 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 12:28:32,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 12:28:32,149 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-17 12:28:32,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-17 12:28:33,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:33,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 3334 conjuncts, 21 conjunts are in the unsatisfiable core [2021-11-17 12:28:33,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 12:28:33,527 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2021-11-17 12:28:33,527 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-17 12:28:33,527 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [611580477] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:28:33,527 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-17 12:28:33,527 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 10 [2021-11-17 12:28:33,527 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796811402] [2021-11-17 12:28:33,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:28:33,529 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 12:28:33,529 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:28:33,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 12:28:33,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:28:33,530 INFO L87 Difference]: Start difference. First operand 18511 states and 24766 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 5 states have internal predecessors, (76), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (23), 4 states have call predecessors, (23), 2 states have call successors, (23) [2021-11-17 12:28:35,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:28:35,480 INFO L93 Difference]: Finished difference Result 55549 states and 74420 transitions. [2021-11-17 12:28:35,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-17 12:28:35,480 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 5 states have internal predecessors, (76), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (23), 4 states have call predecessors, (23), 2 states have call successors, (23) Word has length 191 [2021-11-17 12:28:35,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:28:35,575 INFO L225 Difference]: With dead ends: 55549 [2021-11-17 12:28:35,575 INFO L226 Difference]: Without dead ends: 37048 [2021-11-17 12:28:35,624 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 249 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2021-11-17 12:28:35,624 INFO L933 BasicCegarLoop]: 4376 mSDtfsCounter, 3628 mSDsluCounter, 21118 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3641 SdHoareTripleChecker+Valid, 25494 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-17 12:28:35,625 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3641 Valid, 25494 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-17 12:28:35,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37048 states. [2021-11-17 12:28:37,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37048 to 26680. [2021-11-17 12:28:37,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26680 states, 17419 states have (on average 1.221539698030886) internal successors, (21278), 17849 states have internal predecessors, (21278), 7113 states have call successors, (7113), 2102 states have call predecessors, (7113), 2122 states have return successors, (7256), 6999 states have call predecessors, (7256), 7111 states have call successors, (7256) [2021-11-17 12:28:37,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26680 states to 26680 states and 35647 transitions. [2021-11-17 12:28:37,346 INFO L78 Accepts]: Start accepts. Automaton has 26680 states and 35647 transitions. Word has length 191 [2021-11-17 12:28:37,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:28:37,346 INFO L470 AbstractCegarLoop]: Abstraction has 26680 states and 35647 transitions. [2021-11-17 12:28:37,347 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 5 states have internal predecessors, (76), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (23), 4 states have call predecessors, (23), 2 states have call successors, (23) [2021-11-17 12:28:37,347 INFO L276 IsEmpty]: Start isEmpty. Operand 26680 states and 35647 transitions. [2021-11-17 12:28:37,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2021-11-17 12:28:37,350 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:28:37,350 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:28:37,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-17 12:28:37,550 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2021-11-17 12:28:37,551 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-11-17 12:28:37,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:28:37,551 INFO L85 PathProgramCache]: Analyzing trace with hash -499326324, now seen corresponding path program 1 times [2021-11-17 12:28:37,551 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:28:37,551 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788950169] [2021-11-17 12:28:37,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:28:37,552 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:28:37,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:37,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:28:37,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:37,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 12:28:37,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:37,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:28:37,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:37,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:28:37,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:37,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-11-17 12:28:37,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:37,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:28:37,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:37,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:28:37,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:37,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-17 12:28:37,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:37,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-17 12:28:37,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:37,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:28:37,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:37,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-11-17 12:28:37,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:37,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:28:37,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:37,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:28:37,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:37,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-11-17 12:28:37,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:37,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-11-17 12:28:37,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:37,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-17 12:28:37,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:37,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:28:37,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:37,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:28:37,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:37,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:28:37,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:37,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-11-17 12:28:37,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:37,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:28:37,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:37,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:28:37,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:37,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:28:37,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:37,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2021-11-17 12:28:37,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:37,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:28:37,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:37,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:28:37,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:37,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:28:37,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:37,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2021-11-17 12:28:37,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:37,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2021-11-17 12:28:37,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:37,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2021-11-17 12:28:37,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:37,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2021-11-17 12:28:37,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:37,799 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2021-11-17 12:28:37,800 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:28:37,800 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788950169] [2021-11-17 12:28:37,800 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788950169] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:28:37,800 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:28:37,800 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 12:28:37,800 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938735132] [2021-11-17 12:28:37,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:28:37,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 12:28:37,801 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:28:37,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 12:28:37,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-17 12:28:37,802 INFO L87 Difference]: Start difference. First operand 26680 states and 35647 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (24), 5 states have call predecessors, (24), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2021-11-17 12:28:39,839 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:28:41,017 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:28:44,473 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:28:46,499 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:28:48,508 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:29:00,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:29:00,467 INFO L93 Difference]: Finished difference Result 56817 states and 76778 transitions. [2021-11-17 12:29:00,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-17 12:29:00,468 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (24), 5 states have call predecessors, (24), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 191 [2021-11-17 12:29:00,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:29:00,564 INFO L225 Difference]: With dead ends: 56817 [2021-11-17 12:29:00,564 INFO L226 Difference]: Without dead ends: 30153 [2021-11-17 12:29:00,628 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-11-17 12:29:00,628 INFO L933 BasicCegarLoop]: 3260 mSDtfsCounter, 5146 mSDsluCounter, 4067 mSDsCounter, 0 mSdLazyCounter, 7590 mSolverCounterSat, 4619 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5146 SdHoareTripleChecker+Valid, 7327 SdHoareTripleChecker+Invalid, 12213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4619 IncrementalHoareTripleChecker+Valid, 7590 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.5s IncrementalHoareTripleChecker+Time [2021-11-17 12:29:00,628 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5146 Valid, 7327 Invalid, 12213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4619 Valid, 7590 Invalid, 4 Unknown, 0 Unchecked, 20.5s Time] [2021-11-17 12:29:00,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30153 states. [2021-11-17 12:29:02,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30153 to 26673. [2021-11-17 12:29:02,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26673 states, 17414 states have (on average 1.2214884575628804) internal successors, (21271), 17844 states have internal predecessors, (21271), 7111 states have call successors, (7111), 2102 states have call predecessors, (7111), 2122 states have return successors, (7253), 6997 states have call predecessors, (7253), 7109 states have call successors, (7253) [2021-11-17 12:29:02,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26673 states to 26673 states and 35635 transitions. [2021-11-17 12:29:02,227 INFO L78 Accepts]: Start accepts. Automaton has 26673 states and 35635 transitions. Word has length 191 [2021-11-17 12:29:02,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:29:02,227 INFO L470 AbstractCegarLoop]: Abstraction has 26673 states and 35635 transitions. [2021-11-17 12:29:02,228 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (24), 5 states have call predecessors, (24), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2021-11-17 12:29:02,228 INFO L276 IsEmpty]: Start isEmpty. Operand 26673 states and 35635 transitions. [2021-11-17 12:29:02,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-11-17 12:29:02,230 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:29:02,231 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:29:02,231 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-17 12:29:02,231 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-11-17 12:29:02,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:29:02,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1527406812, now seen corresponding path program 1 times [2021-11-17 12:29:02,232 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:29:02,232 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846089682] [2021-11-17 12:29:02,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:29:02,232 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:29:02,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:02,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:29:02,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:02,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 12:29:02,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:02,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:29:02,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:02,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:29:02,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:02,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-17 12:29:02,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:02,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-17 12:29:02,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:02,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-17 12:29:02,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:02,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:29:02,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:02,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 12:29:02,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:02,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-11-17 12:29:02,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:02,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-11-17 12:29:02,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:02,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-11-17 12:29:02,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:02,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:29:02,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:02,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:29:02,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:02,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:29:02,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:02,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-17 12:29:02,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:02,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:29:02,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:02,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:29:02,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:02,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:29:02,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:02,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-11-17 12:29:02,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:02,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:29:02,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:02,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:29:02,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:02,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:29:02,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:02,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2021-11-17 12:29:02,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:02,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:29:02,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:02,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:29:02,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:02,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:29:02,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:02,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2021-11-17 12:29:02,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:02,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2021-11-17 12:29:02,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:02,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2021-11-17 12:29:02,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:02,566 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2021-11-17 12:29:02,566 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:29:02,567 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846089682] [2021-11-17 12:29:02,567 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846089682] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:29:02,567 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:29:02,567 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-17 12:29:02,567 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141739350] [2021-11-17 12:29:02,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:29:02,568 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-17 12:29:02,568 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:29:02,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-17 12:29:02,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-17 12:29:02,569 INFO L87 Difference]: Start difference. First operand 26673 states and 35635 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (25), 5 states have call predecessors, (25), 2 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2021-11-17 12:29:04,603 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:29:06,680 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:29:08,758 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:29:10,833 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:29:14,496 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:29:16,539 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:29:18,557 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:29:20,569 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:29:37,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:29:37,016 INFO L93 Difference]: Finished difference Result 62665 states and 85308 transitions. [2021-11-17 12:29:37,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-17 12:29:37,017 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (25), 5 states have call predecessors, (25), 2 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) Word has length 184 [2021-11-17 12:29:37,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:29:37,192 INFO L225 Difference]: With dead ends: 62665 [2021-11-17 12:29:37,192 INFO L226 Difference]: Without dead ends: 36134 [2021-11-17 12:29:37,306 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2021-11-17 12:29:37,308 INFO L933 BasicCegarLoop]: 3149 mSDtfsCounter, 8458 mSDsluCounter, 4675 mSDsCounter, 0 mSdLazyCounter, 11857 mSolverCounterSat, 5814 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8648 SdHoareTripleChecker+Valid, 7824 SdHoareTripleChecker+Invalid, 17679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 5814 IncrementalHoareTripleChecker+Valid, 11857 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.9s IncrementalHoareTripleChecker+Time [2021-11-17 12:29:37,308 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8648 Valid, 7824 Invalid, 17679 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [5814 Valid, 11857 Invalid, 8 Unknown, 0 Unchecked, 31.9s Time] [2021-11-17 12:29:37,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36134 states. [2021-11-17 12:29:39,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36134 to 33869. [2021-11-17 12:29:39,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33869 states, 22148 states have (on average 1.22399313707784) internal successors, (27109), 22708 states have internal predecessors, (27109), 8667 states have call successors, (8667), 2902 states have call predecessors, (8667), 3028 states have return successors, (9328), 8565 states have call predecessors, (9328), 8665 states have call successors, (9328) [2021-11-17 12:29:39,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33869 states to 33869 states and 45104 transitions. [2021-11-17 12:29:39,542 INFO L78 Accepts]: Start accepts. Automaton has 33869 states and 45104 transitions. Word has length 184 [2021-11-17 12:29:39,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:29:39,542 INFO L470 AbstractCegarLoop]: Abstraction has 33869 states and 45104 transitions. [2021-11-17 12:29:39,542 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (25), 5 states have call predecessors, (25), 2 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2021-11-17 12:29:39,543 INFO L276 IsEmpty]: Start isEmpty. Operand 33869 states and 45104 transitions. [2021-11-17 12:29:39,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-11-17 12:29:39,545 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:29:39,546 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:29:39,546 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-17 12:29:39,546 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-11-17 12:29:39,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:29:39,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1527466394, now seen corresponding path program 1 times [2021-11-17 12:29:39,547 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:29:39,547 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669244474] [2021-11-17 12:29:39,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:29:39,547 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:29:39,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:39,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:29:39,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:39,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 12:29:39,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:39,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:29:39,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:39,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:29:39,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:39,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-17 12:29:39,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:39,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-17 12:29:39,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:39,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-17 12:29:39,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:39,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:29:39,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:39,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 12:29:39,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:39,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-11-17 12:29:39,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:39,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-11-17 12:29:39,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:39,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-11-17 12:29:39,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:39,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:29:39,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:39,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:29:39,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:39,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:29:39,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:39,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-17 12:29:39,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:39,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:29:39,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:39,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:29:39,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:39,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:29:39,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:39,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-11-17 12:29:39,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:39,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:29:39,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:39,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:29:39,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:39,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:29:39,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:39,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2021-11-17 12:29:39,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:39,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:29:39,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:39,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:29:39,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:39,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:29:39,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:39,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2021-11-17 12:29:39,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:39,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2021-11-17 12:29:39,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:39,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2021-11-17 12:29:39,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:39,801 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2021-11-17 12:29:39,801 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:29:39,801 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669244474] [2021-11-17 12:29:39,802 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669244474] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:29:39,802 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:29:39,802 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 12:29:39,802 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459916364] [2021-11-17 12:29:39,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:29:39,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 12:29:39,803 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:29:39,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 12:29:39,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-17 12:29:39,803 INFO L87 Difference]: Start difference. First operand 33869 states and 45104 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2021-11-17 12:29:41,838 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:29:43,913 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:29:47,246 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:29:49,280 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:29:51,299 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:30:02,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:30:02,825 INFO L93 Difference]: Finished difference Result 36058 states and 48471 transitions. [2021-11-17 12:30:02,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-17 12:30:02,826 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 184 [2021-11-17 12:30:02,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:30:03,057 INFO L225 Difference]: With dead ends: 36058 [2021-11-17 12:30:03,057 INFO L226 Difference]: Without dead ends: 36056 [2021-11-17 12:30:03,073 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2021-11-17 12:30:03,073 INFO L933 BasicCegarLoop]: 3106 mSDtfsCounter, 4882 mSDsluCounter, 4034 mSDsCounter, 0 mSdLazyCounter, 7155 mSolverCounterSat, 3928 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4882 SdHoareTripleChecker+Valid, 7140 SdHoareTripleChecker+Invalid, 11088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3928 IncrementalHoareTripleChecker+Valid, 7155 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.8s IncrementalHoareTripleChecker+Time [2021-11-17 12:30:03,074 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4882 Valid, 7140 Invalid, 11088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3928 Valid, 7155 Invalid, 5 Unknown, 0 Unchecked, 20.8s Time] [2021-11-17 12:30:03,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36056 states. [2021-11-17 12:30:04,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36056 to 33893. [2021-11-17 12:30:04,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33893 states, 22172 states have (on average 1.223209453364604) internal successors, (27121), 22732 states have internal predecessors, (27121), 8667 states have call successors, (8667), 2902 states have call predecessors, (8667), 3028 states have return successors, (9328), 8565 states have call predecessors, (9328), 8665 states have call successors, (9328) [2021-11-17 12:30:05,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33893 states to 33893 states and 45116 transitions. [2021-11-17 12:30:05,053 INFO L78 Accepts]: Start accepts. Automaton has 33893 states and 45116 transitions. Word has length 184 [2021-11-17 12:30:05,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:30:05,053 INFO L470 AbstractCegarLoop]: Abstraction has 33893 states and 45116 transitions. [2021-11-17 12:30:05,053 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2021-11-17 12:30:05,053 INFO L276 IsEmpty]: Start isEmpty. Operand 33893 states and 45116 transitions. [2021-11-17 12:30:05,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2021-11-17 12:30:05,056 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:30:05,056 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:30:05,056 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-17 12:30:05,056 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-11-17 12:30:05,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:30:05,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1828167206, now seen corresponding path program 1 times [2021-11-17 12:30:05,057 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:30:05,057 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118037825] [2021-11-17 12:30:05,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:30:05,058 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:30:05,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:05,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:30:05,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:05,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 12:30:05,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:05,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:30:05,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:05,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:30:05,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:05,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-17 12:30:05,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:05,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-17 12:30:05,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:05,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-17 12:30:05,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:05,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:30:05,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:05,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 12:30:05,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:05,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-11-17 12:30:05,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:05,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-17 12:30:05,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:05,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-11-17 12:30:05,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:05,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-17 12:30:05,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:05,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-11-17 12:30:05,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:05,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-17 12:30:05,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:05,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-11-17 12:30:05,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:05,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-11-17 12:30:05,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:05,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-11-17 12:30:05,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:05,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-11-17 12:30:05,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:05,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-11-17 12:30:05,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:05,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-11-17 12:30:05,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:05,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2021-11-17 12:30:05,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:05,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2021-11-17 12:30:05,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:05,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2021-11-17 12:30:05,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:05,441 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-17 12:30:05,441 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:30:05,441 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118037825] [2021-11-17 12:30:05,442 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118037825] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:30:05,442 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:30:05,442 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 12:30:05,442 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236918564] [2021-11-17 12:30:05,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:30:05,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 12:30:05,443 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:30:05,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 12:30:05,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-17 12:30:05,444 INFO L87 Difference]: Start difference. First operand 33893 states and 45116 transitions. Second operand has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2021-11-17 12:30:07,480 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:30:09,547 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:30:11,618 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:30:14,796 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:30:16,818 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:30:27,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:30:27,327 INFO L93 Difference]: Finished difference Result 35958 states and 48325 transitions. [2021-11-17 12:30:27,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-17 12:30:27,327 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 154 [2021-11-17 12:30:27,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:30:27,418 INFO L225 Difference]: With dead ends: 35958 [2021-11-17 12:30:27,418 INFO L226 Difference]: Without dead ends: 35956 [2021-11-17 12:30:27,434 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-11-17 12:30:27,434 INFO L933 BasicCegarLoop]: 3106 mSDtfsCounter, 7332 mSDsluCounter, 2664 mSDsCounter, 0 mSdLazyCounter, 4826 mSolverCounterSat, 5150 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7544 SdHoareTripleChecker+Valid, 5770 SdHoareTripleChecker+Invalid, 9981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5150 IncrementalHoareTripleChecker+Valid, 4826 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.7s IncrementalHoareTripleChecker+Time [2021-11-17 12:30:27,435 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7544 Valid, 5770 Invalid, 9981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5150 Valid, 4826 Invalid, 5 Unknown, 0 Unchecked, 19.7s Time] [2021-11-17 12:30:27,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35956 states. [2021-11-17 12:30:29,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35956 to 33891. [2021-11-17 12:30:29,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33891 states, 22171 states have (on average 1.223174417031257) internal successors, (27119), 22730 states have internal predecessors, (27119), 8667 states have call successors, (8667), 2902 states have call predecessors, (8667), 3028 states have return successors, (9328), 8565 states have call predecessors, (9328), 8665 states have call successors, (9328) [2021-11-17 12:30:29,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33891 states to 33891 states and 45114 transitions. [2021-11-17 12:30:29,518 INFO L78 Accepts]: Start accepts. Automaton has 33891 states and 45114 transitions. Word has length 154 [2021-11-17 12:30:29,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:30:29,518 INFO L470 AbstractCegarLoop]: Abstraction has 33891 states and 45114 transitions. [2021-11-17 12:30:29,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2021-11-17 12:30:29,519 INFO L276 IsEmpty]: Start isEmpty. Operand 33891 states and 45114 transitions. [2021-11-17 12:30:29,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2021-11-17 12:30:29,521 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:30:29,522 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:30:29,522 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-17 12:30:29,522 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_check_alloc_flagsErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-11-17 12:30:29,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:30:29,523 INFO L85 PathProgramCache]: Analyzing trace with hash -158542688, now seen corresponding path program 1 times [2021-11-17 12:30:29,523 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:30:29,523 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240951765] [2021-11-17 12:30:29,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:30:29,523 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:30:29,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:29,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:30:29,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:29,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 12:30:29,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:29,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:30:29,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:29,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:30:29,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:29,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-17 12:30:29,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:29,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-17 12:30:29,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:29,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-17 12:30:29,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:29,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:30:29,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:29,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 12:30:29,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:29,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-11-17 12:30:29,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:29,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-11-17 12:30:29,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:29,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-11-17 12:30:29,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:29,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:30:29,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:29,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:30:29,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:29,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:30:29,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:29,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-17 12:30:29,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:29,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:30:29,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:29,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:30:29,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:29,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:30:29,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:29,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-11-17 12:30:29,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:29,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:30:29,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:29,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:30:29,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:29,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:30:29,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:29,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2021-11-17 12:30:29,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:29,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:30:29,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:29,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:30:29,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:29,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:30:29,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:29,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2021-11-17 12:30:29,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:29,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2021-11-17 12:30:29,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:29,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2021-11-17 12:30:29,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:29,786 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2021-11-17 12:30:29,786 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:30:29,786 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240951765] [2021-11-17 12:30:29,787 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240951765] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:30:29,787 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:30:29,787 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:30:29,787 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547893079] [2021-11-17 12:30:29,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:30:29,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:30:29,788 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:30:29,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:30:29,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:30:29,789 INFO L87 Difference]: Start difference. First operand 33891 states and 45114 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2021-11-17 12:30:31,822 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:30:33,903 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:30:35,981 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:30:38,894 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:30:47,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:30:47,414 INFO L93 Difference]: Finished difference Result 69655 states and 94851 transitions. [2021-11-17 12:30:47,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:30:47,415 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 188 [2021-11-17 12:30:47,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:30:47,534 INFO L225 Difference]: With dead ends: 69655 [2021-11-17 12:30:47,535 INFO L226 Difference]: Without dead ends: 35906 [2021-11-17 12:30:47,630 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:30:47,630 INFO L933 BasicCegarLoop]: 3100 mSDtfsCounter, 7292 mSDsluCounter, 1293 mSDsCounter, 0 mSdLazyCounter, 2507 mSolverCounterSat, 5139 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7510 SdHoareTripleChecker+Valid, 4393 SdHoareTripleChecker+Invalid, 7650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5139 IncrementalHoareTripleChecker+Valid, 2507 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.0s IncrementalHoareTripleChecker+Time [2021-11-17 12:30:47,631 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7510 Valid, 4393 Invalid, 7650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5139 Valid, 2507 Invalid, 4 Unknown, 0 Unchecked, 15.0s Time] [2021-11-17 12:30:47,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35906 states. [2021-11-17 12:30:49,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35906 to 33841. [2021-11-17 12:30:49,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33841 states, 22122 states have (on average 1.2214989603110027) internal successors, (27022), 22680 states have internal predecessors, (27022), 8667 states have call successors, (8667), 2902 states have call predecessors, (8667), 3028 states have return successors, (9328), 8565 states have call predecessors, (9328), 8665 states have call successors, (9328) [2021-11-17 12:30:49,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33841 states to 33841 states and 45017 transitions. [2021-11-17 12:30:49,814 INFO L78 Accepts]: Start accepts. Automaton has 33841 states and 45017 transitions. Word has length 188 [2021-11-17 12:30:49,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:30:49,814 INFO L470 AbstractCegarLoop]: Abstraction has 33841 states and 45017 transitions. [2021-11-17 12:30:49,814 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2021-11-17 12:30:49,814 INFO L276 IsEmpty]: Start isEmpty. Operand 33841 states and 45017 transitions. [2021-11-17 12:30:49,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-11-17 12:30:49,817 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:30:49,817 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:30:49,818 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-17 12:30:49,818 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_linux_net_rtnetlink_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-11-17 12:30:49,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:30:49,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1517982554, now seen corresponding path program 1 times [2021-11-17 12:30:49,818 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:30:49,819 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946414679] [2021-11-17 12:30:49,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:30:49,819 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:30:49,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:49,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:30:49,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:49,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 12:30:49,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:49,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:30:49,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:49,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:30:49,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:49,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-17 12:30:49,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:49,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-17 12:30:49,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:49,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-17 12:30:49,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:49,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:30:49,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:49,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 12:30:49,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:49,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-11-17 12:30:49,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:49,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-17 12:30:49,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:49,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-11-17 12:30:49,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:49,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-17 12:30:49,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:50,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-11-17 12:30:50,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:50,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-17 12:30:50,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:50,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-11-17 12:30:50,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:50,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-11-17 12:30:50,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:50,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-11-17 12:30:50,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:50,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-11-17 12:30:50,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:50,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-11-17 12:30:50,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:50,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-11-17 12:30:50,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:50,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2021-11-17 12:30:50,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:50,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2021-11-17 12:30:50,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:50,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2021-11-17 12:30:50,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:50,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-11-17 12:30:50,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:50,061 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-17 12:30:50,061 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:30:50,061 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946414679] [2021-11-17 12:30:50,061 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946414679] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:30:50,061 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:30:50,061 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 12:30:50,062 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631399176] [2021-11-17 12:30:50,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:30:50,062 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 12:30:50,062 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:30:50,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 12:30:50,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-17 12:30:50,063 INFO L87 Difference]: Start difference. First operand 33841 states and 45017 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (26), 5 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2021-11-17 12:30:52,097 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:30:54,174 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:30:56,255 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:30:59,490 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:31:01,523 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:31:11,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:31:11,600 INFO L93 Difference]: Finished difference Result 35906 states and 48226 transitions. [2021-11-17 12:31:11,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-17 12:31:11,601 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (26), 5 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 160 [2021-11-17 12:31:11,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:31:11,758 INFO L225 Difference]: With dead ends: 35906 [2021-11-17 12:31:11,758 INFO L226 Difference]: Without dead ends: 35904 [2021-11-17 12:31:11,770 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-11-17 12:31:11,771 INFO L933 BasicCegarLoop]: 3103 mSDtfsCounter, 7292 mSDsluCounter, 2665 mSDsCounter, 0 mSdLazyCounter, 4828 mSolverCounterSat, 5151 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7502 SdHoareTripleChecker+Valid, 5768 SdHoareTripleChecker+Invalid, 9984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5151 IncrementalHoareTripleChecker+Valid, 4828 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.3s IncrementalHoareTripleChecker+Time [2021-11-17 12:31:11,771 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7502 Valid, 5768 Invalid, 9984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5151 Valid, 4828 Invalid, 5 Unknown, 0 Unchecked, 19.3s Time] [2021-11-17 12:31:11,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35904 states. [2021-11-17 12:31:13,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35904 to 33839. [2021-11-17 12:31:13,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33839 states, 22121 states have (on average 1.2214637674607838) internal successors, (27020), 22678 states have internal predecessors, (27020), 8667 states have call successors, (8667), 2902 states have call predecessors, (8667), 3028 states have return successors, (9328), 8565 states have call predecessors, (9328), 8665 states have call successors, (9328) [2021-11-17 12:31:13,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33839 states to 33839 states and 45015 transitions. [2021-11-17 12:31:13,977 INFO L78 Accepts]: Start accepts. Automaton has 33839 states and 45015 transitions. Word has length 160 [2021-11-17 12:31:13,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:31:13,977 INFO L470 AbstractCegarLoop]: Abstraction has 33839 states and 45015 transitions. [2021-11-17 12:31:13,977 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (26), 5 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2021-11-17 12:31:13,977 INFO L276 IsEmpty]: Start isEmpty. Operand 33839 states and 45015 transitions. [2021-11-17 12:31:13,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2021-11-17 12:31:13,980 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:31:13,980 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:31:13,980 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-17 12:31:13,981 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_linux_net_sock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-11-17 12:31:13,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:31:13,981 INFO L85 PathProgramCache]: Analyzing trace with hash -783697648, now seen corresponding path program 1 times [2021-11-17 12:31:13,981 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:31:13,981 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706053537] [2021-11-17 12:31:13,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:31:13,982 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:31:14,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:14,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:31:14,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:14,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 12:31:14,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:14,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:31:14,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:14,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:31:14,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:14,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-17 12:31:14,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:14,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-17 12:31:14,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:14,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-17 12:31:14,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:14,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:31:14,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:14,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 12:31:14,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:14,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-11-17 12:31:14,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:14,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-17 12:31:14,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:14,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-11-17 12:31:14,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:14,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-17 12:31:14,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:14,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-11-17 12:31:14,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:14,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-17 12:31:14,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:14,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-11-17 12:31:14,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:14,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-11-17 12:31:14,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:14,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-11-17 12:31:14,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:14,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-11-17 12:31:14,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:14,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-11-17 12:31:14,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:14,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-11-17 12:31:14,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:14,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2021-11-17 12:31:14,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:14,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2021-11-17 12:31:14,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:14,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2021-11-17 12:31:14,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:14,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-11-17 12:31:14,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:14,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-11-17 12:31:14,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:14,222 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-17 12:31:14,222 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:31:14,223 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706053537] [2021-11-17 12:31:14,223 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706053537] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:31:14,223 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:31:14,223 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 12:31:14,223 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930463019] [2021-11-17 12:31:14,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:31:14,224 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 12:31:14,224 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:31:14,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 12:31:14,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-17 12:31:14,225 INFO L87 Difference]: Start difference. First operand 33839 states and 45015 transitions. Second operand has 7 states, 7 states have (on average 15.0) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2021-11-17 12:31:16,262 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:31:18,335 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:31:22,028 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:31:24,054 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:31:35,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:31:35,021 INFO L93 Difference]: Finished difference Result 35904 states and 48224 transitions. [2021-11-17 12:31:35,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-17 12:31:35,021 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.0) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 166 [2021-11-17 12:31:35,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:31:35,104 INFO L225 Difference]: With dead ends: 35904 [2021-11-17 12:31:35,104 INFO L226 Difference]: Without dead ends: 35902 [2021-11-17 12:31:35,116 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-11-17 12:31:35,117 INFO L933 BasicCegarLoop]: 3106 mSDtfsCounter, 7278 mSDsluCounter, 2668 mSDsCounter, 0 mSdLazyCounter, 4829 mSolverCounterSat, 5139 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7487 SdHoareTripleChecker+Valid, 5774 SdHoareTripleChecker+Invalid, 9972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5139 IncrementalHoareTripleChecker+Valid, 4829 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.3s IncrementalHoareTripleChecker+Time [2021-11-17 12:31:35,117 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7487 Valid, 5774 Invalid, 9972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5139 Valid, 4829 Invalid, 4 Unknown, 0 Unchecked, 18.3s Time] [2021-11-17 12:31:35,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35902 states. [2021-11-17 12:31:37,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35902 to 33837. [2021-11-17 12:31:37,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33837 states, 22120 states have (on average 1.2214285714285715) internal successors, (27018), 22676 states have internal predecessors, (27018), 8667 states have call successors, (8667), 2902 states have call predecessors, (8667), 3028 states have return successors, (9328), 8565 states have call predecessors, (9328), 8665 states have call successors, (9328) [2021-11-17 12:31:37,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33837 states to 33837 states and 45013 transitions. [2021-11-17 12:31:37,227 INFO L78 Accepts]: Start accepts. Automaton has 33837 states and 45013 transitions. Word has length 166 [2021-11-17 12:31:37,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:31:37,228 INFO L470 AbstractCegarLoop]: Abstraction has 33837 states and 45013 transitions. [2021-11-17 12:31:37,228 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.0) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2021-11-17 12:31:37,228 INFO L276 IsEmpty]: Start isEmpty. Operand 33837 states and 45013 transitions. [2021-11-17 12:31:37,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2021-11-17 12:31:37,231 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:31:37,231 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:31:37,231 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-17 12:31:37,231 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-11-17 12:31:37,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:31:37,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1795553766, now seen corresponding path program 1 times [2021-11-17 12:31:37,232 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:31:37,232 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315654933] [2021-11-17 12:31:37,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:31:37,232 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:31:37,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:37,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:31:37,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:37,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 12:31:37,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:37,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:31:37,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:37,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:31:37,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:37,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-17 12:31:37,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:37,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-17 12:31:37,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:37,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-17 12:31:37,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:37,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:31:37,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:37,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 12:31:37,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:37,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-11-17 12:31:37,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:37,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-17 12:31:37,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:37,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-11-17 12:31:37,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:37,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-17 12:31:37,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:37,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-11-17 12:31:37,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:37,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-17 12:31:37,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:37,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-11-17 12:31:37,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:37,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-11-17 12:31:37,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:37,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-11-17 12:31:37,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:37,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-11-17 12:31:37,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:37,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-11-17 12:31:37,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:37,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-11-17 12:31:37,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:37,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2021-11-17 12:31:37,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:37,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2021-11-17 12:31:37,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:37,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2021-11-17 12:31:37,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:37,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-11-17 12:31:37,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:37,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-11-17 12:31:37,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:37,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-11-17 12:31:37,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:37,635 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-17 12:31:37,635 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:31:37,635 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315654933] [2021-11-17 12:31:37,635 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315654933] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:31:37,636 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:31:37,636 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 12:31:37,636 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143796928] [2021-11-17 12:31:37,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:31:37,636 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 12:31:37,637 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:31:37,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 12:31:37,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-17 12:31:37,637 INFO L87 Difference]: Start difference. First operand 33837 states and 45013 transitions. Second operand has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (28), 5 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2021-11-17 12:31:39,672 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:31:41,747 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:31:43,824 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:31:47,070 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:31:49,091 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:31:59,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:31:59,772 INFO L93 Difference]: Finished difference Result 35902 states and 48222 transitions. [2021-11-17 12:31:59,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-17 12:31:59,772 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (28), 5 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 172 [2021-11-17 12:31:59,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:31:59,865 INFO L225 Difference]: With dead ends: 35902 [2021-11-17 12:31:59,865 INFO L226 Difference]: Without dead ends: 35900 [2021-11-17 12:31:59,884 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-11-17 12:31:59,884 INFO L933 BasicCegarLoop]: 3095 mSDtfsCounter, 7288 mSDsluCounter, 2665 mSDsCounter, 0 mSdLazyCounter, 4826 mSolverCounterSat, 5145 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7496 SdHoareTripleChecker+Valid, 5760 SdHoareTripleChecker+Invalid, 9976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5145 IncrementalHoareTripleChecker+Valid, 4826 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.9s IncrementalHoareTripleChecker+Time [2021-11-17 12:31:59,885 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7496 Valid, 5760 Invalid, 9976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5145 Valid, 4826 Invalid, 5 Unknown, 0 Unchecked, 19.9s Time] [2021-11-17 12:31:59,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35900 states. [2021-11-17 12:32:01,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35900 to 33835. [2021-11-17 12:32:01,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33835 states, 22119 states have (on average 1.2213933722139336) internal successors, (27016), 22674 states have internal predecessors, (27016), 8667 states have call successors, (8667), 2902 states have call predecessors, (8667), 3028 states have return successors, (9328), 8565 states have call predecessors, (9328), 8665 states have call successors, (9328) [2021-11-17 12:32:02,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33835 states to 33835 states and 45011 transitions. [2021-11-17 12:32:02,135 INFO L78 Accepts]: Start accepts. Automaton has 33835 states and 45011 transitions. Word has length 172 [2021-11-17 12:32:02,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:32:02,136 INFO L470 AbstractCegarLoop]: Abstraction has 33835 states and 45011 transitions. [2021-11-17 12:32:02,136 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (28), 5 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2021-11-17 12:32:02,136 INFO L276 IsEmpty]: Start isEmpty. Operand 33835 states and 45011 transitions. [2021-11-17 12:32:02,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-11-17 12:32:02,138 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:32:02,138 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:32:02,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-17 12:32:02,139 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-11-17 12:32:02,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:32:02,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1799634238, now seen corresponding path program 1 times [2021-11-17 12:32:02,139 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:32:02,139 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427239852] [2021-11-17 12:32:02,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:32:02,139 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:32:02,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:02,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:32:02,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:02,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 12:32:02,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:02,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:32:02,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:02,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:32:02,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:02,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-17 12:32:02,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:02,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-17 12:32:02,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:02,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-17 12:32:02,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:02,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:32:02,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:02,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 12:32:02,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:02,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-11-17 12:32:02,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:02,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-17 12:32:02,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:02,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-11-17 12:32:02,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:02,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-17 12:32:02,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:02,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-11-17 12:32:02,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:02,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-17 12:32:02,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:02,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-11-17 12:32:02,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:02,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-11-17 12:32:02,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:02,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-11-17 12:32:02,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:02,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-11-17 12:32:02,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:02,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-11-17 12:32:02,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:02,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-11-17 12:32:02,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:02,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2021-11-17 12:32:02,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:02,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2021-11-17 12:32:02,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:02,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2021-11-17 12:32:02,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:02,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-11-17 12:32:02,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:02,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-11-17 12:32:02,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:02,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-11-17 12:32:02,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:02,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2021-11-17 12:32:02,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:02,363 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-17 12:32:02,363 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:32:02,363 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427239852] [2021-11-17 12:32:02,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427239852] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:32:02,364 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:32:02,364 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 12:32:02,364 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535096975] [2021-11-17 12:32:02,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:32:02,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 12:32:02,365 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:32:02,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 12:32:02,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-17 12:32:02,365 INFO L87 Difference]: Start difference. First operand 33835 states and 45011 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 4 states have internal predecessors, (113), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2021-11-17 12:32:04,393 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:32:06,469 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:32:08,551 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:32:11,806 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:32:13,829 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:32:24,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:32:24,789 INFO L93 Difference]: Finished difference Result 35900 states and 48220 transitions. [2021-11-17 12:32:24,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-17 12:32:24,789 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 4 states have internal predecessors, (113), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 178 [2021-11-17 12:32:24,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:32:24,882 INFO L225 Difference]: With dead ends: 35900 [2021-11-17 12:32:24,882 INFO L226 Difference]: Without dead ends: 35898 [2021-11-17 12:32:24,900 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-11-17 12:32:24,901 INFO L933 BasicCegarLoop]: 3102 mSDtfsCounter, 7256 mSDsluCounter, 2666 mSDsCounter, 0 mSdLazyCounter, 4833 mSolverCounterSat, 5138 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7463 SdHoareTripleChecker+Valid, 5768 SdHoareTripleChecker+Invalid, 9976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5138 IncrementalHoareTripleChecker+Valid, 4833 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.1s IncrementalHoareTripleChecker+Time [2021-11-17 12:32:24,901 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7463 Valid, 5768 Invalid, 9976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5138 Valid, 4833 Invalid, 5 Unknown, 0 Unchecked, 20.1s Time] [2021-11-17 12:32:24,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35898 states. [2021-11-17 12:32:27,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35898 to 33833. [2021-11-17 12:32:27,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33833 states, 22118 states have (on average 1.221358169816439) internal successors, (27014), 22672 states have internal predecessors, (27014), 8667 states have call successors, (8667), 2902 states have call predecessors, (8667), 3028 states have return successors, (9328), 8565 states have call predecessors, (9328), 8665 states have call successors, (9328) [2021-11-17 12:32:27,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33833 states to 33833 states and 45009 transitions. [2021-11-17 12:32:27,358 INFO L78 Accepts]: Start accepts. Automaton has 33833 states and 45009 transitions. Word has length 178 [2021-11-17 12:32:27,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:32:27,359 INFO L470 AbstractCegarLoop]: Abstraction has 33833 states and 45009 transitions. [2021-11-17 12:32:27,359 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 4 states have internal predecessors, (113), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2021-11-17 12:32:27,359 INFO L276 IsEmpty]: Start isEmpty. Operand 33833 states and 45009 transitions. [2021-11-17 12:32:27,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-11-17 12:32:27,361 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:32:27,361 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:32:27,361 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-17 12:32:27,362 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ldv_linux_usb_urb_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-11-17 12:32:27,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:32:27,363 INFO L85 PathProgramCache]: Analyzing trace with hash -813779825, now seen corresponding path program 1 times [2021-11-17 12:32:27,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:32:27,363 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214001562] [2021-11-17 12:32:27,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:32:27,363 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:32:27,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:27,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:32:27,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:27,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 12:32:27,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:27,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:32:27,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:27,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:32:27,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:27,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-17 12:32:27,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:27,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-17 12:32:27,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:27,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-17 12:32:27,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:27,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:32:27,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:27,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 12:32:27,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:27,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-11-17 12:32:27,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:27,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-17 12:32:27,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:27,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-11-17 12:32:27,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:27,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-17 12:32:27,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:27,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-11-17 12:32:27,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:27,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-17 12:32:27,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:27,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-11-17 12:32:27,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:27,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-11-17 12:32:27,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:27,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-11-17 12:32:27,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:27,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-11-17 12:32:27,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:27,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-11-17 12:32:27,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:27,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-11-17 12:32:27,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:27,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2021-11-17 12:32:27,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:27,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2021-11-17 12:32:27,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:27,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2021-11-17 12:32:27,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:27,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-11-17 12:32:27,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:27,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-11-17 12:32:27,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:27,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-11-17 12:32:27,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:27,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2021-11-17 12:32:27,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:27,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2021-11-17 12:32:27,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:27,598 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-17 12:32:27,599 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:32:27,599 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214001562] [2021-11-17 12:32:27,599 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214001562] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:32:27,599 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:32:27,599 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 12:32:27,599 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742054373] [2021-11-17 12:32:27,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:32:27,600 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 12:32:27,600 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:32:27,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 12:32:27,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-17 12:32:27,601 INFO L87 Difference]: Start difference. First operand 33833 states and 45009 transitions. Second operand has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 4 states have internal predecessors, (117), 2 states have call successors, (30), 5 states have call predecessors, (30), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2021-11-17 12:32:29,628 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:32:31,704 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:32:33,781 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:32:36,990 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:32:39,006 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:32:50,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:32:50,364 INFO L93 Difference]: Finished difference Result 35898 states and 48218 transitions. [2021-11-17 12:32:50,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-17 12:32:50,364 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 4 states have internal predecessors, (117), 2 states have call successors, (30), 5 states have call predecessors, (30), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 184 [2021-11-17 12:32:50,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:32:50,456 INFO L225 Difference]: With dead ends: 35898 [2021-11-17 12:32:50,457 INFO L226 Difference]: Without dead ends: 35682 [2021-11-17 12:32:50,475 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-11-17 12:32:50,476 INFO L933 BasicCegarLoop]: 3096 mSDtfsCounter, 7260 mSDsluCounter, 2665 mSDsCounter, 0 mSdLazyCounter, 4819 mSolverCounterSat, 5143 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7467 SdHoareTripleChecker+Valid, 5761 SdHoareTripleChecker+Invalid, 9967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5143 IncrementalHoareTripleChecker+Valid, 4819 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.3s IncrementalHoareTripleChecker+Time [2021-11-17 12:32:50,476 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7467 Valid, 5761 Invalid, 9967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5143 Valid, 4819 Invalid, 5 Unknown, 0 Unchecked, 20.3s Time] [2021-11-17 12:32:50,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35682 states. [2021-11-17 12:32:52,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35682 to 33611. [2021-11-17 12:32:52,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33611 states, 21990 states have (on average 1.2220554797635288) internal successors, (26873), 22536 states have internal predecessors, (26873), 8601 states have call successors, (8601), 2876 states have call predecessors, (8601), 3001 states have return successors, (9260), 8505 states have call predecessors, (9260), 8597 states have call successors, (9260) [2021-11-17 12:32:52,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33611 states to 33611 states and 44734 transitions. [2021-11-17 12:32:52,823 INFO L78 Accepts]: Start accepts. Automaton has 33611 states and 44734 transitions. Word has length 184 [2021-11-17 12:32:52,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:32:52,823 INFO L470 AbstractCegarLoop]: Abstraction has 33611 states and 44734 transitions. [2021-11-17 12:32:52,823 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 4 states have internal predecessors, (117), 2 states have call successors, (30), 5 states have call predecessors, (30), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2021-11-17 12:32:52,823 INFO L276 IsEmpty]: Start isEmpty. Operand 33611 states and 44734 transitions. [2021-11-17 12:32:52,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2021-11-17 12:32:52,825 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:32:52,825 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:52,825 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-17 12:32:52,826 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-11-17 12:32:52,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:32:52,826 INFO L85 PathProgramCache]: Analyzing trace with hash -642429775, now seen corresponding path program 1 times [2021-11-17 12:32:52,826 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:32:52,826 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883453252] [2021-11-17 12:32:52,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:32:52,826 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:32:52,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:52,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:32:52,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:52,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 12:32:52,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:52,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:32:52,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:52,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:32:52,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:52,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-17 12:32:52,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:53,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-17 12:32:53,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:53,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-17 12:32:53,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:53,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:32:53,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:53,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 12:32:53,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:53,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-11-17 12:32:53,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:53,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-11-17 12:32:53,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:53,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-11-17 12:32:53,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:53,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:32:53,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:53,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:32:53,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:53,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:32:53,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:53,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-17 12:32:53,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:53,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:32:53,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:53,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:32:53,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:53,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:32:53,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:53,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-11-17 12:32:53,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:53,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:32:53,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:53,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:32:53,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:53,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:32:53,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:53,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2021-11-17 12:32:53,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:53,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:32:53,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:53,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:32:53,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:53,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:32:53,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:53,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2021-11-17 12:32:53,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:53,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2021-11-17 12:32:53,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:53,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2021-11-17 12:32:53,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:53,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:32:53,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:53,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:32:53,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:53,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:32:53,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:53,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:32:53,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:53,162 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2021-11-17 12:32:53,162 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:32:53,162 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883453252] [2021-11-17 12:32:53,162 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883453252] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:32:53,163 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:32:53,163 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-17 12:32:53,163 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985917224] [2021-11-17 12:32:53,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:32:53,164 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-17 12:32:53,164 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:32:53,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-17 12:32:53,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-11-17 12:32:53,164 INFO L87 Difference]: Start difference. First operand 33611 states and 44734 transitions. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (29), 7 states have call predecessors, (29), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2021-11-17 12:32:55,200 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:32:57,272 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:32:59,355 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:33:02,788 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:33:04,814 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:33:06,834 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:33:23,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:33:23,227 INFO L93 Difference]: Finished difference Result 37910 states and 51563 transitions. [2021-11-17 12:33:23,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-17 12:33:23,227 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (29), 7 states have call predecessors, (29), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 218 [2021-11-17 12:33:23,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:33:23,321 INFO L225 Difference]: With dead ends: 37910 [2021-11-17 12:33:23,322 INFO L226 Difference]: Without dead ends: 37908 [2021-11-17 12:33:23,345 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2021-11-17 12:33:23,345 INFO L933 BasicCegarLoop]: 2913 mSDtfsCounter, 7199 mSDsluCounter, 4350 mSDsCounter, 0 mSdLazyCounter, 8818 mSolverCounterSat, 5526 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7383 SdHoareTripleChecker+Valid, 7263 SdHoareTripleChecker+Invalid, 14350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 5526 IncrementalHoareTripleChecker+Valid, 8818 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.2s IncrementalHoareTripleChecker+Time [2021-11-17 12:33:23,345 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7383 Valid, 7263 Invalid, 14350 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [5526 Valid, 8818 Invalid, 6 Unknown, 0 Unchecked, 27.2s Time] [2021-11-17 12:33:23,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37908 states. [2021-11-17 12:33:25,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37908 to 33813. [2021-11-17 12:33:25,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33813 states, 22140 states have (on average 1.221093044263776) internal successors, (27035), 22688 states have internal predecessors, (27035), 8603 states have call successors, (8603), 2924 states have call predecessors, (8603), 3051 states have return successors, (9266), 8507 states have call predecessors, (9266), 8599 states have call successors, (9266) [2021-11-17 12:33:25,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33813 states to 33813 states and 44904 transitions. [2021-11-17 12:33:25,788 INFO L78 Accepts]: Start accepts. Automaton has 33813 states and 44904 transitions. Word has length 218 [2021-11-17 12:33:25,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:33:25,788 INFO L470 AbstractCegarLoop]: Abstraction has 33813 states and 44904 transitions. [2021-11-17 12:33:25,788 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (29), 7 states have call predecessors, (29), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2021-11-17 12:33:25,788 INFO L276 IsEmpty]: Start isEmpty. Operand 33813 states and 44904 transitions. [2021-11-17 12:33:25,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2021-11-17 12:33:25,791 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:33:25,791 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:25,792 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-17 12:33:25,792 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-11-17 12:33:25,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:33:25,792 INFO L85 PathProgramCache]: Analyzing trace with hash -250325396, now seen corresponding path program 1 times [2021-11-17 12:33:25,792 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:33:25,792 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864976156] [2021-11-17 12:33:25,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:33:25,793 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:33:25,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:25,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:33:25,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:25,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 12:33:25,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:25,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:33:25,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:25,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:33:25,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:25,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-17 12:33:25,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:25,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-17 12:33:25,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:25,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-17 12:33:25,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:25,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:33:25,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:25,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 12:33:25,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:25,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-11-17 12:33:25,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:25,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-11-17 12:33:25,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:25,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-11-17 12:33:25,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:26,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:33:26,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:26,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:33:26,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:26,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:33:26,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:26,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-17 12:33:26,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:26,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:33:26,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:26,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:33:26,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:26,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:33:26,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:26,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-11-17 12:33:26,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:26,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:33:26,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:26,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:33:26,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:26,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:33:26,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:26,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2021-11-17 12:33:26,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:26,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:33:26,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:26,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:33:26,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:26,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:33:26,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:26,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2021-11-17 12:33:26,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:26,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2021-11-17 12:33:26,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:26,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2021-11-17 12:33:26,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:26,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:33:26,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:26,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:33:26,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:26,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:33:26,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:26,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:33:26,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:26,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2021-11-17 12:33:26,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:26,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:33:26,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:26,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:33:26,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:26,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-17 12:33:26,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:26,287 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 375 trivial. 0 not checked. [2021-11-17 12:33:26,287 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:33:26,288 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864976156] [2021-11-17 12:33:26,288 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864976156] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:33:26,288 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:33:26,288 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-17 12:33:26,288 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376447210] [2021-11-17 12:33:26,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:33:26,289 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-17 12:33:26,289 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:33:26,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-17 12:33:26,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:33:26,290 INFO L87 Difference]: Start difference. First operand 33813 states and 44904 transitions. Second operand has 10 states, 10 states have (on average 10.1) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (33), 8 states have call predecessors, (33), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2021-11-17 12:33:28,325 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:33:30,400 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:33:32,480 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:33:34,561 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:33:36,640 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:33:40,432 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:33:42,477 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:33:44,486 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:33:46,495 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:34:04,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:34:04,766 INFO L93 Difference]: Finished difference Result 38052 states and 51746 transitions. [2021-11-17 12:34:04,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-17 12:34:04,766 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.1) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (33), 8 states have call predecessors, (33), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 242 [2021-11-17 12:34:04,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:34:04,862 INFO L225 Difference]: With dead ends: 38052 [2021-11-17 12:34:04,862 INFO L226 Difference]: Without dead ends: 38050 [2021-11-17 12:34:04,878 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=349, Unknown=0, NotChecked=0, Total=506 [2021-11-17 12:34:04,879 INFO L933 BasicCegarLoop]: 2914 mSDtfsCounter, 6230 mSDsluCounter, 5517 mSDsCounter, 0 mSdLazyCounter, 12458 mSolverCounterSat, 5561 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6230 SdHoareTripleChecker+Valid, 8431 SdHoareTripleChecker+Invalid, 18028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 5561 IncrementalHoareTripleChecker+Valid, 12458 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 35.5s IncrementalHoareTripleChecker+Time [2021-11-17 12:34:04,879 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6230 Valid, 8431 Invalid, 18028 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [5561 Valid, 12458 Invalid, 9 Unknown, 0 Unchecked, 35.5s Time] [2021-11-17 12:34:04,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38050 states. [2021-11-17 12:34:07,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38050 to 33909. [2021-11-17 12:34:07,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33909 states, 22212 states have (on average 1.2203763731316406) internal successors, (27107), 22760 states have internal predecessors, (27107), 8615 states have call successors, (8615), 2924 states have call predecessors, (8615), 3063 states have return successors, (9294), 8531 states have call predecessors, (9294), 8611 states have call successors, (9294) [2021-11-17 12:34:07,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33909 states to 33909 states and 45016 transitions. [2021-11-17 12:34:07,782 INFO L78 Accepts]: Start accepts. Automaton has 33909 states and 45016 transitions. Word has length 242 [2021-11-17 12:34:07,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:34:07,782 INFO L470 AbstractCegarLoop]: Abstraction has 33909 states and 45016 transitions. [2021-11-17 12:34:07,782 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.1) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (33), 8 states have call predecessors, (33), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2021-11-17 12:34:07,782 INFO L276 IsEmpty]: Start isEmpty. Operand 33909 states and 45016 transitions. [2021-11-17 12:34:07,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2021-11-17 12:34:07,786 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:34:07,786 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 13, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:34:07,786 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-17 12:34:07,786 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ldv_assert_linux_kernel_sched_completion__wait_without_initErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-11-17 12:34:07,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:34:07,786 INFO L85 PathProgramCache]: Analyzing trace with hash -834245733, now seen corresponding path program 1 times [2021-11-17 12:34:07,786 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:34:07,786 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287153344] [2021-11-17 12:34:07,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:34:07,787 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:34:07,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:07,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:34:07,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:07,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 12:34:07,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:07,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:34:07,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:07,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:34:07,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:07,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-17 12:34:07,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:07,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-17 12:34:07,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:07,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-17 12:34:07,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:07,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:34:07,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:07,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 12:34:07,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:07,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-11-17 12:34:07,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:07,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-11-17 12:34:07,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:07,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-11-17 12:34:07,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:07,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:34:07,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:07,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:34:08,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:08,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:34:08,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:08,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-17 12:34:08,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:08,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:34:08,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:08,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:34:08,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:08,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:34:08,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:08,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-11-17 12:34:08,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:08,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:34:08,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:08,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:34:08,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:08,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:34:08,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:08,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2021-11-17 12:34:08,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:08,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:34:08,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:08,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:34:08,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:08,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:34:08,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:08,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2021-11-17 12:34:08,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:08,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2021-11-17 12:34:08,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:08,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2021-11-17 12:34:08,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:08,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:34:08,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:08,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:34:08,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:08,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2021-11-17 12:34:08,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:08,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2021-11-17 12:34:08,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:08,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2021-11-17 12:34:08,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:08,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2021-11-17 12:34:08,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:08,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:34:08,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:08,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-17 12:34:08,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:08,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:34:08,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:08,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2021-11-17 12:34:08,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:08,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:34:08,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:08,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2021-11-17 12:34:08,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:08,136 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 449 trivial. 0 not checked. [2021-11-17 12:34:08,136 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:34:08,136 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287153344] [2021-11-17 12:34:08,136 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287153344] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:34:08,136 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:34:08,137 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-17 12:34:08,137 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202975173] [2021-11-17 12:34:08,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:34:08,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-17 12:34:08,138 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:34:08,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-17 12:34:08,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-11-17 12:34:08,139 INFO L87 Difference]: Start difference. First operand 33909 states and 45016 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 4 states have internal predecessors, (97), 3 states have call successors, (36), 7 states have call predecessors, (36), 1 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2021-11-17 12:34:10,178 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:34:12,255 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:34:14,334 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:34:17,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:34:19,982 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:34:22,002 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:34:24,024 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 [] Killed by 15